John Benediktsson
|
4f0c404d87
|
tools.scaffold: more use of hash-sets.
|
2013-03-10 10:02:53 -07:00 |
|
John Benediktsson
|
229e85459e
|
compiler.tree.tuple-unboxing: simpler checks.
|
2013-03-10 09:36:52 -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
|
80ac71ad86
|
tools.crossref: fix help-lint.
|
2013-03-08 22:24:21 -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 |
|
John Benediktsson
|
5f165095dc
|
ui.tools.listener.completion: fix use of search-vocab-names.
|
2013-03-08 17:53:02 -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 |
|
Doug Coleman
|
85a3966a9d
|
combinators.extras: Add twice, thrice words.
|
2013-03-08 16:50:10 -08:00 |
|
Doug Coleman
|
f9c96628c0
|
tools.completion: Add utility word for searching for a string in a sequence of strings.
|
2013-03-08 16:50:10 -08:00 |
|
John Benediktsson
|
e9aeef7a5e
|
regexp.dfa: more use of hash-sets.
|
2013-03-08 16:50:59 -08:00 |
|
John Benediktsson
|
e9d8ff1c0d
|
prettyprint.sections: more use of hash-sets.
|
2013-03-08 16:32:09 -08:00 |
|
John Benediktsson
|
26506a4b0b
|
destructors: use hash-sets to keep track of disposables.
|
2013-03-08 16:30:33 -08:00 |
|
John Benediktsson
|
4b5833f252
|
tools.crossref: speed up build-crossref.
|
2013-03-08 16:18:26 -08:00 |
|
John Benediktsson
|
2025ffe292
|
compiler.tree.modular-arithmetic: more use of hash-sets.
|
2013-03-08 15:58:16 -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
|
17a71e8105
|
tools.profiler.sampling: more use of hash-sets.
|
2013-03-08 14:36:04 -08:00 |
|
John Benediktsson
|
2d68c470ea
|
misc/fuel: try and fix autodoc bug report.
|
2013-03-08 14:34:43 -08:00 |
|
John Benediktsson
|
262a46a3f4
|
compiler.cfg.loop-detection: more use of hash-sets.
|
2013-03-08 12:38:50 -08:00 |
|
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 |