google_hash 0.6.2 → 0.7.0

data/ext/{sparsehash-1.5.2 → sparsehash-1.8.1}/configure.ac

@@ -4,7 +4,7 @@
 # make sure we're interpreted by some minimal autoconf
 AC_PREREQ(2.57)
 
-AC_INIT(sparsehash, 1.5.2, opensource@google.com)
+AC_INIT(sparsehash, 1.8.1, opensource@google.com)
 # The argument here is just something that should be in the current directory
 # (for sanity checking)
 AC_CONFIG_SRCDIR(README)

data/ext/{sparsehash-1.5.2 → sparsehash-1.8.1}/doc/dense_hash_map.html

@@ -174,7 +174,7 @@ compatible with the tr1 class <code>unordered_map</code>.
 <TD VAlign=top>
    The <A href="http://www.sgi.com/tech/stl/HashFunction.html">hash function</A> used by the
    hash_map.  This is also defined as <tt>dense_hash_map::hasher</tt>.  
-   <br><b>Note:</b> Hashtable performance depends heavliy on the choice of
+   <br><b>Note:</b> Hashtable performance depends heavily on the choice of
    hash function.  See <A HREF="performance.html#hashfn">the performance
    page</A> for more information.
 </TD>
@@ -203,8 +203,19 @@ compatible with the tr1 class <code>unordered_map</code>.
    <tt>Alloc</tt>
 </TD>
 <TD VAlign=top>
-   <b>Ignored</b>; this is included only for API-compatibility
-   with SGI's (and tr1's) STL implementation.
+   The STL allocator to use.  By default, uses the provided allocator
+   <code>libc_allocator_with_realloc</code>, which likely gives better
+   performance than other STL allocators due to its built-in support
+   for <code>realloc</code>, which this container takes advantage of.
+   If you use an allocator other than the default, note that this
+   container imposes an additional requirement on the STL allocator
+   type beyond those in [lib.allocator.requirements]: it does not
+   support allocators that define alternate memory models.  That is,
+   it assumes that <code>pointer</code>, <code>const_pointer</code>,
+   <code>size_type</code>, and <code>difference_type</code> are just
+   <code>T*</code>, <code>const T*</code>, <code>size_t</code>, and
+   <code>ptrdiff_t</code>, respectively.  This is also defined as
+   <tt>dense_hash_map::allocator_type</tt>.
 </TD>
 <TD VAlign=top>
 </TD>
@@ -667,7 +678,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float max_load_factor(size_t new_grow)</tt>
+   <tt>void max_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>Unordered Associative Container</tt> (tr1)
@@ -693,7 +704,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float min_load_factor(size_t new_grow)</tt>
+   <tt>void min_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>dense_hash_map</tt>
@@ -787,6 +798,20 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>allocator_type get_allocator() const</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Returns the <tt>allocator_type</tt> object used by the
+   <tt>dense_hash_map</tt>: either the one passed in to the
+   constructor, or a default <tt>Alloc</tt> instance.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>dense_hash_map()</tt>
@@ -847,6 +872,22 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>dense_hash_map(size_type n, const hasher&amp; h, const
+   key_equal&amp; k, const allocator_type&amp; a)</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates an empty <tt>dense_hash_map</tt> that's optimized for up
+   to <tt>n</tt> items, using <tt>h</tt> as the hash function,
+   <tt>k</tt> as the key equal function, and <tt>a</tt> as the
+   allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <pre>template &lt;class <A
@@ -919,6 +960,25 @@ hasher&amp; h, const key_equal&amp; k) </pre> <A href="#2">[2]</A>
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <pre>template &lt;class <A
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</A>&gt;
+dense_hash_map(InputIterator f, InputIterator l, size_type n, const
+hasher&amp; h, const key_equal&amp; k, const allocator_type&amp; a) </pre>
+   <A href="#2">[2]</A>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates a hash_map with a copy of a range that's optimized for
+   holding up to <tt>n</tt> items, using <tt>h</tt> as the hash
+   function, <tt>k</tt> as the key equal function, and <tt>a</tt> as
+   the allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>dense_hash_map(const hash_map&amp;)</tt>

data/ext/{sparsehash-1.5.2 → sparsehash-1.8.1}/doc/dense_hash_set.html

@@ -164,7 +164,7 @@ compatible with the tr1 class <code>unordered_set</code>.
 <TD VAlign=top>
    The <A href="http://www.sgi.com/tech/stl/HashFunction.html">hash function</A> used by the
    hash_set.  This is also defined as <tt>dense_hash_set::hasher</tt>.  
-   <br><b>Note:</b> Hashtable performance depends heavliy on the choice of
+   <br><b>Note:</b> Hashtable performance depends heavily on the choice of
    hash function.  See <A HREF="performance.html#hashfn">the performance
    page</A> for more information.
 </TD>
@@ -193,8 +193,19 @@ compatible with the tr1 class <code>unordered_set</code>.
    <tt>Alloc</tt>
 </TD>
 <TD VAlign=top>
-   <b>Ignored</b>; this is included only for API-compatibility
-   with SGI's (and tr1's) STL implementation.
+   The STL allocator to use.  By default, uses the provided allocator
+   <code>libc_allocator_with_realloc</code>, which likely gives better
+   performance than other STL allocators due to its built-in support
+   for <code>realloc</code>, which this container takes advantage of.
+   If you use an allocator other than the default, note that this
+   container imposes an additional requirement on the STL allocator
+   type beyond those in [lib.allocator.requirements]: it does not
+   support allocators that define alternate memory models.  That is,
+   it assumes that <code>pointer</code>, <code>const_pointer</code>,
+   <code>size_type</code>, and <code>difference_type</code> are just
+   <code>T*</code>, <code>const T*</code>, <code>size_t</code>, and
+   <code>ptrdiff_t</code>, respectively.  This is also defined as
+   <tt>dense_hash_set::allocator_type</tt>.
 </TD>
 <TD VAlign=top>
 </TD>
@@ -615,7 +626,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float max_load_factor(size_t new_grow)</tt>
+   <tt>void max_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>Unordered Associative Container</tt> (tr1)
@@ -641,7 +652,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float min_load_factor(size_t new_grow)</tt>
+   <tt>void min_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>dense_hash_set</tt>
@@ -735,6 +746,20 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>allocator_type get_allocator() const</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Returns the <tt>allocator_type</tt> object used by the
+   <tt>dense_hash_set</tt>: either the one passed in to the
+   constructor, or a default <tt>Alloc</tt> instance.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>dense_hash_set()</tt>
@@ -795,6 +820,22 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>dense_hash_set(size_type n, const hasher&amp; h, const
+   key_equal&amp; k, const allocator_type&amp; a)</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates an empty <tt>dense_hash_set</tt> that's optimized for up
+   to <tt>n</tt> items, using <tt>h</tt> as the hash function,
+   <tt>k</tt> as the key equal function, and <tt>a</tt> as the
+   allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <pre>template &lt;class <A
@@ -867,6 +908,25 @@ hasher&amp; h, const key_equal&amp; k) </pre> <A href="#1">[2]</A>
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <pre>template &lt;class <A
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</A>&gt;
+dense_hash_set(InputIterator f, InputIterator l, size_type n, const
+hasher&amp; h, const key_equal&amp; k, const allocator_type&amp; a) </pre>
+   <A href="#2">[2]</A>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates a hash_set with a copy of a range that's optimized for
+   holding up to <tt>n</tt> items, using <tt>h</tt> as the hash
+   function, <tt>k</tt> as the key equal function, and <tt>a</tt> as
+   the allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>dense_hash_set(const hash_set&amp;)</tt>

data/ext/{sparsehash-1.5.2 → sparsehash-1.8.1}/doc/implementation.html

@@ -271,11 +271,17 @@ copy-time rehash makes them unnecessary.</p>
 <h3>Resource use</h3>
 
 <p>The data is stored in a sparsetable, so space use is the same as
-for sparsetable.  Time use is also determined in large part by the
-sparsetable implementation.  However, there is also an extra probing
-cost in hashtables, which depends in large part on the "too full"
-value.  It should be rare to need more than 4-5 probes per lookup, and
-usually significantly less will suffice.</p>
+for sparsetable.  However, by default the sparse_hash_set
+implementation tries to keep about half the table buckets empty, to
+keep lookup-chains short.  Since sparsehashmap has about 2 bits
+overhead per bucket (or 2.5 bits on 64-bit systems), sparse_hash_map
+has about 4-5 bits overhead per hashtable item.</p>
+
+<p>Time use is also determined in large part by the sparsetable
+implementation.  However, there is also an extra probing cost in
+hashtables, which depends in large part on the "too full" value.  It
+should be rare to need more than 4-5 probes per lookup, and usually
+significantly less will suffice.</p>
 
 <p>A note on growing and shrinking the hashtable: all hashtable
 implementations use the most memory when growing a hashtable, since

data/ext/{sparsehash-1.5.2 → sparsehash-1.8.1}/doc/sparse_hash_map.html

@@ -172,7 +172,7 @@ compatible with the tr1 class <code>unordered_map</code>.
 <TD VAlign=top>
    The <A href="http://www.sgi.com/tech/stl/HashFunction.html">hash function</A> used by the
    hash_map.  This is also defined as <tt>sparse_hash_map::hasher</tt>.
-   <br><b>Note:</b> Hashtable performance depends heavliy on the choice of
+   <br><b>Note:</b> Hashtable performance depends heavily on the choice of
    hash function.  See <A HREF="performance.html#hashfn">the performance
    page</A> for more information.
 </TD>
@@ -201,8 +201,19 @@ compatible with the tr1 class <code>unordered_map</code>.
    <tt>Alloc</tt>
 </TD>
 <TD VAlign=top>
-   <b>Ignored</b>; this is included only for API-compatibility
-   with SGI's (and tr1's) STL implementation.
+   The STL allocator to use.  By default, uses the provided allocator
+   <code>libc_allocator_with_realloc</code>, which likely gives better
+   performance than other STL allocators due to its built-in support
+   for <code>realloc</code>, which this container takes advantage of.
+   If you use an allocator other than the default, note that this
+   container imposes an additional requirement on the STL allocator
+   type beyond those in [lib.allocator.requirements]: it does not
+   support allocators that define alternate memory models.  That is,
+   it assumes that <code>pointer</code>, <code>const_pointer</code>,
+   <code>size_type</code>, and <code>difference_type</code> are just
+   <code>T*</code>, <code>const T*</code>, <code>size_t</code>, and
+   <code>ptrdiff_t</code>, respectively.  This is also defined as
+   <tt>sparse_hash_map::allocator_type</tt>.
 </TD>
 <TD VAlign=top>
 </TD>
@@ -665,7 +676,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float max_load_factor(size_t new_grow)</tt>
+   <tt>void max_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>Unordered Associative Container</tt> (tr1)
@@ -691,7 +702,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float min_load_factor(size_t new_grow)</tt>
+   <tt>void min_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>sparse_hash_map</tt>
@@ -785,6 +796,20 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>allocator_type get_allocator() const</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Returns the <tt>allocator_type</tt> object used by the
+   <tt>sparse_hash_map</tt>: either the one passed in to the
+   constructor, or a default <tt>Alloc</tt> instance.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>sparse_hash_map()</tt>
@@ -845,6 +870,22 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>sparse_hash_map(size_type n, const hasher&amp; h, const
+   key_equal&amp; k, const allocator_type&amp; a)</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates an empty <tt>sparse_hash_map</tt> that's optimized for up
+   to <tt>n</tt> items, using <tt>h</tt> as the hash function,
+   <tt>k</tt> as the key equal function, and <tt>a</tt> as the
+   allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <pre>template &lt;class <A
@@ -917,6 +958,25 @@ hasher&amp; h, const key_equal&amp; k) </pre> <A href="#2">[2]</A>
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <pre>template &lt;class <A
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</A>&gt;
+sparse_hash_map(InputIterator f, InputIterator l, size_type n, const
+hasher&amp; h, const key_equal&amp; k, const allocator_type&amp; a) </pre>
+   <A href="#2">[2]</A>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates a hash_map with a copy of a range that's optimized for
+   holding up to <tt>n</tt> items, using <tt>h</tt> as the hash
+   function, <tt>k</tt> as the key equal function, and <tt>a</tt> as
+   the allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>sparse_hash_map(const hash_map&amp;)</tt>

data/ext/{sparsehash-1.5.2 → sparsehash-1.8.1}/doc/sparse_hash_set.html

@@ -162,7 +162,7 @@ compatible with the tr1 class <code>unordered_set</code>.
 <TD VAlign=top>
    The <A href="http://www.sgi.com/tech/stl/HashFunction.html">hash function</A> used by the
    hash_set.  This is also defined as <tt>sparse_hash_set::hasher</tt>.  
-   <br><b>Note:</b> Hashtable performance depends heavliy on the choice of
+   <br><b>Note:</b> Hashtable performance depends heavily on the choice of
    hash function.  See <A HREF="performance.html#hashfn">the performance
    page</A> for more information.
 </TD>
@@ -191,8 +191,19 @@ compatible with the tr1 class <code>unordered_set</code>.
    <tt>Alloc</tt>
 </TD>
 <TD VAlign=top>
-   <b>Ignored</b>; this is included only for API-compatibility
-   with SGI's (and tr1's) STL implementation.
+   The STL allocator to use.  By default, uses the provided allocator
+   <code>libc_allocator_with_realloc</code>, which likely gives better
+   performance than other STL allocators due to its built-in support
+   for <code>realloc</code>, which this container takes advantage of.
+   If you use an allocator other than the default, note that this
+   container imposes an additional requirement on the STL allocator
+   type beyond those in [lib.allocator.requirements]: it does not
+   support allocators that define alternate memory models.  That is,
+   it assumes that <code>pointer</code>, <code>const_pointer</code>,
+   <code>size_type</code>, and <code>difference_type</code> are just
+   <code>T*</code>, <code>const T*</code>, <code>size_t</code>, and
+   <code>ptrdiff_t</code>, respectively.  This is also defined as
+   <tt>sparse_hash_set::allocator_type</tt>.
 </TD>
 <TD VAlign=top>
 </TD>
@@ -613,7 +624,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float max_load_factor(size_t new_grow)</tt>
+   <tt>void max_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>Unordered Associative Container</tt> (tr1)
@@ -639,7 +650,7 @@ None.
 
 <TR>
 <TD VAlign=top>
-   <tt>float min_load_factor(size_t new_grow)</tt>
+   <tt>void min_load_factor(float new_grow)</tt>
 </TD>
 <TD VAlign=top>
    <tt>sparse_hash_set</tt>
@@ -733,6 +744,20 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>allocator_type get_allocator() const</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Returns the <tt>allocator_type</tt> object used by the
+   <tt>sparse_hash_set</tt>: either the one passed in to the
+   constructor, or a default <tt>Alloc</tt> instance.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>sparse_hash_set()</tt>
@@ -793,6 +818,22 @@ None.
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <tt>sparse_hash_set(size_type n, const hasher&amp; h, const
+   key_equal&amp; k, const allocator_type&amp; a)</tt>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates an empty <tt>sparse_hash_set</tt> that's optimized for up
+   to <tt>n</tt> items, using <tt>h</tt> as the hash function,
+   <tt>k</tt> as the key equal function, and <tt>a</tt> as the
+   allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <pre>template &lt;class <A
@@ -865,6 +906,25 @@ hasher&amp; h, const key_equal&amp; k) </pre> <A href="#1">[2]</A>
 </TD>
 </TR>
 
+<TR>
+<TD VAlign=top>
+   <pre>template &lt;class <A
+href="http://www.sgi.com/tech/stl/InputIterator.html">InputIterator</A>&gt;
+sparse_hash_set(InputIterator f, InputIterator l, size_type n, const
+hasher&amp; h, const key_equal&amp; k, const allocator_type&amp; a) </pre>
+   <A href="#2">[2]</A>
+</TD>
+<TD VAlign=top>
+   <tt>Unordered Associative Container</tt> (tr1)
+</TD>
+<TD VAlign=top>
+   Creates a hash_set with a copy of a range that's optimized for
+   holding up to <tt>n</tt> items, using <tt>h</tt> as the hash
+   function, <tt>k</tt> as the key equal function, and <tt>a</tt> as
+   the allocator object.
+</TD>
+</TR>
+
 <TR>
 <TD VAlign=top>
    <tt>sparse_hash_set(const hash_set&amp;)</tt>