1
0
Fork 0
cl-sites/guile.html_node/List-Modification.html

166 lines
13 KiB
HTML
Raw Normal View History

2024-12-17 12:49:28 +01:00
<!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>List Modification (Guile Reference Manual)</title>
<meta name="description" content="List Modification (Guile Reference Manual)">
<meta name="keywords" content="List Modification (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="Lists.html" rel="up" title="Lists">
<link href="List-Searching.html" rel="next" title="List Searching">
<link href="Append_002fReverse.html" rel="prev" title="Append/Reverse">
<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="List-Modification">
<div class="nav-panel">
<p>
Next: <a href="List-Searching.html" accesskey="n" rel="next">List Searching</a>, Previous: <a href="Append_002fReverse.html" accesskey="p" rel="prev">Append and Reverse</a>, Up: <a href="Lists.html" accesskey="u" rel="up">Lists</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="List-Modification-1"><span>6.6.9.6 List Modification<a class="copiable-link" href="#List-Modification-1"> &para;</a></span></h4>
<p>The following procedures modify an existing list, either by changing
elements of the list, or by changing the list structure itself.
</p>
<dl class="first-deffn">
<dt class="deffn" id="index-list_002dset_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">list-set!</strong> <var class="def-var-arguments">list k val</var><a class="copiable-link" href="#index-list_002dset_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005flist_005fset_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_list_set_x</strong> <var class="def-var-arguments">(list, k, val)</var><a class="copiable-link" href="#index-scm_005flist_005fset_005fx"> &para;</a></span></dt>
<dd><p>Set the <var class="var">k</var>th element of <var class="var">list</var> to <var class="var">val</var>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-list_002dcdr_002dset_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">list-cdr-set!</strong> <var class="def-var-arguments">list k val</var><a class="copiable-link" href="#index-list_002dcdr_002dset_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005flist_005fcdr_005fset_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_list_cdr_set_x</strong> <var class="def-var-arguments">(list, k, val)</var><a class="copiable-link" href="#index-scm_005flist_005fcdr_005fset_005fx"> &para;</a></span></dt>
<dd><p>Set the <var class="var">k</var>th cdr of <var class="var">list</var> to <var class="var">val</var>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-delq"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delq</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delq"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelq"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delq</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelq"> &para;</a></span></dt>
<dd><p>Return a newly-created copy of <var class="var">lst</var> with elements
<code class="code">eq?</code> to <var class="var">item</var> removed. This procedure mirrors
<code class="code">memq</code>: <code class="code">delq</code> compares elements of <var class="var">lst</var> against
<var class="var">item</var> with <code class="code">eq?</code>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-delv"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delv</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delv"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelv"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delv</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelv"> &para;</a></span></dt>
<dd><p>Return a newly-created copy of <var class="var">lst</var> with elements
<code class="code">eqv?</code> to <var class="var">item</var> removed. This procedure mirrors
<code class="code">memv</code>: <code class="code">delv</code> compares elements of <var class="var">lst</var> against
<var class="var">item</var> with <code class="code">eqv?</code>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-delete"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delete</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delete"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelete"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delete</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelete"> &para;</a></span></dt>
<dd><p>Return a newly-created copy of <var class="var">lst</var> with elements
<code class="code">equal?</code> to <var class="var">item</var> removed. This procedure mirrors
<code class="code">member</code>: <code class="code">delete</code> compares elements of <var class="var">lst</var>
against <var class="var">item</var> with <code class="code">equal?</code>.
</p>
<p>See also SRFI-1 which has an extended <code class="code">delete</code> (<a class="ref" href="SRFI_002d1-Deleting.html">Deleting</a>), and also an <code class="code">lset-difference</code> which can delete
multiple <var class="var">item</var>s in one call (<a class="ref" href="SRFI_002d1-Set-Operations.html">Set Operations on Lists</a>).
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-delq_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delq!</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delq_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-delv_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delv!</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delv_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-delete_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delete!</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delete_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelq_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delq_x</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelq_005fx"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelv_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delv_x</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelv_005fx"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelete_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delete_x</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelete_005fx"> &para;</a></span></dt>
<dd><p>These procedures are destructive versions of <code class="code">delq</code>, <code class="code">delv</code>
and <code class="code">delete</code>: they modify the pointers in the existing <var class="var">lst</var>
rather than creating a new list. Caveat evaluator: Like other
destructive list functions, these functions cannot modify the binding of
<var class="var">lst</var>, and so cannot be used to delete the first element of
<var class="var">lst</var> destructively.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-delq1_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delq1!</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delq1_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelq1_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delq1_x</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelq1_005fx"> &para;</a></span></dt>
<dd><p>Like <code class="code">delq!</code>, but only deletes the first occurrence of
<var class="var">item</var> from <var class="var">lst</var>. Tests for equality using
<code class="code">eq?</code>. See also <code class="code">delv1!</code> and <code class="code">delete1!</code>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-delv1_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delv1!</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delv1_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelv1_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delv1_x</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelv1_005fx"> &para;</a></span></dt>
<dd><p>Like <code class="code">delv!</code>, but only deletes the first occurrence of
<var class="var">item</var> from <var class="var">lst</var>. Tests for equality using
<code class="code">eqv?</code>. See also <code class="code">delq1!</code> and <code class="code">delete1!</code>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-delete1_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">delete1!</strong> <var class="def-var-arguments">item lst</var><a class="copiable-link" href="#index-delete1_0021"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-scm_005fdelete1_005fx"><span class="category-def">C Function: </span><span><strong class="def-name">scm_delete1_x</strong> <var class="def-var-arguments">(item, lst)</var><a class="copiable-link" href="#index-scm_005fdelete1_005fx"> &para;</a></span></dt>
<dd><p>Like <code class="code">delete!</code>, but only deletes the first occurrence of
<var class="var">item</var> from <var class="var">lst</var>. Tests for equality using
<code class="code">equal?</code>. See also <code class="code">delq1!</code> and <code class="code">delv1!</code>.
</p></dd></dl>
<dl class="first-deffn">
<dt class="deffn" id="index-filter"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">filter</strong> <var class="def-var-arguments">pred lst</var><a class="copiable-link" href="#index-filter"> &para;</a></span></dt>
<dt class="deffnx def-cmd-deffn" id="index-filter_0021"><span class="category-def">Scheme Procedure: </span><span><strong class="def-name">filter!</strong> <var class="def-var-arguments">pred lst</var><a class="copiable-link" href="#index-filter_0021"> &para;</a></span></dt>
<dd><p>Return a list containing all elements from <var class="var">lst</var> which satisfy the
predicate <var class="var">pred</var>. The elements in the result list have the same
order as in <var class="var">lst</var>. The order in which <var class="var">pred</var> is applied to
the list elements is not specified.
</p>
<p><code class="code">filter</code> does not change <var class="var">lst</var>, but the result may share a
tail with it. <code class="code">filter!</code> may modify <var class="var">lst</var> to construct its
return.
</p></dd></dl>
</div>
<hr>
<div class="nav-panel">
<p>
Next: <a href="List-Searching.html">List Searching</a>, Previous: <a href="Append_002fReverse.html">Append and Reverse</a>, Up: <a href="Lists.html">Lists</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>
</body>
</html>