Automatic generation produced by ISE Eiffel

Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:
class SED_OBJECTS_TABLE General cluster: ise description: "Equivalent of HASH_TABLE [NATURAL_32, ANY], since this type cannot be written as ANY does not inherit from HASHABLE" create: make, table_make Ancestors HASH_TABLE [G, K -> detachable HASHABLE] SED_ABSTRACT_OBJECTS_TABLE* Queries after: BOOLEAN at alias "@" (key: POINTER): detachable NATURAL_32 capacity: INTEGER_32 changeable_comparison_criterion: BOOLEAN conflict: BOOLEAN current_keys: ARRAY [POINTER] cursor: CURSOR definite_item (key: POINTER): NATURAL_32 disjoint (other: HASH_TABLE [NATURAL_32, POINTER]): BOOLEAN Extendible: BOOLEAN found: BOOLEAN found_item: detachable NATURAL_32 Full: BOOLEAN has (key: POINTER): BOOLEAN has_item (v: NATURAL_32): BOOLEAN has_key (key: POINTER): BOOLEAN hash_code_of (p: POINTER): INTEGER_32 index (an_obj: separate ANY): NATURAL_32 inserted: BOOLEAN is_empty: BOOLEAN is_equal (other: [like Current] SED_OBJECTS_TABLE): BOOLEAN is_inserted (v: NATURAL_32): BOOLEAN item alias "[]" (key: POINTER): detachable NATURAL_32 item_for_iteration: NATURAL_32 iteration_item (i: INTEGER_32): NATURAL_32 iteration_lower: INTEGER_32 iteration_upper: INTEGER_32 key_for_iteration: POINTER linear_representation: ARRAYED_LIST [NATURAL_32] Mismatch_information: MISMATCH_INFORMATION new_cursor: HASH_TABLE_ITERATION_CURSOR [NATURAL_32, POINTER] not_found: BOOLEAN object_comparison: BOOLEAN occurrences (v: NATURAL_32): INTEGER_32 off: BOOLEAN prunable: BOOLEAN removed: BOOLEAN replaced: BOOLEAN same_keys (a_search_key, a_key: POINTER): BOOLEAN table_capacity: INTEGER_32 valid_cursor (c: CURSOR): BOOLEAN valid_iteration_index (i: INTEGER_32): BOOLEAN Commands accommodate (n: INTEGER_32) bag_put (v: NATURAL_32) collection_extend (v: NATURAL_32) compare_objects compare_references copy (other: [like Current] SED_OBJECTS_TABLE) correct_mismatch extend (new: NATURAL_32; key: POINTER) fill (other: CONTAINER [NATURAL_32]) force (new: NATURAL_32; key: POINTER) forth go_to (c: CURSOR) make_equal (n: INTEGER_32) make_from_iterable_tuples (other: ITERABLE [TUPLE [NATURAL_32, POINTER]]) merge (other: HASH_TABLE [NATURAL_32, POINTER]) prune (v: NATURAL_32) prune_all (v: NATURAL_32) put (new: NATURAL_32; key: POINTER) remove (key: POINTER) replace (new: NATURAL_32; key: POINTER) replace_key (new_key, old_key: POINTER) search (key: POINTER) start table_make (n: INTEGER_32) table_wipe_out wipe_out Constraints not is dotnet
Classes Clusters Cluster hierarchy Chart Relations Flat contracts Go to:

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