Next: Sequences Arrays Vectors, Previous: Strings and Characters, Up: Top [Contents][Index]
A list 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.
| • Cons Cells: | How lists are made out of cons cells. | |
| • Lists as Boxes: | Graphical notation to explain lists. | |
| • List-related Predicates: | Is this object a list? Comparing two lists. | |
| • List Elements: | Extracting the pieces of a list. | |
| • Building Lists: | Creating list structure. | |
| • Modifying Lists: | Storing new pieces into an existing list. | |
| • Sets And Lists: | A list can represent a finite mathematical set. | |
| • Association Lists: | A list can represent a finite relation or mapping. | |
| • Property Lists: | A different way to represent a finite mapping. | |
| • Skip Lists: | Very efficient dictionary data type. | |
| • Weak Lists: | A list with special garbage-collection behavior. | |
| • DL-Lists: | A doubly-linked list implementation. | |
| • Bloom Filters: | A special set type with anonymous membership. |
Next: Sequences Arrays Vectors, Previous: Strings and Characters, Up: Top [Contents][Index]