collections
library
Classes
-
DoubleLinkedQueue<E>
-
A Queue implementation based on a double-linked list.
-
DoubleLinkedQueueEntry<E>
-
An entry in a doubly linked list.
-
HashMap<K, V>
-
A hash-table based implementation of Map.
-
HashSet<E>
-
An unordered hash-table based Set implementation.
-
HasNextIterator<E>
-
Wrapper for Iterator providing the pre-Dart 1.0 iterator interface.
-
HolderIterator<E>
-
-
ImmutableIterationHolder<E>
-
-
IndexBaseIterator<E>
-
-
IterableItems<E>
-
-
Iteration<E>
-
-
IterationBase<E>
-
-
IterationConstruct<E>
-
-
IterationHolder<E>
-
-
IterationItem<E>
-
-
IterationItemMap<K, V>
-
-
IterationList<E>
-
-
IterationMap<K, V>
-
-
IteratorBuild<E>
-
-
LargeIterable<VT, E>
-
-
LargeList<VT, E>
-
-
LinkedHashMap<K, V>
-
An insertion-ordered Map with expected constant-time lookup.
-
LinkedHashSet<E>
-
A LinkedHashSet is a hash-table based Set implementation.
-
LinkedList<E extends LinkedListEntry<E>>
-
A specialized double-linked list of elements that extends LinkedListEntry.
-
LinkedListEntry<E extends LinkedListEntry<E>>
-
An object that can be an element in a LinkedList.
-
ListBase<E>
-
Abstract implementation of a list.
-
ListQueue<E>
-
List based Queue.
-
MapBase<K, V>
-
Base class for implementing a Map.
-
MapView<K, V>
-
Wrapper around a class that implements Map that only exposes
Map
members.
-
MultiViewList<E>
-
-
OrderedMap<K, V>
-
-
Queue<E>
-
A Queue is a collection that can be manipulated at both ends. One
can iterate over the elements of a queue through forEach or with
an Iterator.
-
SetBase<E>
-
Base implementation of Set.
-
SplayTreeMap<K, V>
-
A Map of objects that can be ordered relative to each other.
-
SplayTreeSet<E>
-
A Set of objects that can be ordered relative to each other.
-
UnmodifiableListView<E>
-
An unmodifiable List view of another List.
-
UnmodifiableMapBase<K, V>
-
Basic implementation of an unmodifiable Map.
-
UnmodifiableMapView<K, V>
-
View of a Map that disallow modifying the map.
-
UnmodifiableSetView<E>
-
An unmodifiable Set view of another Set.