<?xml version="1.0" encoding="utf-8"?>
<rss xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title>Phil Dawes' Stuff - Latest Comments in Tidying up factor code</title><link>http://phildawesstuff.disqus.com/</link><description></description><atom:link href="https://phildawesstuff.disqus.com/tidying_up_factor_code/latest.rss" rel="self"></atom:link><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>&lt;p&gt;Hi Phil,&lt;/p&gt;&lt;p&gt;To get all words used by a word, recursively, use&lt;/p&gt;&lt;p&gt;[ word-def quot-uses ] closure&lt;/p&gt;&lt;p&gt;Also words list&amp;gt;hashtable is just vocab-words&lt;/p&gt;&lt;p&gt;And list&amp;gt;hashtable can be written as&lt;/p&gt;&lt;p&gt;: list&amp;gt;hashtable [ "" ] H{ } map&amp;gt;assoc ;&lt;/p&gt;&lt;p&gt;Assuming you want "" as the values, but usually we use equal keys/values when representing a set as a hashtable:&lt;/p&gt;&lt;p&gt;: list&amp;gt;hashtable [ dup ] H{ } map&amp;gt;assoc ;&lt;/p&gt;</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>