An ordered collection implemented in Golang with O(log(N)) time complexity on adding / searching / removing
A simple value-sorted map type for Go that features constant-time reads and efficient iteration over records.
Streaming relation (overlap, distance, KNN) of (any number of) sorted genomic interval sets. #golang
Immutable collections for Go
A simple, fast, embeddable, persistent key/value store written in pure Go. It supports fully serializable transactions and many data structures such as list, set, sorted set.
GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON
Type-safe Redis client for Golang
skipset is a high-performance concurrent sorted set based on skip list. Up to 5.5x faster than sync.Map in typical pattern.