[css-gaps-1][editorial] More reordering of content

Author: kbabbitt

css-gaps-1/Overview.bs

@@ -229,8 +229,8 @@ Segment endpoints</h4>
 		<li><dfn>end segment endpoint</dfn>: Point at which a segment ends.
 	</ul>
 
-	<div algorithm="create segment endpoints for a gap">
-		To <dfn>create segment endpoints for a gap</dfn> |G|:
+	<div algorithm="create segment endpoints">
+		To <dfn>create segment endpoints</dfn> for a gap |G|:
 		<ol>
 			<li>Bounds of a Gap:
 				<p>Create endpoints at |G|'s two bounds:
@@ -335,20 +335,43 @@ Segment endpoints</h4>
 	</div>
 
 <h4 id="segments">
-Segments</h4>
+Gap decoration segments</h4>
+
+	<h5 class="no-toc no-num" id="segments-definitions">
+	Definitions</h5>
 
 	A <dfn>gap decoration segment</dfn> is formed by pairing a [=start segment endpoint=] with an [=end segment endpoint=].
 	Each [=gap=] forms a collection of [=gap decoration segments=].
 
+	In this section, we represent a [=gap decoration segment=] |s| as
+	<code>|s| = [|s|.start, |s|.end]</code>,
+	where <code>|s|.start</code> is the <a>start segment endpoint</a> of the segment,
+	and <code>|s|.end</code> is the <a>end segment endpoint</a> of the segment.
+
+	Let <dfn>UNION</dfn>(|s1|, |s2|) be equal to [|s1|.start, |s2|.end].
+
+	A [=gap decoration segment=] is <dfn>flanked by spanning items</dfn> if, for
+	every [=gap junction=] between its endpoints, there exist items on opposing sides of
+	the gap that span across all perpendicular [=gaps=] contributing to that junction.
+
+	In the context of a given [=gap=], a pair of <a>segment endpoints</a> |a| and |b| is considered <dfn>discontiguous</dfn>
+	if a line segment from |a| to |b|, with the same width as the [=gap=], intersects a child item in the container.
+
+	<h5 class="no-toc no-num" id="segments-algorithms">
+	Algorithms</h5>
+
 	<div algorithm>
 		To <dfn>determine the gap decoration segments</dfn> for a given [=gap=] |G|:
 		<ol>
 			<li>
 				Let |S|, the collection of [=gap decoration segments=] for |G|, be an empty list.
 			</li>
 			<li>
-				Let |endpoints| be the list of all <a>segment endpoints</a> <a lt="create segment endpoints for a gap">created</a> for |G|,
-				ordered by their position along the centerline from start to end.
+				Let |endpoints| be the result of [=creating segment endpoints=] for |G|,
+				ordered by their position along |G|'s centerline from start to end.
+
+				Note: This list is guaranteed to contain an even number of elements that strictly alternate
+				between [=start segment endpoint=] and [=end segment endpoint=], beginning with a [=start segment endpoint=].
 			</li>
 			<li>
 				While |endpoints| is not empty:
@@ -364,9 +387,55 @@ Segments</h4>
 			</li>
 		</ol>
 
-		Note: Based on the algorithm for [=create segment endpoints for a gap|creating segment endpoints=],
-		the list |endpoints| is guaranteed to contain an even number of elements that strictly alternate
-		between [=start segment endpoint=] and [=end segment endpoint=], beginning with a [=start segment endpoint=].
+	</div>
+
+	<div algorithm>
+		To <dfn>determine painted segments</dfn> |C| from segments list |S|:
+
+		<ol>
+			<li>Let |S| be the list of segments <a lt="determine the gap decoration segments">determined</a> for the given gap, ordered from start to end along the gap's axis.
+			<li>Let |C| be an empty list of segments.
+			<li>Let |break| be the used value of either 'column-rule-break' or 'row-rule-break', whichever applies to the gap.
+
+			<li>If |S| is empty, return |C|.
+
+			<li>If |break| is ''column-rule-break/none'':
+				<ol>
+					<li>Let |first| be the first segment in |S|.
+					<li>Let |last| be the last segment in |S|.
+					<li>Let |segment| be [=UNION=](|first|, |last|).
+					<li>[=Apply offsets to a segment|Apply offsets to=] |segment|, then append it to |C|.
+					<li>Return |C|.
+				</ol>
+
+			<li>Remove the first segment from |S|. Let |s| be that segment.
+
+			<li>If |s|'s endpoints are <a>discontiguous</a>, go back to step 4.
+
+			<li>If |S| is not empty:
+				<ol>
+					<li>Let |next| be the first segment in |S|.
+					<li>Let |candidate| be <a>UNION</a>(|s|, |next|).
+					<li>If |candidate|'s endpoints are <a>discontiguous</a>, go to step 9.
+					<li>If |break| is ''column-rule-break/intersection'' and |candidate| is not <a>flanked by spanning items</a>, go to step 9.
+					<li>Remove the first segment from |S|.
+					<li>Set |s| to <a>UNION</a>(|s|, |next|).
+					<li>Go back to step 8.
+				</ol>
+
+			<li>[=Apply offsets to a segment|Apply offsets to=] |s|, then append it to |C|.
+
+			<li>Go back to step 4.
+		</ol>
+	</div>
+
+	<div algorithm>
+		To <dfn>apply offsets to a segment</dfn> |s| = [|start|, |end|]:
+		<ol>
+			<li>Offset |start| by the used value of the applicable [[#inset|rule-inset]] property.
+			<li>Offset |end| by the used value of the applicable [[#inset|rule-inset]] property.
+			<li>Update |s| with the adjusted [|start|, |end|].
+		</ol>
 	</div>
 
 	<div class="example">
@@ -424,71 +493,6 @@ Segments</h4>
 		</figure>
 	</div>
 
-<h4 id="painted-segments">
-Painted segments</h4>
-
-	Recall that a <a>gap decoration segment</a>, |s|, can be represented as:
-	|s| = [|s|.start, |s|.end]
-	where |s|.start is the <a>start segment endpoint</a> of the segment, and |s|.end is the <a>end segment endpoint</a> of the segment.
-
-	In the context of a given gap, a pair of <a>segment endpoints</a> |a| and |b| is considered <dfn>discontiguous</dfn>
-	if a line segment from |a| to |b|, with the same width as the gap, intersects a child item in the container.
-
-	Let <dfn>UNION</dfn>(|s1|, |s2|) be equal to [|s1|.start, |s2|.end].
-
-	A [=gap decoration segment=] is <dfn>flanked by spanning items</dfn> if, for
-	every [=gap junction=] between its endpoints, there exist items on opposing sides of
-	the gap that span across all perpendicular [=gaps=] contributing to that junction.
-
-	<div algorithm>
-		To <dfn>determine painted segments</dfn> |C| from segments list |S|:
-
-		<ol>
-			<li>Let |S| be the list of segments <a lt="determine the gap decoration segments">determined</a> for the given gap, ordered from start to end along the gap's axis.
-			<li>Let |C| be an empty list of segments.
-			<li>Let |break| be the used value of either 'column-rule-break' or 'row-rule-break', whichever applies to the gap.
-
-			<li>If |S| is empty, return |C|.
-
-			<li>If |break| is ''column-rule-break/none'':
-				<ol>
-					<li>Let |first| be the first segment in |S|.
-					<li>Let |last| be the last segment in |S|.
-					<li>Let |segment| be [=UNION=](|first|, |last|).
-					<li>[=Apply offsets to a segment|Apply offsets to=] |segment|, then append it to |C|.
-					<li>Return |C|.
-				</ol>
-
-			<li>Remove the first segment from |S|. Let |s| be that segment.
-
-			<li>If |s|'s endpoints are <a>discontiguous</a>, go back to step 4.
-
-			<li>If |S| is not empty:
-				<ol>
-					<li>Let |next| be the first segment in |S|.
-					<li>Let |candidate| be <a>UNION</a>(|s|, |next|).
-					<li>If |candidate|'s endpoints are <a>discontiguous</a>, go to step 9.
-					<li>If |break| is ''column-rule-break/intersection'' and |candidate| is not <a>flanked by spanning items</a>, go to step 9.
-					<li>Remove the first segment from |S|.
-					<li>Set |s| to <a>UNION</a>(|s|, |next|).
-					<li>Go back to step 8.
-				</ol>
-
-			<li>[=Apply offsets to a segment|Apply offsets to=] |s|, then append it to |C|.
-
-			<li>Go back to step 4.
-		</ol>
-	</div>
-
-	<div algorithm>
-		To <dfn>apply offsets to a segment</dfn> |s| = [|start|, |end|]:
-		<ol>
-			<li>Offset |start| by the used value of the applicable [[#inset|rule-inset]] property.
-			<li>Offset |end| by the used value of the applicable [[#inset|rule-inset]] property.
-			<li>Update |s| with the adjusted [|start|, |end|].
-		</ol>
-	</div>
-
 	<wpt>
 		flex/flex-gap-decorations-001.html
 		flex/flex-gap-decorations-006.html