golang-set alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view golang-set alternatives based on common mentions on social networks and blogs.
-
gods
GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more -
go-datastructures
A collection of useful, performant, and threadsafe Go datastructures. -
roaring
Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog -
willf/bloom
Go package implementing Bloom filters, used by Milvus and Beego. -
gocache
☔️ A complete Go cache library that brings you multiple ways of managing your caches -
boomfilters
Probabilistic data structures for processing continuous, unbounded streams. -
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL -
hyperloglog
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom -
trie
Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching. -
go-geoindex
Go native library for fast point tracking and K-Nearest queries -
ttlcache
An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache] -
go-adaptive-radix-tree
Adaptive Radix Trees implemented in Go -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. -
goconcurrentqueue
Go concurrent-safe, goroutine-safe, thread-safe queue -
cuckoo-filter
Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现,优于布隆过滤器,可以定制化过滤器参数,并进行了空间优化 -
ring
Package ring provides a high performance and thread safe Go implementation of a bloom filter. -
go-rquad
:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go -
set
A simple Set data structure implementation in Go (Golang) using LinkedHashMap. -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers -
goset
Set is a useful collection but there is no built-in implementation in Go lang. -
hide
ID type with marshalling to/from hash to prevent sending IDs to clients.
Collect and Analyze Billions of Data Points in Real Time
Do you think we are missing an alternative of golang-set or a related project?
README
golang-set
The missing generic
set collection for the Go language. Until Go has sets built-in...use this.
Update 3/26/2022
- Packaged version:
2.0.0
release for generics support with breaking changes. - supports
new generic
syntax - Go
1.18.0
or higher
[With Generics](new_improved.jpeg)
Coming from Python one of the things I miss is the superbly wonderful set collection. This is my attempt to mimic the primary features of the set collection from Python. You can of course argue that there is no need for a set in Go, otherwise the creators would have added one to the standard library. To those I say simply ignore this repository and carry-on and to the rest that find this useful please contribute in helping me make it better by contributing with suggestions or PRs.
Features
- NEW Generics based implementation (requires Go 1.18 or higher)
- One common interface to both implementations
- a non threadsafe implementation favoring performance
- a threadsafe implementation favoring concurrent use
- Feature complete set implementation modeled after Python's set implementation.
- Exhaustive unit-test and benchmark suite
Trusted by
This package is trusted by many companies and thousands of open-source packages. Here are just a few sample users of this package.
- Notable projects/companies using this package
- Ethereum
- Docker
- 1Password
- Hashicorp
Star History
Usage
The code below demonstrates how a Set collection can better manage data and actually minimize boilerplate and needless loops in code. This package now fully supports generic syntax so you are now able to instantiate a collection for any comparable type object.
What is considered comparable in Go?
Booleans
,integers
,strings
,floats
or basically primitive types.Pointers
Arrays
Structs
if all of their fields are also comparable independently
Using this library is as simple as creating either a threadsafe or non-threadsafe set and providing a comparable
type for instantiation of the collection.
// Syntax example, doesn't compile.
mySet := mapset.NewSet[T]() // where T is some concrete comparable type.
// Therefore this code creates an int set
mySet := mapset.NewSet[int]()
// Or perhaps you want a string set
mySet := mapset.NewSet[string]()
type myStruct {
name string
age uint8
}
// Alternatively a set of structs
mySet := mapset.NewSet[myStruct]()
// Lastly a set that can hold anything using the any or empty interface keyword: interface{}. This is effectively removes type safety.
mySet := mapset.NewSet[any]()
Comprehensive Example
package main
import (
"fmt"
mapset "github.com/deckarep/golang-set/v2"
)
func main() {
// Create a string-based set of required classes.
required := mapset.NewSet[string]()
required.Add("cooking")
required.Add("english")
required.Add("math")
required.Add("biology")
// Create a string-based set of science classes.
sciences := mapset.NewSet[string]()
sciences.Add("biology")
sciences.Add("chemistry")
// Create a string-based set of electives.
electives := mapset.NewSet[string]()
electives.Add("welding")
electives.Add("music")
electives.Add("automotive")
// Create a string-based set of bonus programming classes.
bonus := mapset.NewSet[string]()
bonus.Add("beginner go")
bonus.Add("python for dummies")
}
Create a set of all unique classes. Sets will automatically deduplicate the same data.
all := required
.Union(sciences)
.Union(electives)
.Union(bonus)
fmt.Println(all)
Output:
Set{cooking, english, math, chemistry, welding, biology, music, automotive, beginner go, python for dummies}
Is cooking considered a science class?
result := sciences.Contains("cooking")
fmt.Println(result)
Output:
false
Show me all classes that are not science classes, since I don't enjoy science.
notScience := all.Difference(sciences)
fmt.Println(notScience)
Set{ music, automotive, beginner go, python for dummies, cooking, english, math, welding }
Which science classes are also required classes?
reqScience := sciences.Intersect(required)
Output:
Set{biology}
How many bonus classes do you offer?
fmt.Println(bonus.Cardinality())
Output:
2
Thanks for visiting!
-deckarep