search for:

A list is a handy way to store a series of things. We create one by separating the elements of the series by commas and surrounding the series with braces.

We retrieve the length of a list with the operator #.

We use it also to obtain a particular element. The elements are nubered consecutively starting with 0.

The elements of a list are stored in consecutive memory locations, so the operation above is fast.

The functions first and last retrieve the first and last elements of a list.

Omitting an element of a list causes the symbol null to be inserted in its place.

Lists can be used as vectors, provided their elements are the sorts of things that can be added and mutliplied.

If the elements of a list are themselves lists, we say that we have a nested list.

One level of nesting may be eliminated with flatten.

A table is a list whose elements are lists all of the same length. The inner lists are regarded as rows when the table is displayed as a two-dimensional array with MatrixExpression.

Various other functions for manipulating lists include {...} | {...}, append, between, delete, drop, join, mingle, pack, prepend, reverse, rsort, sort, take, and unique.

The class of all lists is List, and the class of all basic lists, useful for deriving news types of list that do not inherit methods for treating lists as vectors, is BasicList.

search for: