]> gitweb.factorcode.org Git - factor.git/log
factor.git
11 years agocompiler.units: changing definitions-changed to use a set.
John Benediktsson [Sun, 10 Mar 2013 16:11:18 +0000 (09:11 -0700)]
compiler.units: changing definitions-changed to use a set.

11 years agosets: adding adjoin-all.
John Benediktsson [Sun, 10 Mar 2013 16:11:05 +0000 (09:11 -0700)]
sets: adding adjoin-all.

11 years agographs: moving to basis.
John Benediktsson [Sat, 9 Mar 2013 16:31:06 +0000 (08:31 -0800)]
graphs: moving to basis.

11 years agoclasses: finish converting update-map to use hash-sets.
John Benediktsson [Sat, 9 Mar 2013 07:23:39 +0000 (23:23 -0800)]
classes: finish converting update-map to use hash-sets.

11 years agoclasses: change class-usage to return a sequence like it's documented to do.
John Benediktsson [Sat, 9 Mar 2013 07:06:16 +0000 (23:06 -0800)]
classes: change class-usage to return a sequence like it's documented to do.

11 years agoclasses: use faster closure in class-usages.
John Benediktsson [Sat, 9 Mar 2013 07:04:31 +0000 (23:04 -0800)]
classes: use faster closure in class-usages.

11 years agosets: implement M\ f delete.
John Benediktsson [Sat, 9 Mar 2013 06:26:56 +0000 (22:26 -0800)]
sets: implement M\ f delete.

11 years agotools.crossref: fix help-lint.
John Benediktsson [Sat, 9 Mar 2013 06:24:21 +0000 (22:24 -0800)]
tools.crossref: fix help-lint.

11 years agoRevert "graphs: change closure to use a set and operate on sequences."
John Benediktsson [Sat, 9 Mar 2013 02:08:09 +0000 (18:08 -0800)]
Revert "graphs: change closure to use a set and operate on sequences."

This reverts commit 2cc201a38ac6110f0b8c9c86f4cb34c1fde43c0f.

11 years agographs: change closure to use a set and operate on sequences.
John Benediktsson [Sat, 9 Mar 2013 01:53:31 +0000 (17:53 -0800)]
graphs: change closure to use a set and operate on sequences.

11 years agohash-sets: back out this change for now.
John Benediktsson [Sat, 9 Mar 2013 01:53:12 +0000 (17:53 -0800)]
hash-sets: back out this change for now.

11 years agoui.tools.listener.completion: fix use of search-vocab-names.
John Benediktsson [Sat, 9 Mar 2013 01:53:02 +0000 (17:53 -0800)]
ui.tools.listener.completion: fix use of search-vocab-names.

11 years agohash-sets: Support >alist on hash-sets or else tab-completion breaks. Can we write...
Doug Coleman [Sat, 9 Mar 2013 01:32:46 +0000 (17:32 -0800)]
hash-sets: Support >alist on hash-sets or else tab-completion breaks. Can we write a unit test for this too?

11 years agocombinators.extras: Add twice, thrice words.
Doug Coleman [Thu, 7 Mar 2013 22:11:01 +0000 (14:11 -0800)]
combinators.extras: Add twice, thrice words.

11 years agotools.completion: Add utility word for searching for a string in a sequence of strings.
Doug Coleman [Thu, 7 Mar 2013 22:09:23 +0000 (14:09 -0800)]
tools.completion: Add utility word for searching for a string in a sequence of strings.

11 years agoregexp.dfa: more use of hash-sets.
John Benediktsson [Sat, 9 Mar 2013 00:50:59 +0000 (16:50 -0800)]
regexp.dfa: more use of hash-sets.

11 years agoprettyprint.sections: more use of hash-sets.
John Benediktsson [Sat, 9 Mar 2013 00:32:09 +0000 (16:32 -0800)]
prettyprint.sections: more use of hash-sets.

11 years agodestructors: use hash-sets to keep track of disposables.
John Benediktsson [Sat, 9 Mar 2013 00:30:33 +0000 (16:30 -0800)]
destructors: use hash-sets to keep track of disposables.

11 years agotools.crossref: speed up build-crossref.
John Benediktsson [Sat, 9 Mar 2013 00:18:26 +0000 (16:18 -0800)]
tools.crossref: speed up build-crossref.

11 years agocompiler.tree.modular-arithmetic: more use of hash-sets.
John Benediktsson [Fri, 8 Mar 2013 23:58:16 +0000 (15:58 -0800)]
compiler.tree.modular-arithmetic: more use of hash-sets.

11 years agoparser: fix tests for hash-set change.
John Benediktsson [Fri, 8 Mar 2013 22:57:21 +0000 (14:57 -0800)]
parser: fix tests for hash-set change.

11 years agoclasses.tuple: require boa words to have tuple-class arguments.
John Benediktsson [Fri, 8 Mar 2013 22:56:07 +0000 (14:56 -0800)]
classes.tuple: require boa words to have tuple-class arguments.

11 years agotools.profiler.sampling: more use of hash-sets.
John Benediktsson [Fri, 8 Mar 2013 22:36:04 +0000 (14:36 -0800)]
tools.profiler.sampling: more use of hash-sets.

11 years agomisc/fuel: try and fix autodoc bug report.
John Benediktsson [Fri, 8 Mar 2013 22:34:43 +0000 (14:34 -0800)]
misc/fuel: try and fix autodoc bug report.

11 years agocompiler.cfg.loop-detection: more use of hash-sets.
John Benediktsson [Fri, 8 Mar 2013 20:38:50 +0000 (12:38 -0800)]
compiler.cfg.loop-detection: more use of hash-sets.

11 years agocompiler.tree.recursive: more use of hash-sets.
John Benediktsson [Fri, 8 Mar 2013 20:34:23 +0000 (12:34 -0800)]
compiler.tree.recursive: more use of hash-sets.

11 years agocompiler.cfg.write-barrier: more use of hash-sets.
John Benediktsson [Fri, 8 Mar 2013 20:30:37 +0000 (12:30 -0800)]
compiler.cfg.write-barrier: more use of hash-sets.

11 years agocompiler.cfg.ssa.construction: more use of hash-sets.
John Benediktsson [Fri, 8 Mar 2013 20:24:06 +0000 (12:24 -0800)]
compiler.cfg.ssa.construction: more use of hash-sets.

11 years agocompiler.tree.propagation.info: inline <value-info>.
John Benediktsson [Fri, 8 Mar 2013 20:19:24 +0000 (12:19 -0800)]
compiler.tree.propagation.info: inline <value-info>.

11 years agocompiler: fix stack effects to indicate visited is same object.
John Benediktsson [Fri, 8 Mar 2013 20:16:02 +0000 (12:16 -0800)]
compiler: fix stack effects to indicate visited is same object.

11 years agocompiler: use hash-sets to track visited sets.
John Benediktsson [Fri, 8 Mar 2013 19:04:47 +0000 (11:04 -0800)]
compiler: use hash-sets to track visited sets.

11 years agoclasses: store implementors in hash-sets.
John Benediktsson [Fri, 8 Mar 2013 18:29:50 +0000 (10:29 -0800)]
classes: store implementors in hash-sets.

11 years agovocabs.parser: use hash-sets in search-vocab-names.
John Benediktsson [Fri, 8 Mar 2013 18:09:41 +0000 (10:09 -0800)]
vocabs.parser: use hash-sets in search-vocab-names.

11 years agosets: adding diff!.
John Benediktsson [Fri, 8 Mar 2013 16:21:16 +0000 (08:21 -0800)]
sets: adding diff!.

11 years agosets: adding union! and intersection.
John Benediktsson [Fri, 8 Mar 2013 15:57:45 +0000 (07:57 -0800)]
sets: adding union! and intersection.

11 years agobenchmark.ant: fix hash-set constructor.
John Benediktsson [Fri, 8 Mar 2013 14:15:37 +0000 (06:15 -0800)]
benchmark.ant: fix hash-set constructor.

11 years agohash-sets: fix help-lint warnings.
John Benediktsson [Fri, 8 Mar 2013 14:15:27 +0000 (06:15 -0800)]
hash-sets: fix help-lint warnings.

11 years agobootstrap: make sure to rehash hash-sets also.
John Benediktsson [Fri, 8 Mar 2013 06:04:52 +0000 (22:04 -0800)]
bootstrap: make sure to rehash hash-sets also.

11 years agohash-sets: reuse (rehash).
John Benediktsson [Fri, 8 Mar 2013 06:02:02 +0000 (22:02 -0800)]
hash-sets: reuse (rehash).

11 years agohashtables: reuse (rehash).
John Benediktsson [Fri, 8 Mar 2013 06:01:50 +0000 (22:01 -0800)]
hashtables: reuse (rehash).

11 years agohash-sets: faster implementation based on hashtables.
John Benediktsson [Fri, 8 Mar 2013 05:43:17 +0000 (21:43 -0800)]
hash-sets: faster implementation based on hashtables.

11 years agocompiler.cfg.alias-analysis: use clear-set.
John Benediktsson [Fri, 8 Mar 2013 05:35:00 +0000 (21:35 -0800)]
compiler.cfg.alias-analysis: use clear-set.

11 years agohashtables: slightly faster grow logic.
John Benediktsson [Fri, 8 Mar 2013 04:51:46 +0000 (20:51 -0800)]
hashtables: slightly faster grow logic.

11 years agosets: adding clear-set.
John Benediktsson [Fri, 8 Mar 2013 02:48:15 +0000 (18:48 -0800)]
sets: adding clear-set.

11 years agoUse -unsafe words with pair methods.
John Benediktsson [Thu, 7 Mar 2013 18:47:23 +0000 (10:47 -0800)]
Use -unsafe words with pair methods.

11 years agointerval-maps: bit of unsafe.
John Benediktsson [Thu, 7 Mar 2013 18:46:41 +0000 (10:46 -0800)]
interval-maps: bit of unsafe.

11 years agolinked-assocs: some performance improvements.
John Benediktsson [Thu, 7 Mar 2013 18:05:28 +0000 (10:05 -0800)]
linked-assocs: some performance improvements.

11 years agobenchmark.linked-assocs: adding a linked-assocs benchmark.
John Benediktsson [Thu, 7 Mar 2013 17:58:16 +0000 (09:58 -0800)]
benchmark.linked-assocs: adding a linked-assocs benchmark.

11 years agocore-foundation.run-loop: CFTimeInterval is a double.
John Benediktsson [Thu, 7 Mar 2013 04:31:42 +0000 (20:31 -0800)]
core-foundation.run-loop: CFTimeInterval is a double.

11 years agocore-foundation.file-descriptors: inline enable-all-callbacks.
John Benediktsson [Thu, 7 Mar 2013 03:59:52 +0000 (19:59 -0800)]
core-foundation.file-descriptors: inline enable-all-callbacks.

11 years agotools.completion: small performance improvements.
John Benediktsson [Thu, 7 Mar 2013 03:58:53 +0000 (19:58 -0800)]
tools.completion: small performance improvements.

11 years agoheaps: performance improvements.
John Benediktsson [Thu, 7 Mar 2013 03:41:37 +0000 (19:41 -0800)]
heaps: performance improvements.

11 years agotrees.splay: use typed.
John Benediktsson [Thu, 7 Mar 2013 02:42:06 +0000 (18:42 -0800)]
trees.splay: use typed.

11 years agoio.directories: fix docs for (directory-entries).
John Benediktsson [Thu, 7 Mar 2013 01:35:53 +0000 (17:35 -0800)]
io.directories: fix docs for (directory-entries).

11 years agosequences.extras: adding sift! and harvest!.
John Benediktsson [Thu, 7 Mar 2013 00:39:04 +0000 (16:39 -0800)]
sequences.extras: adding sift! and harvest!.

11 years agosequences: add a copy-unsafe that can be used sometimes.
John Benediktsson [Wed, 6 Mar 2013 22:06:33 +0000 (14:06 -0800)]
sequences: add a copy-unsafe that can be used sometimes.

11 years agocontinuations: speed up init-catchstack.
John Benediktsson [Wed, 6 Mar 2013 18:08:48 +0000 (10:08 -0800)]
continuations: speed up init-catchstack.

11 years agosets.extras: Initial checkin. Add setwise-xor word like setxor1d in numpy.
Doug Coleman [Wed, 6 Mar 2013 17:59:37 +0000 (09:59 -0800)]
sets.extras: Initial checkin. Add setwise-xor word like setxor1d in numpy.

11 years agouui: remove trailing spaces.
John Benediktsson [Wed, 6 Mar 2013 17:20:59 +0000 (09:20 -0800)]
uui: remove trailing spaces.

11 years agocache: faster purge-cache.
John Benediktsson [Wed, 6 Mar 2013 17:17:35 +0000 (09:17 -0800)]
cache: faster purge-cache.

11 years agodestructors: adding dispose,.
John Benediktsson [Wed, 6 Mar 2013 17:16:43 +0000 (09:16 -0800)]
destructors: adding dispose,.

11 years agogrouping: making monotonic? faster.
John Benediktsson [Wed, 6 Mar 2013 15:31:45 +0000 (07:31 -0800)]
grouping: making monotonic? faster.

11 years agovocabs: only notify vocab-observers if we are creating a new vocab.
John Benediktsson [Wed, 6 Mar 2013 05:13:45 +0000 (21:13 -0800)]
vocabs: only notify vocab-observers if we are creating a new vocab.

11 years agoassocs: cleanup and use first2-unsafe in assoc-find.
John Benediktsson [Wed, 6 Mar 2013 04:42:15 +0000 (20:42 -0800)]
assocs: cleanup and use first2-unsafe in assoc-find.

11 years agogrouping: faster all-eq? and all-equal? (fewer comparisons).
John Benediktsson [Wed, 6 Mar 2013 04:01:27 +0000 (20:01 -0800)]
grouping: faster all-eq? and all-equal? (fewer comparisons).

11 years agovocabs.cache: root-cache get instead of get-global.
John Benediktsson [Wed, 6 Mar 2013 02:57:32 +0000 (18:57 -0800)]
vocabs.cache: root-cache get instead of get-global.

11 years agoextra: use [-] instead of "- 0 max".
John Benediktsson [Wed, 6 Mar 2013 02:17:17 +0000 (18:17 -0800)]
extra: use [-] instead of "- 0 max".

11 years agobenchmark.randomize: adding a randomize benchmark.
John Benediktsson [Wed, 6 Mar 2013 01:04:57 +0000 (17:04 -0800)]
benchmark.randomize: adding a randomize benchmark.

11 years agocore: some more cleanup of USING lists.
John Benediktsson [Tue, 5 Mar 2013 18:48:14 +0000 (10:48 -0800)]
core: some more cleanup of USING lists.

11 years agocore: cleanup USING lists.
John Benediktsson [Tue, 5 Mar 2013 18:34:47 +0000 (10:34 -0800)]
core: cleanup USING lists.

11 years agocompiler.tree.propagation.transforms: use integer>fixnum-strict in shift.
John Benediktsson [Tue, 5 Mar 2013 16:19:31 +0000 (08:19 -0800)]
compiler.tree.propagation.transforms: use integer>fixnum-strict in shift.

11 years agosequences: Rename slice-error the word to check-slice-error, make slice-error the...
Doug Coleman [Tue, 5 Mar 2013 00:57:49 +0000 (16:57 -0800)]
sequences: Rename slice-error the word to check-slice-error, make slice-error the TUPLE: an ERROR:

11 years agohints: remove these hints for now...
John Benediktsson [Tue, 5 Mar 2013 03:03:10 +0000 (19:03 -0800)]
hints: remove these hints for now...

11 years agocombinators: moving M\ iota hashcode* back since each-integer has hints.
John Benediktsson [Tue, 5 Mar 2013 01:46:46 +0000 (17:46 -0800)]
combinators: moving M\ iota hashcode* back since each-integer has hints.

11 years agohints: prevent specialization on inline-recursive words.
John Benediktsson [Tue, 5 Mar 2013 01:34:20 +0000 (17:34 -0800)]
hints: prevent specialization on inline-recursive words.

11 years agomath: speed up (find-integer) and (all-integers?) by removing curry.
John Benediktsson [Tue, 5 Mar 2013 01:32:11 +0000 (17:32 -0800)]
math: speed up (find-integer) and (all-integers?) by removing curry.

11 years agowords: adding inline-recursive?.
John Benediktsson [Tue, 5 Mar 2013 00:09:56 +0000 (16:09 -0800)]
words: adding inline-recursive?.

11 years agolayouts: speed up ``M\ iota hashcode*`` using most-positive-fixnum.
John Benediktsson [Mon, 4 Mar 2013 01:33:35 +0000 (17:33 -0800)]
layouts: speed up ``M\ iota hashcode*`` using most-positive-fixnum.

11 years agorandom: format delete-random better.
John Benediktsson [Mon, 4 Mar 2013 01:32:53 +0000 (17:32 -0800)]
random: format delete-random better.

11 years agocombinators: faster hashcode for iota.
John Benediktsson [Fri, 1 Mar 2013 18:42:20 +0000 (10:42 -0800)]
combinators: faster hashcode for iota.

11 years agorandom: speed up some random floats using (random-unit).
John Benediktsson [Fri, 1 Mar 2013 17:33:20 +0000 (09:33 -0800)]
random: speed up some random floats using (random-unit).

11 years agorandom: adding (random-unit) for convenience.
John Benediktsson [Fri, 1 Mar 2013 17:27:20 +0000 (09:27 -0800)]
random: adding (random-unit) for convenience.

11 years agotools.profiler.sampling: fix top-down*.
John Benediktsson [Fri, 1 Mar 2013 17:20:48 +0000 (09:20 -0800)]
tools.profiler.sampling: fix top-down*.

11 years agobootstrap: remove old counting profiler vocab.
John Benediktsson [Fri, 1 Mar 2013 17:18:49 +0000 (09:18 -0800)]
bootstrap: remove old counting profiler vocab.

11 years agorandom: speedup random-integer some more.
John Benediktsson [Fri, 1 Mar 2013 03:47:55 +0000 (19:47 -0800)]
random: speedup random-integer some more.

Better code generation by specializing on fixnum/bignum.

11 years agomath.integers: the fixnum-log2 intrinsic didn't work due to inlining.
John Benediktsson [Thu, 28 Feb 2013 01:08:36 +0000 (17:08 -0800)]
math.integers: the fixnum-log2 intrinsic didn't work due to inlining.

11 years agomath.integers: faster fixnum-log2.
John Benediktsson [Thu, 28 Feb 2013 00:01:34 +0000 (16:01 -0800)]
math.integers: faster fixnum-log2.

11 years agorandom: minor speedup (random-bits).
John Benediktsson [Wed, 27 Feb 2013 23:26:56 +0000 (15:26 -0800)]
random: minor speedup (random-bits).

11 years agorandom: speedup randomize.
John Benediktsson [Wed, 27 Feb 2013 22:51:29 +0000 (14:51 -0800)]
random: speedup randomize.

11 years agorandom: speed up uniform-random-float.
John Benediktsson [Wed, 27 Feb 2013 22:40:56 +0000 (14:40 -0800)]
random: speed up uniform-random-float.

11 years agorandom: performance improvements to random-integer and random-bits.
John Benediktsson [Wed, 27 Feb 2013 22:05:46 +0000 (14:05 -0800)]
random: performance improvements to random-integer and random-bits.

11 years agorandom.c: adding a "libc" version of random for performance testing.
John Benediktsson [Wed, 27 Feb 2013 04:03:29 +0000 (20:03 -0800)]
random.c: adding a "libc" version of random for performance testing.

11 years agounix.linux.proc: Older kernels don't have enough fields in /proc/pid/stat. Pad it.
Doug Coleman [Mon, 25 Feb 2013 18:07:05 +0000 (10:07 -0800)]
unix.linux.proc: Older kernels don't have enough fields in /proc/pid/stat. Pad it.

11 years agounix.linux.proc: Add some more /proc parsing.
Doug Coleman [Mon, 25 Feb 2013 02:29:57 +0000 (18:29 -0800)]
unix.linux.proc: Add some more /proc parsing.

11 years agocalendar.format: Add some utility words for implementing top.
Doug Coleman [Mon, 25 Feb 2013 02:29:00 +0000 (18:29 -0800)]
calendar.format: Add some utility words for implementing top.

11 years agotools.ps: Use unix.linux.proc for parsing.
Doug Coleman [Sat, 23 Feb 2013 20:45:45 +0000 (12:45 -0800)]
tools.ps: Use unix.linux.proc for parsing.

11 years agounix.linux.proc: Refactor /proc parsing. Add generic to make pid/string and pid-strin...
Doug Coleman [Sat, 23 Feb 2013 20:44:49 +0000 (12:44 -0800)]
unix.linux.proc: Refactor /proc parsing. Add generic to make pid/string and pid-string/string pairs into /proc/pid/pathname.

11 years agoRevert "robots.txt: Bing bot spams gitweb...disable it hopefully."
Doug Coleman [Sun, 24 Feb 2013 18:30:05 +0000 (10:30 -0800)]
Revert "robots.txt: Bing bot spams gitweb...disable it hopefully."
Found another way.

This reverts commit 7500504bc055573bc50ae5b9349a3a92a4bc237d.

11 years agorobots.txt: Bing bot spams gitweb...disable it hopefully.
Doug Coleman [Sun, 24 Feb 2013 18:23:05 +0000 (10:23 -0800)]
robots.txt: Bing bot spams gitweb...disable it hopefully.

11 years agorot13: adding some tests.
John Benediktsson [Fri, 22 Feb 2013 17:50:26 +0000 (09:50 -0800)]
rot13: adding some tests.