Skip to content

Commit 85ed44e

Browse files
authored
Restore numbered lists (#75)
Fixes rdar://102987273
2 parents c2e7096 + dbe46d1 commit 85ed44e

File tree

6 files changed

+21
-21
lines changed

6 files changed

+21
-21
lines changed

Sources/TSPL/TSPL.docc/GuidedTour/GuidedTour.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1290,9 +1290,9 @@ You can provide an explicit name in parentheses after `set`.
12901290
Notice that the initializer for the `EquilateralTriangle` class
12911291
has three different steps:
12921292

1293-
- Setting the value of properties that the subclass declares.
1294-
- Calling the superclass's initializer.
1295-
- Changing the value of properties defined by the superclass.
1293+
1. Setting the value of properties that the subclass declares.
1294+
2. Calling the superclass's initializer.
1295+
3. Changing the value of properties defined by the superclass.
12961296
Any additional setup work that uses methods, getters, or setters
12971297
can also be done at this point.
12981298

Sources/TSPL/TSPL.docc/LanguageGuide/AdvancedOperators.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -198,9 +198,9 @@ whereas shifting it to the right by one position halves its value.
198198

199199
The bit-shifting behavior for unsigned integers is as follows:
200200

201-
- Existing bits are moved to the left or right by the requested number of places.
202-
- Any bits that are moved beyond the bounds of the integer's storage are discarded.
203-
- Zeros are inserted in the spaces left behind
201+
1. Existing bits are moved to the left or right by the requested number of places.
202+
2. Any bits that are moved beyond the bounds of the integer's storage are discarded.
203+
3. Zeros are inserted in the spaces left behind
204204
after the original bits are moved to the left or right.
205205

206206
This approach is known as a *logical shift*.

Sources/TSPL/TSPL.docc/LanguageGuide/Concurrency.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -883,11 +883,11 @@ the temperature logger is in a temporary inconsistent state.
883883
Preventing multiple tasks from interacting with the same instance simultaneously
884884
prevents problems like the following sequence of events:
885885

886-
- Your code calls the `update(with:)` method.
886+
1. Your code calls the `update(with:)` method.
887887
It updates the `measurements` array first.
888-
- Before your code can update `max`,
888+
2. Before your code can update `max`,
889889
code elsewhere reads the maximum value and the array of temperatures.
890-
- Your code finishes its update by changing `max`.
890+
3. Your code finishes its update by changing `max`.
891891

892892
In this case,
893893
the code running elsewhere would read incorrect information

Sources/TSPL/TSPL.docc/LanguageGuide/Generics.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -320,11 +320,11 @@ The illustration below shows the push and pop behavior for a stack:
320320

321321
![](stackPushPop)
322322

323-
- There are currently three values on the stack.
324-
- A fourth value is pushed onto the top of the stack.
325-
- The stack now holds four values, with the most recent one at the top.
326-
- The top item in the stack is popped.
327-
- After popping a value, the stack once again holds three values.
323+
1. There are currently three values on the stack.
324+
2. A fourth value is pushed onto the top of the stack.
325+
3. The stack now holds four values, with the most recent one at the top.
326+
4. The top item in the stack is popped.
327+
5. After popping a value, the stack once again holds three values.
328328

329329
Here's how to write a nongeneric version of a stack,
330330
in this case for a stack of `Int` values:

Sources/TSPL/TSPL.docc/ReferenceManual/Declarations.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -884,11 +884,11 @@ repeatGreeting("Hello, world!", count: 2) // count is labeled, greeting is not
884884

885885
In-out parameters are passed as follows:
886886

887-
- When the function is called,
887+
1. When the function is called,
888888
the value of the argument is copied.
889-
- In the body of the function,
889+
2. In the body of the function,
890890
the copy is modified.
891-
- When the function returns,
891+
3. When the function returns,
892892
the copy's value is assigned to the original argument.
893893

894894
This behavior is known as *copy-in copy-out*

Sources/TSPL/TSPL.docc/ReferenceManual/Statements.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -123,11 +123,11 @@ while <#condition#> {
123123

124124
A `while` statement is executed as follows:
125125

126-
- The *condition* is evaluated.
126+
1. The *condition* is evaluated.
127127

128128
If `true`, execution continues to step 2.
129129
If `false`, the program is finished executing the `while` statement.
130-
- The program executes the *statements*, and execution returns to step 1.
130+
2. The program executes the *statements*, and execution returns to step 1.
131131

132132
Because the value of the *condition* is evaluated before the *statements* are executed,
133133
the *statements* in a `while` statement can be executed zero or more times.
@@ -168,9 +168,9 @@ repeat {
168168

169169
A `repeat`-`while` statement is executed as follows:
170170

171-
- The program executes the *statements*,
171+
1. The program executes the *statements*,
172172
and execution continues to step 2.
173-
- The *condition* is evaluated.
173+
2. The *condition* is evaluated.
174174

175175
If `true`, execution returns to step 1.
176176
If `false`, the program is finished executing the `repeat`-`while` statement.

0 commit comments

Comments
 (0)