Base class for the dictionary backed by a linked list.
public abstract class base hash dictionary[readonly value key type, value value type]
Wrapper of an array that implements on-demand resizing and copy-on-write semantics. The same dictionary_state can be shared by multiple instances of base_hash_dictionarys.
protected class dictionary state[readonly value key type, value value type]
import idealmachineelementsarray
Specifies whether this instance of dictionary_state is writable. A single non-writable copy can be shared among multiple instances of base_hash_dictionary.
var boolean writable
Specifies how many elements are stored in this dictionary_state. The size is less or equal to the_buckets.size.
var nonnegative size
Construct a dictionary state with an array of specified size.
overload dictionary state(nonnegative initial size)
Construct a dictionary state with a table of default size.
overload dictionary state()
protected void clear()
Make sure the array is of at least the specified size.
void reserve(nonnegative reserve size)
protected equivalence with hash[key type] equivalence
protected var dictionary state[key type, value type] state
The number of elements in the collection.
implement nonnegative size
Specifies whether the collection has zero elements.
implement boolean is empty
Specifies whether the collection has more than zero elements. Shortcut for !is_empty.
implement boolean 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[dictionaryentry[key type, value type]] elements()
implement immutable dictionary[key type, value type] frozen copy()
implement value type or null get(key type key)
implement immutable set[key type] keys()
implement readonly collection[value type] values()
private string debug display()