summary refs log tree commit diff stats
path: root/compiler/concepts.nim
diff options
context:
space:
mode:
Diffstat (limited to 'compiler/concepts.nim')
-rw-r--r--compiler/concepts.nim2
1 files changed, 1 insertions, 1 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)