-
Website
http://phildawes.net/blog/ -
Original page
http://www.phildawes.net/blog/2008/01/15/tidying-up-factor-code/ -
Subscribe
All Comments -
Community
-
Top Commenters
-
danja
4 comments · 4 points
-
phildawes
5 comments · 1 points
-
Dominic Sayers
1 comment · 1 points
-
David W.
2 comments · 1 points
-
ryantm
1 comment · 1 points
-
-
Popular Threads
-
Phil Dawes Stuff >> Idea for a global interpreter lock optimized for low contention
2 weeks ago · 3 comments
-
Phil Dawes Stuff >> Idea for a global interpreter lock optimized for low contention
To get all words used by a word, recursively, use
[ word-def quot-uses ] closure
Also words list>hashtable is just vocab-words
And list>hashtable can be written as
: list>hashtable [ "" ] H{ } map>assoc ;
Assuming you want "" as the values, but usually we use equal keys/values when representing a set as a hashtable:
: list>hashtable [ dup ] H{ } map>assoc ;