more library

Classes

AStarSearchIterable<V>: Generalized A-Star search algorithm.
AtkinPrimeSieve: Prime sieve of Atkin (linear sieve).
BigIntRange: A virtual 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.
DijkstraSearchIterable<V>: Generalized Dijkstra's search algorithm.
DoubleRange: A virtual range of doubles containing an arithmetic progressions.
DurationPrinter: Prints Duration objects in custom ways.
Edge<V, E>: Abstract definition of an edge.
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).
FieldPrinter<T>: Abstract field description.
FixedNumberPrinter<T extends num>: Prints numbers in a fixed format.
Fraction: A rational number.
Graph<V, E>: Abstract base class of graphs.
GraphBuilder<V, E>
Group<K, V>: A group of values.
Heap<E>: A priority queue implemented using a binary heap.
HumanNumberPrinter<T extends num>: Prints numbers in a custom human readable string.
Indexed<E>: An indexed value.
IntegerRange: A virtual range of integers containing an arithmetic progressions.
Interval<T>: An interval over an ordering of type T.
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.
Ordering<T>: An ordering implements a Comparator function that can be modified using a fluent interface.
OrdinalNumberPrinter: Prints numbers in an ordinal format.
Path<V>: Abstract definition of a path.
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, provides various additional accessors of the standard collection iterator.
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.
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.
Tuple: Abstract tuple class.
Tuple0: Tuple with 0 elements.
Tuple1<T1>: Tuple with 1 element.
Tuple2<T1, T2>: Tuple with 2 elements.
Tuple3<T1, T2, T3>: Tuple with 3 elements.
Tuple4<T1, T2, T3, T4>: Tuple with 4 elements.
Tuple5<T1, T2, T3, T4, T5>: Tuple with 5 elements.
Tuple6<T1, T2, T3, T4, T5, T6>: Tuple with 6 elements.
Tuple7<T1, T2, T3, T4, T5, T6, T7>: Tuple with 7 elements.
Tuple8<T1, T2, T3, T4, T5, T6, T7, T8>: Tuple with 8 elements.
Tuple9<T1, T2, T3, T4, T5, T6, T7, T8, T9>: Tuple with 9 elements.
TypeMap<T>: A type-map associates dart runtime types to an instance of that type.
TypePrinter<T>: Printer of the dynamic runtime type.

Enums

Period: Different kinds of repeating periodic timestamps.
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
AtlasGraphBuilderExtension on GraphBuilder<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>
ChunkedExtension on Iterable<E>
CloseToNumExtension on num
CollectionGraphBuilderExtension on GraphBuilder<V, E>
CombinationsExtension on Iterable<E>
CompleteGraphBuilderExtension on GraphBuilder<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
CountIterableExtension on Iterable<E>
DefaultMapExtension on Map<K, V>
DepthFirstGraphExtension on Graph<V, E>
DepthFirstPostOrderGraphExtension on Graph<V, E>
DigitsBigIntExtension on BigInt
DigitsIntegerExtension on int
DoubleRangeExtension on double
DurationIntervalDateTimeExtension on Interval<DateTime>
EmptyPrinterExtension on Printer<Iterable<T>>
FactorialBigIntExtension on BigInt
FactorialIntegerExtension on int
FlatMapExtension on Iterable<E>
FlatMapStreamExtension on Stream<E>
FlattenExtension on Iterable<Iterable<E>>
FlattenIterableExtension on Stream<Iterable<E>>
FlattenStreamExtension on Stream<Stream<E>>
GroupExtension on Iterable<V>
HyperbolicNumberExtension on num
IndentDedentStringExtension on String
IndexedExtension on Iterable<E>
IndicesIterableExtension on Iterable<Object?>
IntegerRangeExtension on int
IterablePrinterExtension on Printer<T>
LargestComparator on Comparator<T>
LcmBigIntExtension on BigInt
LcmIntegerExtension on int
LengthIntervalIntExtension on Interval<int>
LengthIntervalNumExtension on Interval<num>
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
MaxComparator on Comparator<T>
MinComparator on Comparator<T>
MultisetExtension on Iterable<T>
NullPrinterExtension on Printer<T>
NullsFirstComparator on Comparator<T>
NullsLastComparator on Comparator<T>
OperatorExtension on Comparator<T>
OperatorsExtension on Iterable<E>
OrderedComparator on Comparator<T>
PadPrinterExtension on Printer<T>
PartiteGraphBuilderExtension on GraphBuilder<V, E>: https://mathworld.wolfram.com/Completek-PartiteGraph.html
PathGraphBuilderExtension on GraphBuilder<V, E>: https://mathworld.wolfram.com/PathGraph.html
PeriodicalDateTimeExtension on DateTime
PeriodicalExtension on DateTime
PermutationComparableListExtension on List<E>
PermutationIterableExtension on Iterable<E>
PolynomialIterableExtension on Iterable<num>
PowerSetExtension on Iterable<E>
PredicateComparator on Comparator<T>
PrefixSuffixStringExtension on String
PrimesIntegerExtension on int
ProbablyPrimeBigIntExtension on BigInt
ProbablyPrimeComplexExtension on Complex
ProbablyPrimeIntegerExtension on int
ProductExtension on Iterable<Iterable<E>>
RandomExtension on Iterable<E>
RandomGraphBuilderExtension on GraphBuilder<V, E>: Creates random graphs using different models.
RandomWalkGraphExtension on Graph<V, E>
RepeatIterableExtension on Iterable<E>
ResultOfComparator on Comparator<R>
ResultOfPrinterExtension on Printer<R>
ReversedComparator on Comparator<T>
ReversedEdgeExtension on Edge<V, E>
ReversedGraphExtension on Graph<V, E>
RingGraphBuilderExtension on GraphBuilder<V, E>
RotateListExtension on List<E>
RotateQueueExtension on Queue<E>
SearchComparator on Comparator<T>
SearchGraphExtension on Graph<V, E>
SeparatedExtension 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>
StarGraphBuilderExtension on GraphBuilder<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>
ToMapExtension on Iterable<E>
TopologicalGraphExtension on Graph<V, E>
TreeGraphBuilderExtension on GraphBuilder<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>
TruncateExtension on DateTime
TruncatePrinterExtension on Printer<T>
TruncateToDateTimeExtension on DateTime
UniqueExtension on Iterable<E>
WherePrinterExtension on Printer<T>
WhereTypeExtension on Stream<E>
WindowExtension on Iterable<E>
WindowStreamExtension on Stream<E>
WrapUnwrapStringExtension on String
ZipExtension 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: Information about the runtime environment. 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

Functions

constantFunction0<R>(R value) → Map0<R>: Constant function with 0 arguments.
constantFunction1<T0, R>(R value) → Map1<T0, R>: Constant function with 1 argument.
constantFunction10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, R>(R value) → Map10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, R>: Constant function with 10 arguments.
constantFunction2<T0, T1, R>(R value) → Map2<T0, T1, R>: Constant function with 2 arguments.
constantFunction3<T0, T1, T2, R>(R value) → Map3<T0, T1, T2, R>: Constant function with 3 arguments.
constantFunction4<T0, T1, T2, T3, R>(R value) → Map4<T0, T1, T2, T3, R>: Constant function with 4 arguments.
constantFunction5<T0, T1, T2, T3, T4, R>(R value) → Map5<T0, T1, T2, T3, T4, R>: Constant function with 5 arguments.
constantFunction6<T0, T1, T2, T3, T4, T5, R>(R value) → Map6<T0, T1, T2, T3, T4, T5, R>: Constant function with 6 arguments.
constantFunction7<T0, T1, T2, T3, T4, T5, T6, R>(R value) → Map7<T0, T1, T2, T3, T4, T5, T6, R>: Constant function with 7 arguments.
constantFunction8<T0, T1, T2, T3, T4, T5, T6, T7, R>(R value) → Map8<T0, T1, T2, T3, T4, T5, T6, T7, R>: Constant function with 8 arguments.
constantFunction9<T0, T1, T2, T3, T4, T5, T6, T7, T8, R>(R value) → Map9<T0, T1, T2, T3, T4, T5, T6, T7, T8, R>: Constant function with 9 arguments.
emptyFunction0() → void: Generic empty functions returning nothing. Empty function with 0 arguments.
emptyFunction1<T0>(T0 arg0) → void: Empty function with 1 argument.
emptyFunction10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9) → void: Empty function with 10 arguments.
emptyFunction2<T0, T1>(T0 arg0, T1 arg1) → void: Empty function with 2 arguments.
emptyFunction3<T0, T1, T2>(T0 arg0, T1 arg1, T2 arg2) → void: Empty function with 3 arguments.
emptyFunction4<T0, T1, T2, T3>(T0 arg0, T1 arg1, T2 arg2, T3 arg3) → void: Empty function with 4 arguments.
emptyFunction5<T0, T1, T2, T3, T4>(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4) → void: Empty function with 5 arguments.
emptyFunction6<T0, T1, T2, T3, T4, T5>(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5) → void: Empty function with 6 arguments.
emptyFunction7<T0, T1, T2, T3, T4, T5, T6>(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6) → void: Empty function with 7 arguments.
emptyFunction8<T0, T1, T2, T3, T4, T5, T6, T7>(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7) → void: Empty function with 8 arguments.
emptyFunction9<T0, T1, T2, T3, T4, T5, T6, T7, T8>(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8) → void: Empty function with 9 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 functions. Canonical identity function with 1 argument.
iterate<E>(E value, E callback(E element)) → Iterable<E>: Returns a lazy infinite list of repeated applications of the function to the initial value.
naturalComparable<T extends Comparable<T>>(T a, T b) → int: Natural static Comparator function using Comparable arguments.
naturalComparator<T>() → Comparator<T>: Returns a natural Comparator for objects of type T.
naturalCompare(Object? a, Object? b) → int: Natural dynamic Comparator function.
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.
reverseComparator<T>() → Comparator<T>: Returns a reversed Comparator for objects of type T.
reverseCompare(Object? a, Object? b) → int: Reversed dynamic Comparator function.
throwFunction0(Object throwable) → Map0<Never>: Throwing function with 0 arguments.
throwFunction1<T0>(Object throwable) → Map1<T0, Never>: Throwing function with 1 argument.
throwFunction10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>(Object throwable) → Map10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, Never>: Throwing function with 10 arguments.
throwFunction2<T0, T1>(Object throwable) → Map2<T0, T1, Never>: Throwing function with 2 arguments.
throwFunction3<T0, T1, T2>(Object throwable) → Map3<T0, T1, T2, Never>: Throwing function with 3 arguments.
throwFunction4<T0, T1, T2, T3>(Object throwable) → Map4<T0, T1, T2, T3, Never>: Throwing function with 4 arguments.
throwFunction5<T0, T1, T2, T3, T4>(Object throwable) → Map5<T0, T1, T2, T3, T4, Never>: Throwing function with 5 arguments.
throwFunction6<T0, T1, T2, T3, T4, T5>(Object throwable) → Map6<T0, T1, T2, T3, T4, T5, Never>: Throwing function with 6 arguments.
throwFunction7<T0, T1, T2, T3, T4, T5, T6>(Object throwable) → Map7<T0, T1, T2, T3, T4, T5, T6, Never>: Throwing function with 7 arguments.
throwFunction8<T0, T1, T2, T3, T4, T5, T6, T7>(Object throwable) → Map8<T0, T1, T2, T3, T4, T5, T6, T7, Never>: Throwing function with 8 arguments.
throwFunction9<T0, T1, T2, T3, T4, T5, T6, T7, T8>(Object throwable) → Map9<T0, T1, T2, T3, T4, T5, T6, T7, T8, Never>: Throwing function with 9 arguments.

Typedefs

Callback0 = void Function(): Function types for generic callbacks. Function callback with 0 arguments.
Callback1<T0> = void Function(T0 arg0): Function callback with 1 argument.
Callback10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> = void Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9): Function callback with 10 arguments.
Callback2<T0, T1> = void Function(T0 arg0, T1 arg1): Function callback with 2 arguments.
Callback3<T0, T1, T2> = void Function(T0 arg0, T1 arg1, T2 arg2): Function callback with 3 arguments.
Callback4<T0, T1, T2, T3> = void Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3): Function callback with 4 arguments.
Callback5<T0, T1, T2, T3, T4> = void Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4): Function callback with 5 arguments.
Callback6<T0, T1, T2, T3, T4, T5> = void Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5): Function callback with 6 arguments.
Callback7<T0, T1, T2, T3, T4, T5, T6> = void Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6): Function callback with 7 arguments.
Callback8<T0, T1, T2, T3, T4, T5, T6, T7> = void Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7): Function callback with 8 arguments.
Callback9<T0, T1, T2, T3, T4, T5, T6, T7, T8> = void Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8): Function callback with 9 arguments.
Loader<K, V> = FutureOr<V> Function(K key): Function asynchronously loading missing cache values.
Map0<R> = R Function(): Function type for generic mapping functions. Function callback with 0 arguments.
Map1<T0, R> = R Function(T0 arg0): Function callback with 1 argument.
Map10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, R> = R Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9): Function callback with 10 arguments.
Map2<T0, T1, R> = R Function(T0 arg0, T1 arg1): Function callback with 2 arguments.
Map3<T0, T1, T2, R> = R Function(T0 arg0, T1 arg1, T2 arg2): Function callback with 3 arguments.
Map4<T0, T1, T2, T3, R> = R Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3): Function callback with 4 arguments.
Map5<T0, T1, T2, T3, T4, R> = R Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4): Function callback with 5 arguments.
Map6<T0, T1, T2, T3, T4, T5, R> = R Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5): Function callback with 6 arguments.
Map7<T0, T1, T2, T3, T4, T5, T6, R> = R Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6): Function callback with 7 arguments.
Map8<T0, T1, T2, T3, T4, T5, T6, T7, R> = R Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7): Function callback with 8 arguments.
Map9<T0, T1, T2, T3, T4, T5, T6, T7, T8, R> = R Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8): Function callback with 9 arguments.
Predicate0 = bool Function(): Function type for generic predicate functions. Function predicate with 0 arguments.
Predicate1<T0> = bool Function(T0 arg0): Function predicate with 1 argument.
Predicate10<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9> = bool Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8, T9 arg9): Function predicate with 10 arguments.
Predicate2<T0, T1> = bool Function(T0 arg0, T1 arg1): Function predicate with 2 arguments.
Predicate3<T0, T1, T2> = bool Function(T0 arg0, T1 arg1, T2 arg2): Function predicate with 3 arguments.
Predicate4<T0, T1, T2, T3> = bool Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3): Function predicate with 4 arguments.
Predicate5<T0, T1, T2, T3, T4> = bool Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4): Function predicate with 5 arguments.
Predicate6<T0, T1, T2, T3, T4, T5> = bool Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5): Function predicate with 6 arguments.
Predicate7<T0, T1, T2, T3, T4, T5, T6> = bool Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6): Function predicate with 7 arguments.
Predicate8<T0, T1, T2, T3, T4, T5, T6, T7> = bool Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7): Function predicate with 8 arguments.
Predicate9<T0, T1, T2, T3, T4, T5, T6, T7, T8> = bool Function(T0 arg0, T1 arg1, T2 arg2, T3 arg3, T4 arg4, T5 arg5, T6 arg6, T7 arg7, T8 arg8): Function predicate with 9 arguments.
UnitConversion = Map<TimeUnit, num>: Type definition of a Map of conversion factors for different TimeUnits.

Classes

Enums

Mixins

Extensions

Constants

Properties

Functions

Typedefs

more package

more library