John Benediktsson
02156a0c0c
Revert "hash-sets: faster M\ hash-set union."
...
This reverts commit bb7a1017f5
.
2013-03-22 22:05:06 -07:00
John Benediktsson
83408fedcd
hash-sets: faster M\ hash-set union.
2013-03-22 21:52:56 -07:00
John Benediktsson
bbe5f32d5f
sequences: require non-negative-integer for iotas.
2013-03-22 16:05:00 -07:00
Doug Coleman
5bcdeee745
classes: Add a check that arguments to classoids are themselves classoids.
...
Introduce a new word-prop that makes tuple-class words classoids at parse-time so that
self-referential tuple definitions with maybe{} work, e.g. TUPLE: node { next maybe{ node } } ;
Add unit test.
Fixes #766 .
2013-03-22 16:00:46 -07:00
John Benediktsson
d802db939a
sequences: use each-integer and all-integers? instead of iota.
2013-03-22 14:23:08 -07:00
John Benediktsson
f7c35489e9
compiler.units: fix documentation for pair of hash-sets.
2013-03-21 21:26:54 -07:00
John Benediktsson
317db2826e
sets: add proper spacing to docs.
2013-03-21 21:23:17 -07:00
John Benediktsson
a2c241baea
io.binary: faster >be.
2013-03-21 17:39:34 -07:00
Doug Coleman
9f3152c409
sequences: Keep all arguments for immutable error.
2013-03-21 02:46:39 -07:00
John Benediktsson
11e86ec53c
hashtables: faster grow-hash by not calling >alist.
2013-03-20 23:02:40 -07:00
John Benediktsson
8890bdc19a
hash-sets: faster grow-hash by not calling members.
2013-03-20 23:02:28 -07:00
Doug Coleman
5bf5cb3446
math.floats: Fix the output of /mod and add some unit tests. Fixes #803 .
2013-03-20 17:43:56 -07:00
John Benediktsson
c1cfb50728
sorting: speed up sort-keys and sort-values by doing less bounds checking.
2013-03-20 17:06:51 -07:00
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