- From: Ian Hickson <ian@hixie.ch>
- Date: Fri, 18 Oct 2013 20:50:35 +0000 (UTC)
- To: "Tab Atkins Jr." <jackalmage@gmail.com>
- Cc: Glenn Maynard <glenn@zewt.org>, Ryosuke Niwa <rniwa@apple.com>, whatwg <whatwg@lists.whatwg.org>, Tim Streater <tim@clothears.org.uk>, Boris Zbarsky <bzbarsky@mit.edu>
On Fri, 18 Oct 2013, Tab Atkins Jr. wrote: > On Fri, Oct 18, 2013 at 11:09 AM, James Greene <james.m.greene@gmail.com> wrote: > > I would also love to see `getElementById` added to the > > HTMLElement/Element interface. It would be nice to capitalize on that > > potential perf boost in jQuery as well. > > There's no perf boost available for searching by id on an arbitrary > element. The reason you may get a better perf for the normal functions > is that documents cache a map from id->element on themselves, so you > just have to do a fast hash-lookup. Arbitrary elements don't have this > map (it would be way too much memory cost), so it'll fall back to a > standard tree search, exactly as a querySelector would. Well, you _could_ just use the element's document's hash lookup, then walk up the tree from the matching node to see if you reach the element, and only if you don't, then fall back on walking the tree. Assuming most such calls are not failing, that would give you pretty good performance (O(N) on the depth of the subtree, more or less). -- Ian Hickson U+1047E )\._.,--....,'``. fL http://ln.hixie.ch/ U+263A /, _.. \ _\ ;`._ ,. Things that are impossible just take longer. `._.-(,_..'--(,_..'`-.;.'
Received on Friday, 18 October 2013 20:51:00 UTC