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

99 lines
5.7 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 Table properties (Guile Reference Manual)</title>
<meta name="description" content="SRFI-69 Table properties (Guile Reference Manual)">
<meta name="keywords" content="SRFI-69 Table properties (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-Hash-table-algorithms.html" rel="next" title="SRFI-69 Hash table algorithms">
<link href="SRFI_002d69-Accessing-table-items.html" rel="prev" title="SRFI-69 Accessing table items">
<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-Table-properties">
<div class="nav-panel">
<p>
Next: <a href="SRFI_002d69-Hash-table-algorithms.html" accesskey="n" rel="next">Hash table algorithms</a>, Previous: <a href="SRFI_002d69-Accessing-table-items.html" accesskey="p" rel="prev">Accessing table items</a>, Up: <a href="SRFI_002d69.html" accesskey="u" rel="up">SRFI-69 - Basic hash tables</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="subsubsection" id="Table-properties"><span>7.5.39.3 Table properties<a class="copiable-link" href="#Table-properties"> &para;</a></span></h4>
<dl class="first-deffn">
<dt class="deffn" id="index-hash_002dtable_002dsize"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-size</strong> <var class="def-var-arguments">table</var><a class="copiable-link" href="#index-hash_002dtable_002dsize"> &para;</a></span></dt>
<dd><p>Answer the number of associations in <var class="var">table</var>. This is guaranteed
to run in constant time for non-weak tables.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-hash_002dtable_002dkeys"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-keys</strong> <var class="def-var-arguments">table</var><a class="copiable-link" href="#index-hash_002dtable_002dkeys"> &para;</a></span></dt>
<dd><p>Answer an unordered list of the keys in <var class="var">table</var>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-hash_002dtable_002dvalues"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-values</strong> <var class="def-var-arguments">table</var><a class="copiable-link" href="#index-hash_002dtable_002dvalues"> &para;</a></span></dt>
<dd><p>Answer an unordered list of the values in <var class="var">table</var>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-hash_002dtable_002dwalk"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-walk</strong> <var class="def-var-arguments">table proc</var><a class="copiable-link" href="#index-hash_002dtable_002dwalk"> &para;</a></span></dt>
<dd><p>Invoke <var class="var">proc</var> once for each association in <var class="var">table</var>, passing
the key and value as arguments.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-hash_002dtable_002dfold"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-fold</strong> <var class="def-var-arguments">table proc init</var><a class="copiable-link" href="#index-hash_002dtable_002dfold"> &para;</a></span></dt>
<dd><p>Invoke <code class="code">(<var class="var">proc</var> <var class="var">key</var> <var class="var">value</var> <var class="var">previous</var>)</code> for
each <var class="var">key</var> and <var class="var">value</var> in <var class="var">table</var>, where <var class="var">previous</var> is
the result of the previous invocation, using <var class="var">init</var> as the first
<var class="var">previous</var> value. Answer the final <var class="var">proc</var> result.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-hash_002dtable_002d_003ealist"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">hash-table-&gt;alist</strong> <var class="def-var-arguments">table</var><a class="copiable-link" href="#index-hash_002dtable_002d_003ealist"> &para;</a></span></dt>
<dd><p>Answer an alist where each association in <var class="var">table</var> is an
association in the result.
</p></dd></dl>
</div>
</body>
</html>