Type Hierarchy:
Satisfied Interfaces: Category, Cloneable<Set<Element>>, Collection<Element>, Iterable<Element,Null>, Set<Element>

An implementation of Set that wraps an Iterable of elements. All operations on this Set are performed on the Iterable.

By: Enrique Zamudio
Initializer
LazySet({Element*} elems)
Attributes
cloneSource Code
shared actual LazySet<Element> clone

Obtain a clone of this object. For a mutable object, this should return a copy of the object. For an immutable object, it is acceptable to return the object itself.

Refined declaration: clone
hashSource Code
shared actual default Integer hash

The hash value of the value, which allows the value to be an element of a hash-based set or key of a hash-based map. Implementations must respect the constraint that if x==y then x.hash==y.hash.

Refined declaration: hash
sizeSource Code
shared actual Integer size

The number of elements returned by the iterator of this iterable object, if the iterator terminates. In the case of an iterable whose elements are not countable, this operation never terminates.

Refined declaration: size
Inherited Attributes
Attributes inherited from: Object
Attributes inherited from: Cloneable<Clone>
Attributes inherited from: Collection<Element>
Attributes inherited from: Iterable<Element,Absent>
Attributes inherited from: Set<Element>
Methods
complementSource Code
shared actual Set<Element> complement<Other>(Set<Other> set)
given Other satisfies Object

Returns a new Set containing all the elements in this Set that are not contained in the given Set.

Refined declaration: complement
equalsSource Code
shared actual default Boolean equals(Object that)

Determine if two values are equal. Implementations should respect the constraints that:

  • if x===y then x==y (reflexivity),
  • if x==y then y==x (symmetry),
  • if x==y and y==z then x==z (transitivity).

Furthermore it is recommended that implementations ensure that if x==y then x and y have the same concrete class.

Refined declaration: equals
exclusiveUnionSource Code
shared actual Set<Element|Other> exclusiveUnion<Other>(Set<Other> other)
given Other satisfies Object

Returns a new Set containing only the elements contained in either this Set or the given Set, but no element contained in both sets.

Refined declaration: exclusiveUnion
intersectionSource Code
shared actual Set<Element&Other> intersection<Other>(Set<Other> set)
given Other satisfies Object

Returns a new Set containing only the elements that are present in both this Set and the given Set.

Refined declaration: intersection
iteratorSource Code
shared actual Iterator<Element> iterator()

An iterator for the elements belonging to this container.

Refined declaration: iterator
unionSource Code
shared actual Set<Element|Other> union<Other>(Set<Other> set)
given Other satisfies Object

Returns a new Set containing all the elements of this Set and all the elements of the given Set.

Refined declaration: union
Inherited Methods
Methods inherited from: Category
Methods inherited from: Iterable<Element,Absent>
Methods inherited from: Set<Element>