title: In jQuery, to select the nth sibling of a node, is .next() chained n times or .nextAll(':eq(n-1)') faster?
body: <p>Assuming there are an arbitrary number of siblings of a node, and I wanted to select the <code>nth sibling</code> of that node, should I be using <code>.next()</code> chained up n times, or should I just use a single call to <code>.nextAll(':eq(n-1)')</code>?</p>
  
  <p>Seems like there would be a lot of extra overhead with the former for large n, and possibly a bigger overhead with the latter for large number of siblings. I'm concerned with a case that involves n=2 and a large number of siblings, so I'm not sure if I want to use <code>.next().next()</code> or <code>.nextAll(':eq(1)')</code>. Does it matter?</p>
  
  <p>Edit: For the case of n=2 and many siblings, it looks like <code>.next().next()</code> is fastest according to <a href="http://jsperf.com/next-next-vs-nextall-eq-1-vs-nextall-eq-1" rel="nofollow">http://jsperf.com/next-next-vs-nextall-eq-1-vs-nextall-eq-1</a></p>