2 个仓库
Techniques for processing collections and sequences without triggering heap allocations to reduce garbage collection overhead.
Distinct from Zero-Allocation Conversions: Distinct from zero-allocation conversions or readers: focuses on the general pattern of processing sequences via value-type enumerators.
Explore 2 awesome GitHub repositories matching software engineering & architecture · Zero-Allocation Data Processing. Refine with filters or upvote what's useful.
ZLinq is a zero-allocation LINQ library and memory-efficient collection toolkit for C#. It provides a high-performance replacement for standard query operations by using value-type enumerators and pooled memory to eliminate heap allocations and reduce garbage collection overhead. The library features a C# source generator that automatically routes standard query method calls to these zero-allocation implementations. It further accelerates data processing through a SIMD accelerated data library, using hardware vectorization for numeric aggregations and bulk operations on primitive arrays and s
Provides high-performance data processing using value-type enumerators to eliminate heap allocations in memory-constrained environments.
Heapless is an embedded Rust data structure library that provides statically allocated, fixed-capacity collections for memory-constrained systems. It implements a zero-allocation runtime model where all collection elements are stored inline within their own value structure, completely removing the need for operating system interaction, global allocators, or runtime heap allocation. Capacity is specified at compile time through generic type parameters, ensuring every collection has a fixed upper bound known before execution. The library implements core language traits to provide standard coll
Avoids dynamic memory allocation entirely to prevent fragmentation and latency spikes in high-performance application code.