]> gitweb.factorcode.org Git - factor.git/commit
projects / factor.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: d71bd83) | patch
hash-sets,hashtables: improved key@ word
authorBjörn Lindqvist <bjourne@gmail.com>
Sun, 25 Sep 2016 18:07:08 +0000 (20:07 +0200)
committerBjörn Lindqvist <bjourne@gmail.com>
Sun, 25 Sep 2016 18:07:08 +0000 (20:07 +0200)
commit70c7f9e02910746918cc16bf588ef543fda80790
tree2d6651d3e08b5cd3aedb9f2a83170e5e2109aa87tree | snapshot
parentd71bd83f5726b2cae03e0c1933adde51a6aa260acommit | diff
hash-sets,hashtables: improved key@ word

Don't need to check the length of the backing array because it can be
assumed to be > 0. That should make hash lookups a little faster.
core/hash-sets/hash-sets-tests.factor diff | blob | history
core/hash-sets/hash-sets.factor diff | blob | history
core/hashtables/hashtables.factor diff | blob | history
Factor programming language