John Benediktsson
|
76b9220bfa
|
compiler.tree.tuple-unboxing: simpler checks.
|
2013-03-10 09:36:52 -07:00 |
|
John Benediktsson
|
5fabc0c4d7
|
compiler.units: simplify checks.
|
2013-03-10 09:36:35 -07:00 |
|
John Benediktsson
|
eb32ac0a48
|
compiler.units: simpler update-existing? check.
|
2013-03-10 09:19:22 -07:00 |
|
John Benediktsson
|
3be783eb67
|
compiler.units: changing definitions-changed to use a set.
|
2013-03-10 09:11:18 -07:00 |
|
John Benediktsson
|
06dd0d0471
|
sets: adding adjoin-all.
|
2013-03-10 09:11:05 -07:00 |
|
John Benediktsson
|
3ffacf75d2
|
graphs: moving to basis.
|
2013-03-09 08:31:06 -08:00 |
|
John Benediktsson
|
eb273a59cf
|
classes: finish converting update-map to use hash-sets.
|
2013-03-08 23:23:39 -08:00 |
|
John Benediktsson
|
f076fef4a3
|
classes: change class-usage to return a sequence like it's documented to do.
|
2013-03-08 23:06:16 -08:00 |
|
John Benediktsson
|
03e6f48943
|
classes: use faster closure in class-usages.
|
2013-03-08 23:04:31 -08:00 |
|
John Benediktsson
|
fea449d7ea
|
sets: implement M\ f delete.
|
2013-03-08 22:26:56 -08:00 |
|
John Benediktsson
|
e343fc7b01
|
tools.crossref: fix help-lint.
|
2013-03-08 22:24:21 -08:00 |
|
John Benediktsson
|
c1c5b63456
|
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
|
2cc201a38a
|
graphs: change closure to use a set and operate on sequences.
|
2013-03-08 17:53:31 -08:00 |
|
John Benediktsson
|
1384893a0e
|
hash-sets: back out this change for now.
|
2013-03-08 17:53:12 -08:00 |
|
John Benediktsson
|
2be6d81feb
|
ui.tools.listener.completion: fix use of search-vocab-names.
|
2013-03-08 17:53:02 -08:00 |
Doug Coleman
|
1c218d725c
|
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
|
8bfe34418d
|
combinators.extras: Add twice, thrice words.
|
2013-03-08 16:50:10 -08:00 |
|
Doug Coleman
|
6b26a91973
|
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
|
3db1e292a3
|
regexp.dfa: more use of hash-sets.
|
2013-03-08 16:50:59 -08:00 |
|
John Benediktsson
|
6ef0e711c8
|
prettyprint.sections: more use of hash-sets.
|
2013-03-08 16:32:09 -08:00 |
|
John Benediktsson
|
9a0ccea599
|
destructors: use hash-sets to keep track of disposables.
|
2013-03-08 16:30:33 -08:00 |
|
John Benediktsson
|
a68a68a2c9
|
tools.crossref: speed up build-crossref.
|
2013-03-08 16:18:26 -08:00 |
|
John Benediktsson
|
17c1cae124
|
compiler.tree.modular-arithmetic: more use of hash-sets.
|
2013-03-08 15:58:16 -08:00 |
|
John Benediktsson
|
5d146aa648
|
parser: fix tests for hash-set change.
|
2013-03-08 14:57:21 -08:00 |
|
John Benediktsson
|
ed0de7b246
|
classes.tuple: require boa words to have tuple-class arguments.
|
2013-03-08 14:56:07 -08:00 |
|
John Benediktsson
|
3f7b2d3ec3
|
tools.profiler.sampling: more use of hash-sets.
|
2013-03-08 14:36:04 -08:00 |
|
John Benediktsson
|
1ff6640ed7
|
misc/fuel: try and fix autodoc bug report.
|
2013-03-08 14:34:43 -08:00 |
|
John Benediktsson
|
40b4b3ad89
|
compiler.cfg.loop-detection: more use of hash-sets.
|
2013-03-08 12:38:50 -08:00 |
|
John Benediktsson
|
9af579aa69
|
compiler.tree.recursive: more use of hash-sets.
|
2013-03-08 12:34:23 -08:00 |
|
John Benediktsson
|
f8b8ab370e
|
compiler.cfg.write-barrier: more use of hash-sets.
|
2013-03-08 12:30:37 -08:00 |
|
John Benediktsson
|
6e167aeb19
|
compiler.cfg.ssa.construction: more use of hash-sets.
|
2013-03-08 12:24:06 -08:00 |
|
John Benediktsson
|
31916d9f39
|
compiler.tree.propagation.info: inline <value-info>.
|
2013-03-08 12:19:24 -08:00 |
|
John Benediktsson
|
ebe0586772
|
compiler: fix stack effects to indicate visited is same object.
|
2013-03-08 12:16:02 -08:00 |
|
John Benediktsson
|
bb673c72d0
|
compiler: use hash-sets to track visited sets.
|
2013-03-08 11:04:47 -08:00 |
|
John Benediktsson
|
26131a5c3e
|
classes: store implementors in hash-sets.
|
2013-03-08 10:29:50 -08:00 |
|
John Benediktsson
|
45f2b4b62a
|
vocabs.parser: use hash-sets in search-vocab-names.
|
2013-03-08 10:09:41 -08:00 |
|
John Benediktsson
|
b104e94267
|
sets: adding diff!.
|
2013-03-08 08:21:16 -08:00 |
|
John Benediktsson
|
dc3aa2a4e4
|
sets: adding union! and intersection.
|
2013-03-08 07:57:45 -08:00 |
|
John Benediktsson
|
c4fd975d64
|
benchmark.ant: fix hash-set constructor.
|
2013-03-08 06:15:37 -08:00 |
|
John Benediktsson
|
bf4e997c3a
|
hash-sets: fix help-lint warnings.
|
2013-03-08 06:15:27 -08:00 |
|
John Benediktsson
|
25e42f5fb6
|
bootstrap: make sure to rehash hash-sets also.
|
2013-03-07 22:04:52 -08:00 |
|
John Benediktsson
|
db4e6592a2
|
hash-sets: reuse (rehash).
|
2013-03-07 22:02:02 -08:00 |
|
John Benediktsson
|
a4b4f4b458
|
hashtables: reuse (rehash).
|
2013-03-07 22:01:50 -08:00 |
|
John Benediktsson
|
ede0232ddc
|
hash-sets: faster implementation based on hashtables.
|
2013-03-07 21:43:17 -08:00 |
|
John Benediktsson
|
dc89883dc3
|
compiler.cfg.alias-analysis: use clear-set.
|
2013-03-07 21:35:00 -08:00 |
|
John Benediktsson
|
cce5f95cdf
|
hashtables: slightly faster grow logic.
|
2013-03-07 20:51:46 -08:00 |
|
John Benediktsson
|
8ef3f34cde
|
sets: adding clear-set.
|
2013-03-07 18:48:15 -08:00 |
|
John Benediktsson
|
a318742202
|
Use -unsafe words with pair methods.
|
2013-03-07 10:47:23 -08:00 |
|
John Benediktsson
|
bd115175b6
|
interval-maps: bit of unsafe.
|
2013-03-07 10:46:41 -08:00 |
|
John Benediktsson
|
5004c49ca2
|
linked-assocs: some performance improvements.
|
2013-03-07 10:05:28 -08:00 |