John Benediktsson
|
9620438ab7
|
math: implement /mod on floats.
|
2013-03-20 13:13:14 -07:00 |
|
John Benediktsson
|
67a2b9dc9a
|
io.encodings: speed up ascii and utf8 stream-read-until.
|
2013-03-18 13:35:22 -07:00 |
|
John Benediktsson
|
ee1eb8bf09
|
io.encodings: this appears to be faster and produce smaller code.
|
2013-03-15 12:15:52 -07:00 |
|
John Benediktsson
|
86b2dea8d5
|
io.encodings: remove duplication in decoder-readln.
|
2013-03-15 10:50:40 -07:00 |
|
John Benediktsson
|
7bf1173bc3
|
io: adding stream-bl.
|
2013-03-14 19:23:10 -07:00 |
|
John Benediktsson
|
d18317f257
|
sequences: inline last-unsafe.
|
2013-03-14 18:41:44 -07:00 |
|
John Benediktsson
|
ca6b18d945
|
words: add safety checks for word? type.
|
2013-03-11 21:21:44 -07:00 |
|
John Benediktsson
|
734a987e24
|
hash-sets: use ?adjoin instead of (all-unique?).
|
2013-03-11 21:21:44 -07:00 |
Doug Coleman
|
247f57b828
|
sequences: More efficient longest and shortest by moving infimum-by/supremum-by into core.
|
2013-03-11 18:35:53 -07:00 |
|
Doug Coleman
|
875e45a640
|
sequences: Add some short useful factors. Clean up the use of longest.
|
2013-03-11 17:47:52 -07:00 |
|
John Benediktsson
|
c677e34880
|
parser: fix docs for filter-moved.
|
2013-03-10 20:40:40 -07:00 |
|
John Benediktsson
|
b2ffa02fff
|
Fix some tests broken by recent definitions change.
|
2013-03-10 20:22:18 -07:00 |
|
John Benediktsson
|
bc18b2cd29
|
compiler.units: more use of hash-sets.
|
2013-03-10 18:04:37 -07:00 |
|
John Benediktsson
|
7c39f8134b
|
hash-sets: use push-unsafe from hashtables.private.
|
2013-03-10 17:08:41 -07:00 |
|
John Benediktsson
|
7f3f90eb8d
|
compiler: more use of hash-sets.
|
2013-03-10 16:13:31 -07:00 |
|
Doug Coleman
|
5a9e7cd374
|
classes.builtin: Add the BUILTIN: keyword which lets builtin classes show up in source files. Probably could use save-location to allow editing, but it seemed to break things.
|
2013-03-10 12:05:38 -07:00 |
|
John Benediktsson
|
b4ac67dd25
|
compiler.units: simplify checks.
|
2013-03-10 09:36:35 -07:00 |
|
John Benediktsson
|
a595e3c54c
|
compiler.units: simpler update-existing? check.
|
2013-03-10 09:19:22 -07:00 |
|
John Benediktsson
|
c0c769a7d8
|
compiler.units: changing definitions-changed to use a set.
|
2013-03-10 09:11:18 -07:00 |
|
John Benediktsson
|
b159995bb4
|
sets: adding adjoin-all.
|
2013-03-10 09:11:05 -07:00 |
|
John Benediktsson
|
50db0745d6
|
graphs: moving to basis.
|
2013-03-09 08:31:06 -08:00 |
|
John Benediktsson
|
af29a16aeb
|
classes: finish converting update-map to use hash-sets.
|
2013-03-08 23:23:39 -08:00 |
|
John Benediktsson
|
f84df9d190
|
classes: change class-usage to return a sequence like it's documented to do.
|
2013-03-08 23:06:16 -08:00 |
|
John Benediktsson
|
bca13622f5
|
classes: use faster closure in class-usages.
|
2013-03-08 23:04:31 -08:00 |
|
John Benediktsson
|
231cb79282
|
sets: implement M\ f delete.
|
2013-03-08 22:26:56 -08:00 |
|
John Benediktsson
|
4da798920e
|
Revert "graphs: change closure to use a set and operate on sequences."
This reverts commit 2cc201a38a.
|
2013-03-08 18:08:09 -08:00 |
|
John Benediktsson
|
67e3cfae22
|
graphs: change closure to use a set and operate on sequences.
|
2013-03-08 17:53:31 -08:00 |
|
John Benediktsson
|
30bdecd876
|
hash-sets: back out this change for now.
|
2013-03-08 17:53:12 -08:00 |
|
Doug Coleman
|
dc395a6b31
|
hash-sets: Support >alist on hash-sets or else tab-completion breaks. Can we write a unit test for this too?
|
2013-03-08 17:32:46 -08:00 |
|
John Benediktsson
|
26506a4b0b
|
destructors: use hash-sets to keep track of disposables.
|
2013-03-08 16:30:33 -08:00 |
|
John Benediktsson
|
07fc23697b
|
parser: fix tests for hash-set change.
|
2013-03-08 14:57:21 -08:00 |
|
John Benediktsson
|
ac67935ef0
|
classes.tuple: require boa words to have tuple-class arguments.
|
2013-03-08 14:56:07 -08:00 |
|
John Benediktsson
|
f06bfef276
|
classes: store implementors in hash-sets.
|
2013-03-08 10:29:50 -08:00 |
|
John Benediktsson
|
f2d0752403
|
vocabs.parser: use hash-sets in search-vocab-names.
|
2013-03-08 10:09:41 -08:00 |
|
John Benediktsson
|
66165f3660
|
sets: adding diff!.
|
2013-03-08 08:21:16 -08:00 |
|
John Benediktsson
|
ffd03ec922
|
sets: adding union! and intersection.
|
2013-03-08 07:57:45 -08:00 |
|
John Benediktsson
|
931b5cc9bd
|
hash-sets: fix help-lint warnings.
|
2013-03-08 06:15:27 -08:00 |
|
John Benediktsson
|
895c6ca7c5
|
bootstrap: make sure to rehash hash-sets also.
|
2013-03-07 22:04:52 -08:00 |
|
John Benediktsson
|
23078f7bd7
|
hash-sets: reuse (rehash).
|
2013-03-07 22:02:02 -08:00 |
|
John Benediktsson
|
eca5253017
|
hashtables: reuse (rehash).
|
2013-03-07 22:01:50 -08:00 |
|
John Benediktsson
|
04af5f2ffb
|
hash-sets: faster implementation based on hashtables.
|
2013-03-07 21:43:17 -08:00 |
|
John Benediktsson
|
f2eedb67ec
|
hashtables: slightly faster grow logic.
|
2013-03-07 20:51:46 -08:00 |
|
John Benediktsson
|
f46bf3ac5d
|
sets: adding clear-set.
|
2013-03-07 18:48:15 -08:00 |
|
John Benediktsson
|
b571a42679
|
Use -unsafe words with pair methods.
|
2013-03-07 10:47:23 -08:00 |
|
John Benediktsson
|
7e2ff8864f
|
sequences: add a copy-unsafe that can be used sometimes.
|
2013-03-06 14:06:33 -08:00 |
|
John Benediktsson
|
a34c113020
|
continuations: speed up init-catchstack.
|
2013-03-06 10:09:14 -08:00 |
|
John Benediktsson
|
87d65d66d6
|
destructors: adding dispose,.
|
2013-03-06 09:16:43 -08:00 |
|
John Benediktsson
|
019080d82d
|
vocabs: only notify vocab-observers if we are creating a new vocab.
|
2013-03-05 21:13:45 -08:00 |
|
John Benediktsson
|
8f9bd87693
|
assocs: cleanup and use first2-unsafe in assoc-find.
|
2013-03-05 20:42:15 -08:00 |
|
John Benediktsson
|
12216b1246
|
core: some more cleanup of USING lists.
|
2013-03-05 10:48:14 -08:00 |