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

preparations for 0.8.12

Browse source
This commit is contained in:
Araq 2011-07-10 15:48:13 +02:00
commit 5b96eaa953
81 changed files with 2355 additions and 826 deletions
Download patch file Download diff file Expand all files Collapse all files

4
lib/pure/collections/intsets.nim Normal file → Executable file
View file

@ -9,8 +9,8 @@
## The ``intsets`` module implements an efficient int set implemented as a
## sparse bit set.
## **Note**: Since Nimrod does not allow the assignment operator to be
## overloaded, ``=`` for int sets performs some rather meaningless shallow
## **Note**: Since Nimrod currently does not allow the assignment operator to
## be overloaded, ``=`` for int sets performs some rather meaningless shallow
## copy.
import

0
lib/pure/collections/queues.nim Normal file → Executable file
View file

6
lib/pure/collections/sets.nim Normal file → Executable file
View file

@ -9,9 +9,9 @@
## The ``sets`` module implements an efficient hash set and ordered hash set.
##
## Note: The data types declared here have *value semantics*: This means that
## ``=`` performs a copy of the hash table. If you are overly concerned with
## efficiency and know what you do (!), you can define the symbol
## **Note**: The data types declared here have *value semantics*: This means
## that ``=`` performs a copy of the hash table. If you are overly concerned
## with efficiency and know what you do (!), you can define the symbol
## ``shallowADT`` to compile a version that uses shallow copies instead.
import

8
lib/pure/collections/tables.nim Normal file → Executable file
View file

@ -10,9 +10,9 @@
## The ``tables`` module implements an efficient hash table that is
## a mapping from keys to values.
##
## Note: The data types declared here have *value semantics*: This means that
## ``=`` performs a copy of the hash table. If you are overly concerned with
## efficiency and know what you do (!), you can define the symbol
## **Note:** The data types declared here have *value semantics*: This means
## that ``=`` performs a copy of the hash table. If you are overly concerned
## with efficiency and know what you do (!), you can define the symbol
## ``shallowADT`` to compile a version that uses shallow copies instead.
import
@ -27,7 +27,7 @@ type
TSlotEnum = enum seEmpty, seFilled, seDeleted
TKeyValuePair[A, B] = tuple[slot: TSlotEnum, key: A, val: B]
TKeyValuePairSeq[A, B] = seq[TKeyValuePair[A, B]]
TTable* {.final, myShallow.}[A, B] = object
TTable* {.final, myShallow.}[A, B] = object ## generic hash table
data: TKeyValuePairSeq[A, B]
counter: int