- From: Cyril Auburtin via GitHub <sysbot+gh@w3.org>
- Date: Thu, 18 Jan 2018 22:12:59 +0000
- To: public-css-archive@w3.org
Thanks, yes, a 2-values order would be the solution to those problems (sortable lists) You propose is an order by first, then second (`order: 3 4` < `order: 3 5` < `order: 4 -1` < `order: 4` < `order: 4 1`) I thought more about a fractional order (`order: 3 4` < `order: 1 1` < `order: 2 1`) (that's how S-B tree would work, it can find an intermediate fraction between 2 arbitrary fractions) Both ways make sense, in both cases, the list need to be re-balanced at some point (in first case when 2 items are too close (2nd value consecutive), in second case when numerator or denom is > 1e9 for example) -- GitHub Notification of comment by caub Please view or discuss this issue at https://github.com/w3c/csswg-drafts/issues/2202#issuecomment-358799171 using your GitHub account
Received on Thursday, 18 January 2018 22:13:02 UTC