1
0
Fork 0
cl-sites/guile.html_node/Hash-Tables.html
2024-12-17 12:49:28 +01:00

77 lines
3.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>Hash Tables (Guile Reference Manual)</title>
<meta name="description" content="Hash Tables (Guile Reference Manual)">
<meta name="keywords" content="Hash Tables (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="Data-Types.html" rel="up" title="Data Types">
<link href="Other-Types.html" rel="next" title="Other Types">
<link href="VHashes.html" rel="prev" title="VHashes">
<style type="text/css">
<!--
a.copiable-link {visibility: hidden; text-decoration: none; line-height: 0em}
span:hover a.copiable-link {visibility: visible}
-->
</style>
<link rel="stylesheet" type="text/css" href="https://www.gnu.org/software/gnulib/manual.css">
</head>
<body lang="en">
<div class="subsection-level-extent" id="Hash-Tables">
<div class="nav-panel">
<p>
Next: <a href="Other-Types.html" accesskey="n" rel="next">Other Types</a>, Previous: <a href="VHashes.html" accesskey="p" rel="prev">VList-Based Hash Lists or &ldquo;VHashes&rdquo;</a>, Up: <a href="Data-Types.html" accesskey="u" rel="up">Data Types</a> &nbsp; [<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="subsection" id="Hash-Tables-1"><span>6.6.22 Hash Tables<a class="copiable-link" href="#Hash-Tables-1"> &para;</a></span></h4>
<a class="index-entry-id" id="index-Hash-Tables"></a>
<p>Hash tables are dictionaries which offer similar functionality as
association lists: They provide a mapping from keys to values. The
difference is that association lists need time linear in the size of
elements when searching for entries, whereas hash tables can normally
search in constant time. The drawback is that hash tables require a
little bit more memory, and that you can not use the normal list
procedures (see <a class="pxref" href="Lists.html">Lists</a>) for working with them.
</p>
<ul class="mini-toc">
<li><a href="Hash-Table-Examples.html" accesskey="1">Hash Table Examples</a></li>
<li><a href="Hash-Table-Reference.html" accesskey="2">Hash Table Reference</a></li>
</ul>
</div>
</body>
</html>