4 repository-uri
Tree-based hash maps that optimize memory and update time through structural sharing.
Distinct from Hash Data Structures: Specific implementation of a hash data structure, whereas Hash Data Structures is a general category.
Explore 4 awesome GitHub repositories matching data & databases · Hash Array Mapped Tries. Refine with filters or upvote what's useful.
This is a persistent data structure library for JavaScript that provides collections which prevent the direct mutation of objects and arrays. It serves as an immutable state management tool and functional programming utility, ensuring that data remains unchanged after creation to simplify change detection and state tracking. The library enables the maintenance of application state by producing new versions of data structures during updates. It focuses on efficient data comparison by checking actual content instead of memory references and supports a functional programming workflow to prevent
Implements Hash Array Mapped Tries (HAMT) to provide efficient persistent maps and sets.
Immutable.js is a library of persistent data structures and a functional state management toolkit. It provides a collection of immutable objects and arrays that prevent direct mutation to ensure predictable state management in JavaScript applications. The library utilizes structural sharing to efficiently create new versions of data without full copying and implements lazy sequence processing to chain data transformations that execute only when values are requested. It also supports batch mutation processing, allowing multiple changes to be applied to a temporary mutable copy before returning
Implements Hash Array Mapped Tries to enable efficient updates of persistent collections through structural sharing.
go-datastructures is a collection of thread-safe and lock-free data structures designed for high-performance concurrent applications in Go. It provides a modular library of specialized algorithmic toolsets, including a lock-free collection library and an immutable data structure library. The project distinguishes itself through a suite of persistent AVL trees and hash array mapped tries that use branch-copying to preserve previous versions. It also implements non-blocking hash maps, queues, and tries that enable linearizable snapshots and concurrent updates without the use of mutual exclusion
Provides hash array mapped tries that optimize memory and enable fast lookups and snapshots.
Ancestry is a materialized path tree library for managing hierarchical data models in relational databases. It provides a framework for organizing records into tree structures, allowing for the efficient retrieval of ancestors and descendants through path-based storage. The project distinguishes itself through specialized tools for maintaining tree integrity and transforming data. It includes a tree integrity manager to handle orphaned nodes and a JSON tree serializer that converts hierarchical database records into nested hashes or arrays for API responses. The library covers a broad range
Transforms a subtree into nested hashes or serializable arrays to simplify conversion into JSON format.