Version 5.0 The LEDA User Manual

ool A.empty( ) returns true if A is empty, false otherwise.
void A.set default value(const E& x)
sets xdef to x.
Iteration
forall defined(i, A) { “the elements from dom(A) are successively assigned to i” }
Remark: the current element may not be deleted resp. declared undefined during execution
of the loop.
forall(x, A) { “for all i ∈ dom(A) the entries A[i] are successively assigned to x” }.
4. Implementation
Hashing arrays are implemented by hashing with chaining. Access operations take expected
time O(1). In many cases, hashing arrays are more efficient than dictionary arrays
(cf. 7.2).