86 lines
5.2 KiB
HTML
86 lines
5.2 KiB
HTML
<!DOCTYPE html>
|
|
<html>
|
|
<!-- Created by GNU Texinfo 7.1, https://www.gnu.org/software/texinfo/ -->
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
|
|
<!-- This manual documents Guile version 3.0.10.
|
|
|
|
Copyright (C) 1996-1997, 2000-2005, 2009-2023 Free Software Foundation,
|
|
Inc.
|
|
|
|
Copyright (C) 2021 Maxime Devos
|
|
|
|
Copyright (C) 2024 Tomas Volf
|
|
|
|
|
|
Permission is granted to copy, distribute and/or modify this document
|
|
under the terms of the GNU Free Documentation License, Version 1.3 or
|
|
any later version published by the Free Software Foundation; with no
|
|
Invariant Sections, no Front-Cover Texts, and no Back-Cover Texts. A
|
|
copy of the license is included in the section entitled "GNU Free
|
|
Documentation License." -->
|
|
<title>SRFI-69 Hash table algorithms (Guile Reference Manual)</title>
|
|
|
|
<meta name="description" content="SRFI-69 Hash table algorithms (Guile Reference Manual)">
|
|
<meta name="keywords" content="SRFI-69 Hash table algorithms (Guile Reference Manual)">
|
|
<meta name="resource-type" content="document">
|
|
<meta name="distribution" content="global">
|
|
<meta name="Generator" content=".texi2any-real">
|
|
<meta name="viewport" content="width=device-width,initial-scale=1">
|
|
|
|
<link href="index.html" rel="start" title="Top">
|
|
<link href="Concept-Index.html" rel="index" title="Concept Index">
|
|
<link href="index.html#SEC_Contents" rel="contents" title="Table of Contents">
|
|
<link href="SRFI_002d69.html" rel="up" title="SRFI-69">
|
|
<link href="SRFI_002d69-Table-properties.html" rel="prev" title="SRFI-69 Table properties">
|
|
<style type="text/css">
|
|
<!--
|
|
a.copiable-link {visibility: hidden; text-decoration: none; line-height: 0em}
|
|
span:hover a.copiable-link {visibility: visible}
|
|
strong.def-name {font-family: monospace; font-weight: bold; font-size: larger}
|
|
-->
|
|
</style>
|
|
<link rel="stylesheet" type="text/css" href="https://www.gnu.org/software/gnulib/manual.css">
|
|
|
|
|
|
</head>
|
|
|
|
<body lang="en">
|
|
<div class="subsubsection-level-extent" id="SRFI_002d69-Hash-table-algorithms">
|
|
<div class="nav-panel">
|
|
<p>
|
|
Previous: <a href="SRFI_002d69-Table-properties.html" accesskey="p" rel="prev">Table properties</a>, Up: <a href="SRFI_002d69.html" accesskey="u" rel="up">SRFI-69 - Basic hash tables</a> [<a href="index.html#SEC_Contents" title="Table of contents" rel="contents">Contents</a>][<a href="Concept-Index.html" title="Index" rel="index">Index</a>]</p>
|
|
</div>
|
|
<hr>
|
|
<h4 class="subsubsection" id="Hash-table-algorithms"><span>7.5.39.4 Hash table algorithms<a class="copiable-link" href="#Hash-table-algorithms"> ¶</a></span></h4>
|
|
|
|
<p>Each hash table carries an <em class="dfn">equivalence function</em> and a <em class="dfn">hash
|
|
function</em>, used to implement key lookups. Beginning users should
|
|
follow the rules for consistency of the default <var class="var">hash-proc</var>
|
|
specified above. Advanced users can use these to implement their own
|
|
equivalence and hash functions for specialized lookup semantics.
|
|
</p>
|
|
<dl class="first-deffn">
|
|
<dt class="deffn" id="index-hash_002dtable_002dequivalence_002dfunction"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-equivalence-function</strong> <var class="def-var-arguments">hash-table</var><a class="copiable-link" href="#index-hash_002dtable_002dequivalence_002dfunction"> ¶</a></span></dt>
|
|
<dt class="deffnx def-cmd-deffn" id="index-hash_002dtable_002dhash_002dfunction"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-hash-function</strong> <var class="def-var-arguments">hash-table</var><a class="copiable-link" href="#index-hash_002dtable_002dhash_002dfunction"> ¶</a></span></dt>
|
|
<dd><p>Answer the equivalence and hash function of <var class="var">hash-table</var>, respectively.
|
|
</p></dd></dl>
|
|
|
|
<dl class="first-deffn">
|
|
<dt class="deffn" id="index-hash-1"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash</strong> <var class="def-var-arguments">obj [size]</var><a class="copiable-link" href="#index-hash-1"> ¶</a></span></dt>
|
|
<dt class="deffnx def-cmd-deffn" id="index-string_002dhash-1"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">string-hash</strong> <var class="def-var-arguments">obj [size]</var><a class="copiable-link" href="#index-string_002dhash-1"> ¶</a></span></dt>
|
|
<dt class="deffnx def-cmd-deffn" id="index-string_002dci_002dhash"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">string-ci-hash</strong> <var class="def-var-arguments">obj [size]</var><a class="copiable-link" href="#index-string_002dci_002dhash"> ¶</a></span></dt>
|
|
<dt class="deffnx def-cmd-deffn" id="index-hash_002dby_002didentity"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-by-identity</strong> <var class="def-var-arguments">obj [size]</var><a class="copiable-link" href="#index-hash_002dby_002didentity"> ¶</a></span></dt>
|
|
<dd><p>Answer a hash value appropriate for equality predicate <code class="code">equal?</code>,
|
|
<code class="code">string=?</code>, <code class="code">string-ci=?</code>, and <code class="code">eq?</code>, respectively.
|
|
</p></dd></dl>
|
|
|
|
<p><code class="code">hash</code> is a backwards-compatible replacement for Guile’s built-in
|
|
<code class="code">hash</code>.
|
|
</p>
|
|
</div>
|
|
|
|
|
|
|
|
</body>
|
|
</html>
|