extensions_pack library

Classes

BoolList
A space-efficient list of boolean values.
CanonicalizedMap<C, K, V>
A map whose keys are converted to canonical values of type C.
CapitalizeCaseTextFormatter
CaseInsensitiveEquality
String equality that's insensitive to differences in ASCII case.
CombinedIterableView<T>
A view of several iterables combined sequentially into a single iterable.
CombinedListView<T>
A view of several lists combined into a single list.
CombinedMapView<K, V>
Returns a new map that represents maps flattened into a single map.
CommonValidator
Date
A calendar date in the proleptic Gregorian calendar.
DateRange
Debouncer
DecimalTextInputFormatter
DeepCollectionEquality
Deep equality on collections.
DefaultEquality<E>
Equality of objects that compares only the natural equality of the objects.
DelegatingIterable<E>
An Iterable that delegates all operations to a base iterable.
DelegatingList<E>
A List that delegates all operations to a base list.
DelegatingMap<K, V>
A Map that delegates all operations to a base map.
DelegatingQueue<E>
A Queue that delegates all operations to a base queue.
DelegatingSet<E>
A Set that delegates all operations to a base set.
DimensionSide
DimensionSize
DimensionUtils
Equality<E>
A generic equality relation on objects.
EqualityBy<E, F>
Equality of objects based on derived values.
EqualityMap<K, V>
A Map whose key equality is determined by an Equality object.
EqualitySet<E>
A Set whose key equality is determined by an Equality object.
HeapPriorityQueue<E>
Heap based priority queue.
IdentityEquality<E>
Equality of objects that compares only the identity of the objects.
IterableEquality<E>
Equality on iterables.
IterableZip<T>
Iterable that iterates over lists of values from other iterables.
ListEquality<E>
Equality on lists.
ListSlice<E>
A list view of a range of another list.
ListValidator
LowerCaseTextFormatter
MapEquality<K, V>
Equality on maps.
MapKeySet<E>
An unmodifiable Set view of the keys of a Map.
MapUtils
MapValueSet<K, V>
Creates a modifiable Set view of the values of a Map.
MaxLengthTextFormatter
MaxSpacing
MultiEquality<E>
Combines several equalities into a single equality.
NonGrowableListMixin<E>
Mixin class that implements a throwing version of all list operations that change the List's length.
NonGrowableListView<E>
A fixed-length list.
NumberValidator
NumericalRangeTextFormatter
PriorityQueue<E>
A priority queue is a priority based work-list of elements.
QueueList<E>
A class that efficiently implements both Queue and List.
SetEquality<E>
Equality of sets.
SidesFlag
Spacing
StringUtils
StringValidator
SuffixTextFormatter
TimeTextFormatter
TrimSpacesTextFormatter
UnionSet<E>
A single set that provides a view of the union over a set of sets.
UnionSetController<E>
A controller that exposes a view of the union of a collection of sets.
UnmodifiableListView<E>
An unmodifiable List view of another List.
UnmodifiableMapMixin<K, V>
Mixin class that implements a throwing version of all map operations that change the Map.
UnmodifiableMapView<K, V>
View of a Map that disallow modifying the map.
UnmodifiableSetMixin<E>
Mixin class that implements a throwing version of all set operations that change the Set.
UnmodifiableSetView<E>
An unmodifiable set.
UnorderedIterableEquality<E>
Equality of the elements of two iterables without considering order.
UpperCaseTextFormatter
ValueThreshold

Extensions

AnimationControllerExtension on AnimationController
BoolEPExtension on bool
ColorExtension on Color
ComparatorExtension on Comparator<T>
Extensions on comparator functions.
ContextEPExtension on BuildContext
DateEPExtension on DateTime
DateExtension on Date
DateRangeExtension on DateRange
DateTimeDate on DateTime
DateTimeRangeDateRange on DateTimeRange
DoubleEPExtension on double
DurationEPExtension on Duration
FormKeyExtension on FormKey
IntEPExtension on int
IterableComparableExtension on Iterable<T>
Extensions that apply to iterables of Comparable elements.
IterableDoubleExtension on Iterable<double>
Extension on iterables of double.
IterableEPExtension on Iterable<T?>
IterableExtension on Iterable<T>
Extensions that apply to all iterables.
IterableIntegerExtension on Iterable<int>
Extension on iterables of integers.
IterableIterableExtension on Iterable<Iterable<T>>
Extensions on iterables whose elements are also iterables.
IterableNullableExtension on Iterable<T?>
Extensions that apply to iterables with a nullable element type.
IterableNumberExtension on Iterable<num>
Extensions that apply to iterables of numbers.
ListComparableExtensions on List<E>
Various extensions on lists of comparable elements.
ListEPExtension on List<T>
ListExtensions on List<E>
Various extensions on lists of arbitrary elements.
ListWidgetEPExtension on List<Widget>
MapExtension on Map<A, B>
NullIterableExtension on Iterable<T>?
NullMapExtension on Map<A, B>?
NullNumEPExtension on num?
NullStringEPExtension on String?
ObjectsEPExtension on Object?
StringEPExtension on String
TimeOfDayEPExtension on TimeOfDay
VoidCallbackEPExtension on VoidCallback
WidgetEPExtension on Widget

Constants

kAppDefaultBorderRadius → const double
kAppDefaultElevation → const double
kBottomContentSpacing → const Spacing
kGridSpacer → const double
kLGAll → const EdgeInsets
kLGBottom → const EdgeInsets
kLGHorizontal → const EdgeInsets
kLGLeft → const EdgeInsets
kLGRight → const EdgeInsets
kLGSize → const double
kLGSpacing → const Spacing
kLGTop → const EdgeInsets
kLGVertical → const EdgeInsets
kMDSize → const double
kMDSpacing → const Spacing
kSAll → const EdgeInsets
kSBottom → const EdgeInsets
kSHorizontal → const EdgeInsets
kSLeft → const EdgeInsets
kSMAll → const EdgeInsets
kSMBottom → const EdgeInsets
kSMHorizontal → const EdgeInsets
kSMLeft → const EdgeInsets
kSMRight → const EdgeInsets
kSMSize → const double
kSMSpacing → const Spacing
kSMTop → const EdgeInsets
kSMVertical → const EdgeInsets
kSpacing → const Spacing
kSRight → const EdgeInsets
kSTop → const EdgeInsets
kSVertical → const EdgeInsets
kXLAll → const EdgeInsets
kXLBottom → const EdgeInsets
kXLHorizontal → const EdgeInsets
kXLLeft → const EdgeInsets
kXLRight → const EdgeInsets
kXLSize → const double
kXLSpacing → const Spacing
kXLTop → const EdgeInsets
kXLVertical → const EdgeInsets
kXSAll → const EdgeInsets
kXSBottom → const EdgeInsets
kXSHorizontal → const EdgeInsets
kXSLeft → const EdgeInsets
kXSRight → const EdgeInsets
kXSSize → const double
kXSSpacing → const Spacing
kXSTop → const EdgeInsets
kXSVertical → const EdgeInsets
kXXLAll → const EdgeInsets
kXXLBottom → const EdgeInsets
kXXLHorizontal → const EdgeInsets
kXXLLeft → const EdgeInsets
kXXLRight → const EdgeInsets
kXXLSize → const double
kXXLSpacing → const Spacing
kXXLTop → const EdgeInsets
kXXLVertical → const EdgeInsets
kXXSAll → const EdgeInsets
kXXSBottom → const EdgeInsets
kXXSHorizontal → const EdgeInsets
kXXSLeft → const EdgeInsets
kXXSRight → const EdgeInsets
kXXSSize → const double
kXXSSpacing → const Spacing
kXXSTop → const EdgeInsets
kXXSVertical → const EdgeInsets

Properties

kSpacer DimensionUtils
getter/setter pair

Functions

and<T>(List<PredicateFn<T>> predicates) PredicateFn<T>
binarySearch<E>(List<E> sortedList, E value, {int compare(E, E)?}) int
Returns a position of the value in sortedList, if it is there.
compareAsciiLowerCase(String a, String b) int
Compares a and b lexically, converting ASCII letters to lower case.
compareAsciiLowerCaseNatural(String a, String b) int
Compares strings a and b according to lower-case natural sort ordering.
compareAsciiUpperCase(String a, String b) int
Compares a and b lexically, converting ASCII letters to upper case.
compareAsciiUpperCaseNatural(String a, String b) int
Compares strings a and b according to upper-case natural sort ordering.
compareNatural(String a, String b) int
Compares strings a and b according to natural sort ordering.
equalsIgnoreAsciiCase(String a, String b) bool
Checks if strings a and b differ only on the case of ASCII letters.
groupBy<S, T>(Iterable<S> values, T key(S)) Map<T, List<S>>
Groups the elements in values by the value returned by key.
hashIgnoreAsciiCase(String string) int
Hash code for a string which is compatible with equalsIgnoreAsciiCase.
insertionSort<E>(List<E> elements, {int compare(E, E)?, int start = 0, int? end}) → void
Sort a list between start (inclusive) and end (exclusive) using insertion sort.
lastBy<S, T>(Iterable<S> values, T key(S)) Map<T, S>
Associates the elements in values by the value returned by key.
lowerBound<E>(List<E> sortedList, E value, {int compare(E, E)?}) int
Returns the first position in sortedList that does not compare less than value.
mapMap<K1, V1, K2, V2>(Map<K1, V1> map, {K2 key(K1, V1)?, V2 value(K1, V1)?}) Map<K2, V2>
Creates a new map from map with new keys and values.
maxBy<S, T>(Iterable<S> values, T orderBy(S), {int compare(T, T)?}) → S?
Returns the element of values for which orderBy returns the maximum value.
mergeMaps<K, V>(Map<K, V> map1, Map<K, V> map2, {V value(V, V)?}) Map<K, V>
Returns a new map with all key/value pairs in both map1 and map2.
mergeSort<E>(List<E> elements, {int start = 0, int? end, int compare(E, E)?}) → void
Sorts a list between start (inclusive) and end (exclusive) using the merge sort algorithm.
minBy<S, T>(Iterable<S> values, T orderBy(S), {int compare(T, T)?}) → S?
Returns the element of values for which orderBy returns the minimum value.
not<T>(List<PredicateFn<T>> predicates) PredicateFn<T>
or<T>(List<PredicateFn<T>> predicates) PredicateFn<T>
reverse<E>(List<E> elements, [int start = 0, int? end]) → void
Reverses a list, or a part of a list, in-place.
shuffle(List elements, [int start = 0, int? end, Random? random]) → void
Shuffles a list randomly.
stronglyConnectedComponents<T>(Map<T, Iterable<T>> graph) List<Set<T>>
Returns the strongly connected components of graph, in topological order.
transitiveClosure<T>(Map<T, Iterable<T>> graph) Map<T, Set<T>>
Returns the transitive closure of graph.

Typedefs

ContextCallback = void Function(BuildContext)
DeleteFn<T> = Future<bool> Function(T)
FormKey = GlobalKey<FormState>
FutureCallback = Future<void> Function()
FutureOrCallback<T> = FutureOr<T> Function()
FutureValueChanged<T> = Future<void> Function(T)
Json = Map<String, dynamic>
PredicateFn<T> = bool Function(T value)
ReplaceFn<O, N> = void Function({required N newItem, required O oldItem})
SaveFn<T> = Future<bool> Function(T)