Skip to content

Commit abe768c

Browse files
tabatkinstabatkins
committed
Swapped out I and N for 'value' and 'length' in the algorithms.
1 parent 7edc54d commit abe768c

1 file changed

Lines changed: 28 additions & 28 deletions

File tree

‎css3-lists/Overview.src.html‎

Lines changed: 28 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -885,10 +885,10 @@ <h4>
885885
representation of the value 1, the second <i>counter glyph</i> (if it exists)
886886
is used as the representation of the value 2, etc.</p>
887887

888-
<p>In general, if there are <var>N</var> <i>counter glyphs</i> and
889-
a representation is being constructed for the value <var>I</var>,
888+
<p>In general, if there are <var>length</var> <i>counter glyphs</i> and
889+
a representation is being constructed for the value <var>value</var>,
890890
the representation is the <i>counter glyph</i> at index
891-
(<var>I</var> mod <var>N</var>) of the list of <i>counter glyph</i>s
891+
(<var>value</var> mod <var>length</var>) of the list of <i>counter glyph</i>s
892892
(0-indexed).</p>
893893

894894
<div class=example>
@@ -922,27 +922,27 @@ <h4>
922922
<i>counter glyph</i>s as digits to a number system, similar to the default
923923
''decimal'' counter style. The first <i>counter glyph</i> in the list is
924924
interpreted as the digit 0, the second as the digit 1, and so on. If there
925-
are <var>N</var> <i>counter glyph</i>s, the representation is a base
926-
<var>N</var> number using the <i>counter glyph</i>s as digits.</p>
925+
are <var>length</var> <i>counter glyph</i>s, the representation is a base
926+
<var>length</var> number using the <i>counter glyph</i>s as digits.</p>
927927

928928
<p>To construct the representation, run the following algorithm. Let
929-
<var>N</var> be the length of the list of <i>counter glyphs</i>,
930-
<var>I</var> initially be the counter value, <var>S</var>
929+
<var>length</var> be the length of the list of <i>counter glyphs</i>,
930+
<var>value</var> initially be the counter value, <var>S</var>
931931
initially be the empty string, <var>negative</var> be a boolean flag
932932
that is initially false, and <var>glyph(n)</var> be the nth
933933
<i>counter glyph</i> in the list of <i>counter glyph</i>s (0-indexed).</p>
934934

935935
<ol>
936-
<li>If <var>I</var> is 0, append <var>glyph(0)</var> to
936+
<li>If <var>value</var> is 0, append <var>glyph(0)</var> to
937937
<var>S</var> and return <var>S</var>.</li>
938938

939-
<li>While <var>I</var> is not equal to 0:
939+
<li>While <var>value</var> is not equal to 0:
940940

941941
<ol>
942-
<li>Prepend <var>glyph( <var>I</var> mod <var>N</var> )</var>
942+
<li>Prepend <var>glyph( <var>value</var> mod <var>length</var> )</var>
943943
to <var>S</var>.</li>
944944

945-
<li>Set <var>I</var> to <code>floor( <var>I</var> / <var>N</var> )</code>.</li>
945+
<li>Set <var>value</var> to <code>floor( <var>value</var> / <var>length</var> )</code>.</li>
946946
</ol>
947947
</li>
948948

@@ -984,26 +984,26 @@ <h4>
984984
''lower-alpha'' counter style. Alphabetic numbering systems are commonly used
985985
for lists, and also appear in many spreadsheet programs to number columns.
986986
The first <i>counter glyph</i> in the list is interpreted as the digit 1,
987-
the second as the digit 2, and so on. If there are <var>N</var>
988-
<i>counter glyph</i>s, the representation is a base <var>N</var> alphabetic
987+
the second as the digit 2, and so on. If there are <var>length</var>
988+
<i>counter glyph</i>s, the representation is a base <var>length</var> alphabetic
989989
number using the <i>counter glyph</i>s as digits. Alphabetic numbering
990990
systems do not contain a digit representing 0.</p>
991991

992992
<p>To construct the representation, run the following algorithm. Let
993-
<var>N</var> be the length of the list of <i>counter glyph</i>s,
994-
<var>I</var> initially be the counter value, <var>S</var> initially
993+
<var>length</var> be the length of the list of <i>counter glyph</i>s,
994+
<var>value</var> initially be the counter value, <var>S</var> initially
995995
be the empty string, and <var>glyph(n)</var> be the nth <i>counter glyph</i>
996996
in the list of <i>counter glyph</i>s (0-indexed).</p>
997997

998-
<p>While <var>I</var> is not equal to 0:</p>
998+
<p>While <var>value</var> is not equal to 0:</p>
999999

10001000
<ol>
1001-
<li>Set <var>I</var> to <code><var>I</var> - 1</code>.</li>
1001+
<li>Set <var>value</var> to <code><var>value</var> - 1</code>.</li>
10021002

1003-
<li>Prepend <var>glyph( <var>I</var> mod <var>N</var> )</var>
1003+
<li>Prepend <var>glyph( <var>value</var> mod <var>length</var> )</var>
10041004
to <var>S</var>.</li>
10051005

1006-
<li>Set <var>I</var> to <code>floor( <var>I</var> / <var>N</var> )</code>.</li>
1006+
<li>Set <var>value</var> to <code>floor( <var>value</var> / <var>length</var> )</code>.</li>
10071007
</ol>
10081008

10091009
<p>Finally, return <var>S</var>.</p>
@@ -1084,12 +1084,12 @@ <h4>
10841084
alphabetic-style lists for a slightly different presentation than what the
10851085
''alphabetic'' type presents.</p>
10861086

1087-
<p>To construct the representation, let <var>N</var> be the length of
1088-
the list of <i>counter glyph</i>s, <var>I</var> initially be the counter
1087+
<p>To construct the representation, let <var>length</var> be the length of
1088+
the list of <i>counter glyph</i>s, <var>value</var> initially be the counter
10891089
value, <var>S</var> initially be the empty string, and <code>glyph(n)</code>
10901090
be the nth <i>counter glyph</i> in the list of <i>counter glyph</i>s
1091-
(0-indexed). Append <code class='inline'>glyph( <var>I</var> mod <var>N</var> )</code>
1092-
to <var>S</var> <code class='inline'>floor( (<var>I</var> - 1) / <var>N</var> )</code>
1091+
(0-indexed). Append <code class='inline'>glyph( <var>value</var> mod <var>length</var> )</code>
1092+
to <var>S</var> <code class='inline'>floor( (<var>value</var> - 1) / <var>length</var> )</code>
10931093
times, then return <var>S</var>.</p>
10941094

10951095
<div class=example>
@@ -1184,27 +1184,27 @@ <h4>
11841184
several languages which use different characters for the digits in differnt
11851185
positions.</p>
11861186

1187-
<p>To construct the representation, run this algorithm. let <var>I</var>
1187+
<p>To construct the representation, run this algorithm. let <var>value</var>
11881188
initially be the counter value, <var>S</var> initially be the empty string,
11891189
and <var>glyph list</var> initially be the list of <i>additive tuple</i>s.
11901190

1191-
<p>If <var>I</var> is initially 0, and there is an <i>additive tuple</i>
1191+
<p>If <var>value</var> is initially 0, and there is an <i>additive tuple</i>
11921192
with a weight of 0, append that tuple's <i>counter glyph</i> to S
11931193
and return S.</p>
11941194

1195-
<p>Otherwise, while <var>I</var> is greater than 0 and there are elements
1195+
<p>Otherwise, while <var>value</var> is greater than 0 and there are elements
11961196
left in the <var>glyph list</var>:</p>
11971197

11981198
<ol>
11991199
<li>Pop the first <i>additive tuple</i> from the <var>glyph list</var>.
12001200
This is the <dfn>current tuple</dfn>.</li>
12011201

12021202
<li>Append the <i>current tuple</i>'s <i>counter glyph</i> to <var>S</var>
1203-
<code>floor( <var>I</var> / <var><i>current tuple</i>'s weight</var> )</code>
1203+
<code>floor( <var>value</var> / <var><i>current tuple</i>'s weight</var> )</code>
12041204
times (this may be 0).</li>
12051205
</ol>
12061206

1207-
<p>If the loop ended because <var>I</var> is 0, return S. Otherwise, the
1207+
<p>If the loop ended because <var>value</var> is 0, return S. Otherwise, the
12081208
given counter value cannot be represented by this counter style, and must
12091209
instead be represented by the fallback counter style.</p>
12101210

0 commit comments

Comments
 (0)