GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
-
Updated
May 26, 2024 - Go
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.
golang实现常用集合
A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
This library is inspired by functional programming - Clojure
Implements some containers (stack, queue, priorityQueue, set, arrayList, linkedList, map and btree) in golang
The go-set package provides generic Set implementations for Go, including HashSet for types with a Hash() function and TreeSet for orderable data
A versatile toolkit for k-mers with taxonomic information
GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Generic data structure using parameterized types in Golang.
A generic Go implementation of the Set data structure
Collection of simple generic data structures currently missing in Go's standard library.
A priority queue that shuffles elements with the same priority. Written in Go and inspired by https://github.com/mafintosh/shuffled-priority-queue.
Add a description, image, and links to the set topic page so that developers can more easily learn about it.
To associate your repository with the set topic, visit your repo's landing page and select "manage topics."