Fix many broken links
Note that contrary to what docgen.rst currently says, the ids have to match exactly or else most web browsers will not jump to the intended symbol.
This commit is contained in:
parent
6bfa4eb6c5
commit
93461aee34
35 changed files with 145 additions and 143 deletions
|
|
@ -69,8 +69,8 @@
|
|||
## See also
|
||||
## ========
|
||||
##
|
||||
## * `deques module <#deques.html>`_ for double-ended queues
|
||||
## * `sharedlist module <#sharedlist.html>`_ for shared singly-linked lists
|
||||
## * `deques module <deques.html>`_ for double-ended queues
|
||||
## * `sharedlist module <sharedlist.html>`_ for shared singly-linked lists
|
||||
|
||||
|
||||
when not defined(nimhygiene):
|
||||
|
|
|
|||
|
|
@ -35,7 +35,7 @@
|
|||
## `filterIt<#filterIt.t,untyped,untyped>`_, etc.)
|
||||
##
|
||||
## The chaining of functions is possible thanks to the
|
||||
## `method call syntax<manual.html#procs-method-call-syntax>`_.
|
||||
## `method call syntax<manual.html#procedures-method-call-syntax>`_.
|
||||
##
|
||||
## .. code-block::
|
||||
## import sequtils, sugar
|
||||
|
|
|
|||
|
|
@ -99,7 +99,7 @@ proc init*[A](s: var HashSet[A], initialSize = defaultInitialSize) =
|
|||
##
|
||||
## The `initialSize` parameter needs to be a power of two (default: 64).
|
||||
## If you need to accept runtime values for this, you can use
|
||||
## `math.nextPowerOfTwo proc <math.html#nextPowerOfTwo>`_ or `rightSize proc
|
||||
## `math.nextPowerOfTwo proc <math.html#nextPowerOfTwo,int>`_ or `rightSize proc
|
||||
## <#rightSize,Natural>`_ from this module.
|
||||
##
|
||||
## Starting from Nim v0.20, sets are initialized by default and it is
|
||||
|
|
@ -645,7 +645,7 @@ proc init*[A](s: var OrderedSet[A], initialSize = defaultInitialSize) =
|
|||
##
|
||||
## The `initialSize` parameter needs to be a power of two (default: 64).
|
||||
## If you need to accept runtime values for this, you can use
|
||||
## `math.nextPowerOfTwo proc <math.html#nextPowerOfTwo>`_ or `rightSize proc
|
||||
## `math.nextPowerOfTwo proc <math.html#nextPowerOfTwo,int>`_ or `rightSize proc
|
||||
## <#rightSize,Natural>`_ from this module.
|
||||
##
|
||||
## Starting from Nim v0.20, sets are initialized by default and it is
|
||||
|
|
|
|||
|
|
@ -134,7 +134,7 @@
|
|||
## # 'a': 5, 'b': 2, 'c': 1, 'd': 1, 'r': 2}
|
||||
##
|
||||
## The same could have been achieved by manually iterating over a container
|
||||
## and increasing each key's value with `inc proc<#inc,CountTable[A],A,int>`_:
|
||||
## and increasing each key's value with `inc proc<#inc,CountTable[A],A,Positive>`_:
|
||||
##
|
||||
## .. code-block::
|
||||
## import tables
|
||||
|
|
@ -2236,7 +2236,7 @@ proc `[]=`*[A](t: var CountTable[A], key: A, val: int) =
|
|||
##
|
||||
## See also:
|
||||
## * `[] proc<#[],CountTable[A],A>`_ for retrieving a value of a key
|
||||
## * `inc proc<#inc,CountTable[A],A,int>`_ for incrementing a
|
||||
## * `inc proc<#inc,CountTable[A],A,Positive>`_ for incrementing a
|
||||
## value of a key
|
||||
assert(not t.isSorted, "CountTable must not be used after sorting")
|
||||
assert val >= 0
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue