Namespace Evergine.Common.Collections

Classes

CheckDictionary<K, V>

Dictionary implementation to detect when the collection is modified.

FastList<T>

List<T> implementation that allows you to access the internal array.

PriorityQueue<T>

An implementation of a min-Priority Queue using a heap. Has O(1) .Contains()! See https://bitbucket.org/BlueRaja/high-speed-priority-queue-for-c/wiki/Getting%20Started for more information.

SimpleCache<TKey, KValue>

Simple cache implementation.

Structs

FastBitSet32

A high-performance, stack-allocated structure wrapping a 32-bit unsigned integer (uint) to act as a set of boolean flags (bits). Provides fast indexing and highly optimized iteration over only the set bits using hardware intrinsics (BitOperations).

FastBitSet32.BitEnumerator

A custom struct enumerator designed to avoid heap allocation (GC) during iteration and use highly optimized bit-twiddling techniques (like TZCNT) to efficiently find only the set bits.

FastList<T>.Enumerator

A struct that represents the enumerator of the list.

FastStack<T>

Lightweight stack for primitive values (LIFO) to avoid List overhead.