On Mon, 15 Jun 2009 21:38:05 +0200, Darin Adler <[email protected]> wrote:
On Jun 15, 2009, at 12:22 PM, Ian Hickson wrote:
On Tue, 9 Jun 2009, Erik Arvidsson wrote:
I was about to follow up on this. Requiring sorting which is O(n
log n) for something that can be done in O(n) makes thing slower
without any real benefit. Like João said the order should be
defined as the order of the class content attribute.
Fair enough. Done.
Since DOMTokenList requires uniqueness, then I suspect it's still O(n
log n) even without sorting, not O(n).
-- Darin
Oh, I have forseen that. Is it really necessary to remove duplicates ?
I imagine DOMTokenList to be similar to what can be achieved with a
String.split(), but then it would be just more duplicate functionality.
