Fast Splay tree for Node and browser
A splay tree typescript library
Lightweight Splay tree javascript library for node, browser
Binary search tree data structure library for JavaScript
Generic Splay Tree implementation in TypeScript
A fast, zero-dependency sorted container suite for JavaScript.
usingbytes-dsa is comprehensive JavaScript library for common data structures and algorithms. This library is designed to be both educational and practical, providing implementations of fundamental data structures and algorithms that can be used in a vari
An intrusive splay tree implementation that is no-std compatible and free from allocation and moves.
Data Structures of daily use: Graph, HashTable, PriorityQueue, Trie, SuffixTree, Rope, SplayTree, SkipList, RedBlackTree.
A collection of geospatial tools primarily designed for WGS84, Web Mercator, and S2.
A binary search tree that supports fast clone and delete-range operations
Splay tree is an efficient implementation of a balanced binary search tree that takes advantage of locality in the keys used in incoming lookup requests. For many applications, there is excellent key locality.
A Splay Tree is a self adjusting binary search tree with the additional property that recently accessed elements are quick to access again. This makes it useful for caches because the most commonly accessed elements will be the fastest ones to access. This tree has an additional feature that allows it's maximum size to be restricted. When it exceeds it's maximum size, it will drop all of the nodes which are at the terminal ends of the tree structure, leaving many of the more commonly accessed nodes intact. This implementation is written in C++ with a Ruby wrapper.