Doug Coleman
|
391f8e433f
|
basis: Cleaning up tests using lists and IN: forms.
|
2016-03-30 20:04:14 -07: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 |
Slava Pestov
|
3c73e53db3
|
sets, bit-sets: cleanups
|
2010-12-27 20:10:37 -08:00 |
Daniel Ehrenberg
|
265fe6208f
|
Adding null? word to test if a set is empty
|
2010-04-17 16:25:51 -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
|
f042019337
|
bit-sets: efficient bitwise operations on bit-arrays
|
2009-07-02 21:58:49 -05:00 |