A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.
MIT License
慕课 liuyubobobo「玩转数据结构」课程的 Go 语言实现版本
Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci
The go-set package provides generic Set implementations for Go, including HashSet for types with ...
A collection of useful, performant, and threadsafe Go datastructures.
[WIP] Implementation of HAT-trie in Go
generic container
B-tree implementation for Go
This repo contains my notes on working with Go and computer systems.
A collection of generic data structures written in Go.
This is technically a B+Tree, but the btree name is easier on the tongoue :). Completely improvis...
Simple Implementation of Modified Merkle Patricia Tries
Data structure and algorithm library for go, designed to provide functions similar to C++ STL