sets_in_go
Sets in Go
Background: why sets are useful
Nobody has yet discovered a branch of mathematics that has successfully resisted formalization into set theory. (Thomas Forster, Logic Induction and Sets, p. 167)
Boolean logic and set theory are closely related
Examples

Web search result for “go set”.
Libraries
gen: type-driven code generation for Go
-
strset: Go
Set
type with rich
API to hold
string
elements.
bitset: a mapping between non-negative integers and boolean values, stored as bits on slices of uint64.
go-set: type-safe, zero-allocation sets for Go.
References
-
-
unique: package unique provides primitives for sorting slices removing repeated elements.
-
-
math/bits: standard library package for bitwise operations on uint types, introduced in Go 1.9
sets_in_go.txt · Last modified: 2018/10/03 05:29 by luciano