Popularity
3.8
Stable
Activity
0.0
Stable
23
21
11
Programming language: Go
License: BSD 3-clause "New" or "Revised" License
Tags:
Data Structures
set alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view 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. -
golang-set
A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp. -
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] -
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 -
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.
Clean code begins in your IDE with SonarLint
Up your coding game and discover issues early. SonarLint is a free plugin that helps you find & fix bugs and security issues from the moment you start writing code. Install from your favorite IDE marketplace today.
Promo
www.sonarlint.org
Do you think we are missing an alternative of set or a related project?
Popular Comparisons
README
Set
Set is a simple Set data structure implementation in Go (Golang) using LinkedHashMap.
This library allow you to get a set of int64
or string
without duplicated items.
Usage
package main
import (
"fmt"
"github.com/StudioSol/set"
)
func main() {
duplicatedInt64 := []int64{1, 1, 2, 2, 3, 3}
unduplicatedInt64 := set.NewLinkedHashSetINT64(duplicatedInt64...)
// Get a []int64 from set
unduplicatedArray := unduplicatedInt64.AsSlice()
fmt.Println(unduplicatedArray) // will print [1 2 3]
// Get the Length from set
fmt.Println(unduplicatedInt64.Length()) // will print 3
// Add new items in set
unduplicatedInt64.Add(1, 2, 3, 4)
fmt.Println(unduplicatedInt64.AsSlice()) // will print [1 2 3 4]
// Check if item is in set
fmt.Println(unduplicatedInt64.InArray(1)) // will print true
fmt.Println(unduplicatedInt64.InArray(5)) // will print false
// Get a []interface{} from set
interfaceList := unduplicatedInt64.AsInterface()
fmt.Println(interfaceList) // will print [1 2 3 4]
// Allow to iter over set
for i := range unduplicatedInt64.Iter() {
fmt.Println(i)
}
// Remove items from set
unduplicatedInt64.Remove(0, 1, 2, 3)
fmt.Println(unduplicatedInt64.AsSlice()) // will print [4]
}
// You have same methods to LinkedHashSetString