Functional tree editing, manipulation & navigation
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
Extremely fast double-ended queue implementation
Database designed for handle relation pair/pool address to token0 & token1 addresses
Parse and query computer programs source code
Parse and query computer programs source code
No description provided.
Patterns for TypeScript
Simple Typescript Stack with generics type support
Distributed tree
[](https://www.npmjs.com/package/@marianmeres/tree) [](https://jsr.io/@marianmeres/tree) [![License: MIT](https://img.shields.io/badge/Lic
A new and intuitive way to link Arweave transactions
Just Tree algorithms.
Tree data structure with customizable numerical tree-shaking.
An intelligent, zero-dependency utility to find and normalize URLs in text, with advanced punctuation and context handling.
Reduced ordered binary decision diagram library for JS
Computation tree logic library for JS
A Generic Zipper Library
Algorithms in Javasript
The fastest javascript implementation of a double-ended queue. Used by the official Redis, MongoDB, MariaDB & MySQL libraries for Node.js and many other libraries. Maintains compatability with deque.
Heap data structure implemented in TypeScript
Some data structure that will improve your development
Package to handle dot-quiver-based structures
The JavaScript fontpicker plugin
A Rust library for implementing and managing common data structures.
Persistent data structures with structural sharing
data structures for relational code
Login and authentication for rocket web apps. This crate provides functions to process login forms and to deal with private cookies easily.
B-field datastructure implementation in Rust
implements a golomb coded set as defined in BIP 158 -- provides encoding/decoding
data structure collection traits
Data structures for for deep_causality crate.
Mycelium intrusive data structures.
Reuse rustc_data_structures for compiler_base
Ha provides core structs and traits for programming with higher order structures in Rust
Core structs and traits for programming with higher order structures in Rust
Programatically declare your data structures for various contexts.
Data Structure Type
DataStructures101 is a simple gem that groups several implementations of common data structures usually taught in Computer Science courses.
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.
Data Structures that I decided to implement.
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.