- void `l_class'(list l);
deletes the first element in the l list
- void `l_clear'(list l);
empties the l list
- void `l_copy'(list l, list
t);
empties the l list and copies the content of the t list in l
- void `l_delete'(list l, mode
m);
deletes the m indexed element of the l list
- mode `l_length'(list l);
is the length (i.e. number of items) of the l list
- void `l_link'(list l, mode m,
list t, mode n);
moves the m indexed element of the l list in the n position
in the t list
- void `l_move'(list l, mode m,
mode n);
moves the m indexed element of the l list in the n position
- void `l_new'(list &l);
sets the l list as a new list (same as `l_clear' if l is not
linked multiple times, otherwise creates a new list and sets l as a
reference to that new list)
The function is generated on request only.
See List Library Generation Flags.
- void `l_offset'(list l, mode
m);
shifts (rotates/circulates) the l list (as if it was a circular list)
until the (m % <list size> + <list size>) % <list size> element becomes
the first
- void `l_reverse'(list l);
reverses the order of the elements in the l list
- void `l_set'(list &l, list
t);
sets the l list as a reference of the t list
The function is generated on request only.
See List Library Generation Flags.
- void `l_short'(list l);
deletes the last element in the l list
- void `l_spin'(list l, mode m,
mode n);
exchanges the m and n indexed elements in the l list
- void `l_swap'(list l, list
t);
exchanges the content of the l and t lists
- void `l_trade'(list l, mode
m, list t, mode n);
exchanges the m indexed element in the l list and the n
indexed element in the t list