Additional async LINQ to objects operators for IAsyncEnumerable<T>
It's like MoreLINQ, only asynchronous.
Ensures that a source sequence of disposable objects are all acquired successfully. If the acquisition of any one fails then those successfully acquired till that point are disposed.
Applies multiple accumulators sequentially in a single pass over a sequence.
Applies a right-associative accumulator function over a sequence.
This operator is the right-associative version of the Aggregate operator.
Asserts that all elements of a sequence meet a given condition otherwise throws an exception.
Asserts that a source sequence contains a given count of elements.
Determines whether or not the number of elements in the sequence is greater than or equal to the given integer.
Determines whether or not the number of elements in the sequence is lesser than or equal to the given integer.
Inserts the elements of a sequence into another sequence at a specified index from the tail of the sequence, where zero always represents the last position, one represents the second-last element, two represents the third-last element and so on.
Batches the source sequence into sized buckets.
Returns the Cartesian product of two or more sequences by combining each element from the sequences and applying a user-defined projection to the set.
Applies a function to each element of the source sequence and returns a new
sequence of result elements for source elements where the function returns a
couple (2-tuple) having a true as its first element and result as the
second.
Compares two sequences and returns an integer that indicates whether the first sequence has fewer, the same or more elements than the second sequence.
Completely consumes the given sequence. This method uses immediate execution, and doesn't store any data during execution
Determines whether or not the number of elements in the sequence is between an inclusive range of minimum and maximum integers.
Applies a key-generating function to each element of a sequence and returns a sequence of unique keys and their number of occurrences in the original sequence.
Provides a countdown counter for a given count of elements at the tail of the sequence where zero always represents the last element, one represents the second-last element, two represents the third-last element and so on.
Returns all distinct elements of the given source, where "distinctness" is determined via a projection and the default equality comparer for the projected type.
Determines whether the end of the first sequence is equivalent to the second sequence.
Returns a projection of tuples, where each tuple contains the N-th element from each of the argument sequences. An exception is thrown if the input sequences are of different lengths.
Returns a sequence containing the values resulting from invoking (in order) each function in the source sequence of functions.
Determines whether or not the number of elements in the sequence is equals to the given integer.
Returns the set of elements in the first sequence which aren't in the second sequence, according to a given key selector.
Excludes elements from a sequence starting at a given index
Returns the elements of a sequence and falls back to another if the original sequence is empty.
Returns a sequence with each null reference or value in the source replaced with the following non-null reference or value in that sequence.
Returns a sequence with each null reference or value in the source replaced with the previous non-null reference or value seen in that sequence.
Flattens a sequence containing arbitrarily-nested sequences.
Returns the result of applying a function to a sequence with 1 to 16 elements.
Immediately executes the given action on each element in the source sequence.
Returns a sequence containing the values resulting from invoking (in order) each function in the source sequence of functions.
Performs a Full Group Join between the and sequences.
Performs a full outer join between two sequences.
Returns a sequence of values consecutively generated by a generator function
Returns a sequence of values based on indexes
Groups the adjacent elements of a sequence according to a specified key selector function.
Returns a sequence of tuples of an element and its zero-based index in the source sequence.
Applies a key-generating function to each element of a sequence and returns a sequence that contains the elements of the original sequence as well its key and index inside the group of its key. An additional argument specifies a comparer to use for testing equivalence of keys.
Inserts the elements of a sequence into another sequence at a specified index.
Interleaves the elements of two or more sequences into a single sequence, skipping sequences as they are consumed.
Produces a projection of a sequence by evaluating pairs of elements separated by a negative offset.
Produces a projection of a sequence by evaluating pairs of elements separated by a positive offset.
Performs a left outer join between two sequences.
Returns the maxima (maximal elements) of the given sequence, based on the given projection.
Returns the minima (minimal elements) of the given sequence, based on the given projection.
Returns a sequence with a range of elements in the source sequence moved to a new offset.
Sorts the elements of a sequence in a particular direction (ascending, descending) according to a key.
Merges two ordered sequences into one. Where the elements equal in both sequences, the element from the first sequence is returned in the resulting sequence.
Pads a sequence with default values if it is narrower (shorter in length) than a given width.
Pads a sequence with default values in the beginning if it is narrower (shorter in length) than a given width.
Returns a sequence resulting from applying a function to each element in the source sequence and its predecessor, with the exception of the first element which is only returned as the predecessor of the second element
Combines OrderBy (where element is key) and Take in a single operation.
Combines OrderBy and Take in a single operation.
Partitions a sequence by a predicate, or a grouping by Boolean keys or up to 3 sets of keys.
Executes the given action on each element in the source sequence and yields it
Performs a pre-scan (exclusive prefix sum) on a sequence of elements
Ranks each item in the sequence in descending ordering using a default comparer.
Ranks each item in the sequence in descending ordering by a specified key using a default comparer.
Repeats the sequence indefinitely or a specific number of times.
Performs a right outer join between two sequences.
Run-length encodes a sequence by converting consecutive instances of the same element into a tuple representing the item and its occurrence count.
Performs a scan (inclusive prefix sum) on a sequence of elements.
Applies an accumulator function over sequence element keys, returning the keys along with intermediate accumulator states.
Performs a right-associative scan (inclusive prefix) on a sequence of elements. This operator is the right-associative version of the Scan operator.
Divides a sequence into multiple sequences by using a segment detector based on the original sequence.
Bypasses a specified number of elements at the end of the sequence.
Skips items from the input sequence until the given predicate returns true when applied to the current source item; that item will be the last skipped
Extracts elements from a sequence at a particular zero-based starting index
Merges two or more sequences that are in a common order (either ascending or descending) into a single sequence that preserves that order.
Splits the source sequence by a separator.
Determines whether the beginning of the first sequence is equivalent to the second sequence.
Returns a sequence resulting from applying a function to each element in the source sequence with additional parameters indicating whether the element is the first and/or last of the sequence
Returns every N-th element of a source sequence
Returns a specified number of contiguous elements from the end of a sequence
Returns items from the input sequence until the given predicate returns true when applied to the current source item; that item will be the last returned
Performs a subsequent ordering of elements in a sequence in a particular direction (ascending, descending) according to a key.
Creates an array from an IAsyncEnumerable<T> where a function is used to determine
the index at which an element will be placed in the array.
Creates a delimited string from a sequence of values. The delimiter used depends on the current culture of the executing thread.
Creates a dictionary from a sequence of key-value pair elements or tuples of 2.
Creates a lookup from a sequence of key-value pair elements or tuples of 2.
Traces the elements of a source sequence for diagnostics.
Transposes the rows of a sequence into columns.
Traverses a tree in a breadth-first fashion, starting at a root node and using a user-defined function to get the children at each node of the tree.
Traverses a tree in a depth-first fashion, starting at a root node and using a user-defined function to get the children at each node of the tree.
Returns a sequence generated by applying a state to the generator function, and from its result, determines if the sequence should have a next element and its value, and the next state in the recursive call.
Processes a sequence into a series of subsequences representing a windowed subset of the original
Creates a left-aligned sliding window over the source sequence of a given size.
Creates a right-aligned sliding window over the source sequence of a given size.
Returns a projection of tuples, where each tuple contains the N-th element from each of the argument sequences. The resulting sequence will always be as long as the longest of input sequences where the default value of each of the shorter sequence element types is used for padding.
Returns a projection of tuples, where each tuple contains the N-th element from each of the argument sequences. The resulting sequence is as short as the shortest input sequence.
Credit: This project and its documentation are derived from MoreLINQ