<story><title>In-memory hash tree implementation</title><url>https://godoc.org/github.com/hit9/htree</url></story><parent_chain></parent_chain><comment><author>songgao</author><text>&amp;gt; HTree is better for local locks if you want a safe container.&lt;p&gt;&amp;gt; Goroutine Safety.&lt;p&gt;Could somebody elaborate on these two points? Why is it a &amp;quot;safe container&amp;quot; and how is it more &amp;quot;goroutine safe&amp;quot; than a map?</text></comment>
<story><title>In-memory hash tree implementation</title><url>https://godoc.org/github.com/hit9/htree</url></story><parent_chain></parent_chain><comment><author>lisper</author><text>&lt;p&gt;&lt;pre&gt;&lt;code&gt;    Take 10 consecutive prime numbers:

    2, 3, 5, 7, 11, 13, 17, 19, 23, 29
    And they can distinguish all uint32 numbers:

    2*3*5*7*11*13*17*19*23*29 &amp;gt; ^uint32(0)
&lt;/code&gt;&lt;/pre&gt;
Huh?  How do I represent 31 (or any prime greater than 29)?</text></comment>