<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0"><channel><title>Phil Dawes' Stuff - Latest Comments in Tidying up factor code</title><link>http://phildawesstuff.disqus.com/</link><description></description><language>en</language><lastBuildDate>Tue, 15 Jan 2008 22:20:26 -0000</lastBuildDate><item><title>Re: Tidying up factor code</title><link>http://www.phildawes.net/blog/2008/01/15/tidying-up-factor-code/#comment-2753698</link><description>Hi Phil,&lt;br&gt;&lt;br&gt;To get all words used by a word, recursively, use&lt;br&gt;&lt;br&gt;[ word-def quot-uses ] closure&lt;br&gt;&lt;br&gt;Also words list&amp;gt;hashtable is just vocab-words&lt;br&gt;&lt;br&gt;And list&amp;gt;hashtable can be written as&lt;br&gt;&lt;br&gt;: list&amp;gt;hashtable [ "" ] H{ } map&amp;gt;assoc ;&lt;br&gt;&lt;br&gt;Assuming you want "" as the values, but usually we use equal keys/values when representing a set as a hashtable:&lt;br&gt;&lt;br&gt;: list&amp;gt;hashtable [ dup ] H{ } map&amp;gt;assoc ;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Slava Pestov</dc:creator><pubDate>Tue, 15 Jan 2008 22:20:26 -0000</pubDate></item></channel></rss>