I'm was using PHP eregi function, but I get the notice that it is deprecated. Here's my code:  !eregi("^[A-Z0-9._%-]+@[A-Z0-9._%-]+\.[A-Z]{2,4}$", trim($_POST['email']))   Therefore I am trying to replace the function with the preg_match, but seems that I am unable to get the correct pattern for the preg_match, as I get error with the following code:  !preg_match("^[A-Z0-9._%-]+@[A-Z0-9._%-]+\.[A-Z]{2,4}$", trim($_POST['email']))   Here's the error I get from above code:  Warning: preg_match(): No ending delimiter '^' found in   Thanks for any help.
Over the years I have slowly developed a  that validates MOST email addresses correctly, assuming they don't use an IP address as the server part.  I use it in several PHP programs, and it works most of the time.  However, from time to time I get contacted by someone that is having trouble with a site that uses it, and I end up having to make some adjustment (most recently I realized that I wasn't allowing 4-character TLDs).  What is the best regular expression you have or have seen for validating emails?  I've seen several solutions that use functions that use several shorter expressions, but I'd rather have one long complex expression in a simple function instead of several short expression in a more complex function.
Why would someone use WHERE 1=1 AND &lt;conditions&gt; in a SQL clause (Either SQL obtained through concatenated strings, either view definition)  I've seen somewhere that this would be used to protect against SQL Injection, but it seems very weird.  If there is injection WHERE 1 = 1 AND injected OR 1=1 would have the same result as injected OR 1=1.  Later edit: What about the usage in a view definition?    Thank you for your answers.  Still, I don't understand why would someone use this construction for defining a view, or use it inside a stored procedure.  Take this for example:  CREATE VIEW vTest AS SELECT FROM Table WHERE 1=1 AND table.Field=Value Split a string by a delimiter in python Where should I put software I compile myself? There are often situations where buying two separate one-way tickets from A to C via B is cheaper than buying a normal multi-leg ticket. This can be especially useful with airlines such as Ryanair, which specifically avoids selling multi-leg tickets.  Is there a search engine which allows one to search for such flights? When Ron broke his wand, why didn't he apply for Hogwarts financial aid? how to find $|GL_2(F_p)|$ I need to find $|GL_2(F_p)|$, I am very very uncomfortable in counting, so please help here I proceed,  $\begin{pmatrix}a&amp;b\\c&amp;d\end{pmatrix}$ be such an invertible matrix, so we need and sufficient that $ad\neq bc$, so if i chose all non zero $a,b,c$ arbitrarily and chose $d\neq a^{-1}bc$ and form matrices then the cardinality   will be $(q-1)^3\times (q-2)$, well now if one of $a,b,c,d$ be zero then other three can be anything nonzero so in this case cardinality will be $4(q-1)^3$, so finally if two entries are $0$ then they must be opposite to each other i.e diagonally, but other two must be nonzero, so cardinality in that case $2(q-1)^2$, so total number is just sum of three cases. Is there a way to get reverse numbering on the enumerate environment? To build a list of publications, I wish to show the most recent on top of the list, while keeping the numbering similar. This can be achieved manually by doing something like:  \begin{enumerate} \item[42] pub num 42 \item[41] pub num 41 \item[...] \item[1] pub num 1 \end{enumerate}   but is there a more principled approach? Make bash exit != 0 when called by AWK and interrupted with ^C I'm having an issue with the following piece of (G)AWK script:  do {     ... } while (system("sleep 10"))   My intention is to break the loop when the user presses ^C during the sleep, but it's not working.  I believe the problem is that Bash exits with 0 when interrupted with ^C, at least when it's executed by AWK's system():  $ awk 'BEGIN { print "\n" system("sleep 2") }' (let the sleep complete) 0      $ awk 'BEGIN { print "\n" system("sleep 2") }' ^C 0   Why is it so?   Is this a bug in Bash or in (G)AWK?  Is there a simple solution that doesn't involve complicated Bash-specific syntax like trap?  The best I could come up with is this:  do {     ... } while (42 == system("sleep 10 &amp;&amp; exit 42"))   which still looks like a kludge to me. Q: Will there be, or have there been, any “late blooming” students in the school who come into their magic potential as adults, rather than as children? By the way, I loved meeting you, and hearing you speak, when you came to Anderson's in Naperville. I can hardly wait until you tour again. JKR: Ahhh! I loved the event at Anderson’s. It was one of my favorites. That is completely true. No, is the answer. In my books, magic almost always shows itself in a person before age 11; however, there is a character who does manage in desperate circumstances to do magic quite late in life, but that is very rare in the world I am writing about. (src: )  Who was JKR referring to in “there is a character”? Clearly, it not a student; so the most obvious guess of &quot;Neville Longbottom&quot; is wrong – both due to “no” answer regarding the question itself, and the fact that Neville bloomed in his 6th/7th year, well before you can legitimately term “quite late in life”. I have been working on the following problem:     For a given $c\in \Bbb Z^+$, find $a,b \in \Bbb Z^+: c=a^2-b^2$.   I have already figured out and proved a number of things:   A way to directly determine if a particular instance is solvable:  $\exists a,b \in \Bbb Z^+: c=a^2-b^2 \iff c \not\equiv 2 \mod 4$ An upper bound on the values for a (and b): $b \lt a\le\lfloor\frac{c-1}{2}\rfloor$ And a simple algorithm to find a solution:     $$ \begin{align*}  (a_0, b_0) &amp;= (0, 0) \\  (a_{n+1}, b_{n+1}) &amp;= \begin{cases}   (a_n+1, &amp;b_n&amp;)&amp;\text{if } a_n^2-b_n^2 &lt; c\\   (a_n, &amp;b_n+1&amp;)&amp;\text{if } a_n^2-b_n^2 &gt; c\\  \end{cases} \end{align*} $$   This can be iterated until a solution is found or the upper bound is reached.   I am currently trying to work out a more direct way to find an answer, but I have been unable to figure out any other ways to approach the problem.  How can I more directly find values for $a$ and $b$ for a given value of $c$? Java equivalent to PHP's preg_replace_callback Hiding reputation and encouraging thinking time would improve the quality of answers on SO I've only been a member of SO for a couple of months but I must say that the site can be a bit daunting even for an experienced developer.  Part of this is because when users with very high reputations answer questions then it seems that everyone assumes that they have the right answer.  I don't want to go into the self-fulfilling nature of reputation increase for high reputation people.  But I think it is clear that people with high reputation scores get more upvotes () because people assume (usually accurately) that they are correct.    But if reputation was hidden on SO, at least for, say, the first hour after a question is asked then the probability of the best answer being upvoted the most would surely increase.  This might also require the hiding of the names of the answerers if they have very high reps!  As a second method of getting improved answers I would correlate the value of an answer (in terms of reputation gained) with the difficulty of the question.  And the simplest way to do that would be based on the time required for the question to be answered.  So if a question is answered within a minute then it is a 20% question (2 points per upvote), within 2 minutes a 40% question, within 5 minutes a 60% question and so on, on to say a 200% answer (20 points per upvote) on questions that have been hanging around for months.  This would encourage considered answers to new questions and tempt people into reducing the backlog - rather than encouraging people to sit on the 'newest questions' hoping for a gimme.  These two measures would incentivise people to answer the questions that no-one likes the look of and reduce the relative value of answering easy questions. I read this sentence on an educational website:     Now times have changed and you are ready for situations involving forces in two dimensions.   Shouldn't there be a comma before and, since the subject of the sentence has changed (things vs. you)?      Now times have changed, and you are ready for situations involving forces in two dimensions.   What is the exact comma rule for joining two clauses with and? Clear item with custom name? Uncountable well ordered set in $Z^-$ theory. I want to build an uncountable well-ordered set within the theory $Z^\textbf-$. So, I take $A=\omega$ (exists by infinity axiom) and define $$W:=\{(X,R)\in\mathcal{P}(A)\times\mathcal{P}(A\times A):\langle X,R\rangle\ \text{is a well-ordered set}\}$$  With this I consider the set $T:=W/\cong$ (where $\cong$ is isomorphism relation). Note that $W$ and $T$ are sets by power set axiom. So I define for each equivalence class $[x],[y]\in T$ the order  $$ [x]\leq_T[y]\Leftrightarrow \text{type}(x, R_x)\leq \text{type}(y,R_y) $$  Here, $R_x$ means the order of $x$ that make it belongs to $[x]$.   So, $T$ is well ordered by $\leq_T$ and it is uncountable.  Question: I don't pretty sure if I can build $\leq_ T$ without replacement axiom. Another doubt is, Can I take the $R_x$ without AC? Simulate limited bandwidth from within Chrome? Can't boot without Flash Drive plugged in "Install alongside" option missing. How do I install Ubuntu beside Windows using "Something Else"? Is it touch(1) from coreutils-8.4-37.el6.x86_64 or my brain which is broken?  $ touch abc $ LANG=C stat abc   File: `abc'   Size: 0               Blocks: 0          IO Block: 4096   regular empty file Device: fd04h/64772d    Inode: 10485773    Links: 1 Access: (0664/-rw-rw-r--)  Uid: (3060399/ nodakai)   Gid: (  418/   quant) Access: 2016-10-14 18:42:06.189751847 +0800 Modify: 2016-10-14 18:42:06.189751847 +0800 Change: 2016-10-14 18:42:06.189751847 +0800 $ touch -a abc $ LANG=C stat abc   File: `abc'   Size: 0               Blocks: 0          IO Block: 4096   regular empty file Device: fd04h/64772d    Inode: 10485773    Links: 1 Access: (0664/-rw-rw-r--)  Uid: (3060399/ nodakai)   Gid: (  418/   quant) Access: 2016-10-14 18:42:17.374235446 +0800 Modify: 2016-10-14 18:42:06.189751847 +0800 Change: 2016-10-14 18:42:17.374235446 +0800 $ touch --help | grep 'access time'   -a                     change only the access time   As you see, it was not only atime but also ctime which was updated by touch -a !?!?  The filesystem is ext4 over LVM if that makes any differences. I need to repair my Windows 10 installation. Where can I get a clean ISO (with install.wim, no Install.ESD, so that I can run DISM against the WIM) of the specific Windows 10 build required for this?  In my case, I need the Anniversary update (Build 14393), Creators Update (Build 15063) or Fall Creators Update (Build 16299.15).