general/serializable library

Classes

DoubleLinkedQueue<E>
A Queue implementation based on a double-linked list.
DoubleLinkedQueueEntry<E>
An entry in a doubly linked list.
FixedMap<K, V>
FixedMap - interface for Map constraints FixedMap - fixed set of keys optimized for small fixed set of keys guarantees all keys are present can guarantee non null return - if V is defined as non nullable
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.
IndexMap<K extends dynamic, V>
IndexMap Default implementation using parallel arrays
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.
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.
SerializableField<V>
SerializableField<V>/NamedField a key to each field, an type parameter, with an generated string, use as json key; effectively describe the memory allocation requirements maps entirety of the struct
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.

Mixins

Immutable<S extends Immutable<S>>
optional
Serializable<S extends Serializable<S>>
Serializable - mixin in 1 step for serialization provide toMap or implements MapBase and duplicate code until combine mixin is support mixin toMap<K extends Enum, V> implmenting Map would require subclasses to mixin MapBase

Extension Types

EnumMap
EnumMap A Map with the additional constraint that Keys are a fixed set, via Enum. creation implements FixedMap/IndexMap constraints factory constructors build IndexMap by default Adds Serialization using Enum.name to a Map, Keys inherit from Enum - index via Enum.index -> create a parallel array map by default String name via Enum.name -> directly use for serialization
EnumMapFactory
construct a Map<K extends Enum, V> from Map<String, V> on creation ensure all fields are valid

Extensions

EnumMapByName on Map<K, V>
Serialization of Map<Enum, V> interface Methods on loose contraints Map<Enum, V> Enum.name base methods are applicable regardless of EnumMap FixedMap constraints add fills existing Map only
EnumNamedValues on Iterable<MapEntry<K, V>>
IterableExtensions on Iterable<T>
Operations on iterables.
NullableIterableExtensions on Iterable<T?>
Operations on iterables with nullable elements.
SerializableKeys on StructForm<K, V>
SerializableKeysType on StructForm<K, Object>
SerializableMethods on Serializable<Serializable>

Typedefs

FieldMap<K extends Field<V>, V> = Map<K, V>
IterableBase<E> = Iterable<E>
Base class for implementing Iterable.
IterableMixin<E> = Iterable<E>
This Iterable mixin implements all Iterable members except iterator.
ListMixin<E> = ListBase<E>
Base mixin implementation of a List class.
MapMixin<K, V> = MapBase<K, V>
Mixin implementing a Map.
SerializableEntry<V> = ({SerializableField<V> key, V value})
SetMixin<E> = SetBase<E>
Mixin implementation of Set.