Buy the book!
|[ < ]||[ > ]||[ << ]||[ 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.
5.1 Lists and Cons Cells How lists are made out of cons cells. 5.2 Lists as Linked Pairs of Boxes Graphical notation to explain lists. 5.3 Predicates on Lists Is this object a list? Comparing two lists. 5.4 Accessing Elements of Lists Extracting the pieces of a list. 5.5 Building Cons Cells and Lists Creating list structure. 5.6 Modifying Existing List Structure Storing new pieces into an existing list. 5.7 Using Lists as Sets A list can represent a finite mathematical set. 5.8 Association Lists A list can represent a finite relation or mapping.
|webmaster donations bookstore||delorie software privacy|
|Copyright © 2003 by The Free Software Foundation||Updated Jun 2003|