Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci

golang persistent immutable treap sorted sets

A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.

generic, fast lookup on one dimensional intervals. The implementation is based on treaps, augmented for intervals. Treaps are randomized self balancing binary search trees.

fast IP to CIDR lookup, longest prefix match in golang

Proof of concept for dynamic Merkle tree

用golang语言实现的STL,在高并发时实现了线程安全