John Benediktsson
|
6f1c44b46d
|
Cleanup some lint warnings.
|
2011-10-15 19:19:44 -07:00 |
Slava Pestov
|
3e27d06914
|
layouts: most-positive/negative-fixnum return fixnums now
|
2009-09-29 22:27:54 -05:00 |
|
Slava Pestov
|
1fd6ae1776
|
project-euler.044: update average time in comment
|
2009-09-11 21:15:48 -05:00 |
|
Slava Pestov
|
7145016142
|
project-euler.044: even faster algorithm
|
2009-09-11 21:14:43 -05:00 |
|
Slava Pestov
|
96ca914972
|
project-euler.044: more efficient algorithm
|
2009-09-11 20:59:54 -05: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
|
f995542246
|
Project Euler solutions had MAIN: words which would leave values on the stack; add a new SOLUTION: parsing word now that MAIN: cannot do that
|
2009-03-18 23:05:32 -05:00 |
|
Slava Pestov
|
e88812b76a
|
map infimum => [ min ] map-reduce
|
2009-02-02 06:04:29 -06:00 |
Aaron Schaefer
|
b5b207a484
|
Add test files for all Project Euler solutions
|
2008-11-05 01:11:15 -05:00 |
|
Aaron Schaefer
|
92e2ee3509
|
Clean up Projece Euler solutions
|
2008-11-03 16:20:36 -05:00 |
|
Doug Coleman
|
b7c1f9dbe8
|
extra changes:
index* -> index-from
last-index* -> last-index-from
1 tail -> rest
1 tail-slice -> rest-slice
subset -> filter
prepose
find* -> find-from
find-last* -> find-last-from
before, after generic, < for integers
make between? work for timestamps
|
2008-04-25 23:17:08 -05:00 |
|
Slava Pestov
|
c22af5c7a6
|
Rename 2apply to bi@
|
2008-03-29 20:36:58 -05:00 |
|
Aaron Schaefer
|
d206ff9067
|
Solution to Project Euler problem 45
|
2008-02-08 19:28:30 -05:00 |
|
Aaron Schaefer
|
d27ae06708
|
Solution to Project Euler problem 44
|
2008-02-06 00:53:18 -05:00 |