Version 5.0 The LEDA User Manual

3. Creation
sortseq S;
creates an instance S of type sortseq based on the linear order
defined by the global compare function and and initializes it to the empty
sorted sequence.
sortseq S(int (∗cmp) (const K& , const K& ));
creates an instance S of type sortseq based on the linear order
defined by the compare function cmp and initializes it with the empty
sorted sequence.
4. Operations
const K& S.key(seq item it)
const I& S.inf(seq item it)
returns the key of item it.
returns the information of item it.
I& S[seq item it] returns a reference to the information of item it.
Precondition: it is an item in S.
seq item S.lookup(const K& k) returns the item with key k (nil if there is no such
item).
seq item S.finger lookup(const K& k)
seq item S.finger lookup from front(const K& k)
seq item S.finger lookup from rear(const K& k)
equivalent to S.lookup(k)
equivalent to S.lookup(k)
equivalent to S.lookup(k)
seq item S.locate(const K& k) returns the item 〈k1 , i〉 in S such that k1 is minimal
with k1 ≥ k (nil if no such item exists).
seq item S.finger locate(const K& k)
seq item S.finger locate from front(const K& k)
seq item S.finger locate from rear(const K& k)
equivalent to S.locate(k)
equivalent to S.locate(k)
equivalent to S.locate(k)
seq item S.locate succ(const K& k)
equivalent to S.locate(k)