John Benediktsson
|
2621fff99e
|
bit-sets: use adjoin-all.
|
2013-03-23 22:07:22 -07:00 |
|
John Benediktsson
|
1524d43c9c
|
sequences: define a single "?set-nth" that is used.
|
2013-02-20 10:42:21 -08:00 |
|
John Benediktsson
|
55cfbf072f
|
sequences: fix uses of set-nth-unsafe.
|
2013-02-20 08:01:06 -08:00 |
|
John Benediktsson
|
f8f5feed4a
|
sequences: normalize all the "?set-nth" words, probably this should be a stdlib thing.
|
2013-02-19 16:52:40 -08:00 |
|
John Benediktsson
|
ba8a3c2ecd
|
bit-sets: inline <bit-set>.
|
2012-09-28 20:29:39 -07:00 |
|
John Benediktsson
|
4e72d80256
|
Using "same?" in more places.
|
2012-07-21 10:22:44 -07:00 |
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
|
fab9a925c3
|
Reducing bit-sets performance regression somewhat
|
2010-03-17 21:38:06 -04: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 |
|
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 |