more library

Classes

AtkinPrimeSieve: Prime sieve of Atkin (linear sieve).
BigIntRange: A range of BigInt containing an arithmetic progressions.
BiMap<K, V>: A bi-map associates keys with values and values with keys.
BitList: An space efficient List that stores boolean values.
Bounds: Axis-aligned bounding box.
BreadthFirstIterable<V>: Iterable over the breadth-first traversal of vertices.
Cache<K, V>
CharMatcher: Abstract character matcher function.
Complex: A complex number of the form a + b*i.
DateTimePrinter: Prints DateTime objects in custom ways.
DelegateCache<K, V>: A cache that delegates to another one.
DepthFirstIterable<V>: Iterable over the depth-first traversal of vertices. The vertices are emitted pre-order, that is right when they are first discovered.
DepthFirstPostOrderIterable<V>: Iterable over the post-order depth-first traversal of vertices. The vertices are emitted post-order, that is after all its descendants have been discovered.
DinicMaxFlow<V>: Dinic max flow algorithm in O(V^2*E).
DoubleRange: A range of doubles containing an arithmetic progressions.
DurationPrinter: Prints Duration objects in custom ways.
Edge<V, E>: An edge withing a graph connects a source and a target vertex.
Either<L, R>: A disjoint union with a value of either type L or type R.
EratosthenesPrimeSieve: Prime sieve of Eratosthenes.
EulerPrimeSieve: Prime sieve of Euler (linear sieve).
FenwickTree: A fenwick tree (or binary indexed tree) is a data structure that can efficiently update and calculate sums in an array of values.
FieldPrinter<T>: Abstract field description.
FixedNumberPrinter<T extends num>: Prints numbers in a fixed format.
ForwardingGraph<V, E>: Graph that forwards to a delegate implementation.
Fraction: A rational number.
Graph<V, E>: Abstract base class of graphs.
GraphFactory<V, E>: Factory methods to create common graphs types efficiently.
HumanNumberPrinter<T extends num>: Prints numbers in a custom human readable string.
IntegerRange: A range of integers containing an arithmetic progressions.
Interval<T extends Comparable<T>>: An interval over a continuous ordering of type T.
IntervalTree<K extends Comparable<K>, V>: Immutable IntervalTree that can hold arbitrary elements of type V with Intervals of type K. The data structure is built in O(n*log(n)) and can be queried in O(log(n)).
ListMultimap<K, V>: A multimap that stores values in a List, and that maintains the insertion order of values of a given key. A factory can be provided to create custom value collections.
LiteralPrinter<T>: Prints a string literal.
MapWithDefault<K, V>
Multiset<E>: A generalized Set (or Bag) in which members are allowed to appear more than once.
NumeralSystem: A class defining different numeral systems for number printing.
ObjectPrinter<T>: Configurable printer for standard objects.
Optional<T>: A container object which may or may not contain a value of type T.
OrdinalNumberPrinter: Prints numbers in an ordinal format.
Path<V, E>: A path withing a graph connects a series of vertices through their respective edges and values.
PrimeSieve: Abstract sieve implementation for primes up to and including max.
Printer<T>: An abstract function that prints objects of type T.
Quaternion: A quaternion number of the form w + x*i + y*j + z*k.
RandomWalkIterable<V>: Iterable producing a random walk over a graph.
Range<T>: Abstract superclass of an arithmetic progressions.
RangeIterator<T>: An Iterator over a Range.
RTree<T>: Abstract base implementation of the R-Tree data structure, based on the Python implementation from https://github.com/lukas-shawford/rtreelib.
RTreeEntry<T>: R-Tree entry, containing either a pointer to a child RTreeNode instance (if this is not a leaf entry), or data (if this is a leaf entry).
RTreeNode<T>: An R-Tree node, which is a container for R-Tree entries. The node is a leaf node if its entries contain data; otherwise, if it is a non-leaf node, then its entries contain pointers to children nodes.
ScientificNumberPrinter<T extends num>: Prints numbers in a scientific format.
SequencePrinter<T>: Prints a sequence of printers.
SetMultimap<K, V>: A multimap that stores values in a Set, and that keeps the unique values of a given key. A factory can be provided to create custom value collections.
SignNumberPrinter<T extends num>: Prints numbers in various formats.
SortedList<E>: A sorted-list that remains sorted by a Comparator as elements get added.
StandardPrinter<T>: Calls the standard toString method.
StoerWagnerMinCut<V, E>: Stoer–Wagner minimum cut algorithm in O(VE + Vlog(V)).
StorageStrategy<T>: Encapsulates data structures used for the various graph algorithms.
TopologicalIterable<V>: Iterable over the topological sorting of vertices. This traversal requires a predecessor-function, and ignores nodes that are part of cycles.
Trie<K, P extends Comparable, V>: A generalized Trie (or prefix tree) which keys of type K split into parts of type P, and values of type V.
TrieNode<K, P extends Comparable, V>: Abstract implementation of the nodes in a Trie.
TrieNodeEntry<K, P extends Comparable, V>: Abstract TrieNode with a possible key and value.
TrieNodeList<K, P extends Comparable, V>: TrieNode that holds children in a sorted List.
TrieNodeMap<K, P extends Comparable, V>: TrieNode that holds children in a Map.
TypeMap<T>: A type-map associates dart runtime types to an instance of that type.
TypePrinter<T>: Printer of the dynamic runtime type.
UnicodeCharMatcher: Character matcher function that classifies characters using official Unicode categories and properties.

Enums

TimeUnit: Different units of time.
TruncateMethod: Method to truncate.

Mixins

CloseTo<T>
CompareOperators<T>: A generic mixin that provides standard comparison operators like <, <=, >= and > provided the class is Comparable.
ToStringPrinter: A mixin to provide a consistent toString() implementation.

Extensions

AccessorsDateTimeExtension on DateTime
AlgorithmsGraphExtension on Graph<V, E>
AtlasGraphFactoryExtension on GraphFactory<V, E>
BigIntExtension on BigInt
BigIntRangeExtension on BigInt
BiMapOnIterableExtension on Iterable<E>
BiMapOnMapExtension on Map<K, V>
BinomialBigIntExtension on BigInt
BinomialIntegerExtension on int
BitListExtension on Iterable<bool>
BitUint32Extension on int: Bit twiddling loosely based on http://graphics.stanford.edu/~seander/bithacks.html.
BreadthFirstGraphExtension on Graph<V, E>
BufferExtension on Stream<E>
BuilderPrinterExtension on Printer<T>
ChunkedIterableExtension on Iterable<E>
CloseToNumExtension on num
CollectionGraphFactoryExtension on GraphFactory<V, E>
CombinationsIterableExtension on Iterable<E>
CompleteGraphFactoryExtension on GraphFactory<V, E>: https://mathworld.wolfram.com/CompleteGraph.html
CompoundComparator on Comparator<T>
CompoundIterableComparator on Iterable<Comparator<T>>
ConnectedGraphExtension on Graph<V, E>
ConvertFirstLastStringExtension on String
ConvertToAllDurationExtension on Duration
ConvertToDurationExtension on Duration
CopyGraphExtension on Graph<V, E>
CountIterableExtension on Iterable<E>
Curry1 on Map1<T1, R>
Curry10 on Map10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R>
Curry2 on Map2<T1, T2, R>
Curry3 on Map3<T1, T2, T3, R>
Curry4 on Map4<T1, T2, T3, T4, R>
Curry5 on Map5<T1, T2, T3, T4, T5, R>
Curry6 on Map6<T1, T2, T3, T4, T5, T6, R>
Curry7 on Map7<T1, T2, T3, T4, T5, T6, T7, R>
Curry8 on Map8<T1, T2, T3, T4, T5, T6, T7, T8, R>
Curry9 on Map9<T1, T2, T3, T4, T5, T6, T7, T8, T9, R>
DeepFlattenIterableExtension on Iterable
DefaultMapExtension on Map<K, V>
DepthFirstGraphExtension on Graph<V, E>
DepthFirstPostOrderGraphExtension on Graph<V, E>
DigitsBigIntExtension on BigInt
DigitsIntegerExtension on int
DoubleExtension on double
DoubleRangeExtension on double
DurationIntervalDateTimeExtension on Interval<DateTime>
EmptyGraphFactoryExtension on GraphFactory<V, E>
EmptyPrinterExtension on Printer<Iterable<T>>
ExportGraphExtension on Graph<V, E>
FactorialBigIntExtension on BigInt
FactorialIntegerExtension on int
FlatMapIterableExtension on Iterable<E>
FlatMapStreamExtension on Stream<E>
FlattenIterableExtension on Iterable<Iterable<E>>
FlattenStreamIterableExtension on Stream<Iterable<E>>
FlattenStreamStreamExtension on Stream<Stream<E>>
GcdBigIntIterableExtension on Iterable<BigInt>
GcdIntegerIterableExtension on Iterable<int>
GroupIterableExtension on Iterable<V>
GroupMapEntryExtension on Group<K, V>: Extension to access the index on the Group values.
HyperbolicNumberExtension on num
IndentDedentStringExtension on String
IndexedIterableExtension on Iterable<E>
IndexedMapEntryExtension on Indexed<E>: Extension to access the index on a Indexed value.
IndicesIterableExtension on Iterable<Object?>
IntegerRangeExtension on int
IterablePrinterExtension on Printer<T>
LargestComparator on Comparator<T>
LcmBigIntExtension on BigInt
LcmBigIntIterableExtension on Iterable<BigInt>
LcmIntegerExtension on int
LcmIntegerIterableExtension on Iterable<int>
LexicographicalComparator on Comparator<T>
ListMultimapOnIterableExtension on Iterable<E>
ListMultimapOnMapExtension on Map<K, V>
LogicalGraphExtension on Graph<V, E>
MapGraphExtension on Graph<V, E>
MathNumberExtension on num
MinMaxComparator on Comparator<T>
MultisetExtension on Iterable<T>
NullPrinterExtension on Printer<T>
NullsFirstComparator on Comparator<T>
NullsLastComparator on Comparator<T>
NumericPathExtension on Path<V, num>
OperatorsIterableExtension on Iterable<E>
OrderedComparator on Comparator<T>
PadPrinterExtension on Printer<T>
PairwiseIterableExtension on Iterable<E>
Partial1 on Map1<T1, R>
Partial10 on Map10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R>
Partial2 on Map2<T1, T2, R>
Partial3 on Map3<T1, T2, T3, R>
Partial4 on Map4<T1, T2, T3, T4, R>
Partial5 on Map5<T1, T2, T3, T4, T5, R>
Partial6 on Map6<T1, T2, T3, T4, T5, T6, R>
Partial7 on Map7<T1, T2, T3, T4, T5, T6, T7, R>
Partial8 on Map8<T1, T2, T3, T4, T5, T6, T7, T8, R>
Partial9 on Map9<T1, T2, T3, T4, T5, T6, T7, T8, T9, R>
PartiteGraphFactoryExtension on GraphFactory<V, E>: https://mathworld.wolfram.com/Completek-PartiteGraph.html
PartitionIterableExtension on Iterable<E>
PartitionStringExtension on String
PathGraphFactoryExtension on GraphFactory<V, E>: https://mathworld.wolfram.com/PathGraph.html
PeriodicalDateTimeExtension on DateTime
PermutationComparableListExtension on List<E>
PermutationIterableExtension on Iterable<E>
PolynomialIterableExtension on Iterable<num>
PowerSetIterableExtension on Iterable<E>
PredicateComparator on Comparator<T>
PrefixSuffixStringExtension on String
ProbablyPrimeBigIntExtension on BigInt
ProbablyPrimeComplexExtension on Complex
ProbablyPrimeIntegerExtension on int
Product2IterableExtension on (Iterable<T1>, Iterable<T2>)
ProductIterableExtension on Iterable<Iterable<E>>
RandomGraphFactoryExtension on GraphFactory<V, E>: Creates random graphs using different models.
RandomIterableExtension on Iterable<E>
RandomWalkGraphExtension on Graph<V, E>
RepeatIterableExtension on Iterable<E>
ResultOfComparator on Comparator<R>
ResultOfPrinterExtension on Printer<R>
ReversedComparator on Comparator<T>
ReversedGraphExtension on Graph<V, E>
RingGraphFactoryExtension on GraphFactory<V, E>
RotateListExtension on List<E>
RotateQueueExtension on Queue<E>
ScopeFunctionExtension on T
SearchComparator on Comparator<T>
SeparatedIterableExtension on Iterable<E>
SeparatePrinterExtension on Printer<T>
SequencePrinterIterableExtension on Iterable<Printer<T>>
SequencePrinterPrinterExtension on Printer<T>
SetMultimapOnIterableExtension on Iterable<E>
SetMultimapOnMapExtension on Map<K, V>
SmallestComparator on Comparator<T>
SortComparator on Comparator<T>
SortedListIterableExtension on Iterable<E>
StarGraphFactoryExtension on GraphFactory<V, E>: https://mathworld.wolfram.com/StarGraph.html
StringListExtension on String
TakeSkipListExtension on List<E>
TakeSkipPrinterExtension on Printer<T>
TakeSkipStringExtension on String
TapExtension on Stream<E>
ToMapIterableExtension on Iterable<E>
TopologicalGraphExtension on Graph<V, E>
TreeGraphFactoryExtension on GraphFactory<V, E>: Creates m-ary trees (also known as n-ary, k-ary or k-way tree) in which each node has no more than m children.
TrimPrinterExtension on Printer<T>
TruncatePrinterExtension on Printer<T>
TruncateToDateTimeExtension on DateTime
Tuple on Record: Extension methods on Record.
Tuple0 on (): Extension methods on Record with 0 positional elements.
Tuple1 on (T1): Extension methods on Record with 1 positional element.
Tuple2 on (T1, T2): Extension methods on Record with 2 positional elements.
Tuple3 on (T1, T2, T3): Extension methods on Record with 3 positional elements.
Tuple4 on (T1, T2, T3, T4): Extension methods on Record with 4 positional elements.
Tuple5 on (T1, T2, T3, T4, T5): Extension methods on Record with 5 positional elements.
Tuple6 on (T1, T2, T3, T4, T5, T6): Extension methods on Record with 6 positional elements.
Tuple7 on (T1, T2, T3, T4, T5, T6, T7): Extension methods on Record with 7 positional elements.
Tuple8 on (T1, T2, T3, T4, T5, T6, T7, T8): Extension methods on Record with 8 positional elements.
Tuple9 on (T1, T2, T3, T4, T5, T6, T7, T8, T9): Extension methods on Record with 9 positional elements.
UniqueIterableExtension on Iterable<E>
UnmodifiableGraphExtension on Graph<V, E>
WhereGraphExtension on Graph<V, E>
WherePrinterExtension on Printer<T>
WhereTypeExtension on Stream<E>
WindowIterableExtension on Iterable<E>
WindowStreamExtension on Stream<E>
WrapUnwrapStringExtension on String
Zip2IterableExtension on (Iterable<T1>, Iterable<T2>)
ZipIterableExtension on Iterable<Iterable<E>>

Constants

accurateConversion → const UnitConversion: Accurate conversion scheme from different TimeUnits to microseconds.
casualConversion → const UnitConversion: Casual conversion scheme from different TimeUnits to microseconds.
isJavaScript → const bool: True, if the code is running in JavaScript.
safeIntegerBits → const int: The safe bits of an int value. In the Dart VM integer are represented using 63 bits, in JavaScript we only have 53.

Properties

maxSafeInteger → int: The maximum safe value of an int.
final
minSafeInteger → int: The minimum safe value of an int.
final
unicodeCodePointPrinter → Printer<int>: Prints a unicode code-point.
final

Functions

aStarSearch<V>({required Iterable<V> startVertices, required bool targetPredicate(V vertex), required Iterable<V> successorsOf(V vertex), required num costEstimate(V source), num edgeCost(V source, V target)?, bool includeAlternativePaths = false, StorageStrategy<V>? vertexStrategy}) → Iterable<Path<V, num>>: A-Star search algorithm.
bronKerboschCliques<V>(Iterable<V> vertices, {required Iterable<V> neighboursOf(V vertex), required StorageStrategy<V> vertexStrategy}) → Iterable<Set<V>>: The Bron–Kerbosch algorithm enumerates all maximal cliques in an undirected graph. This implementation uses the variation with pivoting. The algorithm has exponential complexity, but for graphs with small outgoing vertex degree is fast.
constantFunction0<R>(R value) → Map0<R>: Constant function with 0 positional arguments.
constantFunction1<T1, R>(R value) → Map1<T1, R>: Constant function with 1 positional argument.
constantFunction10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R>(R value) → Map10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R>: Constant function with 10 positional arguments.
constantFunction2<T1, T2, R>(R value) → Map2<T1, T2, R>: Constant function with 2 positional arguments.
constantFunction3<T1, T2, T3, R>(R value) → Map3<T1, T2, T3, R>: Constant function with 3 positional arguments.
constantFunction4<T1, T2, T3, T4, R>(R value) → Map4<T1, T2, T3, T4, R>: Constant function with 4 positional arguments.
constantFunction5<T1, T2, T3, T4, T5, R>(R value) → Map5<T1, T2, T3, T4, T5, R>: Constant function with 5 positional arguments.
constantFunction6<T1, T2, T3, T4, T5, T6, R>(R value) → Map6<T1, T2, T3, T4, T5, T6, R>: Constant function with 6 positional arguments.
constantFunction7<T1, T2, T3, T4, T5, T6, T7, R>(R value) → Map7<T1, T2, T3, T4, T5, T6, T7, R>: Constant function with 7 positional arguments.
constantFunction8<T1, T2, T3, T4, T5, T6, T7, T8, R>(R value) → Map8<T1, T2, T3, T4, T5, T6, T7, T8, R>: Constant function with 8 positional arguments.
constantFunction9<T1, T2, T3, T4, T5, T6, T7, T8, T9, R>(R value) → Map9<T1, T2, T3, T4, T5, T6, T7, T8, T9, R>: Constant function with 9 positional arguments.
delegateComparator<T, R extends Comparable<R>>(R transformation(T value)) → Comparator<T>: Creates a comparator that compares values of type T but delegates the decision to a Comparable<R> with the provided transformation.
dijkstraSearch<V>({required Iterable<V> startVertices, required bool targetPredicate(V vertex), required Iterable<V> successorsOf(V vertex), num edgeCost(V source, V target)?, bool includeAlternativePaths = false, StorageStrategy<V>? vertexStrategy}) → Iterable<Path<V, num>>: Dijkstra's search algorithm.
emptyFunction0() → void: Empty function with 0 positional arguments.
emptyFunction1<T1>(T1 arg1) → void: Empty function with 1 positional argument.
emptyFunction10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10>(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9, T10 arg10) → void: Empty function with 10 positional arguments.
emptyFunction2<T1, T2>(T1 arg1, T2 arg2) → void: Empty function with 2 positional arguments.
emptyFunction3<T1, T2, T3>(T1 arg1, T2 arg2, T3 arg3) → void: Empty function with 3 positional arguments.
emptyFunction4<T1, T2, T3, T4>(T1 arg1, T2 arg2, T3 arg3, T4 arg4) → void: Empty function with 4 positional arguments.
emptyFunction5<T1, T2, T3, T4, T5>(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5) → void: Empty function with 5 positional arguments.
emptyFunction6<T1, T2, T3, T4, T5, T6>(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6) → void: Empty function with 6 positional arguments.
emptyFunction7<T1, T2, T3, T4, T5, T6, T7>(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7) → void: Empty function with 7 positional arguments.
emptyFunction8<T1, T2, T3, T4, T5, T6, T7, T8>(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8) → void: Empty function with 8 positional arguments.
emptyFunction9<T1, T2, T3, T4, T5, T6, T7, T8, T9>(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9) → void: Empty function with 9 positional arguments.
explicitComparator<T>(Iterable<T> iterable) → Comparator<T>: Returns an explicit Comparator based on an iterable of elements.
identityFunction<T>(T arg) → T: Generic identity function with 1 positional argument.
iterate<E>(E value, E callback(E element)) → Iterable<E>: Returns a lazy infinite list of repeated applications of callback to the initial value.
kruskalSpanningTree<V, E>(Graph<V, E> graph, {required num edgeWeight(V source, V target), required Comparator<num> weightComparator, required StorageStrategy<V> vertexStrategy}) → Graph<V, E>: Kruskal's algorithm to find the spanning tree in O(E*log(E)).
naturalComparable<T extends Comparable<T>>(T a, T b) → int: Natural static Comparator function using Comparable arguments.
naturalCompare(Object? a, Object? b) → int: Natural dynamic Comparator function.
primSpanningTree<V, E>(Graph<V, E> graph, {required V? startVertex, required num edgeWeight(V source, V target), required Comparator<num> weightComparator, required StorageStrategy<V> vertexStrategy}) → Graph<V, E>: Prim's algorithm to find the spanning tree in O(E*log(V)).
repeat<E>(E element, {int? count}) → Iterable<E>: Returns an infinite iterable with a constant element. If count is provided the resulting iterator is limited to count elements.
reverseComparable<T extends Comparable<T>>(T a, T b) → int: Reversed static Comparator function using Comparable arguments.
reverseCompare(Object? a, Object? b) → int: Reversed dynamic Comparator function.
tarjanStronglyConnected<V>(Iterable<V> vertices, {required Iterable<V> successorsOf(V vertex), required StorageStrategy<V> vertexStrategy}) → Iterable<Set<V>>: The Tarjan's algorithm enumerates the strongly connected components (SCCs). It runs in linear time.
throwFunction0(Object throwable) → Map0<Never>: Throwing function with 0 positional arguments.
throwFunction1<T1>(Object throwable) → Map1<T1, Never>: Throwing function with 1 positional argument.
throwFunction10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10>(Object throwable) → Map10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, Never>: Throwing function with 10 positional arguments.
throwFunction2<T1, T2>(Object throwable) → Map2<T1, T2, Never>: Throwing function with 2 positional arguments.
throwFunction3<T1, T2, T3>(Object throwable) → Map3<T1, T2, T3, Never>: Throwing function with 3 positional arguments.
throwFunction4<T1, T2, T3, T4>(Object throwable) → Map4<T1, T2, T3, T4, Never>: Throwing function with 4 positional arguments.
throwFunction5<T1, T2, T3, T4, T5>(Object throwable) → Map5<T1, T2, T3, T4, T5, Never>: Throwing function with 5 positional arguments.
throwFunction6<T1, T2, T3, T4, T5, T6>(Object throwable) → Map6<T1, T2, T3, T4, T5, T6, Never>: Throwing function with 6 positional arguments.
throwFunction7<T1, T2, T3, T4, T5, T6, T7>(Object throwable) → Map7<T1, T2, T3, T4, T5, T6, T7, Never>: Throwing function with 7 positional arguments.
throwFunction8<T1, T2, T3, T4, T5, T6, T7, T8>(Object throwable) → Map8<T1, T2, T3, T4, T5, T6, T7, T8, Never>: Throwing function with 8 positional arguments.
throwFunction9<T1, T2, T3, T4, T5, T6, T7, T8, T9>(Object throwable) → Map9<T1, T2, T3, T4, T5, T6, T7, T8, T9, Never>: Throwing function with 9 positional arguments.

Typedefs

Callback0 = Map0<void>: Callback function type with 0 positional arguments.
Callback1<T1> = Map1<T1, void>: Callback function type with 1 positional argument.
Callback10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> = Map10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, void>: Callback function type with 10 positional arguments.
Callback2<T1, T2> = Map2<T1, T2, void>: Callback function type with 2 positional arguments.
Callback3<T1, T2, T3> = Map3<T1, T2, T3, void>: Callback function type with 3 positional arguments.
Callback4<T1, T2, T3, T4> = Map4<T1, T2, T3, T4, void>: Callback function type with 4 positional arguments.
Callback5<T1, T2, T3, T4, T5> = Map5<T1, T2, T3, T4, T5, void>: Callback function type with 5 positional arguments.
Callback6<T1, T2, T3, T4, T5, T6> = Map6<T1, T2, T3, T4, T5, T6, void>: Callback function type with 6 positional arguments.
Callback7<T1, T2, T3, T4, T5, T6, T7> = Map7<T1, T2, T3, T4, T5, T6, T7, void>: Callback function type with 7 positional arguments.
Callback8<T1, T2, T3, T4, T5, T6, T7, T8> = Map8<T1, T2, T3, T4, T5, T6, T7, T8, void>: Callback function type with 8 positional arguments.
Callback9<T1, T2, T3, T4, T5, T6, T7, T8, T9> = Map9<T1, T2, T3, T4, T5, T6, T7, T8, T9, void>: Callback function type with 9 positional arguments.
Group<K, V> = MapEntry<K, List<V>>: A group of values.
Indexed<E> = MapEntry<int, E>: An indexed value.
Loader<K, V> = FutureOr<V> Function(K key): Function asynchronously loading missing cache values.
Map0<R> = R Function(): Mapping function type with 0 positional arguments.
Map1<T1, R> = R Function(T1 arg1): Mapping function type with 1 positional argument.
Map10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, R> = R Function(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9, T10 arg10): Mapping function type with 10 positional arguments.
Map2<T1, T2, R> = R Function(T1 arg1, T2 arg2): Mapping function type with 2 positional arguments.
Map3<T1, T2, T3, R> = R Function(T1 arg1, T2 arg2, T3 arg3): Mapping function type with 3 positional arguments.
Map4<T1, T2, T3, T4, R> = R Function(T1 arg1, T2 arg2, T3 arg3, T4 arg4): Mapping function type with 4 positional arguments.
Map5<T1, T2, T3, T4, T5, R> = R Function(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5): Mapping function type with 5 positional arguments.
Map6<T1, T2, T3, T4, T5, T6, R> = R Function(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6): Mapping function type with 6 positional arguments.
Map7<T1, T2, T3, T4, T5, T6, T7, R> = R Function(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7): Mapping function type with 7 positional arguments.
Map8<T1, T2, T3, T4, T5, T6, T7, T8, R> = R Function(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8): Mapping function type with 8 positional arguments.
Map9<T1, T2, T3, T4, T5, T6, T7, T8, T9, R> = R Function(T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9): Mapping function type with 9 positional arguments.
Predicate0 = Map0<bool>: Predicate function type with 0 positional arguments.
Predicate1<T1> = Map1<T1, bool>: Predicate function type with 1 positional argument.
Predicate10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10> = Map10<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, bool>: Predicate function type with 10 positional arguments.
Predicate2<T1, T2> = Map2<T1, T2, bool>: Predicate function type with 2 positional arguments.
Predicate3<T1, T2, T3> = Map3<T1, T2, T3, bool>: Predicate function type with 3 positional arguments.
Predicate4<T1, T2, T3, T4> = Map4<T1, T2, T3, T4, bool>: Predicate function type with 4 positional arguments.
Predicate5<T1, T2, T3, T4, T5> = Map5<T1, T2, T3, T4, T5, bool>: Predicate function type with 5 positional arguments.
Predicate6<T1, T2, T3, T4, T5, T6> = Map6<T1, T2, T3, T4, T5, T6, bool>: Predicate function type with 6 positional arguments.
Predicate7<T1, T2, T3, T4, T5, T6, T7> = Map7<T1, T2, T3, T4, T5, T6, T7, bool>: Predicate function type with 7 positional arguments.
Predicate8<T1, T2, T3, T4, T5, T6, T7, T8> = Map8<T1, T2, T3, T4, T5, T6, T7, T8, bool>: Predicate function type with 8 positional arguments.
Predicate9<T1, T2, T3, T4, T5, T6, T7, T8, T9> = Map9<T1, T2, T3, T4, T5, T6, T7, T8, T9, bool>: Predicate function type with 9 positional arguments.
UnitConversion = Map<TimeUnit, num>: Type definition of a Map of conversion factors for different TimeUnits.

Exceptions / Errors

GraphError: Error thrown when encountering unexpected graph types.

Classes

Enums

Mixins

Extensions

Constants

Properties

Functions

Typedefs

Exceptions / Errors

more package

more library