diff options
Diffstat (limited to 'compiler')
| -rw-r--r-- | compiler/concepts.nim | 2 | ||||
| -rw-r--r-- | compiler/ic/bitabs.nim | 2 | ||||
| -rw-r--r-- | compiler/typeallowed.nim | 2 |
3 files changed, 3 insertions, 3 deletions
diff --git a/compiler/concepts.nim b/compiler/concepts.nim index 628e1d4be..a810b3642 100644 --- a/compiler/concepts.nim +++ b/compiler/concepts.nim @@ -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 ## (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 - ## '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 ## we do not add any bindings at all on an unsuccessful match! var m = MatchCon(inferred: @[], potentialImplementation: arg) diff --git a/compiler/ic/bitabs.nim b/compiler/ic/bitabs.nim index 8adab8388..a55131051 100644 --- a/compiler/ic/bitabs.nim +++ b/compiler/ic/bitabs.nim @@ -1,5 +1,5 @@ ## 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 diff --git a/compiler/typeallowed.nim b/compiler/typeallowed.nim index 37b548865..18cfcf6b2 100644 --- a/compiler/typeallowed.nim +++ b/compiler/typeallowed.nim @@ -8,7 +8,7 @@ # ## This module contains 'typeAllowed' and friends which check -## for invalid types like 'openArray[var int]'. +## for invalid types like `openArray[var int]`. import intsets, ast, renderer, options, semdata, types |