jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

fix a few "broken link" warnings (#20837)

Browse source
This commit is contained in:
Andrey Makarov 2022-11-14 10:43:29 +03:00 • committed by GitHub
commit 3eef0491a8
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
6 changed files with 6 additions and 6 deletions
Download patch file Download diff file Expand all files Collapse all files

2
compiler/concepts.nim
View file

@ -316,7 +316,7 @@ proc conceptMatch*(c: PContext; concpt, arg: PType; bindings: var TIdTable; invo
## concept's requirements. If so, we return true and fill the 'bindings' with pairs of ## concept's requirements. If so, we return true and fill the 'bindings' with pairs of
## (typeVar, instance) pairs. ('typeVar' is usually simply written as a generic 'T'.) ## (typeVar, instance) pairs. ('typeVar' is usually simply written as a generic 'T'.)
## 'invocation' can be nil for atomic concepts. For non-atomic concepts, it contains the ## 'invocation' can be nil for atomic concepts. For non-atomic concepts, it contains the
## 'C[S, T]' parent type that we look for. We need this because we need to store bindings ## `C[S, T]` parent type that we look for. We need this because we need to store bindings
## for 'S' and 'T' inside 'bindings' on a successful match. It is very important that ## for 'S' and 'T' inside 'bindings' on a successful match. It is very important that
## we do not add any bindings at all on an unsuccessful match! ## we do not add any bindings at all on an unsuccessful match!
var m = MatchCon(inferred: @[], potentialImplementation: arg) var m = MatchCon(inferred: @[], potentialImplementation: arg)

2
compiler/ic/bitabs.nim
View file

@ -1,5 +1,5 @@
## A BiTable is a table that can be seen as an optimized pair ## A BiTable is a table that can be seen as an optimized pair
## of (Table[LitId, Val], Table[Val, LitId]). ## of `(Table[LitId, Val], Table[Val, LitId])`.
import hashes, rodfiles import hashes, rodfiles

2
compiler/typeallowed.nim
View file

@ -8,7 +8,7 @@
# #
## This module contains 'typeAllowed' and friends which check ## This module contains 'typeAllowed' and friends which check
## for invalid types like 'openArray[var int]'. ## for invalid types like `openArray[var int]`.
import import
intsets, ast, renderer, options, semdata, types intsets, ast, renderer, options, semdata, types

2
doc/manual_experimental.md
View file

@ -548,7 +548,7 @@ For example:
The algorithm behind this analysis is described in The algorithm behind this analysis is described in
the [view types algorithm]. the [view types algorithm][Algorithm].
View types View types

2
lib/impure/re.nim
View file

@ -436,7 +436,7 @@ iterator findAll*(buf: cstring, pattern: Regex, start = 0, bufSize: int): string
proc findAll*(s: string, pattern: Regex, start = 0): seq[string] {.inline.} = proc findAll*(s: string, pattern: Regex, start = 0): seq[string] {.inline.} =
## returns all matching `substrings` of `s` that match `pattern`. ## returns all matching `substrings` of `s` that match `pattern`.
## If it does not match, @[] is returned. ## If it does not match, `@[]` is returned.
result = @[] result = @[]
for x in findAll(s, pattern, start): result.add x for x in findAll(s, pattern, start): result.add x

2
lib/pure/pegs.nim
View file

@ -1172,7 +1172,7 @@ iterator findAll*(s: string, pattern: Peg, start = 0): string =
func findAll*(s: string, pattern: Peg, start = 0): seq[string] {. func findAll*(s: string, pattern: Peg, start = 0): seq[string] {.
rtl, extern: "npegs$1".} = rtl, extern: "npegs$1".} =
## returns all matching *substrings* of `s` that match `pattern`. ## returns all matching *substrings* of `s` that match `pattern`.
## If it does not match, @[] is returned. ## If it does not match, `@[]` is returned.
result = @[] result = @[]
for it in findAll(s, pattern, start): result.add it for it in findAll(s, pattern, start): result.add it