On Mon, Jun 15, 2009 at 7:11 PM, Kristof Zelechovski<giecrilj at stegny.2a.pl> wrote: > The complexity of using a set/map is logarithmic in the size of the set. Not if it's implemented as a hash table. Is DOMTokenList really expected to store lists large enough that this asymptotic behavior matters, though?