View source
abstract thx.HashSet<T>(HashMap<T, Bool>)
Available on all platforms
A set is a list of unique, hashable values. Equality of items is determined using
a required function hashCode():Int
on the item instances.
Class Fields
Instance Fields
inline function difference(set:HashSet<T>):HashSet<T>
difference
creates a new HashSet
with elements from the first set excluding the elements
from the second.
inline function intersection(set:HashSet<T>):HashSet<T>
intersection
returns a HashSet with elements that are presents in both sets
inline function symmetricDifference(set:HashSet<T>):HashSet<T>
symmetricDifference
creates a new HashSet
with elements that appear in either of the sets, but not in both.
Equivalent to: s1.union(s2) - s1.intersection(s2)