Namespace BelNytheraSeiche.TrieDictionary
Classes
- AATreeRecordStore
A concrete implementation of BinaryTreeRecordStore that uses a self-balancing AA tree.
- AVLTreeRecordStore
A concrete implementation of BinaryTreeRecordStore that uses a self-balancing AVL tree.
- BasicRecordStore
An abstract base class for key-value record stores.
- BasicRecordStore.Record
Represents a single node in a linked list of records.
- BasicRecordStore.RecordAccess
Provides access to and manages a linked list of BasicRecordStore.Record objects.
- BasicRecordStore.SerializationOptions
Provides options to control the serialization process for key-value record stores.
- BinaryTreeRecordStore
An abstract base class for record stores that use a binary search tree to organize records.
- BitSet
Provides a mutable bit set for efficiently building large bit vectors.
- BitwiseVectorDictionary
A concrete implementation of KeyRecordDictionary that uses a high-performance, array-based trie structure.
- DirectedAcyclicGraphDictionary
A concrete implementation of KeyRecordDictionary that uses a Directed Acyclic Word Graph (DAWG).
- DoubleArrayDictionary
A concrete implementation of KeyRecordDictionary that uses a mutable Double-Array trie structure.
- HashMapRecordStore
A concrete implementation of BasicRecordStore that uses a hash map as its underlying data structure.
- ImmutableBitSet
Represents a read-only, immutable bit set.
- KeyRecordDictionary
An abstract base class for advanced key-record dictionaries.
- KeyRecordDictionary.SerializationOptions
Provides options to control the serialization process for dictionary data structures.
- KeyRecordDictionary.StringSpecialized
Provides a string-specialized wrapper around an KeyRecordDictionary.IKeyAccess instance, simplifying operations by handling string-to-byte encoding and decoding.
- LevelOrderBitsDictionary
An abstract base class for read-only, trie-based dictionaries that are constructed in level-order.
- LoudsDictionary
A concrete implementation of KeyRecordDictionary that uses a memory-efficient LOUDS (Level-Order Unary Degree Sequence) trie.
- PrimitiveRecordStore
Provides a low-level, memory-efficient data store for variable-length byte records.
- PrimitiveRecordStore.Record
Represents a handle to a single record within the store.
- PrimitiveRecordStore.RecordAccess
Provides access to a linked list of records within a PrimitiveRecordStore.
- PrimitiveRecordStore.SerializationOptions
Provides options to control the serialization process for data store.
- RankSelectBitSet
An immutable bit set optimized for high-performance Rank and Select operations.
- ScapegoatTreeRecordStore
A concrete implementation of BinaryTreeRecordStore that uses a self-balancing Scapegoat tree.
- TreapRecordStore
A concrete implementation of BinaryTreeRecordStore that uses a Treap.
- ValueBuffer<T>
Represents a buffer for value types, implemented using a list of array chunks.
- Xoroshiro128PlusPlus
Represents a 64-bit pseudo-random number generator based on the xoroshiro128++ algorithm.
- Xoshiro256PlusPlus
Represents a 64-bit pseudo-random number generator based on the xoshiro256++ algorithm.
Interfaces
- KeyRecordDictionary.IKeyAccess
Defines the primary public contract for all key-based operations within the dictionary.
- KeyRecordDictionary.IRecord
Defines a public contract for a single data record.
- KeyRecordDictionary.IRecordAccess
Defines a public contract for accessing and managing a list of records associated with a single key.
Enums
- KeyRecordDictionary.SearchDirectionType
Specifies the direction for key matching and sorting operations.