darq library
Classes
-
EqualityComparer<T>
-
Used in various iteration methods for allowing user-defined comparisons
between complex elements. [...]
-
GroupByIterable<TSource, TKey>
-
This class is created by calls to
Iterable.groupBy
and isn't intended to be
instantiated directly.
-
GroupByValueIterable<TSource, TKey, TValue>
-
This class is created by calls to
Iterable.groupByValue
and isn't intended to be
instantiated directly.
-
Grouping<TKey, TValue>
-
This class is created by calls to grouping
Iterable
methods and isn't
intended to be instantiated directly.
-
GroupJoinIterable<TSource, TInner, TKey, TResult>
-
This class is created by calls to
Iterable.groupJoin
and isn't intended to be
instantiated directly.
-
GroupJoinIterator<TSource, TInner, TKey, TResult>
-
This class is created by calls to
Iterable.groupJoinIterator
and isn't intended to be
instantiated directly.
-
GroupSelectIterable<TSource, TKey, TResult>
-
This class is created by calls to
Iterable.groupSelectIterable
and isn't intended to be
instantiated directly.
-
GroupSelectValueIterable<TSource, TKey, TValue, TResult>
-
This class is created by calls to
Iterable.groupSelectValueIterable
and isn't intended to be
instantiated directly.
-
ILookup<TKey, TValue>
-
-
InternalIterableSorter<TValue, TKey>
-
This class is created by calls to
Iterable.orderBy
(and related) and isn't
intended to be instantiated directly.
-
InternalOrderedIterable<TValue, TKey>
-
This class is created by calls to
Iterable.orderBy
(and related) and isn't
intended to be instantiated directly.
-
IterableSorter<T>
-
-
Lookup<TKey, TValue>
-
This is a utility class used by grouping
Iterable
methods and isn't
intended to be instantiated directly.
-
MemoizedIterable<T>
-
-
OrderedBuffer<T>
-
This class is created by calls to
Iterable.orderBy
(and related) and isn't
intended to be instantiated directly.
-
OrderedIterable<T>
-
-
RangeIterable
-
Creates an iterable whose elements represent a range of
integral values.
-
RepeatIterable<T>
-
Creates an iterable whose elements are a single value
repeated a specified number of times.
-
Tuple0
-
A finite fixed-length ordered list containing 0 dynamically-typed elements.
-
Tuple1<T>
-
A finite fixed-length ordered list containing 1 dynamically-typed element.
-
Tuple2<T0, T1>
-
A finite fixed-length ordered list containing 2 dynamically-typed elements.
-
Tuple3<T0, T1, T2>
-
A finite fixed-length ordered list containing 3 dynamically-typed elements.
-
Tuple4<T0, T1, T2, T3>
-
A finite fixed-length ordered list containing 4 dynamically-typed elements.
-
Tuple5<T0, T1, T2, T3, T4>
-
A finite fixed-length ordered list containing 5 dynamically-typed elements.
-
Tuple6<T0, T1, T2, T3, T4, T5>
-
A finite fixed-length ordered list containing 6 dynamically-typed elements.
-
Tuple7<T0, T1, T2, T3, T4, T5, T6>
-
A finite fixed-length ordered list containing 7 dynamically-typed elements.
-
Tuple8<T0, T1, T2, T3, T4, T5, T6, T7>
-
A finite fixed-length ordered list containing 8 dynamically-typed elements.
-
Tuple9<T0, T1, T2, T3, T4, T5, T6, T7, T8>
-
A finite fixed-length ordered list containing 9 dynamically-typed elements.
Typedefs
-
Comparer<T>(T left, T right)
→ bool
-
Takes two elements of type
T
and checks them for equality, returning true
if the elements are equal and false
otherwise.
-
Hasher<T>(T value)
→ int
-
Takes an element of type
T
and computes its hash code, returning the code's
integer value.
-
Sorter<T>(T left, T right)
→ int
-
Takes two values of type
T
and computes their sort order, represented by
a returned integer value. [...]