Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class HASH_TABLE_EX [G, K -> HASHABLE] General cluster: base_extension description: "Hash tables, used to store items identified by hashable keys using a EQUALITY_TESTER for comparison." create: make, make_with_key_tester Ancestors HASH_TABLE [G, K -> detachable HASHABLE] Queries after: BOOLEAN at alias "@" (key: K): detachable G capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN conflict: BOOLEAN count: INTEGER_32 current_keys: ARRAY [K] cursor: CURSOR definite_item (key: K): G disjoint (other: HASH_TABLE [G, K]): BOOLEAN Extendible: BOOLEAN found: BOOLEAN found_item: detachable G Full: BOOLEAN has (key: K): BOOLEAN has_item (v: G): BOOLEAN has_key (key: K): BOOLEAN hash_code_of (a_key: attached K): INTEGER_32 inserted: BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] HASH_TABLE_EX [G, K]): BOOLEAN is_inserted (v: G): BOOLEAN item alias "[]" (key: K): detachable G item_for_iteration: G iteration_item (i: INTEGER_32): G iteration_lower: INTEGER_32 iteration_upper: INTEGER_32 key_for_iteration: K linear_representation: ARRAYED_LIST [G] Mismatch_information: MISMATCH_INFORMATION new_cursor: HASH_TABLE_ITERATION_CURSOR [G, K] not_found: BOOLEAN object_comparison: BOOLEAN occurrences (v: G): INTEGER_32 off: BOOLEAN prunable: BOOLEAN removed: BOOLEAN replaced: BOOLEAN same_keys (a_search_key, a_key: K): BOOLEAN valid_cursor (c: CURSOR): BOOLEAN valid_iteration_index (i: INTEGER_32): BOOLEAN Commands accommodate (n: INTEGER_32) bag_put (v: G) collection_extend (v: G) compare_objects compare_references copy (other: [like Current] HASH_TABLE_EX [G, K]) correct_mismatch extend (new: G; key: K) fill (other: CONTAINER [G]) force (new: G; key: K) forth go_to (c: CURSOR) make (n: INTEGER_32) make_equal (n: INTEGER_32) make_from_iterable_tuples (other: ITERABLE [TUPLE [G, K]]) make_with_key_tester (n: INTEGER_32; a_key_tester: detachable EQUALITY_TESTER [K]) merge (other: HASH_TABLE [G, K]) prune (v: G) prune_all (v: G) put (new: G; key: K) remove (key: K) replace (new: G; key: K) replace_key (new_key, old_key: K) search (key: K) start wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

-- Generated by Eiffel Studio --
For more details: eiffel.org