Efficient data structures for Node: heaps, queues, tries, string builders etc.
Set of efficient data structures based on skip lists.
Efficient data structures for every day programming
A robust and efficient data structures library.
Efficient data structures that represent renderable scenes
Immutable Data Collections
Binary serialization which sorts bytewise for arbirarily complex data structures
Three efficient data structures to save and traverse indexed chunks of information (like torrent blocks or HLS segments)
A high-performance JavaScript and TypeScript library offering a comprehensive set of efficient data structures. Simplify your algorithm implementation and data manipulation with optimized, easy-to-use tools.
JS implementation of probabilistic data structures: Bloom Filter (and its derived), HyperLogLog, Count-Min Sketch, Top-K and MinHash
Binary serialization of arbitrarily complex structures that sort element-wise
Miscellaneous indices for graphology.
Efficient, compact binary format for serializing data structures with extensible typing
Simple, efficient, scalable, high-performance LMDB interface
Tokenized zip support
A universally-unique, lexicographically-sortable, identifier generator
[](https://www.npmjs.com/package/@smithy/types) [](https://www.npmjs.com/package/@smithy/types)
Codecs for various data structures
Intuitive magical memoization library with Proxy and WeakMap
a CSS selector compiler/engine
Job manager
Provides functionality related to source maps.
This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.
javascript standard data structure library which benchmark against C++ STL
An efficient tree structure for querying on data with overlapping ranges
FractionalIndexer is a Ruby gem designed to leverage fractional indexing for ordering within lists or data structures. it enables efficient sorting and insertion of large volumes of data.
A directed acyclic word graph in Ruby.
A Deque is a queue type data structure that allows efficient insertion and deletion from both ends of the queue. This implementation wrapps the standard C++ structure of the same name.
Ruby binding for marisa-trie which is a static and space-efficient trie data structure.
Adds Redis::Bloomfilter class which can be used as ditributed bloom filter implementation on Redis. A Bloom filter is a space-efficient probabilistic data structure that is used to test whether an element is a member of a set.
Union Find is an algorithm that uses a disjoint-set data structure. It allows us to efficiently connect any items of a given list and to efficiently check whether two items of this list are connected (any degree of separation) or not.
ActiveModel::Caching is a versatile gem for managing structured, temporary data using a caching backend, typically Rails cache for Rails applications. This gem provides an easy-to-use API for storing, retrieving, and manipulating data structures like scalars, lists, and JSON, making it simple to handle transient data without adding extra dependencies.
A ruby implementation of the canonical serialization for the Libra network. Canonical serialization guarantees byte consistency when serializing an in-memory data structure. It is useful for situations where two parties want to efficiently compare data structures they independently maintain. It happens in consensus where independent validators need to agree on the state they independently compute. A cryptographic hash of the serialized data structure is what ultimately gets compared. In order for this to work, the serialization of the same data structures must be identical when computed by independent validators potentially running different implementations of the same spec in different languages.
A Ruby implementation of the famous Doubly Linkedlist data structure with support to the Enumerable methods such as `each`, `to_a`, `map`, etc. following ruby idioms. Supports Queue operations as well as Stack operations. A Linkedlist is efficient in many specific cases(eg:- Queue operations) than other data structures such as Array.
A comprehensive Ruby client for interacting with the Rospatent patent search API. Features include automatic caching, request validation, structured logging, error handling, and batch operations for efficient patent data retrieval.
A gem that provides deterministic encryption for JSONB fields while maintaining queryability. It encrypts values within JSON structures while preserving the structure itself, allowing for efficient querying of encrypted data.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.