diff options
author | konsumlamm <44230978+konsumlamm@users.noreply.github.com> | 2021-03-10 19:39:23 +0100 |
---|---|---|
committer | GitHub <noreply@github.com> | 2021-03-10 10:39:23 -0800 |
commit | 9819fb21d8db818c0b3027d4e6ba58dc550b77c0 (patch) | |
tree | c96be69e439f34b4f191ec5a25ce6ef7b2e0d766 /lib/pure/collections/tables.nim | |
parent | eb07a5a75b63110642c5ce6f9126c9c8af231a64 (diff) | |
download | Nim-9819fb21d8db818c0b3027d4e6ba58dc550b77c0.tar.gz |
Use `.. warning::` (#17320)
Diffstat (limited to 'lib/pure/collections/tables.nim')
-rw-r--r-- | lib/pure/collections/tables.nim | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/lib/pure/collections/tables.nim b/lib/pure/collections/tables.nim index e19298239..f77642349 100644 --- a/lib/pure/collections/tables.nim +++ b/lib/pure/collections/tables.nim @@ -598,7 +598,7 @@ template withValue*[A, B](t: var Table[A, B], key: A, value, body: untyped) = # block is executed only if `key` in `t` value.name = "Nim" value.uid = 1314 - + t.withValue(2, value) do: value.name = "No" value.uid = 521 @@ -2437,7 +2437,7 @@ proc sort*[A](t: var CountTable[A], order = SortOrder.Descending) = ## Sorts the count table so that, by default, the entry with the ## highest counter comes first. ## - ## **WARNING:** This is destructive! Once sorted, you must not modify `t` afterwards! + ## .. warning:: This is destructive! Once sorted, you must not modify `t` afterwards! ## ## You can use the iterators `pairs<#pairs.i,CountTable[A]>`_, ## `keys<#keys.i,CountTable[A]>`_, and `values<#values.i,CountTable[A]>`_ |