Version 5.0 The LEDA User Manual

const E& L.head( )
const E& L.tail( )
returns the first element of L, i.e. the contents of
L.first().
Precondition: L is not empty.
returns the last element of L, i.e. the contents of
L.last().
Precondition: L is not empty.
slist item L.push(const E& x) adds a new item 〈x〉 at the front of L and returns
it.
slist item L.append(const E& x) appends a new item 〈x〉 to L and returns it.
slist item
L.insert(const E& x, slist item pos)
inserts a new item 〈x〉 after item pos into L and
returns it.
Precondition: it is an item in L.
const E& L.pop( )
deletes the first item from L and returns its contents.
Precondition: L is not empty.
void
L.del succ item(slist item it)
deletes the successor of item it from L.
Precondition: it is an item in L and has a successor.
void L.conc(slist& L1 ) appends list L 1 to list L and makes L 1 the empty
list.
Precondition: L ! = L 1 .
E& L[slist item it] returns a reference to the contents of it.
slist item L += const E& x appends a new item 〈x〉 to L and returns it.