Björn Lindqvist
|
1ca8276df4
|
basis/,core/,extra/: many new tags
|
2017-07-06 23:04:18 +02:00 |
Doug Coleman
|
e189954ecc
|
core: Rename iota to <iota> so we can have TUPLE: iota ... ; instead of TUPLE: iota-tuple ... ;
|
2017-06-02 11:57:05 -05:00 |
|
Doug Coleman
|
391f8e433f
|
basis: Cleaning up tests using lists and IN: forms.
|
2016-03-30 20:04:14 -07:00 |
John Benediktsson
|
e7a42b1dc4
|
sets: rename unordered-set back to set.
|
2016-03-29 15:46:29 -07:00 |
|
John Benediktsson
|
ceb75057da
|
change ERROR: words from throw-foo back to foo.
|
2015-08-13 16:13:05 -07:00 |
|
Doug Coleman
|
b6be8685c3
|
basis: ERROR: changes.
|
2015-08-13 03:20:39 -07:00 |
|
Doug Coleman
|
28dcd0667a
|
factor: rename set to unordered-set.
|
2015-08-12 10:54:19 -05:00 |
|
Doug Coleman
|
43d6f1d3e2
|
factor: Retrying on the unit tests. Also normalize some syntax with FUNCTION:.
|
2015-07-02 17:28:17 -07:00 |
|
Doug Coleman
|
59f3b1ea57
|
Revert "factor: rename [ ] [ ] unit-test -> { } [ ] unit-test using a refactoring tool!"
Needs a bit more work.
This reverts commit 7e54cc2824.
|
2015-07-02 13:47:06 -07:00 |
|
Doug Coleman
|
7e54cc2824
|
factor: rename [ ] [ ] unit-test -> { } [ ] unit-test using a refactoring tool!
|
2015-07-02 11:36:08 -07:00 |
|
John Benediktsson
|
a0a76469b6
|
bit-sets: some cleanup, small performance improvement to members.
|
2014-04-29 22:13:37 -07:00 |
|
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
|
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 |