Skip to content

Commit 5b168d3

Browse files
Danil Yarantsevnarimiran
authored andcommitted
Fix some typos in the manual [backport] (#14399)
(cherry picked from commit 1450924)
1 parent 965f7eb commit 5b168d3

File tree

1 file changed

+9
-9
lines changed

1 file changed

+9
-9
lines changed

doc/manual.rst

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -142,7 +142,7 @@ It is mostly accurate to picture semantic analysis proceeding top to bottom and
142142
left to right in the source code, with compile-time code execution interleaved
143143
when necessary to compute values that are required for subsequent semantic
144144
analysis. We will see much later in this document that macro invocation not only
145-
requires this interleaving, but also creates a situation where semantic analyis
145+
requires this interleaving, but also creates a situation where semantic analysis
146146
does not entirely proceed top to bottom and left to right.
147147

148148

@@ -783,7 +783,7 @@ features supported at compile time (as detailed in the next section below).
783783
Within such a code block, it is possible to declare variables and then later
784784
read and update them, or declare variables and pass them to procedures that
785785
modify them. However, the code in such a block must still adhere to the
786-
retrictions listed above for referencing values and operations outside the
786+
restrictions listed above for referencing values and operations outside the
787787
block.
788788

789789
The ability to access and modify compile-time variables adds flexibility to
@@ -1287,7 +1287,7 @@ A parameter ``A`` may be an *open array*, in which case it is indexed by
12871287
integers from 0 to ``len(A)-1``. An array expression may be constructed by the
12881288
array constructor ``[]``. The element type of this array expression is
12891289
inferred from the type of the first element. All other elements need to be
1290-
implicitly convertable to this type.
1290+
implicitly convertible to this type.
12911291

12921292
Sequences are similar to arrays but of dynamic length which may change
12931293
during runtime (like strings). Sequences are implemented as growable arrays,
@@ -3814,7 +3814,7 @@ as there are components in the tuple. The i'th iteration variable's type is
38143814
the type of the i'th component. In other words, implicit tuple unpacking in a
38153815
for loop context is supported.
38163816

3817-
Implict items/pairs invocations
3817+
Implicit items/pairs invocations
38183818
-------------------------------
38193819

38203820
If the for loop expression ``e`` does not denote an iterator and the for loop
@@ -4493,8 +4493,8 @@ more complex type classes:
44934493
44944494
Whilst the syntax of type classes appears to resemble that of ADTs/algebraic data
44954495
types in ML-like languages, it should be understood that type classes are static
4496-
constraints to be enforced at type instantations. Type classes are not really
4497-
types in themsleves, but are instead a system of providing generic "checks" that
4496+
constraints to be enforced at type instantiations. Type classes are not really
4497+
types in themselves, but are instead a system of providing generic "checks" that
44984498
ultimately *resolve* to some singular type. Type classes do not allow for
44994499
runtime type dynamism, unlike object variants or methods.
45004500

@@ -4656,7 +4656,7 @@ instantiation. The following is not allowed:
46564656
# not valid: 'T' is not inferred to be of type 'var int'
46574657
g(v, i)
46584658
4659-
# also not allowed: explict instantiation via 'var int'
4659+
# also not allowed: explicit instantiation via 'var int'
46604660
g[var int](v, i)
46614661
46624662
@@ -5127,7 +5127,7 @@ tree (AST) of the code that is passed to it. The macro can then do
51275127
transformations on it and return the transformed AST. This can be used to
51285128
add custom language features and implement `domain specific languages`:idx:.
51295129

5130-
Macro invocation is a case where semantic analyis does **not** entirely proceed
5130+
Macro invocation is a case where semantic analysis does **not** entirely proceed
51315131
top to bottom and left to right. Instead, semantic analysis happens at least
51325132
twice:
51335133

@@ -6483,7 +6483,7 @@ and instead the generated code should contain an ``#include``:
64836483
PFile {.importc: "FILE*", header: "<stdio.h>".} = distinct pointer
64846484
# import C's FILE* type; Nim will treat it as a new pointer type
64856485
6486-
The ``header`` pragma always expects a string constant. The string contant
6486+
The ``header`` pragma always expects a string constant. The string constant
64876487
contains the header file: As usual for C, a system header file is enclosed
64886488
in angle brackets: ``<>``. If no angle brackets are given, Nim
64896489
encloses the header file in ``""`` in the generated C code.

0 commit comments

Comments
 (0)