John Benediktsson
|
da6c8e3b8b
|
binary-search: faster by specializing on array and vectors.
|
2013-04-19 11:35:14 -07:00 |
|
John Benediktsson
|
d51a0e1647
|
binary-search: check +eq+ last.
|
2012-07-13 16:21:18 -07:00 |
Slava Pestov
|
cf69c58eee
|
binary-search: use nth-unsafe for a further performance gain
|
2010-04-18 21:42:44 -05:00 |
|
Slava Pestov
|
8d3d425d44
|
binary-search: faster and cleaner implementation using locals
|
2010-04-17 00:58:12 -05:00 |
Joe Groff
|
191ac353fd
|
generalize stack effects so we can bootstrap with the stricter stack effect checking
|
2010-03-08 23:38:10 -08:00 |
Doug Coleman
|
bd13e018dd
|
memq? -> member-eq?, sorted-memq? -> sorted-member-eq?
|
2009-10-28 15:02:00 -05:00 |
|
Slava Pestov
|
91e51f038c
|
Slightly faster binary-search
|
2009-03-12 20:43:44 -05:00 |
|
Slava Pestov
|
8aa6f673aa
|
Optimizations and load fixes
|
2008-08-24 03:59:37 -05:00 |
|
Slava Pestov
|
d66f887736
|
Create basis vocab root
|
2008-07-28 22:03:13 -05:00 |