JavaScript data structures written in CoffeeScript.
Codecs for various data structures
Curated collection of data structures for the JavaScript/TypeScript.
Editor state data structures for the CodeMirror code editor
Typewise-structured sorting for arbitrarily complex data structures
Binary serialization which sorts bytewise for arbirarily complex data structures
Handy data structures for elements keyed by string.
Type definitions for common Sanity data structures
Read/write XDR encoded data structures (RFC 4506)
Library of data structures
Shared TypeScript definitions for core Portable Text data structures
TypeScript types for core Notion data structures.
Priority queue data structures
data structures with idiomatic JavaScript collection interfaces
A react component library for visualizing tree data structures
Data structures which may be observed for changes.
Data structures for JavaScript
Javascript data structures (e.g., Map, Set) that support deep object equality
Type definitions for common Sanity Media Library data structures
An simple, relational SDK for querying TypeScript and JavaScript data structures
The Map & WeakMap data structures as a reactive signals.
Provide the common data structures and interfaces for web3 modules.
This package provides support for the [RedisBloom](https://redis.io/docs/data-types/probabilistic/) module, which adds additional probabilistic data structures to Redis.
toposort using modern ecma script data structures
A simple data structures crate in rust, WIP
Discrete Optimization utilitary library (data-structures)
A dynamic data structure for efficiently indexing arbitrary boolean expressions
A FIFO queue for efficiently hopping and skipping between tagged items
Persistent data structures with structural sharing
Moved to: https://crates.io/crates/deep_causality_data_structures
Data structures for for deep_causality crate.
A data structure to store values of multiple types
This crate provides Discrete Interval Tree Data-Structures, which are based off BTreeMap.
Represent and enumerate set partitions
A Rust library for implementing and managing common data structures.
A one-stop rust crate for high-speed, high-performance, high-concurrency data-structures.
DataStructures101 is a simple gem that groups several implementations of common data structures usually taught in Computer Science courses.
Data Structures that I decided to implement.
This small gem contains several data structures that I have implemented in Ruby to learn how they work. Sometimes it is not enough to read the description of a data structure and accompanying pseudo-code. Actually implementing it is often helpful in understanding what is going on. It is also usually fun. The gem contains basic implementions of Disjoint Union, Heap, Priority Search Tree, and Segment Tree. See the homepage for more details.
Awesome Data Structures such as Trees, Graphs etc
dry-schema provides a DSL for defining schemas with keys and rules that should be applied to values. It supports coercion, input sanitization, custom types and localized error messages (with or without I18n gem). It's also used as the schema engine in dry-validation.
map.rb is a string/symbol indifferent ordered hash that works in all rubies. out of the over 200 ruby gems i have written, this is the one i use every day, in all my projects. some may be accustomed to using ActiveSupport::HashWithIndiffentAccess and, although there are some similarities, map.rb is more complete, works without requiring a mountain of code, and has been in production usage for over 15 years. it has no dependencies, and suports a myriad of other, 'tree-ish' operators that will allow you to slice and dice data like a giraffee with a giant weed whacker.
Class to build custom data structures, similar to a Hash.
RubyTree is a Ruby implementation of the generic tree data structure. It provides simple APIs to store named nodes, and to access, modify, and traverse the tree. The data model is node-centric, where nodes in the tree are the primary structural elements. It supports all common tree-traversal methods (pre-order, post-order, and breadth first). RubyTree mixes in the Enumerable and Comparable modules and behaves like a standard Ruby collection (iteration, comparison, etc.). RubyTree also includes a binary tree implementation, which provides in-order node traversal besides the other methods. RubyTree can import from and export to JSON, and supports Ruby’s object marshaling.
Provides a DSL for generating immutable Ruby Data objects with type coercion and data transformation capabilities.
This gem is a Logstash plugin required to be installed on top of the Logstash core pipeline using $LS_HOME/bin/logstash-plugin install gemname. This gem is not a stand-alone program
Argument-specific data structures for Trailblazer such as Context and ContainerChain.
Allows defining structure of data and perform validation against it using json-schema
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.
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.