GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
-
Updated
Aug 18, 2024 - Go
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Generic PriorityQueues, Queues, Stacks, and Deque data structures for Go
dagger is a fast, concurrency safe, mutable, in-memory directed graph library. Also includes a number of generic, concurrency safe data-structures
Opinionated StackSet resource for managing application life cycle and traffic switching in Kubernetes
Data Structures with Go Language
The Cloud Posse Terraform Provider for various utilities (e.g. deep merging, stack configuration management)
qaz—A CLI tool for Templating & Managing stacks in AWS Cloudformation
Scalable stateless «zero config» service-name ingress for docker swarm mode with a fresh more secure approach
GoDS-Generic (Go Generic Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
Implements some containers (stack, queue, priorityQueue, set, arrayList, linkedList, map and btree) in golang
Package deque implements a very fast and efficient general purpose queue/stack/deque data structure that is specifically optimized to perform when used by Microservices and Serverless services running in production environments. https://godoc.org/github.com/ef-ds/deque
golang实现常用集合
Collection of simple generic data structures currently missing in Go's standard library.
Generic data structures in Go.
Generic Golang implementation of a few basic data structures.
Generic data structure using parameterized types in Golang.
Add a description, image, and links to the stack topic page so that developers can more easily learn about it.
To associate your repository with the stack topic, visit your repo's landing page and select "manage topics."