High-performance immutable data structures for modern JavaScript and TypeScript applications. Functional interfaces, deep/composite operations API, mixed mutability API, TypeScript definitions, ES2015 module exports.

Black-White Array: fast, ordered data structure based on arrays with O(log N) memory allocations

Sorted set in golang.

This is an extension of Immutable.js that provides sorted collections SortedMap and SortedSet. The current implementation is using highly optimized B-tree memory structure.

SortedSet and SortedMap with skip list for Go

Leaderboard API implemented with Node.js and Redis.

𝗥𝗲𝗱𝗶𝘀 𝗦𝗲𝗿𝘃𝗲𝗿 + 𝗖𝗟𝗜 | 𝗣𝗲𝗿𝘀𝗶𝘀𝘁𝗲𝗻𝗰𝗲, 𝗥𝗲𝗽𝗹𝗶𝗰𝗮𝘁𝗶𝗼𝗻, 𝗣𝘂𝗯/𝗦𝘂𝗯, 𝗦𝘁𝗿𝗲𝗮𝗺𝘀, 𝗧𝗨𝗜

This Go package provides an implementation of sorted set in redis

(persistent) DAta Structures In Elixir.

Typescript implementations of in-memory cache data-structures for Node and Browser.

Top N Streaming Counter

Generic skip list implemented from scratch in Java as a fully compliant SortedSet<T> — O(log n) insert, search, and delete. Tested at 10M elements.

A faster, immutable replacement for Ruby's Set

Redis sorted set with size limit within time frame

an implementation of sorted set class in C++ using singly linked list.

An implementation of a skip list as a sorted set

Mainly change sorted set to hold time series elements which elements repeatable.

A comprehensive C# collection demonstrating core data structures with practical examples and complexity analysis

An immutable in-memory tree data structure for maintaining an ordered set of 32 bit integers.

Creating subsets from SoredSet.