diff options
| author | Craig Jennings <c@cjennings.net> | 2024-04-07 13:41:34 -0500 |
|---|---|---|
| committer | Craig Jennings <c@cjennings.net> | 2024-04-07 13:41:34 -0500 |
| commit | 754bbf7a25a8dda49b5d08ef0d0443bbf5af0e36 (patch) | |
| tree | f1190704f78f04a2b0b4c977d20fe96a828377f1 /devdocs/elisp/lists.html | |
new repository
Diffstat (limited to 'devdocs/elisp/lists.html')
| -rw-r--r-- | devdocs/elisp/lists.html | 51 |
1 files changed, 51 insertions, 0 deletions
diff --git a/devdocs/elisp/lists.html b/devdocs/elisp/lists.html new file mode 100644 index 00000000..75f763d0 --- /dev/null +++ b/devdocs/elisp/lists.html @@ -0,0 +1,51 @@ + <h2 class="chapter">Lists</h2> <p>A <em>list</em> represents a sequence of zero or more elements (which may be any Lisp objects). The important difference between lists and vectors is that two or more lists can share part of their structure; in addition, you can insert or delete elements in a list without copying the whole list. </p> <table class="menu" border="0" cellspacing="0"> <tr> +<td align="left" valign="top">• <a href="cons-cells" accesskey="1">Cons Cells</a> +</td> +<td> </td> +<td align="left" valign="top">How lists are made out of cons cells. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="list_002drelated-predicates" accesskey="2">List-related Predicates</a> +</td> +<td> </td> +<td align="left" valign="top">Is this object a list? Comparing two lists. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="list-elements" accesskey="3">List Elements</a> +</td> +<td> </td> +<td align="left" valign="top">Extracting the pieces of a list. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="building-lists" accesskey="4">Building Lists</a> +</td> +<td> </td> +<td align="left" valign="top">Creating list structure. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="list-variables" accesskey="5">List Variables</a> +</td> +<td> </td> +<td align="left" valign="top">Modifying lists stored in variables. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="modifying-lists" accesskey="6">Modifying Lists</a> +</td> +<td> </td> +<td align="left" valign="top">Storing new pieces into an existing list. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="sets-and-lists" accesskey="7">Sets And Lists</a> +</td> +<td> </td> +<td align="left" valign="top">A list can represent a finite mathematical set. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="association-lists" accesskey="8">Association Lists</a> +</td> +<td> </td> +<td align="left" valign="top">A list can represent a finite relation or mapping. </td> +</tr> <tr> +<td align="left" valign="top">• <a href="property-lists" accesskey="9">Property Lists</a> +</td> +<td> </td> +<td align="left" valign="top">A list of paired elements. </td> +</tr> </table><div class="_attribution"> + <p class="_attribution-p"> + Copyright © 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/Lists.html" class="_attribution-link">https://www.gnu.org/software/emacs/manual/html_node/elisp/Lists.html</a> + </p> +</div> |