new do return new HashMap[K, V]
end
+redef class Set[E]
+ # Get an instance of `HashSet[E]`, the default implementation
+ new do return new HashSet[E]
+end
+
# A HashCollection is an array of HashNode[K] indexed by the K hash value
private abstract class HashCollection[K]
type N: HashNode[K]
end
end
- redef fun iterator: HashMapIterator[K, V] do return new HashMapIterator[K,V](self)
+ redef fun iterator do return new HashMapIterator[K,V](self)
redef fun length do return _the_length
_the_length = 0
end
+ # Build a list filled with the items of `coll`.
+ init from(coll: Map[K, V]) do
+ init
+ add_all(coll)
+ end
+
redef var keys: RemovableCollection[K] = new HashMapKeys[K, V](self) is lazy
redef var values: RemovableCollection[V] = new HashMapValues[K, V](self) is lazy
redef fun has_key(k) do return node_at(k) != null