LinkedHashSet<E> class

A LinkedHashSet is a hash-table based Set implementation.

A LinkedHashSet is a hash-table based Set implementation.

The LinkedHashSet also keep track of the order that elements were inserted in, and iteration happens in first-to-last insertion order.

The elements of a LinkedHashSet must have consistent Object.operator== and Object.hashCode implementations. This means that the == operator must define a stable equivalence relation on the elements (reflexive, symmetric, transitive, and consistent over time), and that hashCode must be the same for objects that are considered equal by ==.

The set allows null as an element.

Iteration of elements is done in element insertion order. An element that was added after another will occur later in the iteration. Adding an element that is already in the set does not change its position in the iteration order, but removing an element and adding it again, will make it the last element of an iteration.

Most simple operations on HashSet are done in (potentially amortized) constant time: add, contains, remove, and length, provided the hash codes of objects are well distributed..

Implements:

Constructors

LinkedHashSet ( {bool equals(E e1, E e2), int hashCode(E e), bool isValidKey(potentialKey)} )
Create an insertion-ordered hash set using the provided equals and hashCode.
LinkedHashSet.identity ( )
Creates an insertion-ordered identity-based set.
LinkedHashSet.from ( Iterable<E> elements )
Create a linked hash set containing all elements.

Instance Properties

iterator Iterator<E>
read-only
isEmpty bool Inherited
read-only
isNotEmpty bool Inherited
read-only
first E Inherited
read-only
last E Inherited
read-only
single E Inherited
read-only
length int Inherited
read-only

Instance Methods

forEach ( void action(E element) ) → void
Executes a function on each element of the set.
remove Inherited ( Object value ) → bool
Removes value from the set. Returns true if value was in the set. Returns false otherwise. The method has no effect if value value was not in the set.
clear Inherited ( ) → void
Removes all elements in the set.
take Inherited ( int n ) → Iterable<E>
Returns a lazy iterable of the count first elements of this iterable.
map Inherited ( dynamic f(E element) ) → Iterable
Returns a new lazy Iterable with elements that are created by calling f on each element of this Iterable in iteration order.
intersection Inherited ( Set<Object> other ) → Set<E>
Returns a new set which is the intersection between this set and other.
takeWhile Inherited ( bool test(E value) ) → Iterable<E>
Returns a lazy iterable of the leading elements satisfying test.
fold Inherited ( initialValue, dynamic combine(previousValue, E element) ) → dynamic
Reduces a collection to a single value by iteratively combining each element of the collection with an existing value
toSet Inherited ( ) → Set<E>
Creates a [Set] containing the same elements as this iterable.
firstWhere Inherited ( bool test(E element), {E orElse()} ) → E
Returns the first element that satisfies the given predicate test.
difference Inherited ( Set<E> other ) → Set<E>
Returns a new set with the the elements of this that are not in other.
skipWhile Inherited ( bool test(E value) ) → Iterable<E>
Returns an Iterable that skips leading elements while test is satisfied.
join Inherited ( [String separator = ""] ) → String
Converts each element to a String and concatenates the strings.
contains Inherited ( Object value ) → bool
Returns true if value is in the set.
union Inherited ( Set<E> other ) → Set<E>
Returns a new set which contains all the elements of this set and other.
removeAll Inherited ( Iterable<Object> elements ) → void
Removes each element of elements from this set.
add Inherited ( E value ) → bool
Adds value into the set. Returns true if value was added to the set.
lastWhere Inherited ( bool test(E element), {E orElse()} ) → E
Returns the last element that satisfies the given predicate test.
singleWhere Inherited ( bool test(E element) ) → E
Returns the single element that satisfies test.
addAll Inherited ( Iterable<E> elements ) → void
Adds all elements to this Set.
reduce Inherited ( E combine(E value, E element) ) → E
Reduces a collection to a single value by iteratively combining elements of the collection using the provided function.
containsAll Inherited ( Iterable<Object> other ) → bool
Returns whether this Set contains all the elements of other.
removeWhere Inherited ( bool test(E element) ) → void
Removes all elements of this set that satisfy test.
any Inherited ( bool f(E element) ) → bool
Checks whether any element of this iterable satisfies test.
every Inherited ( bool f(E element) ) → bool
Checks whether every element of this iterable satisfies test.
toList Inherited ( {bool growable: true} ) → List<E>
Creates a List containing the elements of this Iterable.
where Inherited ( bool f(E element) ) → Iterable<E>
Returns a new lazy Iterable with all elements that satisfy the predicate test.
lookup Inherited ( Object object ) → E
If an object equal to object is in the set, return it.
skip Inherited ( int n ) → Iterable<E>
Returns an Iterable that provides all but the first count elements.
expand Inherited ( Iterable f(E element) ) → Iterable
Expands each element of this Iterableinto zero or more elements.
retainAll Inherited ( Iterable<Object> elements ) → void
Removes all elements of this set that are not elements in elements.
retainWhere Inherited ( bool test(E element) ) → void
Removes all elements of this set that fail to satisfy test.
elementAt Inherited ( int index ) → E
Returns the indexth element.