zyedidia/generic
Generic
This project is a comprehensive library of type-safe, high-performance data structures for Go. By leveraging language-level generics, it provides reusable containers and algorithms that eliminate the need for runtime type assertions or interface casting, ensuring efficient and type-safe data management.
The library distinguishes itself through its support for persistent data structures and specialized indexing. It utilizes copy-on-write semantics and memory sharing to maintain multiple versions of a collection, allowing for efficient modifications without duplicating entire datasets. Additionally, it includes advanced structures such as interval trees for range-based queries and trie implementations for rapid prefix searching and hierarchical data retrieval.
The collection covers a broad range of foundational storage mechanisms, including associative mappings, heaps, queues, stacks, and cache-friendly unrolled lists. It also provides utilities for memory-constrained storage, featuring automatic eviction policies and custom callbacks to manage capacity effectively. These components are designed to support complex state management and high-performance data processing tasks.
Features
- Go Generic Collections - Provides a comprehensive suite of optimized data structures including trees, heaps, and hash maps for Go.
- Persistent Collections - Maintains historical states of collections by sharing memory between versions to allow efficient modifications.
- Caching Structures - Managing memory-constrained data stores with automatic eviction policies to maintain optimal performance for frequently accessed items.
- Map Data Structures - Provides associative mappings using hashing or tree strategies for fast data access.
- Persistent Data Structures - Provides persistent data structures using copy-on-write semantics to maintain multiple versions of collections efficiently.
- Parameterized Type Definitions - Leverages language-level generics to provide type-safe data structures without runtime casting.
- Generic Data Structures - Leverages language generics to provide type-safe, reusable, and efficient data containers.
- Copy-on-Write Data Structures - Implements copy-on-write semantics to share memory between versions of data structures for efficient persistence.
- Unrolled List Implementations - Implements cache-friendly unrolled lists to reduce pointer overhead and improve traversal performance.
- Tree-Based Storage - The library organizes data in tree structures to facilitate fast searching, range queries, and interval management.
- Bidirectional Mappings - Maintains dual-index structures to allow efficient lookups in both directions.
- Self-Balancing Tree Implementations - The library maintains data in self-balancing binary search trees to keep keys sorted and ensure logarithmic performance for operations.
- Trie-Based Inverted Indexes - Provides trie-based indexing for rapid prefix searching and hierarchical data retrieval.
- Key-Value Pair Managers - Manages key-value pairs within hash-based structures that automatically resize for performance.
- Queue Implementations - Maintains collections where the first element added is the first one removed using linked structures.
- Trie Implementations - The library organizes data in prefix-based structures to enable efficient retrieval, prefix searching, and management of associated values.
- Multi-Value Mappings - Organizes data into key-value pairs where each key maps to multiple values.
- Unordered Unique Collection Management - The library stores collections of distinct elements using hash-based implementations to ensure membership uniqueness and efficient lookup.
- Sequence Slicing - The library provides methods to split, join, and extract segments of a sequence without copying underlying data to optimize memory usage.
- Augmented Trees - Provides augmented tree structures that maintain metadata for efficient range and intersection queries.
- Implementations - The library stores elements in a dynamic array that allows items to be added, removed, or inspected from the top.
- Grid Array Management - Stores and manipulates data in two-dimensional structures with coordinate-based access.
- Linked Lists - Stores elements in sequences where nodes point to neighbors for efficient modification.
- Heap Management Operations - Organizes elements in binary min-heap structures to ensure the smallest value is always accessible.
- Interval Tree Operations - Implements interval tree structures to provide efficient range-based queries and overlap detection with logarithmic performance.
- Interval Indexing Utilities - Identifies stored intervals that intersect with a range and returns associated values sorted by position.
- Linked Data Structures - Uses pointer-based nodes to manage collections and enable efficient insertion and removal.
- Memory-Limited Caches - Manages memory-constrained storage with automatic eviction policies to maintain fixed-capacity caches.
- Specialized Data Structures - Provides a suite of optimized data structures including stacks, queues, and interval trees for specialized access patterns.
- Comparison Logic Providers - Decouples data structures from specific types by delegating comparison logic to user-defined functions.
- Trie Data Structures - Implements prefix-based trie structures for rapid string indexing and hierarchical data retrieval.
- Prefix Trie Filters - Organizes string-indexed data in trie structures to enable rapid prefix searching and routing.
- Value Comparison Libraries - Provides utilities to evaluate the relative order of items for sorting and comparison.
