devdocs/elisp/hash-table-type.html


1
2
3
4
5
6
7
8
9
10

 <h4 class="subsection">Hash Table Type</h4> <p>A hash table is a very fast kind of lookup table, somewhat like an alist in that it maps keys to corresponding values, but much faster. The printed representation of a hash table specifies its properties and contents, like this: </p> <div class="example"> <pre class="example">(make-hash-table)
     ⇒ #s(hash-table size 65 test eql rehash-size 1.5
                             rehash-threshold 0.8125 data ())
</pre>
</div> <p>See <a href="hash-tables">Hash Tables</a>, for more information about hash tables. </p><div class="_attribution">
  <p class="_attribution-p">
    Copyright &copy; 1990-1996, 1998-2022 Free Software Foundation, Inc. <br>Licensed under the GNU GPL license.<br>
    <a href="https://www.gnu.org/software/emacs/manual/html_node/elisp/Hash-Table-Type.html" class="_attribution-link">https://www.gnu.org/software/emacs/manual/html_node/elisp/Hash-Table-Type.html</a>
  </p>
</div>