Macaulay2 » Documentation
Packages » Macaulay2Doc :: BasicList
next | previous | forward | backward | up | index | toc

BasicList -- the class of all basic lists


For an overview of lists and sequences, see lists and sequences.

A basic list is a sequence of expressions indexed by a sequence of consecutive integers of the form 0, 1, ..., N-1. The number N is called the length of the list.

There are various types of basic lists, depending on the application, and they are displayed in different ways. The types first encountered are those of type VisibleList, but new types are easy to introduce. In the following example we introduce a new type of basic list called L.
i1 : L = new Type of BasicList

o1 = L

o1 : Type
i2 : x = new L from {a,b,c,d}

o2 = L{a, b, c, d}

o2 : L
i3 : join(x,x)

o3 = L{a, b, c, d, a, b, c, d}

o3 : L

Types of basic list :

Functions and methods returning a basic list :

Methods that use a basic list :

Fixed objects of class BasicList :

For the programmer

The object BasicList is a type, with ancestor class Thing.