John Benediktsson
|
42f404787a
|
hash-sets: simpler code.
|
2013-03-26 17:42:40 -07:00 |
|
John Benediktsson
|
5624473a5a
|
hash-sets: implement faster ?adjoin.
|
2013-03-23 16:58:31 -07:00 |
|
John Benediktsson
|
8dc17047e2
|
hash-sets: speed up union on two hash-sets.
|
2013-03-23 14:17:10 -07:00 |
|
John Benediktsson
|
7f0a5eb572
|
Revert "hash-sets: faster M\ hash-set union."
This reverts commit bb7a1017f5.
|
2013-03-22 22:05:06 -07:00 |
|
John Benediktsson
|
bb7a1017f5
|
hash-sets: faster M\ hash-set union.
|
2013-03-22 21:52:56 -07:00 |
|
John Benediktsson
|
a75d852a89
|
hash-sets: faster grow-hash by not calling members.
|
2013-03-20 23:02:28 -07:00 |
|
John Benediktsson
|
16f7850590
|
hash-sets: use ?adjoin instead of (all-unique?).
|
2013-03-11 21:21:44 -07:00 |
|
John Benediktsson
|
64489d93c7
|
hash-sets: use push-unsafe from hashtables.private.
|
2013-03-10 17:08:41 -07:00 |
|
John Benediktsson
|
1384893a0e
|
hash-sets: back out this change for now.
|
2013-03-08 17:53:12 -08:00 |
Doug Coleman
|
1c218d725c
|
hash-sets: Support >alist on hash-sets or else tab-completion breaks. Can we write a unit test for this too?
|
2013-03-08 17:32:46 -08:00 |
|
John Benediktsson
|
bf4e997c3a
|
hash-sets: fix help-lint warnings.
|
2013-03-08 06:15:27 -08:00 |
|
John Benediktsson
|
25e42f5fb6
|
bootstrap: make sure to rehash hash-sets also.
|
2013-03-07 22:04:52 -08:00 |
|
John Benediktsson
|
db4e6592a2
|
hash-sets: reuse (rehash).
|
2013-03-07 22:02:02 -08:00 |
|
John Benediktsson
|
ede0232ddc
|
hash-sets: faster implementation based on hashtables.
|
2013-03-07 21:43:17 -08:00 |
|
John Benediktsson
|
8ef3f34cde
|
sets: adding clear-set.
|
2013-03-07 18:48:15 -08:00 |
|
John Benediktsson
|
3337401551
|
core: cleanup USING lists.
|
2013-03-05 10:34:47 -08:00 |
|
John Benediktsson
|
d4af92f933
|
sets: minor improvements to sequence-as-sets.
|
2012-08-24 16:37:01 -07:00 |
|
John Benediktsson
|
7c990fc09d
|
hash-sets: using ?adjoin to implement duplicates, some tests.
|
2012-05-14 15:47:56 -07:00 |
|
John Benediktsson
|
b0a2027e71
|
hash-sets: speed up diff, intersect, and union.
|
2012-04-16 10:58:08 -07:00 |
|
John Benediktsson
|
20a1d63df4
|
hash-sets: separate <hash-set> and >hash-set to match other containers. Fixes #154.
|
2011-10-19 11:35:25 -07:00 |
|
John Benediktsson
|
fcce06f27f
|
hash-sets: remove unused import.
|
2011-09-06 11:26:29 -07:00 |
|
John Benediktsson
|
5a7389a94c
|
hash-sets: simpler <hash-set>.
|
2011-09-03 16:38:42 -07:00 |
|
John Benediktsson
|
af91c8baeb
|
hash-sets: initialize hashtable capacity to length of sequence.
|
2011-09-03 14:46:26 -07:00 |
|
John Benediktsson
|
2534bd5054
|
sets: adding cardinality word.
|
2010-12-27 19:22:36 -08:00 |
Daniel Ehrenberg
|
30e0471ade
|
Adding null? word to test if a set is empty
|
2010-04-17 16:25:51 -05:00 |
Slava Pestov
|
ee288016f6
|
sets: fix performance regression in all-unique? word
|
2010-04-13 04:43:47 -07:00 |
|
Slava Pestov
|
92b66ada71
|
sets, hash-sets, bit-sets: fix some typos in the documentation
|
2010-03-30 01:10:39 -04:00 |
Daniel Ehrenberg
|
b0f0c58141
|
Making <hash-set> faster
|
2010-03-17 20:12:25 -04:00 |
|
Daniel Ehrenberg
|
384f854d77
|
Fixing bugs with sets, including adding new within and without words
|
2010-03-16 20:17:26 -04:00 |
|
Daniel Ehrenberg
|
92d76657b8
|
Updated documentation for sets
|
2010-02-27 00:27:40 -05:00 |
|
Daniel Ehrenberg
|
0f0571e48a
|
Moving new-sets to sets
|
2010-02-26 16:01:01 -05:00 |
|
Daniel Ehrenberg
|
8b219ef472
|
Making it fast to create a new hashset
|
2010-02-26 13:24:26 -05:00 |
|
Daniel Ehrenberg
|
9943f225d9
|
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
|
d0e7d8198e
|
Moving new-sets and hash-sets to core
|
2010-02-26 11:01:57 -05:00 |