- From: Tab Atkins Jr.. via cvs-syncmail <cvsmail@w3.org>
- Date: Fri, 08 Apr 2011 00:49:07 +0000
- To: public-css-commits@w3.org
Update of /sources/public/csswg/css3-flexbox In directory hutz:/tmp/cvs-serv15920 Modified Files: Overview.src.html Removed Files: Overview.old.html Overview.old.src.html Log Message: Quoted all my ids, to avoid breaking the syntax highlighting of my new editor. ;_; Fixed a wording bug in the free space algo. --- Overview.old.src.html DELETED --- --- Overview.old.html DELETED --- Index: Overview.src.html =================================================================== RCS file: /sources/public/csswg/css3-flexbox/Overview.src.html,v retrieving revision 1.17 retrieving revision 1.18 diff -u -d -r1.17 -r1.18 --- Overview.src.html 22 Mar 2011 16:54:32 -0000 1.17 +++ Overview.src.html 8 Apr 2011 00:49:05 -0000 1.18 @@ -352,7 +352,7 @@ <!-- ====================================================================== --> -<h2 id=flexibility> +<h2 id='flexibility'> Flexibility</h2> <p>The defining aspect of flexbox layout is the ability to make various lengths @@ -366,7 +366,7 @@ <p class=issue>TODO: Examples!</p> </div> -<h3 id=resolving-flexible-lengths> +<h3 id='resolving-flexible-lengths'> Resolving Flexible Lengths</h3> <p>CSS resolves a <i>flexible length</i> into a definite length by first collecting @@ -430,7 +430,7 @@ <!-- ====================================================================== --> -<h2 id=flex-pack> +<h2 id='flex-pack'> The 'flex-pack' property</h2> <table class=propdef> @@ -464,24 +464,24 @@ 'flex-pack' property defines the flexibility of these packing spaces: <dl> - <dt><dfn id=flex-pack-start>start</dfn></dt> + <dt><dfn id='flex-pack-start'>start</dfn></dt> <dd><i>flexbox item</i>s are packed toward the start of the flexbox. The last packing space (between the margin of the last flexbox item and the edge of the flexbox) must absorb all leftover free space; all other packing spaces must have a length of ''0''.</dd> - <dt><dfn id=flex-pack-end>end</dfn></dt> + <dt><dfn id='flex-pack-end'>end</dfn></dt> <dd><i>flexbox item</i>s are packed toward the end of the flexbox. The first packing space (between the edge of the flexbox and the margin of the first flexbox item ) must absorb all leftover free space; all other packing spaces must have a length of ''0''.</dd> - <dt><dfn id=flex-pack-center>center</dt> + <dt><dfn id='flex-pack-center'>center</dt> <dd><i>flexbox item</i>s are packed toward the center of the flexbox. The first and last packing spaces must equally split all leftover free space; all other packing spaces must have a length of ''0''.</dd> - <dt><dfn id=flex-pack-justify>justify</dfn></dt> + <dt><dfn id='flex-pack-justify'>justify</dfn></dt> <dd><i>flexbox item</i>s are evenly distributed through the flexbox. The first and last packing spaces must have a length of ''0''; all other packing spaces must equally split all leftover free space.</dd> @@ -540,7 +540,7 @@ --> <!-- ====================================================================== --> -<h2 id=flex-align> +<h2 id='flex-align'> The 'flex-align' property</h2> <table class=propdef> @@ -595,7 +595,7 @@ <!-- ====================================================================== --> -<h2 id=free-space-algorithm> +<h2 id='free-space-algorithm'> Free Space Calculation and Distribution</h2> <p>The following algorithms detail precisely how to determine the dimensions @@ -619,12 +619,17 @@ size, a maximum size, a preferred size, a positive flexibility, and a negative flexibility.</dd> + <dt><dfn>total free space</dfn></dt> + <dd>The inner width or height of the flexbox (depending on the distribution + round), which will be used to calculate the sizes of the <i>flexbox item</i>s.</dd> + <dt><dfn>available free space</dfn></dt> - <dd>The inner width/height of the flexbox minus the sum of the preflex sizes - of all the relevant lengths.</dd> + <dd>The <i>total free space</i> minus the sum of the preferred sizes of all + the relevant lengths, which is used to resolve <i>flex tuple</i>s into + inflexible lengths.</dd> </dl> -<h3 id=initial-computation> +<h3 id='initial-computation'> Initial Computation</h3> <p>This step computes necessary information required to run the free-space @@ -737,7 +742,7 @@ </li> </ol> -<h3 id=first-distribution-round> +<h3 id='first-distribution-round'> First Distribution Round</h3> <p>This step distributes free space to the flexible lengths of the flexbox @@ -764,7 +769,7 @@ collected above, and an <i>available free space</i> equal to the flexbox's inner measure.</p> -<h3 id=second-distribution-round> +<h3 id='second-distribution-round'> Second Distribution Round</h3> <p>This step distributes any leftover available space to the <i>packing space</i>, @@ -777,13 +782,13 @@ collected above, and an <i>available free space</i> equal to the flexbox's inner measure.</p> -<h3 id=intermediate-computation> +<h3 id='intermediate-computation'> Intermediate Computation</h3> <p>Determine the length of the flexbox, given the sizes that have already been determined.</p> -<h3 id=third-distribution-round> +<h3 id='third-distribution-round'> Third Distribution Round</h3> <p>This step distributes free space to the flexible lengths of each flexbox @@ -820,13 +825,16 @@ collected above, and an <i>available free space</i> equal to the flexbox's inner length.</p> -<h3 id=free-space-allocation-algorithm> +<h3 id='free-space-allocation-algorithm'> Free Space Allocation Algorithm</h3> <p>This section describes the algorithm used to allocate free space to a set of flexible lengths. The inputs to this algorithm are a set of <i>flex tuple</i>s - and a length representing the <i>available free space</i>, which may be positive - or negative. The output is a set of inflexible lengths.</p> + and a length representing the <i>total free space</i>. The output is a set + of inflexible lengths.</p> + + <p>Calculate the <i>available free space</i> by summing the preferred size + of all the <i>flex tuple</i>s and subtracting that value from the <i>total free space</i>.</p> <p>If the <i>available free space</i> is 0, transform all the <i>flex tuple</i>s into inflexible lengths equal to their preferred size and return them.</p>
Received on Friday, 8 April 2011 00:49:09 UTC