- From: Boris Zbarsky <bzbarsky@MIT.EDU>
- Date: Mon, 24 May 2010 21:39:54 -0400
- To: Alex Mogilevsky <alexmog@microsoft.com>
- CC: James Robinson <jamesr@chromium.org>, "Tab Atkins Jr." <jackalmage@gmail.com>, www-style list <www-style@w3.org>
On 5/24/10 9:24 PM, Alex Mogilevsky wrote: > I predict that somebody will fill a Flexbox with thousands of items and > then use box-ordinal-group for sorting, and expect reasonable > performance. Then Flexbox layout not only needs a secondary storage for > child order and quicksort. Neither is rocket science, but if it needs to > be there it really should have a strong reason. Fwiw.... the Gecko implementation is somewhat as you described, and it's not good enough for this use case if the DOM is being mutated and you have to resort. Quicksort is typically O(N log N) or worse on nearlt-sorted data, so you get overall O(N^2 log N) behavior unless you add yet more complexity and sort lazily, etc. The complexity is the real issue. The non-flexbox box model is already complicated enough that defining how this new feature would interact with all the kitchen sinks already tossed in (and then implementing it) would be a major undertaking. It doesn't obviously seem worth it. -Boris
Received on Tuesday, 25 May 2010 01:40:30 UTC