end
redef class Set[E]
- # Get an instance of `HashMap[K, V]`, the default implementation
+ # Get an instance of `HashSet[E]`, the default implementation
new do return new HashSet[E]
end
# Build a list filled with the items of `coll`.
init from(coll: Map[K, V]) do
init
- recover_with(coll)
+ add_all(coll)
end
redef var keys: RemovableCollection[K] = new HashMapKeys[K, V](self) is lazy