A | |
add [HashSet.S] | |
add [HashSet] | SetHash.add h x adds x to the set h ,
resizing the set when the number of elements is
equal or more than the size of the set.
|
add_unsafe [HashSet.S] | |
add_unsafe [HashSet] | SetHash.add_unsafe h x adds x to the set h ,
without resizing the set.
|
B | |
bucket_lengths [HashSet.S] | |
bucket_lengths [HashSet] | |
C | |
capacity [HashSet.S] | |
capacity [HashSet] | SetHash.capacity is the size of the set, i.e.
|
clear [HashSet.S] | |
clear [HashSet] |
Empty a set.
|
compare [HashSet.HashedType] |
The comparison function used to compare elements.
|
copy [HashSet.S] | |
copy [HashSet] | SetHash.copy h returns a copy of h
|
copy_resize [HashSet.S] | |
copy_resize [HashSet] | SetHash.copy_resize h n return a new set
with the same elements as h and with size n
|
create [HashSet.S] | |
create [HashSet] | SetHash.create n k creates a new, empty set with
initial size n .
|
create_from_list [HashSet.S] | |
create_from_list [HashSet] | |
D | |
diff [HashSet.S] | |
diff [HashSet] | |
diff_update [HashSet.S] | |
diff_update [HashSet] | |
E | |
empty [HashSet.S] | |
empty [HashSet] | SetHash.empty() creates an empty set of zero size.
|
equal [HashSet.S] | |
equal [HashSet] | SetHash.equal h1 h2 tests whether the sets h1 and h2 are
equal, that is, contain equal elements.
|
exists [HashSet.S] | |
exists [HashSet] | SetHash.exists p h checks if at least one element of
the set satisfies the predicate p .
|
F | |
fold [HashSet.S] | |
fold [HashSet] | SetHash.fold f h a computes (f xN ... (f x2 (f x1 a))...) ,
where x1 ... xN are the elements in s .
|
for_all [HashSet.S] | |
for_all [HashSet] | SetHash.for_all p h checks if all elements of the set h
satisfy the predicate p .
|
H | |
hash [HashSet.HashedType] |
A hashing function on elements.
|
I | |
inter [HashSet.S] | |
inter [HashSet] | |
inter_update [HashSet.S] | |
inter_update [HashSet] | |
iter [HashSet.S] | |
iter [HashSet] | SetHash.iter f h applies f to all elements of
the set.
|
iter_v [HashSet.S] | |
K | |
keys [HashSet.S] | |
keys [HashSet] | SetHash.keys h returns an array with the elements of the set
in unspecified order.
|
L | |
length [HashSet.S] | |
length [HashSet] | SetHash.length h returns the number of elements
in the set.
|
M | |
mem [HashSet.S] | |
mem [HashSet] | SetHash.mem h x checks if x is a member of h .
|
R | |
remove [HashSet.S] | |
remove [HashSet] | SetHash.remove h x removes the element x from
the set h .
|
resize [HashSet.S] | |
S | |
symmetric_diff [HashSet.S] | |
symmetric_diff [HashSet] | |
symmetric_diff_update [HashSet.S] | |
symmetric_diff_update [HashSet] | |
U | |
union [HashSet.S] | |
union [HashSet] | |
update [HashSet.S] | |
update [HashSet] |