Automatic generation produced by ISE Eiffel
class SEARCH_TABLE [H -> HASHABLE] General cluster: base_extension description: "Set based on implementation of HASH_TABLE for fast lookup." create: make, make_map, make_with_key_tester Ancestors ANY ITERABLE* [G] Queries after: BOOLEAN count: INTEGER_32 cursor: INTEGER_32 disjoint (other: [like Current] SEARCH_TABLE [H]): BOOLEAN found: BOOLEAN found_item: detachable H has (key: H): BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] SEARCH_TABLE [H]): BOOLEAN item (key: H): detachable H item_for_iteration: H key_at (n: INTEGER_32): detachable H key_for_iteration: H key_tester: detachable EQUALITY_TESTER [H] linear_representation: ARRAYED_LIST [H] new_cursor: SEARCH_TABLE_ITERATION_CURSOR [H] next_iteration_position (a_position: [like iteration_position] INTEGER_32): [like iteration_position] INTEGER_32 off: BOOLEAN same_keys (a_search_key, a_key: H): BOOLEAN valid_cursor (c: [like cursor] INTEGER_32): BOOLEAN valid_key (k: detachable H): BOOLEAN Commands change_key (new_key, old_key: H) clear_all copy (other: [like Current] SEARCH_TABLE [H]) force (key: H) forth go_to (c: [like cursor] INTEGER_32) merge (other: SEARCH_TABLE [H]) prune (key: H) put (key: H) remove (key: H) resize (n: INTEGER_32) search (key: H) start wipe_out Constraints count big enough -- Generated by Eiffel Studio --
For more details: eiffel.org