John Benediktsson
|
ff9af6423f
|
compiler.tree.recursive: more use of hash-sets.
|
2013-03-08 12:34:23 -08:00 |
|
John Benediktsson
|
9d43e21563
|
compiler.cfg.write-barrier: more use of hash-sets.
|
2013-03-08 12:30:37 -08:00 |
|
John Benediktsson
|
88626d38ca
|
compiler.cfg.ssa.construction: more use of hash-sets.
|
2013-03-08 12:24:06 -08:00 |
|
John Benediktsson
|
af1b167c28
|
compiler.tree.propagation.info: inline <value-info>.
|
2013-03-08 12:19:24 -08:00 |
|
John Benediktsson
|
b97a1a0753
|
compiler: fix stack effects to indicate visited is same object.
|
2013-03-08 12:16:02 -08:00 |
|
John Benediktsson
|
bf35114fec
|
compiler: use hash-sets to track visited sets.
|
2013-03-08 11:04:47 -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
|
b015af4f33
|
benchmark.ant: fix hash-set constructor.
|
2013-03-08 06:15:37 -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
|
5908186301
|
compiler.cfg.alias-analysis: use clear-set.
|
2013-03-07 21:35:00 -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
|
bddd66f5f3
|
interval-maps: bit of unsafe.
|
2013-03-07 10:46:41 -08:00 |
|
John Benediktsson
|
8c161df10e
|
linked-assocs: some performance improvements.
|
2013-03-07 10:05:28 -08:00 |
|
John Benediktsson
|
30cbce3f41
|
benchmark.linked-assocs: adding a linked-assocs benchmark.
|
2013-03-07 09:58:16 -08:00 |
|
John Benediktsson
|
c81bf00e46
|
core-foundation.run-loop: CFTimeInterval is a double.
|
2013-03-06 20:31:42 -08:00 |
|
John Benediktsson
|
be04b19745
|
core-foundation.file-descriptors: inline enable-all-callbacks.
|
2013-03-06 19:59:52 -08:00 |
|
John Benediktsson
|
248d4e6bee
|
tools.completion: small performance improvements.
|
2013-03-06 19:58:53 -08:00 |
|
John Benediktsson
|
95c1abe468
|
heaps: performance improvements.
|
2013-03-06 19:41:37 -08:00 |
|
John Benediktsson
|
e008810677
|
trees.splay: use typed.
|
2013-03-06 18:42:06 -08:00 |
|
John Benediktsson
|
85d0c607b0
|
io.directories: fix docs for (directory-entries).
|
2013-03-06 17:35:53 -08:00 |
|
John Benediktsson
|
0fe01622de
|
sequences.extras: adding sift! and harvest!.
|
2013-03-06 16:39:04 -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 |
Doug Coleman
|
cadde9117c
|
sets.extras: Initial checkin. Add setwise-xor word like setxor1d in numpy.
|
2013-03-06 10:00:13 -08:00 |
|
John Benediktsson
|
fe9448533f
|
uui: remove trailing spaces.
|
2013-03-06 09:20:59 -08:00 |
|
John Benediktsson
|
45f49775ec
|
cache: faster purge-cache.
|
2013-03-06 09:17:35 -08:00 |
|
John Benediktsson
|
87d65d66d6
|
destructors: adding dispose,.
|
2013-03-06 09:16:43 -08:00 |
|
John Benediktsson
|
a60b49630f
|
grouping: making monotonic? faster.
|
2013-03-06 07:31:45 -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
|
ca8c7b4db4
|
grouping: faster all-eq? and all-equal? (fewer comparisons).
|
2013-03-05 20:01:27 -08:00 |
|
John Benediktsson
|
c64a90b277
|
vocabs.cache: root-cache get instead of get-global.
|
2013-03-05 18:57:32 -08:00 |
|
John Benediktsson
|
cf4d639345
|
extra: use [-] instead of "- 0 max".
|
2013-03-05 18:17:17 -08:00 |
|
John Benediktsson
|
53992695e4
|
benchmark.randomize: adding a randomize benchmark.
|
2013-03-05 17:04:57 -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 |
|
John Benediktsson
|
5751f6d309
|
compiler.tree.propagation.transforms: use integer>fixnum-strict in shift.
|
2013-03-05 08:19:31 -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
|
843426c664
|
hints: remove these hints for now...
|
2013-03-04 19:03:10 -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
|
8043b7b4ba
|
hints: prevent specialization on inline-recursive words.
|
2013-03-04 17:34:20 -08:00 |