← immutable hash dictionary ideal • runtime • elements • base hash set hash set →
Base class for the dictionary backed by a linked list.
public abstract class base hash set[readonly value element type]
Declaration: base hash set
Announcements: base hash set
Direct supertypes: set
All supertypes: collection / composite value / value / entity
namespace parameters
Declaration: parameters
Use: base hash set / base hash set
protected class hash cell[readonly value element type]
Declaration: hash cell
All supertypes: value / entity
Use: base hash set / base hash set / base hash set / base hash set / base hash set / base hash set / base hash set / hash set / hash set
protected element type the value
Declaration: the value
Use: base hash set
protected integer the hash
Declaration: the hash
Use: base hash set
protected var hash cell[element type] or null next
Declaration: next
Use: base hash set
public overload hash cell(element type the value, integer the hash, hash cell[element type] or null next)
Declaration: constructor
public overload hash cell(element type the value, integer the hash)
Declaration: constructor
Wrapper of an array that implements on-demand resizing and copy-on-write semantics. The same set_state can be shared by multiple instances of base_hash_sets.
protected class set state[readonly value element type]
Declaration: set state
All supertypes: value / entity
Use: base hash set / base hash set / set state / set state / set state / immutable hash set
import ideal • machine • elements • array
Specifies whether this instance of set_state is writable. A single non-writable copy can be shared among multiple instances of base_hash_set.
var boolean writable
Declaration: writable
Use: base hash set
Specifies how many elements are stored in this set_state. The size is less or equal to the_buckets.size.
var nonnegative size
Declaration: size
Use: base hash set / base hash set / base hash set / base hash set / base hash set
Construct a dictionary state with an array of specified size.
overload set state(nonnegative initial size)
Declaration: constructor
Construct a dictionary state with a table of default size.
overload set state()
Declaration: constructor
protected void clear()
Declaration: clear
Make sure the array is of at least the specified size.
void reserve(nonnegative reserve size)
Declaration: reserve
protected nonnegative bucket index(integer hash)
Declaration: bucket index
Use: base hash set
protected set state[element type] copy()
Declaration: copy
protected equivalence with hash[element type] equivalence
Declaration: equivalence
Use: equivalence / equivalence / equivalence / equivalence / equivalence
protected var set state[element type] state
Declaration: state
Use: state / state / state / state / state / state / state / state / state / state
protected overload base hash set(equivalence with hash[element type] equivalence)
Declaration: constructor
protected overload base hash set(equivalence with hash[element type] equivalence, set state[element type] state)
Declaration: constructor
The number of elements in the collection.
implement nonnegative size
Declaration: size
Direct overrides: size
Specifies whether the collection has zero elements.
implement boolean is empty
Declaration: is empty
Direct overrides: is empty
Use: is empty
Specifies whether the collection has more than zero elements. Shortcut for !is_empty.
implement boolean is not empty
Declaration: is not empty
Direct overrides: is not empty
Enumerates elements in some collection-defined order. This method returns a snapshot of the collection state, so subsequent mutations of the collection do not cause changes in the returned list.
implement immutable list[element type] elements()
Declaration: elements
Direct overrides: elements
implement immutable set[element type] frozen copy()
Declaration: frozen copy
Direct overrides: set
Directly overriden by: immutable hash set
implement boolean contains(element type key)
Declaration: contains
Direct overrides: set
← immutable hash dictionary ideal • runtime • elements • base hash set hash set →