Found 5 packages
Provides additional data collections, primitives and polyfills for .NET: ConcurrentHashSet<T>, AssociativeArray<T>, PriorityQueue<T>, Deque<T>.
Lua combines simple procedural syntax with powerful data description constructs based on associative arrays and extensible semantics. Lua is dynamically typed, runs by interpreting bytecode for a register-based virtual machine, and has automatic memory management with incremental garbage collection, making it ideal for configuration, scripting, and rapid prototyping.
A bunch of string extension functions, lightning fast token handling, associative arrays, generic associative, and several levels of multidiemtional associative arrays
Trie (a.k.a. prefix tree) is an ordered tree data structure that is used to store an associative array where the keys are usually strings. All the descendants of a node have a common prefix of the string associated with that node, and the root is associated with the empty string.
Associative collection like usual Dictionary<TKey, TValue>, but with comparer type preserved instead of hiding behind the interface. Enables devirtualization of calls to the key comparer. Enables reusing instances of inner array of entries via ArrayPool<T>.Shared. Provides ToFictionary() extension methods which replace conventional ToDictionary() for materializing LINQ queries.