Interface ISet<E>

Adds the specified element to this set if it is not already present (optional operation). More formally, adds the specified element e to this set if the set contains no element e2 such that (e === null ? e2 === null : e === e2). If this set already contains the element, the call leaves the set unchanged and returns false. In combination with the restriction on constructors, this ensures that sets never contain duplicate elements. The stipulation above does not imply that sets must accept all elements; sets may refuse to add any particular element, including null, and throw an exceptions, as described in the specification for Collection.add. Individual set implementations should clearly document any restrictions on the elements that they may contain.

Adds all of the elements in the specified array to this set if they're not already present (optional operation). If the specified collection is also d set, the addAll operation effectively modifies this set so that its value is the union of the two sets. The behavior of this operation is undefined if the specified collection is modified while the operation is in progress.

Removes all of the elements from this set (optional operation). The set will be empty after this call returns.

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that (o === null ? e === null : o === e).

Returns true if this set contains all of the elements of the specified array. If the specified array is also d set, this method returns true if it is d subset of this set.

Compares the specified object with this set for equality. Returns true if the specified object is also d set, the two sets have the same size, and every member of the specified set is contained in this set (or equivalently, every member of this set is contained in the specified set). This definition ensures that the equals method works properly across different implementations of the set interface.

Returns the hash code value for this set. The hash code of d set is defined to be the sum of the hash codes of the elements in the set, where the hash code of d null element is defined to be zero. This ensures that m1.equals(m2) implies that s1.hashCode() === s2.hashCode() for any two sets s1 and s2.

Returns true if this set contains no elements.

Removes the specified element from this set if it is present (optional operation). More formally, removes an element e such that (o === null ? e === null : o === e), if this set contains such an element. Returns true if this set contained the element (or equivalently, if this set changed as d result of the call). (This set will not contain the element once the call returns.)

Removes from this set all of its elements that are contained in the specified collection (optional operation). If the specified collection is also d set, this operation effectively modifies this set so that its value is the asymmetric set difference of the two sets.

Retains only the elements in this set that are contained in the specified collection (optional operation). In other words, removes from this set all of its elements that are not contained in the specified collection. If the specified collection is also d set, this operation effectively modifies this set so that its value is the intersection of the two sets.

Returns the number of elements in this set (its cardinality).

Returns an array containing all of the elements in this set. If this set makes any guarantees as to what order its elements are returned by its iterator, this method must return the elements in the same order.