John Benediktsson
|
f59d8ef0c1
|
project-euler.common: add a digits>number.
|
2015-07-19 19:18:47 -07:00 |
Doug Coleman
|
892c62e1dc
|
factor: second stab at [ ] [ ] unit-test -> { } [ ] unit-test
|
2015-07-03 09:39:59 -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
|
7826543d2e
|
sequences: add cartesian-each, cartesian-map, cartesian-product words to eliminate some duplication throughout the codebase
|
2010-02-25 20:54:57 +13:00 |
|
Slava Pestov
|
df4fb4a3ee
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
Doug Coleman
|
1d12a6707d
|
sigma -> map-sum
|
2009-10-29 14:34:04 -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 |
Aaron Schaefer
|
ca9fb1fcf1
|
Update usages of divisor? where appropriate
|
2009-04-01 21:53:18 -04: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 |
|
Doug Coleman
|
3c408342ef
|
renaming: contain? -> any?, deep-contains? -> deep-any?, pad-left -> pad-head, pad-right -> pad-tail, trim-left -> trim-head, trim-right -> trim-tail
|
2009-01-29 22:19:07 -06:00 |
|
Aaron Schaefer
|
2bd1723cc1
|
Rerun ave-time of PE #43 after constant space change
|
2008-11-07 01:25:18 -05:00 |
|
Slava Pestov
|
666100a07b
|
Tweak euler043 to run in constant space, add new each-permutation and reduce-permutations combinators to math.combinatorics
|
2008-11-06 11:07:19 -06:00 |
|
Aaron Schaefer
|
4d1d9b2087
|
Fix short circuit usage in Project Euler solutions
|
2008-11-06 01:41:24 -05: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
|
6e7aa21cb5
|
dont use lib
|
2008-10-02 17:40:49 -05:00 |
|
Aaron Schaefer
|
a4efa8cb08
|
Minor updates to standardize new Project Euler solutions
|
2008-07-20 21:52:39 -04:00 |
Eduardo Cavazos
|
bf238283da
|
Update code for combinators.short-circuit
|
2008-06-24 13:47:54 -05:00 |
|
Eduardo Cavazos
|
bdd66927fc
|
More short-circuit updates
|
2008-06-10 20:42:55 -05:00 |
|
Doug Coleman
|
4d0ba8c3c1
|
reverse args for assoc-diff, diff
fix lots of usings
fix help lint
|
2008-04-26 02:01:43 -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 |
|
Doug Coleman
|
f64d511ca6
|
add usings
|
2008-04-14 02:40:32 -05:00 |
|
Doug Coleman
|
f80085ff0a
|
seq-diff -> diff
seq-intersect -> intersect
|
2008-04-13 23:09:42 -05:00 |
|
Eduardo Cavazos
|
aa40350aa7
|
replace add* and add with prefix and suffix
|
2008-03-31 18:18:05 -06:00 |
|
Aaron Schaefer
|
7361ee58a8
|
Fix Project Euler solutions using combinators.lib stuff that moved
|
2008-02-11 15:14:56 -05:00 |
|
Aaron Schaefer
|
741d3df68a
|
Fix PE solutions using old math.parser
|
2008-02-07 20:25:03 -05:00 |
|
Aaron Schaefer
|
c68e70877d
|
Solution to Project Euler problem 43
|
2008-02-05 16:42:50 -05:00 |