using ID selector for to addMethod for jQuery validate
jQuery Validate Plugin - How to create a simple custom rule?
Just a quick question from an Objective-C beginner: what does the asterisk in the parenthesis mean in the following sample code? Is it a pointer? Thanks in advance.  #import &lt;Foundation/Foundation.h&gt;  @interface Tire : NSObject @end @implementation Tire  - (NSString *) description {    return (@"I am a tire."); }  @end Currently questions are added in a rapid pace to SO, so that new questions disappear very quickly from the homepage. It I want to see questions from my areas of interest I can do either:   Go to the tagged/my tags page, but then I will see the questions only according to the votes Supply a list of tags "x or y or z", but it seems the list is limited to 15 or 20 tags.   What I suggest is to have categories as grouping of tags - the .net category , java category , web development category , etc. It can also help new users to locate questions from their area of expertise they can answer. We can decide that a category can contain between 5 and 20  tags in order no to have too narrow or too broad categories (numbers were given just for the sake of argument) Another (perhaps humorous) term for "The Gold Standard" Gold Standard as in:     an example against which others of the same type are compared   -    Any other humorous ways to refer to this?  Something like "the holy mother"... To illustrate, assume that I have two tables as follows:  VehicleID Name 1         Chuck 2         Larry  LocationID VehicleID City 1          1         New York 2          1         Seattle 3          1         Vancouver 4          2         Los Angeles 5          2         Houston   I want to write a query to return the following results:  VehicleID Name    Locations 1         Chuck   New York, Seattle, Vancouver 2         Larry   Los Angeles, Houston   I know that this can be done using server side cursors, ie:  DECLARE @VehicleID int DECLARE @VehicleName varchar(100) DECLARE @LocationCity varchar(100) DECLARE @Locations varchar(4000) DECLARE @Results TABLE (   VehicleID int   Name varchar(100)   Locations varchar(4000) )  DECLARE VehiclesCursor CURSOR FOR SELECT   [VehicleID] , [Name] FROM [Vehicles]  OPEN VehiclesCursor  FETCH NEXT FROM VehiclesCursor INTO   @VehicleID , @VehicleName WHILE @@FETCH_STATUS = 0 BEGIN    SET @Locations = ''    DECLARE LocationsCursor CURSOR FOR   SELECT     [City]   FROM [Locations]   WHERE [VehicleID] = @VehicleID    OPEN LocationsCursor    FETCH NEXT FROM LocationsCursor INTO     @LocationCity   WHILE @@FETCH_STATUS = 0   BEGIN     SET @Locations = @Locations + @LocationCity      FETCH NEXT FROM LocationsCursor INTO       @LocationCity   END   CLOSE LocationsCursor   DEALLOCATE LocationsCursor    INSERT INTO @Results (VehicleID, Name, Locations) SELECT @VehicleID, @Name, @Locations  END      CLOSE VehiclesCursor DEALLOCATE VehiclesCursor  SELECT * FROM @Results   However, as you can see, this requires a great deal of code.  What I would like is a generic function that would allow me to do something like this:  SELECT VehicleID      , Name      , JOIN(SELECT City FROM Locations WHERE VehicleID = Vehicles.VehicleID, ', ') AS Locations FROM Vehicles   Is this possible?  Or something similar? Is a function defined at a single point continuous? Is a function defined at a single point continuous?  For example $f:\{0\}\to\{0\}$ defined by $f(x)=\sqrt{x}+\sqrt{-x}$ is a sum of two continuous functions and is therefore continuous, however for $f$ to be continuous, it has to have the limit $\lim\limits_{x_0\to x}f(x_0)=f(x)$ but it dosen't seem to have that limit. Intersection reports invalid geometries How to achieve this smudge effect in photoshop? Possible Duplicate:             In the itemize environment, how do I use the ampersand symbol &amp; without LaTeX trying to use it as a command? General way to determine $\mathbb{Q}(\gamma) = \mathbb{Q}(\alpha,\beta)$ given $\alpha$ and $\beta$ The internal storage on my phone is almost full. The storage screen tells me    2.77GB / 2.91 GB taken Apps 0.89GB Other 1.89 GB Available 138MB   What is this "other" and how can I clean it up? I already followed the steps of "make more space", it barely makes a difference.   Phone Storage then tells me 43.00MB / 1.09GB is taken.  And on the SD card I have 1.86GB / 14.72GB taken.  I have plenty of storage in various places yet when I try to install apps I'm unable to do so cause of "insufficient storage". How can I fix this? Prove that the equation $x^2-y^2 = 2002$ has no integer solution My regex works on regex101 but doesn't work in python? .toArray(new MyClass[0]) or .toArray(new MyClass[myList.size()])? Assuming I have an ArrayList  ArrayList&lt;MyClass&gt; myList;   And I want to call toArray, is there a performance reason to use  MyClass[] arr = myList.toArray(new MyClass[myList.size()]);   over  MyClass[] arr = myList.toArray(new MyClass[0]);   ?  I prefer the second style, since it's less verbose, and I assumed that the compiler will make sure the empty array doesn't really get created, but I've been wondering if that's true.  Of course, in 99% of the cases it doesn't make a difference one way or the other, but I'd like to keep a consistent style between my normal code and my optimized inner loops... I've read before that, by the Principle of Explosion, if a theory is inconsistent, then absolutely any statement can be proven within it.  Obviously, there are statements which are independent of ZFC (Continuum Hypothesis, etc). It seems to me that this proves that ZFC is incomplete. Why does it not then follow that ZFC is consistent? It seems to me that we could say "Assume ZFC is inconsistent. Then the the Continuum Hypothesis is provable in ZFC. But the Continuum Hypothesis is neither provable nor disprovable in ZFC. Therefore ZFC is consistent."  What am I missing here? E: Unable to correct problems, you have held broken packages Evaluating limit (iterated sine function) The limit is   $$\lim_{x\rightarrow0} \frac{x-\sin_n(x)}{x^3},$$  where $\sin_n(x)$ is the $\sin(x)$ function composed with itself $n$ times:  $$\sin_n(x) = \sin(\sin(\dots \sin(x)))$$  For $n=1$ the limit is $\frac{1}{6}$, $n=2$, the limit is $\frac{1}{3}$ and so on.  Can we define a recurrent relation upon that given hypothesis? Also, how do I involve $n$ into calculation, because the final limit will depend on it?  Any suggestions on how to tackle this?  Thank you! How best to include other scripts? The way you would normally include a script is with "source"  eg:  main.sh:  #!/bin/bash  source incl.sh  echo "The main script"   incl.sh:  echo "The included script"   The output of executing "./main.sh" is:  The included script The main script   ... Now, if you attempt to execute that shell script from another location, it can't find the include unless it's in your path.  What's a good way to ensure that your script can find the include script, especially if for instance, the script needs to be portable? Divisor function asymptotics Define $\tau_{r}(n) = \sum_{d_1...d_r = n}1$.   One exercise in a book on sieve theory asked for an elementary proof by induction of the fact that   $$\sum_{n\le x}\tau_r(n) = \frac{1}{(r - 1)!}x(\ln x)^{r - 1} + O\left(x(\ln x)^{r - 2}\right)$$  The base case $r = 2$ is easy with reversing the order of summation.  The only other progress that I made was the fact that $\sum_{n\le x}\tau_{r}(n) = \sum_{d\le x}\left\lfloor\frac{x}{d}\right\rfloor\tau_{r- 1}(d)$, but I don't know how to proceed. I am looking for an app that can monitor my C: (system) drive and find which program is creating a folder, with the rather generic name TEMP1\, on that drive.  I wouldn't mind if it could hook the creation of files too – as there a couple of files created as well (quite probably from another process). Google does not help me, as the names of those files are a bit generic too (not as TEMP1 though – dvmaccounts.ini and dvmexp.idx).   The problem is that every time I delete those, they are recreated on startup, so the utility I'm searching must start up on boot and also start fast. It should also be really clever, as my C: drive is huge. Let $(G,.)$ be a group and $m,n \in\mathbb Z$ such that $\gcd(m,n)=1$. Assume that $$ \forall a,b \in G, \,a^mb^m=b^ma^m,$$ $$\forall a,b \in G, \, a^nb^n=b^na^n.$$  Then how prove $G$ is an abelian group?  Some context: Some of these commutation relations often imply that $G$ is abelian, for example , or . This looks like another example of this phenomenon, but the same techniques do not apply.