Slava Pestov
|
3c73e53db3
|
sets, bit-sets: cleanups
|
2010-12-27 20:10:37 -08: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
|
c36d85ab47
|
sets, hash-sets, bit-sets: fix some typos in the documentation
|
2010-03-30 01:10:39 -04:00 |
Daniel Ehrenberg
|
fab9a925c3
|
Reducing bit-sets performance regression somewhat
|
2010-03-17 21:38:06 -04:00 |
|
Daniel Ehrenberg
|
cd10fed0af
|
Fixing bit sets help
|
2010-03-16 23:59:35 -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
|
04878057af
|
Compiler.cfg.{dce,linearization} use new-sets
|
2010-02-16 15:48:07 -06:00 |
|
Daniel Ehrenberg
|
30cc248bb3
|
Bit sets use new new set protocol, and compiler.cfg.ssa.construction.tdmsc is updated for it
|
2010-02-16 15:14:32 -06:00 |
Doug Coleman
|
3f3d57032b
|
Delete empty unit tests files, remove 1- and 1+, reorder IN: lines in a lot of places, minor refactoring
|
2009-08-13 19:21:44 -05:00 |
|
Slava Pestov
|
5fe3bcff4d
|
Faster bit-array equality, add bit-set-subset? word
|
2009-07-28 11:14:57 -05:00 |
|
Slava Pestov
|
f042019337
|
bit-sets: efficient bitwise operations on bit-arrays
|
2009-07-02 21:58:49 -05:00 |