Version 5.0 The LEDA User Manual

seq item S.succ(const K& k) equivalent to S.locate(k)
seq item S.finger locate succ(const K& k)
equivalent to S.locate(k)
seq item S.finger locate succ from front(const K& k)
equivalent to S.locate(k)
seq item S.finger locate succ from rear(const K& k)
seq item S.locate pred(const K& k)
equivalent to S.locate(k)
returns the item 〈k1 , i〉 in S such that k1 is maximal
with k1 ≤ k ( nil if no such item exists).
seq item S.pred(const K& k) equivalent to S.locate pred(k)
seq item S.finger locate pred(const K& k)
equivalent to S.locate pred(k)
seq item S.finger locate pred from front(const K& k)
seq item S.finger locate pred from rear(const K& k)
seq item S.finger lookup(seq item it, const K& k)
seq item S.finger locate(seq item it, const K& k)
equivalent to S.locate pred(k)
equivalent to S.locate pred(k)
seq item S.finger locate succ(seq item it, const K& k)
seq item S.finger locate pred(seq item it, const K& k)
equivalent to IT.lookup(k) where IT is the sorted
sequence containing it.
Precondition: S and IT must have the same type
equivalent to IT.locate(k) where IT is the sorted
sequence containing it.
Precondition: S and IT must have the same type.
equivalent to IT.locate succ(k) where IT is the
sorted sequence containing it.
Precondition: S and IT must have the same type
equivalent to IT.locate pred(k) where IT is the
sorted sequence containing it.
Precondition: S and IT must have the same type.
seq item S.min item( ) returns the item with minimal key (nil if S is
empty).