Version 5.0 The LEDA User Manual

seq item S.max item( ) returns the item with maximal key (nil if S is
empty).
seq item S.succ(seq item it) returns the successor item of it in the sequence containing
it (nil if there is no such item).
seq item S.pred(seq item x) returns the predecessor item of it in the sequence
containing it (nil if there is no such item).
seq item S.insert(const K& k, const I& i)
seq item S.insert at(seq item it, const K& k, const I& i)
associates information i with key k: If there is an
item 〈k, j〉 in S then j is replaced by i, else a new
item 〈k, i〉 is added to S. In both cases the item is
returned.
Like IT.insert(k, i) where IT is the sequence containing
item it.
Precondition: it is an item in IT with
key(it) is maximal with key(it) < k or
key(it) is minimal with key(it) > k or
if key(it) = k then inf (it) is replaced by i. S and
IT have the same type.
seq item
S.insert at(seq item it, const K& k, const I& i, int dir)
Like IT.insert(k, i) where IT is the sequence containing
item it.
Precondition: it is an item in IT with
key(it) is maximal with key(it) < k if dir =
leda :: before or
key(it) is minimal with k < key(it) if dir =
leda :: behind or
if key(it) = k then inf (it) is replaced by i. S and
IT have the same type.
int S.size( ) returns the size of S.
bool S.empty( ) returns true if S is empty, false otherwise.
void S.clear( ) makes S the empty sorted sequence.
void S.reverse items(seq item a, seq item b)
void S.flip items(seq item a, seq item b)
the subsequence of IT from a to b is reversed, where
IT is the sequence containing a and b.
Precondition: a appears before b in IT .
equivalent to S.reverse items(a, b).