AlgorithmsPlayGround.NET
NetFabric.Hyperlinq
| AlgorithmsPlayGround.NET | NetFabric.Hyperlinq | |
|---|---|---|
| 2 | 4 | |
| 92 | 860 | |
| - | 0.3% | |
| 10.0 | 0.0 | |
| over 1 year ago | 3 months ago | |
| C# | C# | |
| - | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
AlgorithmsPlayGround.NET
-
I made a library containing all known sorting and searching algorithms and their performance
skillmaker-dev/AlgorithmsPlayGround.NET: Open source library containing known sorting and searching algorithms. (github.com)
- I made repository containing the sorting and searching algorithms a developer must know
NetFabric.Hyperlinq
-
Classes vs. Structs in .NET. How not to teach about performance
> AVX instructions, which is implemented for quite a few LINQ methods
Are you sure? Any examples of such methods? And does AVX actually helps?
I don’t think that’s possible because IMO AVX and other SIMD can only help for dense inputs. The C# type is ReadOnlySpan, however ReadOnlySpan doesn’t implement IEnumerable and therefore incompatible with LINQ.
There’s even an alternative LINQ to workaround https://github.com/NetFabric/NetFabric.Hyperlinq but that thing is a third-party library most people aren’t using.
- Like Regular LINQ, but Faster and Without Allocations: Is It Possible?
-
700,000 lines of code, 20 years, and one developer: How Dwarf Fortress is built
I know it C# it doesn't have to make heap allocations, here's a Linq-clone that mostly eliminates them: https://github.com/NetFabric/NetFabric.Hyperlinq
-
Array iteration performance in C# — Branching and Parallelization
I'm the developer of one of the libraries and you may find in the benchmarks that it performs better than most others.
What are some alternatives?
Fop - Filtering, Ordering (Sorting) and Pagination library for .Net Core, ASP.NET Core, C#
MoreLINQ - Extensions to LINQ to Objects
data-structures-and-algorithms-in-python - Data Structures and Algorithms in Python ( DSA )
ksqlDB.RestApi.Client-DotNet - ksqlDb.RestApi.Client is a C# LINQ-enabled client API for issuing and consuming ksqlDB push and pull queries and executing statements.
stalin-sort - Add a stalin sort algorithm in any language you like ❣️ if you like give us a ⭐️
LinqBenchmarks - Benchmarking LINQ and alternative implementations
IntervalUtility - .Net C # utility for working with intervals, such as time periods. The utility allows you to find intersections of periods, exclude periods, etc.
StructLinq - Implementation in C# of LINQ concept with struct
C# Algorithms - :books: :chart_with_upwards_trend: Plug-and-play class-library project of standard Data Structures and Algorithms in C#
MicroBenchmarksDotNet - C# Benchmarks for a better understanding of performance cost
CIDLib - The CIDLib general purpose C++ development environment
CQC - CQC (Charmed Quark Controller) a commercial grade, full featured, software based automation system. CQC is built on our CIDLib C++ development system, which is also available here on GitHub.