Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/NetFabric/NetFabric.Hyperlinq
High performance LINQ implementation with minimal heap allocations. Supports enumerables, async enumerables, arrays and Span<T>.
https://github.com/NetFabric/NetFabric.Hyperlinq
array async-enumerable buffer-pools csharp csharp-library dotnet dotnet-core dotnet-standard enumeration heap-allocations linq nuget-package performance reduced-heap-allocations simd span
Last synced: about 2 months ago
JSON representation
High performance LINQ implementation with minimal heap allocations. Supports enumerables, async enumerables, arrays and Span<T>.
- Host: GitHub
- URL: https://github.com/NetFabric/NetFabric.Hyperlinq
- Owner: NetFabric
- License: mit
- Created: 2019-01-06T22:19:47.000Z (over 5 years ago)
- Default Branch: main
- Last Pushed: 2024-02-14T09:36:43.000Z (7 months ago)
- Last Synced: 2024-05-12T13:32:34.655Z (4 months ago)
- Topics: array, async-enumerable, buffer-pools, csharp, csharp-library, dotnet, dotnet-core, dotnet-standard, enumeration, heap-allocations, linq, nuget-package, performance, reduced-heap-allocations, simd, span
- Language: C#
- Homepage:
- Size: 8.26 MB
- Stars: 860
- Watchers: 19
- Forks: 35
- Open Issues: 9
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
- csharp-source-generators - NetFabric.Hyperlinq -   generates overloads for its extension methods. (Projects using custom Source Generators "internally" / Other)
README
[](https://github.com/NetFabric/NetFabric.Hyperlinq/actions)
[](https://coveralls.io/github/NetFabric/NetFabric.Hyperlinq)
[](https://www.nuget.org/packages/NetFabric.Hyperlinq/)
[](https://www.nuget.org/packages/NetFabric.Hyperlinq/)
[](https://gitter.im/NetFabric/NetFabric.Hyperlinq)
# NetFabric.Hyperlinq
`NetFabric.Hyperlinq` contains alternative implementations of many operations found in the `System.Linq` namespace:
- Uses value-types to improve performance by making method calls non-virtual and reducing GC collections by not allocating on the heap.
- Adds support for `Span<>`, `ReadOnlySpan<>`, `Memory<>` and `ReadOnlyMemory<>`.
- [Nullable reference type](https://docs.microsoft.com/en-us/dotnet/csharp/nullable-references) annotations.
- One single NuGet package support for both sync and async enumerables.
This implementation **favors performance in detriment of assembly binary size** (lots of overloads).
## Contents
- [Fast enumeration](#fast-enumeration)
- [Reduced heap allocations](#reduced-heap-allocations)
- [Benchmarks](#benchmarks)
- [Usage](#usage)
- [Value delegates](#value-delegates)
- [Generation operations](#generation-operations)
- [Method return types](#method-return-types)
- [Composition](#composition)
- [Option](#option)
- [Buffer pools](#buffer-pools)
- [SIMD](#simd)
- [Documentation](#documentation)
- [Supported operations](#supported-operations)
- [References](#references)
- [Credits](#credits)
- [License](#license)
## Fast enumeration
`NetFabric.Hyperlinq` can enumerate faster the results of a query than `System.Linq` by performing all of the following:
- Merges multiple enumerators into a single one for several more scenarios.
- It does not box value-type enumerators so, calls to the `Current` property and the `MoveNext()` method are non-virtual.
- All the enumerables returned by operations define a value-type enumerator.
- Whenever possible, the enumerator returned by the public `GetEnumerator()` or `GetAsyncEnumerator()` does not implement `IDisposable`. This allows the `foreach` that enumerates the result to be inlinable.
- Operations enumerate the source using the indexer when the source is an array, `ArraySegment<>`, `Span<>`, `ReadOnlySpan<>`, `Memory<>`, `ReadOnlyMemory<>`, or implements `IReadOnlyList<>`.
- `Range()` and `Repeat()` return enumerables that implement `IReadOnlyCollection<>` and `ICollection<>`. `Return()` and `Select()` return enumerables that implement `IReadOnlyList<>` and `IList<>`.
- Use of buffer pools in operations like `Distinct()`, `ToArray()` and `ToList()`.
- Use of SIMD in `Sum()` and `SelectVector()`.
- Elimination of conditional branchs in `Where().Count()`.
- Allows the JIT compiler to perform optimizations on array enumeration whenever possible.
- Takes advantage of `EqualityComparer<>.Default` devirtualization whenever possible.
The performance is equivalent when the enumerator is a reference-type. This happens when the enumerable is generated using `yield` or when it's cast to one of the BCL enumerable interfaces (`IEnumerable`, `IEnumerable<>`, `IReadOnlyCollection<>`, `ICollection<>`, `IReadOnlyList<>`, `IList<>`, or `IAsyncEnumerable<>`). In the case of operation composition, this only affects the first operation. The subsequent operations will have value-type enumerators.
## Reduced heap allocations
`NetFabric.Hyperlinq` allocates as much as possible on the stack. Enumerables and enumerators are defined as value-types. Generics constraints are used for the operation parameters so that the value-types are not boxed.
It only allocates on the heap for the following cases:
- Operations that use `ICollection<>.CopyTo()`, `ICollection<>.Contains()`, or `IList<>.IndexOf()` will box enumerables that are value-types.
- `ToArray()` and `ToList()` allocate their results on the heap. You can use the `ToArray()` overload that take an buffer pool as parameter so that its result is not managed by the garbage collector.
## Benchmarks
The results of the benchmarks comparing multiple LINQ libraries can be found in the [LinqBenchmarks](https://github.com/NetFabric/LinqBenchmarks) repository.
The results of the benchmarks included in this repository can be found in the [Benchmarks](https://github.com/NetFabric/NetFabric.Hyperlinq/tree/main/Benchmarks) folder.
The names of the benchmarks are structured as follow:
- The library used:
- _Linq_ - the `System.Linq` namespace (includes [System.Linq.Async](https://www.nuget.org/packages/System.Linq.Async/), [System.Interactive](https://www.nuget.org/packages/System.Interactive/), and [System.Interactive.Async](https://www.nuget.org/packages/System.Interactive.Async/))
- _StructLinq_ - [StructLinq](https://www.nuget.org/packages/StructLinq/)
- _Hyperlinq_ - [NetFabric.Hyperlinq](https://www.nuget.org/packages/NetFabric.Hyperlinq/)
- The type of collection used as source:
- _Array_ - an array
- _Span_ - a `Span<>`
- _Memory_ - a `Memory<>`
- _Enumerable_ - implements `IEnumerable<>`
- _Collection_ - implements `IReadOnlyCollection<>` and `ICollection<>`
- _List_ - implements `IReadOnlyList<>` and `IList<>` but is not an array
- _AsyncEnumerable_ - implements `IAsyncEnumerable<>`
- The type of enumerator provided by the source:
- _Value_ - the enumerator is a value type
- _Reference_ - the enumerator is a reference type
- How the result of the operation is iterated:
- _For_ - a `for` loop is used to call the indexer
- _Foreach_ - a `foreach` loop is used to call the enumerator
- Has a variant:
- _SIMD_ - using SIMD
## Usage
- Add the [`NetFabric.Hyperlinq` NuGet package](https://www.nuget.org/packages/NetFabric.Hyperlinq/) to your project.
- Optionally, also add the [`NetFabric.Hyperlinq.Analyzer` NuGet package](https://www.nuget.org/packages/NetFabric.Hyperlinq.Analyzer/) to your project. It's a Roslyn analyzer that suggests performance improvements on your enumeration source code. No dependencies are added to your assemblies.
- Add an `using NetFabric.Hyperlinq` directive to all source code files where you want to use `NetFabric.Hyperlinq`. It can coexist with `System.Linq` and `System.Linq.Async` directives:
``` csharp
using System;
using System.Linq;
using NetFabric.Hyperlinq; // add this directive
```
- Use the methods `AsValueEnumerable()` to make any collection usable with `NetFabric.Hyperlinq`. This includes arrays, `Memory<>`, `ReadOnlyMemory<>`, `Span<>`, `ReadOnlySpan<>`, BCL collections, and any other implementation of `IEnumerable<>`. Use `AsAsyncValueEnumerable()` for any implementation of `IAsyncEnumerable<>`.
``` csharp
public static void Example(IReadOnlyList list)
{
var result = list
.AsValueEnumerable()
.Where(item => item > 2)
.Select(item => item * 2);
foreach(var value in result)
Console.WriteLine(value);
}
```
- `Netfabric.Hyperlinq` contains special versions of `AsValueEnumerable()` for better performance with all collections in the `System.Collections.Immutable` namespace. Projects targetting .NET Framework, `netcoreapp2.1` or `netstandard2.0`, require the addition of the [`NetFabric.Hyperlinq.Immutable` NuGet package](https://www.nuget.org/packages/NetFabric.Hyperlinq.Immutable/) dependency.
- Most enumerables returned by `NetFabric.Hyperlinq` are compatible with `System.Linq`. The exception is enumerables for `Span<>` or `ReadOnlySpan<>`.
This allows the use of `System.Linq` operators on `NetFabric.Hyperlinq` enumerables. `OrderByDescending()` is not yet available in `Netfabric.Hyperlinq` but can still be used without requiring any conversion:
``` csharp
public static void Example(IReadOnlyList list)
{
var result = list
.AsValueEnumerable()
.Where(item => item > 2)
.OrderByDescending(item => item) // is not yet available in Netfabric.Hyperlinq
.AsValueEnumerable()
.Select(item => item * 2);
foreach(var value in result)
Console.WriteLine(value);
}
```
To add `NetFabric.Hyperlinq` operations after a `System.Linq` operation, simply add one more `AsValueEnumerable()` or `AsAsyncValueEnumerable()`.
### Value delegates
Calling a lambda expression for each item of the collection is very expensive. `NetFabric.Hyperlinq` supports an alternative that is not as practical but that has much better performance.
- Declare a `struct` that implements `IFunction<>`. Here's two examples of how to implement:
``` csharp
readonly struct MultiplyBy2
: IFunction
{
public int Invoke(int element)
=> element * 2;
}
readonly struct LessThan
: IFunction
{
readonly int value;
public LessThan(int value)
=> this.value = value;
public bool Invoke(int element)
=> element < value;
}
```
- Pass an instance as a parameter or just add the type to the generics arguments list (uses the default constructor):
``` csharp
public static void Example(IReadOnlyList list)
{
var result = list
.AsValueEnumerable()
.Where(new LessThan(10))
.Select();
foreach(var value in result)
Console.WriteLine(value);
}
```
The instances are allocated on the stack and the methods calls are non-virtual.
### Generation operations
In `NetFabric.Hyperlinq`, the generation operations like `Empty()`, `Range()`, `Repeat()` and `Return()` are static methods implemented in the static class `ValueEnumerable`. To use them, instead of the `System.Linq` equivalents, simply use `ValueEnumerable` instead of `Enumerable`.
``` csharp
public static void Example(int count)
{
var source = ValueEnumerable
.Range(0, count)
.Select(item => item * 2);
foreach(var value in source)
Console.WriteLine(value);
}
```
### Composition
`NetFabric.Hyperlinq` operations can be composed just like with `System.Linq`. The difference is on how each one optimizes the internals to reduce the number of enumerators required to iterate the values.
Both `System.Linq` and `NetFabric.Hyperlinq` optimize the code in the following example so that only one enumerator is used to perform both the `Where()` and the `Select()`:
``` csharp
var result = source.AsValueEnumerable()
.Where(item => item > 2)
.Select(item => item * 2);
```
`NetFabric.Hyperlinq` includes many more composition optimizations. In the following code, only one enumerator is used:
``` csharp
var result = array.AsValueEnumerable()
.Skip(1)
.Take(10)
.Where(item => item > 2)
.Select(item => item * 2)
.First();
```
### Option
In `System.Linq`, the aggregation operations like `First()`, `Single()` and `ElementAt()`, throw an exception when the source has no items. Often, empty collections are a valid scenario and exception handling is very slow. `System.Linq` has alternative methods like `FirstOrDefault()`, `SingleOrDefault()` and `ElementAtOrDefault()`, that return the `default` value instead of throwing. This is still an issue when the items are of a value-type, where there's no way to distinguish between an empty collection and a valid item.
In `NetFabric.Hyperlinq`, aggregation operations return an `Option<>` type. This is similar in behavior to the [`Nullable<>`](https://docs.microsoft.com/en-us/dotnet/api/system.nullable-1) but it can contain reference types.
Here's a small example using `First()`:
``` csharp
var result = source.AsValueEnumerable().First();
if (result.IsSome)
Console.WriteLine(result.Value);
```
It also provides a deconstructor so, you can convert it to a tuple:
``` csharp
var (isSome, value) = source.AsValueEnumerable().First();
if (isSome)
Console.WriteLine(value);
```
If you prefer a more functional approach, you can use `Match()` to specify the value returned when the collection has values and when it's empty. Here's how to use it to define the previous behavior of `First()` and `FirstOrDefault()`:
``` csharp
var first = source.AsValueEnumerable()
.First()
.Match(
item => item,
() => throw new InvalidOperationException("Sequence contains no elements"));
var firstOrDefault = source.AsValueEnumerable()
.First()
.Match(
item => item,
() => default);
Console.WriteLine(first);
Console.WriteLine(firstOrDefault);
```
`Match()` can also be used to define actions:
``` csharp
source.AsValueEnumerable()
.First()
.Match(
item => Console.WriteLine(item),
() => { });
```
The `NetFabric.Hyperlinq` operations can be applied to `Option<>`, including `Where()`, `Select()` and `SelectMany()`. These return another `Option<>` with the predicate/selector applied to the value, if it exists.
```csharp
source.AsValueEnumerable()
.First()
.Where(item => item > 2)
.Match(
item => Console.WriteLine(item),
() => { });
```
### Buffer pools
[Buffer pools](https://adamsitnik.com/Array-Pool/) allow the use of heap memory without adding pressure to the garbage collector. It pre-allocates a chunk of memory and "rents" it as required. The garbage collector will add this memory to the Large Object Heap (LOH).
`ToArray()` is frequently used to cache values for a brief period and the use of buffer pools may be useful.
`Netfabric.Hyperlinq` adds an overload that takes a `ArrayPool<>` as a parameter:
``` csharp
void Method()
{
using var buffer = source.AsValueEnumerable()
.ToArray(ArrayPool.Shared);
var memory = buffer.Memory;
// use memory here
}
```
It returns an instance of a [`IMemoryOwner<>`](https://docs.microsoft.com/en-us/dotnet/api/system.buffers.imemoryowner-1). The `using` statement guarantees that it is disposed and the buffer automatically returned to the pool.
### SIMD
`NetFabric.Hyperlinq` uses SIMD implicitly to improve performance of some operations. Many times this can only be done explicitly because it can only be used on a limited number of types and operations on them.
In `NetFabric.Hyperlinq`, alternative methods that use SIMD, have the word `Vector` at the end of its name. You'll also find that the operations that require an expression, now require two.
``` csharp
var result = list
.AsValueEnumerable()
.SelectVector(item = item * 2, item = item * 2)
.ToArray();
```
SIMD improves performance by performing the same operations simultaneously on multiple items. The operation can only be performed if this number is met. This means that the remaining number of items has to be processed without SIMD. The first expression is applied on a [`System.Numerics.Vector<>`](https://docs.microsoft.com/en-us/dotnet/api/system.numerics.vector-1), while the second one is applied on an item.
These methods also support the use of [value delegates](#value-delegates). In this case, the `struct` containing the expressions must implement two `IFunction<,>`:
``` csharp
readonly struct MultiplyBy2
: IFunction, Vector>
, IFunction
{
public Vector Invoke(Vector element)
=> element * 2;
public int Invoke(int element)
=> element * 2;
}
public static void Example(List list)
{
var result = list
.AsValueEnumerable()
.SelectVector()
.ToArray();
foreach(var value in result)
Console.WriteLine(value);
}
```
Please note that the operation `SelectVector()` does not return an enumerable. It returns the context required for subsequent operations like `ToArray()`, `ToList()`, and `Sum()`.
Up until now I haven't found a way to improve the performance of `Select()` by using SIMD. The returned context allows the use of composition, exposing only the operations that can gain with the use of SIMD.
## Documentation
Articles explaining implementation:
- [Optimizing LINQ](https://medium.com/@antao.almada/netfabric-hyperlinq-optimizing-linq-348e02566cef)
- [Generation Operations](https://medium.com/@antao.almada/netfabric-hyperlinq-generation-operations-6530826a70ca)
- [Select Operation](https://medium.com/@antao.almada/netfabric-hyperlinq-select-operation-e4ac2bbfb187)
- [Zero Allocation](https://medium.com/@antao.almada/netfabric-hyperlinq-zero-allocation-fe5d0dd6b1a6)
## Supported operations
- Aggregation
- `Count()`
- `Sum()`
- Conversion
- `AsEnumerable()`
- `AsValueEnumerable()`
- `ToArray()`
- `ToList()`
- `ToDictionary(Func)`
- `ToDictionary(Func, IEqualityComparer)`
- `ToDictionary(Func, Func)`
- `ToDictionary(Func, Func, IEqualityComparer)`
- Element
- `ElementAt()`
- `First()`
- `Single()`
- Filtering
- `Where(Func)`
- `Where(Func)`
- Generation
- `Create(Func)`
- `Empty()`
- `Range(int, int)`
- `Repeat(TSource, int)`
- `Return(TSource)`
- Projection
- `Select(Func)`
- `Select(Func)`
- `SelectMany(IValueEnumerable)`
- Partitioning
- `Take(int)`
- `Skip(int)`
- Quantifier
- `All(Func)`
- `All(Func)`
- `Any()`
- `Any(Func)`
- `Any(Func)`
- `Contains(TSource)`
- `Contains(TSource, IEqualityComparer)`
- Set
- `Distinct(TSource)`
- `Distinct(TSource, IEqualityComparer)`
## References
- [Enumeration in .NET](https://blog.usejournal.com/enumeration-in-net-d5674921512e) by Antão Almada
- [Performance of value-type vs reference-type enumerators](https://medium.com/@antao.almada/performance-of-value-type-vs-reference-type-enumerators-820ab1acc291) by Antão Almada
- [Performance Tuning for .NET Core](https://reubenbond.github.io/posts/dotnet-perf-tuning) by Reuben Bond
- [ValueLinqBenchmarks](https://gist.github.com/benaadams/294cbd41ec1179638cb4b5495a15accf) by Ben Adams
- [C# - How method calling works](http://www.levibotelho.com/development/how-method-calling-works/) by Levi Botelho
- [Improving .NET Disruptor performance — Part 2](https://medium.com/@ocoanet/improving-net-disruptor-performance-part-2-5bf456cd595f) by Olivier Coanet
- [Optimizing string.Count all the way from LINQ to hardware accelerated vectorized instructions](https://medium.com/@SergioPedri/optimizing-string-count-all-the-way-from-linq-to-hardware-accelerated-vectorized-instructions-186816010ad9) by Sergio Pedri
- [Simulating Return Type Inference in C#](https://tyrrrz.me/blog/return-type-inference) by Alexey Golub
- [Pooling large arrays with ArrayPool](https://adamsitnik.com/Array-Pool/) by Adam Sitnik
## Credits
The following open-source projects are used to build and test this project:
- [.NET](https://github.com/dotnet)
- [BenchmarkDotNet](https://benchmarkdotnet.org/)
- [coveralls](https://coveralls.io)
- [coverlet](https://github.com/tonerdo/coverlet)
- [ILRepack](https://github.com/gluck/il-repack)
- [ILRepack.MSBuild.Task](https://github.com/peters/ILRepack.MSBuild.Task)
- [NetFabric.Assertive](https://github.com/NetFabric/NetFabric.Assertive)
- [NetFabric.Hyperlinq.Analyzer](https://github.com/NetFabric/NetFabric.Hyperlinq.Analyzer)
- [Nullable](https://github.com/manuelroemer/Nullable)
- [Source Link](https://github.com/dotnet/sourcelink)
- [xUnit.net](https://xunit.net/)
## License
This project is licensed under the MIT license. See the [LICENSE](LICENSE) file for more info.