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 |
|
John Benediktsson
|
5487480126
|
core: cleanup USING lists.
|
2013-03-05 10:34:47 -08:00 |
|
Doug Coleman
|
9af2924924
|
sequences: Rename slice-error the word to check-slice-error, make slice-error the TUPLE: an ERROR:
|
2013-03-05 06:57:40 -08:00 |
|
John Benediktsson
|
2c33fe56a4
|
combinators: moving M\ iota hashcode* back since each-integer has hints.
|
2013-03-04 17:46:46 -08:00 |
|
John Benediktsson
|
ff95c17972
|
math: speed up (find-integer) and (all-integers?) by removing curry.
|
2013-03-04 17:32:11 -08:00 |
|
John Benediktsson
|
7a3a801bde
|
words: adding inline-recursive?.
|
2013-03-04 16:09:56 -08:00 |
|
John Benediktsson
|
668d37fef7
|
layouts: speed up ``M\ iota hashcode*`` using most-positive-fixnum.
|
2013-03-03 17:33:35 -08:00 |
|
John Benediktsson
|
35c313c6b4
|
combinators: faster hashcode for iota.
|
2013-03-01 10:42:20 -08:00 |
|
John Benediktsson
|
24fe886946
|
bootstrap: remove old counting profiler vocab.
|
2013-03-01 09:18:49 -08:00 |
|
John Benediktsson
|
6d679cf3a2
|
math.integers: the fixnum-log2 intrinsic didn't work due to inlining.
|
2013-02-27 17:08:36 -08:00 |
|
John Benediktsson
|
7ba77673a8
|
math.integers: faster fixnum-log2.
|
2013-02-27 16:01:34 -08:00 |
|
John Benediktsson
|
07b2a9407e
|
assocs: change enum to immutable-sequence.
|
2013-02-22 06:58:29 -08:00 |
|
John Benediktsson
|
0d5a91345b
|
assocs: allow enums to support sequence protocol.
|
2013-02-21 18:24:50 -08:00 |
|
John Benediktsson
|
1524d43c9c
|
sequences: define a single "?set-nth" that is used.
|
2013-02-20 10:42:21 -08:00 |
|
Doug Coleman
|
10e74c6066
|
sequences: Add join-as, which takes an exemplar. Move split-subseq and replace from unicode.case to splitting and fix an infinite loop with split-subseq. Add docs/tests.
|
2013-01-03 16:44:25 -08:00 |
|
John Benediktsson
|
10bd89b439
|
io.files: fix testcase for renamed icon file.
|
2012-11-30 18:28:20 -08:00 |
|
John Benediktsson
|
e0aff8d02c
|
sbufs: no need to contract.
|
2012-10-24 20:16:34 -07:00 |
|
John Benediktsson
|
247600df71
|
hashtables: use "4drop" instead of "drop 3drop".
|
2012-10-23 12:26:14 -07:00 |