Eli Barzilay
1a12497bc1
optimize insertionsort: one less loop variable, one more addition, unconditional first step
...
svn: r17227
2009-12-06 09:11:47 +00:00
Eli Barzilay
4977e6bd6c
Switch off unsafe operations for now, better to turn it on after the
...
code was used for a while.
svn: r17008
2009-11-23 18:53:13 +00:00
Eli Barzilay
0b6ae05e9b
Use unsafe operations for dealing with the vectors and indexes.
...
svn: r17007
2009-11-23 18:51:03 +00:00
Eli Barzilay
ea94f5dea5
Added `copying-insertionsort' for small blocks, some fixes.
...
svn: r17006
2009-11-23 18:50:12 +00:00
Eli Barzilay
ab832a3b4d
Optimize copying-quicksort by passing around only two indexes and the
...
length of the block.
svn: r17005
2009-11-23 18:49:38 +00:00
Eli Barzilay
d46beb2325
Works on lists of any size now.
...
svn: r17004
2009-11-23 18:48:46 +00:00
Eli Barzilay
c68eeb97ca
Further optimizations to `merge'.
...
svn: r17003
2009-11-23 18:48:06 +00:00
Eli Barzilay
ebfdbe4bb0
Combined the two merge functions into one macro, and improved it a little.
...
svn: r17002
2009-11-23 18:47:32 +00:00
Eli Barzilay
a272c479a6
First version of a vector-based "half-copying" merge sort, which will end up
...
being more than twice faster than the current version.
[Currently works only with 2^n lists, and otherwise broken -- committed
to keep the development history in svn.]
svn: r17001
2009-11-23 18:46:40 +00:00
Eli Barzilay
e2cd7a51e5
Fixed a comparison that was too strict, making the code go to the
...
general case on lists of length 3. (Didn't have much effect since it's
only the toplevel comparison).
svn: r16899
2009-11-19 21:58:44 +00:00
Matthew Flatt
021d4d7527
new hash function names and ops (3.99.0.23)
...
svn: r9209
2008-04-08 21:42:38 +00:00
Eli Barzilay
fcfaa3cc64
use sort.ss in kw.ss too
...
svn: r9129
2008-04-02 00:07:45 +00:00
Eli Barzilay
bfc990e3c5
Added #:key and #:cache-keys to `sort', documented and tested.
...
svn: r9128
2008-04-01 20:58:41 +00:00
