SuperLinq 4.0.0-preview.0.16
Prefix ReservedSee the version list below for details.
dotnet add package SuperLinq --version 4.0.0-preview.0.16
NuGet\Install-Package SuperLinq -Version 4.0.0-preview.0.16
<PackageReference Include="SuperLinq" Version="4.0.0-preview.0.16" />
paket add SuperLinq --version 4.0.0-preview.0.16
#r "nuget: SuperLinq, 4.0.0-preview.0.16"
// Install SuperLinq as a Cake Addin #addin nuget:?package=SuperLinq&version=4.0.0-preview.0.16&prerelease // Install SuperLinq as a Cake Tool #tool nuget:?package=SuperLinq&version=4.0.0-preview.0.16&prerelease
SuperLinq
LINQ to Objects is missing a few desirable features.
This project enhances LINQ to Objects with extra methods, in a manner which keeps to the spirit of LINQ.
SuperLinq is available for download and installation as NuGet packages.
Usage
SuperLinq can be used in one of two ways. The simplest is to just import the
SuperLinq
namespace and all extension methods become instantly available for
you to use on the types they extend (typically some instantiation of
IEnumerable<T>
).
Apart from extension methods, SuperLinq also offers regular static method
that generate (instead of operating on) sequences, like Unfold
,
Random
, Sequence
and others.
Migration from MoreLINQ
In most case, migration should be easy:
- Remove the nuget reference to MoreLINQ and add a reference to SuperLinq.
- Replace any
using MoreLinq;
withusing SuperLinq;
- Remove any
using MoreLinq.Extensions.*
This is because SuperLinq has been updated to be side-by-side compatible with .NET Core 3.1 and .NET 5.0/6.0.
.NET Versions
Base library is supported on .NET Core 3.1 and .NET 5.0+.
Operators
Acquire
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.
Aggregate
Applies multiple accumulators sequentially in a single pass over a sequence.
This method has 7 overloads.
AggregateRight
Applies a right-associative accumulator function over a sequence. This operator is the right-associative version of the Aggregate LINQ operator.
This method has 3 overloads.
AtLeast
Determines whether or not the number of elements in the sequence is greater than or equal to the given integer.
AtMost
Determines whether or not the number of elements in the sequence is lesser than or equal to the given integer.
Backsert
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.
Batch
Batches the source sequence into sized buckets.
This method has 2 overloads.
Cartesian
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.
This method has 7 overloads.
Choose
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.
CompareCount
Compares two sequences and returns an integer that indicates whether the first sequence has fewer, the same or more elements than the second sequence.
Consume
Completely consumes the given sequence. This method uses immediate execution, and doesn't store any data during execution
CountBetween
Determines whether or not the number of elements in the sequence is between an inclusive range of minimum and maximum integers.
CountBy
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.
This method has 2 overloads.
CountDown
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.
DistinctBy (Hidden in .NET 6 in favor of the Framework version)
Returns all distinct elements of the given source, where "distinctness" is determined via a projection and the default equality comparer for the projected type.
This method has 2 overloads.
EndsWith
Determines whether the end of the first sequence is equivalent to the second sequence.
This method has 2 overloads.
EquiZip
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.
This method has 3 overloads.
Exactly
Determines whether or not the number of elements in the sequence is equals to the given integer.
ExceptBy (Side-by-side with .NET 6.0 ExceptBy()
, due to differing signatures)
Returns the set of elements in the first sequence which aren't in the second sequence, according to a given key selector.
This method has 2 overloads.
Exclude
Excludes elements from a sequence starting at a given index
FallbackIfEmpty
Returns the elements of a sequence and falls back to another if the original sequence is empty.
This method has 6 overloads.
FillBackward
Returns a sequence with each null reference or value in the source replaced with the following non-null reference or value in that sequence.
This method has 3 overloads.
FillForward
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.
This method has 3 overloads.
Flatten
Flattens a sequence containing arbitrarily-nested sequences.
This method has 3 overloads.
Fold
Returns the result of applying a function to a sequence with 1 to 16 elements.
This method has 16 overloads.
ForEach
Immediately executes the given action on each element in the source sequence.
This method has 2 overloads.
From
Returns a sequence containing the values resulting from invoking (in order) each function in the source sequence of functions.
This method has 4 overloads.
FullGroupJoin
Performs a Full Group Join between the and sequences.
This method has 4 overloads.
FullJoin
Performs a full outer join between two sequences.
This method has 4 overloads.
Generate
Returns a sequence of values consecutively generated by a generator function
GenerateByIndex
Returns a sequence of values based on indexes
GroupAdjacent
Groups the adjacent elements of a sequence according to a specified key selector function.
This method has 6 overloads.
Index
Returns a sequence of where the key is the zero-based index of the value in the source sequence.
This method has 2 overloads.
IndexBy
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.
This method has 2 overloads.
Insert
Inserts the elements of a sequence into another sequence at a specified index.
Interleave
Interleaves the elements of two or more sequences into a single sequence, skipping sequences as they are consumed.
Lag
Produces a projection of a sequence by evaluating pairs of elements separated by a negative offset.
This method has 2 overloads.
Lead
Produces a projection of a sequence by evaluating pairs of elements separated by a positive offset.
This method has 2 overloads.
LeftJoin
Performs a left outer join between two sequences.
This method has 4 overloads.
MaxElementsBy
Returns the maxima (maximal elements) of the given sequence, based on the given projection.
This method has 2 overloads.
MinElementsBy
Returns the minima (minimal elements) of the given sequence, based on the given projection.
This method has 2 overloads.
Move
Returns a sequence with a range of elements in the source sequence moved to a new offset.
OrderBy
Sorts the elements of a sequence in a particular direction (ascending, descending) according to a key.
This method has 2 overloads.
OrderedMerge
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.
This method has 7 overloads.
Pad
Pads a sequence with default values if it is narrower (shorter in length) than a given width.
This method has 3 overloads.
PadStart
Pads a sequence with default values in the beginning if it is narrower (shorter in length) than a given width.
This method has 3 overloads.
Pairwise
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
PartialSort
Combines OrderBy
(where element is key) and Take
in a single operation.
This method has 4 overloads.
PartialSortBy
Combines OrderBy
and Take
in a single operation.
This method has 4 overloads.
Partition
Partitions a sequence by a predicate, or a grouping by Boolean keys or up to 3 sets of keys.
This method has 10 overloads.
Permutations
Generates a sequence of lists that represent the permutations of the original sequence
Pipe
Executes the given action on each element in the source sequence and yields it
PreScan
Performs a pre-scan (exclusive prefix sum) on a sequence of elements
Random
Returns an infinite sequence of random integers using the standard .NET random number generator.
This method has 6 overloads.
RandomDouble
Returns an infinite sequence of random double values between 0.0 and 1.0.
This method has 2 overloads.
RandomSubset
Returns a sequence of a specified size of random elements from the original sequence.
This method has 2 overloads.
Rank
Ranks each item in the sequence in descending ordering using a default comparer.
This method has 2 overloads.
RankBy
Ranks each item in the sequence in descending ordering by a specified key using a default comparer.
This method has 2 overloads.
Repeat
Repeats the sequence indefinitely or a specific number of times.
This method has 2 overloads.
Return
Returns a single-element sequence containing the item provided.
RightJoin
Performs a right outer join between two sequences.
This method has 4 overloads.
RunLengthEncode
Run-length encodes a sequence by converting consecutive instances of the same
element into a KeyValuePair<T, int>
representing the item and its occurrence
count.
This method has 2 overloads.
Scan
Peforms a scan (inclusive prefix sum) on a sequence of elements.
This method has 2 overloads.
ScanBy
Applies an accumulator function over sequence element keys, returning the keys along with intermediate accumulator states.
This method has 2 overloads.
ScanRight
Peforms a right-associative scan (inclusive prefix) on a sequence of elements. This operator is the right-associative version of the Scan operator.
This method has 2 overloads.
Segment
Divides a sequence into multiple sequences by using a segment detector based on the original sequence.
This method has 3 overloads.
Sequence
Generates a sequence of integral numbers within the (inclusive) specified range.
This method has 2 overloads.
Shuffle
Returns a sequence of elements in random order from the original sequence.
This method has 2 overloads.
SkipUntil
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
Slice
Extracts elements from a sequence at a particular zero-based starting index
SortedMerge
Merges two or more sequences that are in a common order (either ascending or descending) into a single sequence that preserves that order.
This method has 2 overloads.
Split
Splits the source sequence by a separator.
This method has 12 overloads.
StartsWith
Determines whether the beginning of the first sequence is equivalent to the second sequence.
This method has 2 overloads.
Subsets
Returns a sequence of representing all of the subsets of any size that are part of the original sequence.
This method has 2 overloads.
TagFirstLast
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
TakeEvery
Returns every N-th element of a source sequence
TakeUntil
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
ThenBy
Performs a subsequent ordering of elements in a sequence in a particular direction (ascending, descending) according to a key.
This method has 2 overloads.
ToArrayByIndex
Creates an array from an IEnumerable<T> where a function is used to determine the index at which an element will be placed in the array.
This method has 6 overloads.
ToDataTable
Appends elements in the sequence as rows of a given object with a set of lambda expressions specifying which members (property or field) of each element in the sequence will supply the column values.
This method has 4 overloads.
ToDelimitedString
Creates a delimited string from a sequence of values. The delimiter used depends on the current culture of the executing thread.
This method has 15 overloads.
ToDictionary
Creates a dictionary from a sequence of key-value pair elements or tuples of 2.
This method has 4 overloads.
ToLookup
Creates a lookup from a sequence of key-value pair elements or tuples of 2.
This method has 4 overloads.
Transpose
Transposes the rows of a sequence into columns.
TraverseBreadthFirst
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.
TraverseDepthFirst
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.
Trace
Traces the elements of a source sequence for diagnostics.
This method has 3 overloads.
Unfold
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.
Window
Processes a sequence into a series of subsequences representing a windowed subset of the original
WindowLeft
Creates a left-aligned sliding window over the source sequence of a given size.
WindowRight
Creates a right-aligned sliding window over the source sequence of a given size.
ZipLongest
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.
This method has 3 overloads.
ZipShortest
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.
This method has 3 overloads.
Experimental Operators
THESE METHODS ARE EXPERIMENTAL. THEY MAY BE UNSTABLE AND UNTESTED. THEY MAY BE REMOVED FROM A FUTURE MAJOR OR MINOR RELEASE AND POSSIBLY WITHOUT NOTICE. USE THEM AT YOUR OWN RISK. THE METHODS ARE PUBLISHED FOR FIELD EXPERIMENTATION TO SOLICIT FEEDBACK ON THEIR UTILITY AND DESIGN/IMPLEMENTATION DEFECTS.
Use of experimental methods requires importing the MoreLinq.Experimental
namespace.
Aggregate
Applies multiple accumulator queries sequentially in a single pass over a sequence.
This method has 8 overloads.
Await
Creates a sequence query that streams the result of each task in the source sequence as it completes asynchronously.
This method has 2 overloads.
AwaitCompletion
Awaits completion of all asynchronous evaluations irrespective of whether they succeed or fail. An additional argument specifies a function that projects the final result given the source item and completed task.
Memoize
Creates a sequence that lazily caches the source as it is iterated for the first time, reusing the cache thereafter for future re-iterations. If the source is already cached or buffered then it is returned verbatim.
TrySingle
Returns the only element of a sequence that has just one element. If the sequence has zero or multiple elements, then returns a user-defined value that indicates the cardinality of the result sequence.
This method has 2 overloads.
Product | Versions Compatible and additional computed target framework versions. |
---|---|
.NET | net5.0 is compatible. net5.0-windows was computed. net6.0 is compatible. net6.0-android was computed. net6.0-ios was computed. net6.0-maccatalyst was computed. net6.0-macos was computed. net6.0-tvos was computed. net6.0-windows was computed. net7.0 was computed. net7.0-android was computed. net7.0-ios was computed. net7.0-maccatalyst was computed. net7.0-macos was computed. net7.0-tvos was computed. net7.0-windows was computed. net8.0 was computed. net8.0-android was computed. net8.0-browser was computed. net8.0-ios was computed. net8.0-maccatalyst was computed. net8.0-macos was computed. net8.0-tvos was computed. net8.0-windows was computed. |
.NET Core | netcoreapp3.1 is compatible. |
-
.NETCoreApp 3.1
- No dependencies.
-
net5.0
- No dependencies.
-
net6.0
- No dependencies.
NuGet packages (2)
Showing the top 2 NuGet packages that depend on SuperLinq:
Package | Downloads |
---|---|
SuperLinq.Async
This project enhances Async LINQ to Objects with the following methods: AggregateRight, AssertCount, AtLeast, AtMost, Choose, CollectionEqual, CompareCount, ConcurrentMerge, Consume, CountBetween, CountBy, CountDown, DenseRank, DenseRankBy, DistinctBy, ElementAt, EndsWith, Exactly, ExceptBy, FallbackIfEmpty, FillBackward, FillForward, Fold, From, Generate, GroupAdjacent, Index, IndexBy, Insert, Interleave, OrderBy, Pad, PadStart, PartialSort, PartialSortBy, Random, Rank, RankBy, RunLengthEncode, ScanBy, ScanRight, Segment, Sequence, SkipUntil, SortedMerge, Split, StartsWith, TagFirstLast, Take, TakeEvery, TakeUntil, ThenBy, Where, Window, WindowLeft, WindowRight, ZipLongest, ZipMap, ZipShortest |
|
Hussy.Net
A minified dialect of .NET languages designed with code golf in mind. |
GitHub repositories (1)
Showing the top 1 popular GitHub repositories that depend on SuperLinq:
Repository | Stars |
---|---|
recyclarr/recyclarr
Automatically sync TRaSH Guides to your Sonarr and Radarr instances
|
Version | Downloads | Last updated |
---|---|---|
6.2.0 | 11,803 | 7/17/2024 |
6.1.0 | 5,591 | 5/24/2024 |
6.0.1 | 6,838 | 4/30/2024 |
6.0.0 | 676 | 4/10/2024 |
6.0.0-preview.1 | 101 | 2/26/2024 |
5.4.0 | 13,917 | 11/27/2023 |
5.4.0-preview.1 | 108 | 11/22/2023 |
5.3.0 | 434 | 11/14/2023 |
5.2.0 | 4,840 | 7/8/2023 |
5.1.0 | 4,460 | 5/26/2023 |
5.0.0 | 702 | 4/28/2023 |
4.8.0 | 719 | 2/21/2023 |
4.7.0 | 587 | 1/30/2023 |
4.6.0 | 604 | 12/24/2022 |
4.5.0 | 827 | 11/28/2022 |
4.4.0 | 2,749 | 10/3/2022 |
4.3.0 | 621 | 9/28/2022 |
4.2.0 | 2,412 | 8/25/2022 |
4.1.0 | 564 | 8/12/2022 |
4.1.0-preview.2 | 121 | 7/25/2022 |
4.1.0-preview.1 | 121 | 7/21/2022 |
4.0.0 | 663 | 7/20/2022 |
4.0.0-preview.7 | 131 | 7/9/2022 |
4.0.0-preview.6 | 191 | 7/4/2022 |
4.0.0-preview.5 | 121 | 6/28/2022 |
4.0.0-preview.4 | 126 | 6/20/2022 |
4.0.0-preview.3 | 104 | 6/20/2022 |
4.0.0-preview.2 | 107 | 6/15/2022 |
4.0.0-preview.1 | 119 | 6/13/2022 |
4.0.0-preview.0.16 | 110 | 6/13/2022 |