John Benediktsson
|
179f063eb9
|
sequences: fix test case.
|
2013-05-07 06:18:13 -07:00 |
John Benediktsson
|
a5bc30ba42
|
sequences: change binary-reduce not to be row-polymorphic until #879 is fixed.
|
2013-05-06 16:17:57 -07:00 |
John Benediktsson
|
71ad332027
|
sequences: implement sum on iota-tuple.
|
2013-05-06 16:02:49 -07:00 |
John Benediktsson
|
61912f3c73
|
adding some summary.txt files.
|
2013-04-26 17:43:24 -07:00 |
John Benediktsson
|
2b7d53b7d1
|
parser: add invalid-word-name, use it to check for redefining quotes.
|
2013-04-25 15:41:20 -07:00 |
John Benediktsson
|
cead10cfb6
|
strings.parser: use rest-slice.
|
2013-04-22 06:26:36 -07:00 |
John Benediktsson
|
89d4fdfb75
|
sequences: cleanup shared code between supremum-by and infimum-by.
|
2013-04-17 15:29:42 -07:00 |
John Benediktsson
|
21463894e7
|
sequences: faster remove-nth.
|
2013-04-17 09:05:19 -07:00 |
John Benediktsson
|
15c4927c5f
|
words.alias: make aliases to parsing words also parsing words.
|
2013-04-16 11:23:41 -07:00 |
Doug Coleman
|
ee921150c7
|
effests.parser: Oops wrong word.
|
2013-04-14 13:33:48 -07:00 |
Doug Coleman
|
bd3762502f
|
effects.parser: Fix word -> current-word for definition errors.
|
2013-04-14 13:32:15 -07:00 |
John Benediktsson
|
86ad529ed7
|
sequences: fix supremum-by and infimum-by to be row polymorphic.
|
2013-04-10 11:10:01 -07:00 |
John Benediktsson
|
5c225fa09f
|
sequences: moving some words to sequences.extras.
|
2013-04-10 10:49:29 -07:00 |
John Benediktsson
|
17da9e0cff
|
assocs: faster keys/values for enums.
|
2013-04-07 12:44:09 -07:00 |
John Benediktsson
|
e3ea3ac140
|
hashtables: cleanup duplicate code.
|
2013-04-06 21:36:39 -07:00 |
John Benediktsson
|
a58c8ecc03
|
hashtables: faster keys and values on hashtables.
|
2013-04-06 21:20:07 -07:00 |
John Benediktsson
|
9926c205a5
|
assocs: making keys and values generic.
|
2013-04-06 21:19:56 -07:00 |
John Benediktsson
|
c900590f8b
|
use concat instead of join.
|
2013-04-06 17:02:22 -07:00 |
John Benediktsson
|
f13cbb3c4a
|
sequences: adding nths-unsafe.
|
2013-04-06 14:29:47 -07:00 |
John Benediktsson
|
2ca5b739e0
|
splitting: removing split* to extras.
|
2013-04-01 09:14:01 -07:00 |
John Benediktsson
|
ff7793bb90
|
splitting: add another test case to make sure we can access ... args.
|
2013-03-31 18:52:53 -07:00 |
John Benediktsson
|
a96737fc29
|
words.alias: definition is just the def>>.
|
2013-03-31 17:00:31 -07:00 |
John Benediktsson
|
042d86846e
|
splitting: change split* to preserve (separately) the separators.
|
2013-03-31 16:05:30 -07:00 |
John Benediktsson
|
5793229dae
|
math.floats: fix M\ float /mod.
|
2013-03-29 08:48:28 -07:00 |
John Benediktsson
|
37ca02a84e
|
math.floats: adding some tests for M\ float mod.
|
2013-03-29 08:30:56 -07:00 |
John Benediktsson
|
77e8346ec0
|
slots: fix typo, cleanup style a little bit.
|
2013-03-28 20:04:19 -07:00 |
John Benediktsson
|
ff72d10fda
|
math.parser: don't use variables in M\ ratio >base.
|
2013-03-28 14:31:55 -07:00 |
John Benediktsson
|
412382abca
|
math.parser: exactly allocate sbuf for fixnums.
|
2013-03-28 11:55:52 -07:00 |
John Benediktsson
|
bf0f6476f5
|
math.parser: do two digits down until 10.
|
2013-03-27 18:01:59 -07:00 |
John Benediktsson
|
b5b0839426
|
math.parser: faster using byte-arrays.
|
2013-03-27 17:54:24 -07:00 |
John Benediktsson
|
ae4e53fd5b
|
splitting: adding split-slice and split*-slice for completeness.
|
2013-03-27 16:29:13 -07:00 |
John Benediktsson
|
f285d4db3f
|
splitting: add split*-when-slice and change to not use make.
|
2013-03-27 16:19:56 -07:00 |
John Benediktsson
|
6fd25b6668
|
splitting: adding split1-when-slice and split-when-slice.
|
2013-03-27 16:00:16 -07:00 |
John Benediktsson
|
b7cb67bf76
|
math.parser: faster number>string.
|
2013-03-27 14:47:46 -07:00 |
John Benediktsson
|
3d9b1f4adb
|
hash-sets: inline >hash-set to speed up set operations.
|
2013-03-26 17:51:59 -07:00 |
John Benediktsson
|
1f13eefad2
|
hash-sets: slightly faster filter-members.
|
2013-03-26 17:42:41 -07:00 |
John Benediktsson
|
daaf090459
|
hash-sets: faster intersect and diff, when both are hash-sets.
|
2013-03-26 17:42:40 -07:00 |
John Benediktsson
|
ac8473e0ea
|
hash-sets: faster subset? and set= when both are hash-sets.
|
2013-03-26 17:42:40 -07:00 |
John Benediktsson
|
200e37671f
|
hash-sets: faster intersects?.
|
2013-03-26 17:42:40 -07:00 |
John Benediktsson
|
28b194d5fc
|
sets: inline small/large.
|
2013-03-26 17:42:40 -07:00 |
John Benediktsson
|
92c0faa918
|
hash-sets: simpler code.
|
2013-03-26 17:42:40 -07:00 |
John Benediktsson
|
e25fe7c7cc
|
sets: encourage re-use by adding (intersect) and (diff).
|
2013-03-26 17:42:40 -07:00 |
John Benediktsson
|
872e3c4e83
|
splitting: string-lines docs say it returns strings, so do that.
|
2013-03-24 19:45:29 -07:00 |
John Benediktsson
|
c60d4a0066
|
sets: adding intersect!.
|
2013-03-24 16:48:45 -07:00 |
Doug Coleman
|
31e1fe54e3
|
core/extra tests: Fix word -> last-word
|
2013-03-24 01:11:54 -07:00 |
Doug Coleman
|
f66c9cc206
|
classes.union/maybe: Check the members of the maybe{} in a different way.
|
2013-03-24 01:10:54 -07:00 |
John Benediktsson
|
244fca37a9
|
compiler.units: use ?adjoin.
|
2013-03-23 22:13:14 -07:00 |
John Benediktsson
|
da84d1ce21
|
vocabs.loader: use adjoin-all.
|
2013-03-23 22:07:08 -07:00 |
Doug Coleman
|
1d8f1343e0
|
sorting: Rename merge tuple to merge-state.
|
2013-03-23 21:56:56 -07:00 |
Doug Coleman
|
f028aff605
|
source-files.errors: Oops fix double define.
|
2013-03-23 21:54:44 -07:00 |