John Benediktsson
|
d62fea3bbc
|
sets: minor improvements to sequence-as-sets.
|
2012-08-24 16:37:01 -07:00 |
John Benediktsson
|
0f6972b98b
|
hash-sets: using ?adjoin to implement duplicates, some tests.
|
2012-05-14 15:47:56 -07:00 |
John Benediktsson
|
ca4d5cbde0
|
hash-sets: speed up diff, intersect, and union.
|
2012-04-16 10:58:08 -07:00 |
John Benediktsson
|
beb5b9bf64
|
hash-sets: separate <hash-set> and >hash-set to match other containers. Fixes #154.
|
2011-10-19 11:35:25 -07:00 |
John Benediktsson
|
29f6011817
|
hash-sets: remove unused import.
|
2011-09-06 11:26:29 -07:00 |
John Benediktsson
|
e8aa41ae57
|
hash-sets: simpler <hash-set>.
|
2011-09-03 16:38:42 -07:00 |
John Benediktsson
|
f2aa8ec876
|
hash-sets: initialize hashtable capacity to length of sequence.
|
2011-09-03 14:46:26 -07:00 |
John Benediktsson
|
47faf5f6ae
|
sets: adding cardinality word.
|
2010-12-27 19:22:36 -08:00 |
Daniel Ehrenberg
|
265fe6208f
|
Adding null? word to test if a set is empty
|
2010-04-17 16:25:51 -05:00 |
Slava Pestov
|
3e91a7f280
|
sets: fix performance regression in all-unique? word
|
2010-04-13 04:43:47 -07:00 |
Slava Pestov
|
c36d85ab47
|
sets, hash-sets, bit-sets: fix some typos in the documentation
|
2010-03-30 01:10:39 -04:00 |
Daniel Ehrenberg
|
67912db5f1
|
Making <hash-set> faster
|
2010-03-17 20:12:25 -04:00 |
Daniel Ehrenberg
|
1da6ea957a
|
Fixing bugs with sets, including adding new within and without words
|
2010-03-16 20:17:26 -04:00 |
Daniel Ehrenberg
|
7ad324837b
|
Updated documentation for sets
|
2010-02-27 00:27:40 -05:00 |
Daniel Ehrenberg
|
7074979745
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -05:00 |
Daniel Ehrenberg
|
73a990a4b8
|
Making it fast to create a new hashset
|
2010-02-26 13:24:26 -05:00 |
Daniel Ehrenberg
|
b76c82048d
|
Making propagation and tuple.parser refer to new-sets; adding some missing features from sets into new-sets
|
2010-02-26 12:07:37 -05:00 |
Daniel Ehrenberg
|
e43312d780
|
Moving new-sets and hash-sets to core
|
2010-02-26 11:01:57 -05:00 |