Version 5.0 The LEDA User Manual

const I& D.inf(dic2 item it) returns the information of item it.
Precondition: it is an item in D.
I& D[dic2 item it] returns a reference to the information of item
it.
Precondition: it is an item in D.
dic2 item D.min key1( ) returns the item with minimal first key.
dic2 item D.min key2( ) returns the item with minimal second key.
dic2 item D.max key1( ) returns the item with maximal first key.
dic2 item D.max key2( ) returns the item with maximal second key.
dic2 item D.insert(const K1 & x, const K2 & y, const I& i)
dic2 item D.lookup(const K1 & x, const K2 & y)
associates the information i with the keys x
and y. If there is an item in D then
j is replaced by i, else a new item
is added to D. In both cases the item is returned.
returns the item with keys x and y (nil if no
such item exists in D).
list D.range search(const K1 & x0 , const K1 & x1 , const K2 & y0 ,
const K2 & y1 )
returns the list of all items in D
with x 0 ≤ k 1 ≤ x 1 and y 0 ≤ k 2 ≤ y 1 .
list D.all items( ) returns the list of all items of D.
void D.del(const K1 & x, const K2 & y)
deletes the item with keys x and y from D.
void D.del item(dic2 item it) removes item it from D.
Precondition: it is an item in D.
void D.change inf(dic2 item it, const I& i)
makes i the information of item it.
Precondition: it is an item in D.
void D.clear( ) makes D the empty d2 dictionary.
bool D.empty( ) returns true if D is empty, false otherwise.
int D.size( ) returns the size of D.