Automatic generation produced by ISE Eiffel

Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 
class
	EQUALITY_HASH_TABLE [G -> detachable ANY, H -> HASHABLE]

General
	obsolete: "[2013/01/10] Use `{HASH_TABLE [Generic #1, Generic #2]}.make_equal`"
	cluster: base_extension
	description: "HASH_TABLE with different is_equal that checks the values."
	create: make, table_make

Ancestors
	HASH_TABLE [G, K -> detachable HASHABLE]

Queries
	after: BOOLEAN
	at alias "@" (key: H): detachable G
	capacity: INTEGER_32
	changeable_comparison_criterion: BOOLEAN
	conflict: BOOLEAN
	count: INTEGER_32
	current_keys: ARRAY [H]
	cursor: CURSOR
	definite_item (key: H): G
	disjoint (other: HASH_TABLE [G, H]): BOOLEAN
	Extendible: BOOLEAN
	found: BOOLEAN
	found_item: detachable G
	Full: BOOLEAN
	has (key: H): BOOLEAN
	has_item (v: G): BOOLEAN
	has_key (key: H): BOOLEAN
	hash_code_of (a_key: attached H): INTEGER_32
	inserted: BOOLEAN
	is_empty: BOOLEAN
	is_equal (other: [like Current] EQUALITY_HASH_TABLE [G, H]): BOOLEAN
	is_inserted (v: G): BOOLEAN
	item alias "[]" (key: H): detachable G
	item_for_iteration: G
	iteration_item (i: INTEGER_32): G
	iteration_lower: INTEGER_32
	iteration_upper: INTEGER_32
	key_for_iteration: H
	linear_representation: ARRAYED_LIST [G]
	Mismatch_information: MISMATCH_INFORMATION
	new_cursor: HASH_TABLE_ITERATION_CURSOR [G, H]
	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: H): 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] EQUALITY_HASH_TABLE [G, H])
	correct_mismatch
	extend (new: G; key: H)
	fill (other: CONTAINER [G])
	force (new: G; key: H)
	forth
	go_to (c: CURSOR)
	make (n: INTEGER_32)
	make_from_iterable_tuples (other: ITERABLE [TUPLE [G, H]])
	merge (other: HASH_TABLE [G, H])
	prune (v: G)
	prune_all (v: G)
	put (new: G; key: H)
	remove (key: H)
	replace (new: G; key: H)
	replace_key (new_key, old_key: H)
	search (key: H)
	start
	table_make (n: INTEGER_32)
	wipe_out



Classes
Clusters
Cluster hierarchy
Chart
Relations
Flat contracts
Go to: 

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