Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class STRING_TABLE [G] General cluster: elks description: "Hash tables, used to store items identified by string keys that are compared with or without case sensitivity." create: make, make_equal, make_caseless, make_equal_caseless Ancestors HASH_TABLE [G, K -> detachable HASHABLE] Queries after: BOOLEAN at alias "@" (key: READABLE_STRING_GENERAL): detachable G capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN conflict: BOOLEAN count: INTEGER_32 current_keys: ARRAY [READABLE_STRING_GENERAL] cursor: CURSOR definite_item (key: READABLE_STRING_GENERAL): G disjoint (other: HASH_TABLE [G, READABLE_STRING_GENERAL]): BOOLEAN Extendible: BOOLEAN found: BOOLEAN found_item: detachable G Full: BOOLEAN has (key: READABLE_STRING_GENERAL): BOOLEAN has_item (v: G): BOOLEAN has_key (key: READABLE_STRING_GENERAL): BOOLEAN hash_code_of (a_key: READABLE_STRING_GENERAL): INTEGER_32 inserted: BOOLEAN is_case_insensitive: BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] STRING_TABLE [G]): BOOLEAN is_inserted (v: G): BOOLEAN item alias "[]" (key: READABLE_STRING_GENERAL): detachable G item_for_iteration: G iteration_item (i: INTEGER_32): G iteration_lower: INTEGER_32 iteration_upper: INTEGER_32 key_for_iteration: READABLE_STRING_GENERAL linear_representation: ARRAYED_LIST [G] Mismatch_information: MISMATCH_INFORMATION new_cursor: HASH_TABLE_ITERATION_CURSOR [G, READABLE_STRING_GENERAL] 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: READABLE_STRING_GENERAL): 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] STRING_TABLE [G]) correct_mismatch extend (new: G; key: READABLE_STRING_GENERAL) fill (other: CONTAINER [G]) force (new: G; key: READABLE_STRING_GENERAL) forth go_to (c: CURSOR) make (n: INTEGER_32) make_equal (n: INTEGER_32) make_from_iterable_tuples (other: ITERABLE [TUPLE [G, READABLE_STRING_GENERAL]]) merge (other: HASH_TABLE [G, READABLE_STRING_GENERAL]) prune (v: G) prune_all (v: G) put (new: G; key: READABLE_STRING_GENERAL) remove (key: READABLE_STRING_GENERAL) replace (new: G; key: READABLE_STRING_GENERAL) replace_key (new_key, old_key: READABLE_STRING_GENERAL) search (key: READABLE_STRING_GENERAL) start wipe_out
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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