bloeys/nset
1
0
Fork 0
mirror of https://github.com/bloeys/nset.git synced 2025-12-29 14:28:20 +00:00
Code Issues Packages Projects Releases Wiki Activity

Improve docs

Browse Source
This commit is contained in:
bloeys
2022-06-11 04:31:56 +04:00
parent d523ee6e14
commit 02265fd5ab
1 changed files with 17 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
README.md
View File

@ -61,6 +61,7 @@ To install run `go get github.com/bloeys/nset`
Then usage is very simple: Then usage is very simple:
```go ```go
//Basic
mySet := nset.NewNSet[uint32]() mySet := nset.NewNSet[uint32]()
mySet.Add(0) mySet.Add(0)
@ -74,6 +75,22 @@ if mySet.Contains(5) {
mySet.Remove(4) mySet.Remove(4)
// Intersections
myOtherSet := nset.NewNSet[uint32]()
myOtherSet.AddMany(0, 1, 2, 4, 14)
println("There is intersection:", myOtherSet.HasIntersection(mySet)) //True
intersection := mySet.GetIntersection(myOtherSet)
println("The intersection contains 300:", intersection.Contains(300)) //False
println("The intersection contains 0 and 4:", intersection.ContainsAll(0, 4)) //True
//Unions
unionOfBothSets := nset.UnionSets(mySet, myOtherSet)
println(unionOfBothSets.ContainsAll(0, 1, 2, 4, 14, 256, 300)) //True
myOtherSet.Union(mySet) //This will change 'myOtherSet'
println(myOtherSet.ContainsAll(0, 1, 2, 4, 14, 256, 300)) //True
``` ```
## Benchmarks ## Benchmarks