Results for splay_tree

Fast Splay tree for Node and browser

A NodeJs implementation of Splay Tree binary search algorithm

Splay Tree based Data Structures (map, set, heap)

An intrusive splay tree implementation that is no-std compatible and free from allocation and moves.

The implementation of data structure splay tree in Rust. Splay tree uses splay algorithm to balance itself and it allows to access node (insert, search, delete) on average of O(logn).

A native implementation of a Splay Tree for Rust. Splay Trees are self-balancing binary search trees which adapt dynamically to lookups over time to allow common access patterns to frequently have better than log(n) lookup time.

Collections using splay trees

A segment tree library enabling generic user-defined queries and actions on segments of your data.

dynamic forest management

Rust implementation of the Martinez-Rueda Polygon Clipping Algorithm

Rust implementation of the Martinez-Rueda Polygon Clipping Algorithm

Binary delta compression — diff and apply for byte sequences, with rolling-hash matching, splay-tree indexing, and in-place patching.

A simple object arena

Splay map and splay set data structures.