- From: fantasai via GitHub <sysbot+gh@w3.org>
- Date: Thu, 07 Feb 2019 08:38:10 +0000
- To: public-css-archive@w3.org
Wrt the first point, the following inequality holds: minimum contribution ≤ min-content contribution ≤ max-content contribution. This allowed us to have a simpler structure for span=1. (We could have written super generalized algorithm, but this would have been harder for readers to follow. It's easier to think about the span=1 case using the simplified algorithm, and then work up to spanning items, where there is some extra complexity.) Wrt the second point. see https://github.com/w3c/csswg-drafts/issues/2303#issuecomment-435212567 :) -- GitHub Notification of comment by fantasai Please view or discuss this issue at https://github.com/w3c/csswg-drafts/issues/3616#issuecomment-461330465 using your GitHub account
Received on Thursday, 7 February 2019 08:38:12 UTC