[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

2.9.4 Lists

055E9 NULL{} ( → {} )
Pushes a null list to the stack.
36ABD DUPNULL{}? ( {} → {} flag )
159006 ^DUPCKLEN{} ( {} → {} #n )
( ob → ob #1 )
Return length of list, or 1 for non-lists.
29D18 ONE{}N ( ob → { ob } )
36202 TWO{}N ( ob1 ob2 → { ob1 ob2 } )
36216 THREE{}N ( ob1 ob2 ob3 → { ob1 ob2 ob3 } )
361EE #1-{}N ( ob1..obn #n+1 → {} )
2B42A PUTLIST ( ob #i {} → {}' )
Replaces object at specified position. Assumes valid #i.
2FC006 ^INSERT{}N ( {} ob # → {}' )
Insert object into list at given position. The position must be < than length of the list. If the position is zero, >TCOMP is used.
2FB006 ^NEXTPext ( list → list1 list2 )
Extract in list2 all occurrances of the 1st object of list, the remaining objects are stored in list1. list1 = list-list2.
2FD006 ^COMPRIMext ( {} → {}' )
Suppress multiple occurrances in the list.
15A006 ^CKCARCOMP ( {} → ob1 )
( ob → ob )
Returns first element for lists, or object itself if it is not a list.
2EF5A apndvarlst ( {} ob → {}' )
Appends ob to list if not already there.
0FE006 ^AppendList ( {} ob → {}' )
Equivalent to apndvarlst, but faster.
4EB006 ^prepvarlist ( {} ob → {}' )
Adds ob at the beginning of the list if not present. If ob is in list, move ob to the beginning of list. Unfortunately moving an entry does influence the sequence of the rest of the list unchanged.
100006 ^SortList ( L pred → L' )
Sorts list according to give predicate. Pred is a program that tests two elements and returns FALSE if the first is to appear earlier than the second. To sort in numerical order, for example, the predicate would be a > test.
28A006 ^PIext ( {} → ob )
Returns the product of all elements of the list.
25ED3 EqList? ( ob → )
Is ob a list of equations? Returns T if ob is a list of at least two elements, and the second element is not a list itself.


[ < ] [ > ]   [ << ] [ Up ] [ >> ]         [Top] [Contents] [Index] [ ? ]

This document was generated by Carsten Dominik on May, 30 2005 using texi2html