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

UnionSets

Browse Source
This commit is contained in:
bloeys
2022-06-11 04:21:28 +04:00
parent 54908e7690
commit d523ee6e14
2 changed files with 41 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

33
nset.go
View File

@ -267,6 +267,39 @@ func (n *NSet[T]) Copy() *NSet[T] {
}
func UnionSets[T IntsIf](set1, set2 *NSet[T]) *NSet[T] {
newSet := NewNSet[T]()
for i := 0; i < BucketCount; i++ {
b1 := &set1.Buckets[i]
b2 := &set2.Buckets[i]
//Size bucket
bucketSize := b1.StorageUnitCount
if b2.StorageUnitCount > bucketSize {
bucketSize = b2.StorageUnitCount
}
newB := &newSet.Buckets[i]
newB.Data = make([]StorageType, bucketSize)
newB.StorageUnitCount = bucketSize
newSet.StorageUnitCount += bucketSize
//Union fields of both sets on the new set
for j := 0; j < len(b1.Data); j++ {
newB.Data[j] |= b1.Data[j]
}
for j := 0; j < len(b2.Data); j++ {
newB.Data[j] |= b2.Data[j]
}
}
return newSet
}
func NewNSet[T IntsIf]() *NSet[T] {
n := &NSet[T]{

8
nset_test.go
View File

@ -67,6 +67,14 @@ func TestNSet(t *testing.T) {
n7.Union(n6)
AllTrue(t, n6.ContainsAll(4, 7, 100, 1000), !n6.Contains(math.MaxUint32), n7.ContainsAll(4, 7, 100, 1000, math.MaxUint32), n7.StorageUnitCount == n7OldStorageUnitCount+n6.StorageUnitCount)
//UnionSets
n7 = nset.NewNSet[uint32]()
n7.AddMany(math.MaxUint32)
unionedSet := nset.UnionSets(n6, n7)
AllTrue(t, !n6.Contains(math.MaxUint32), !n7.ContainsAny(4, 7, 100, 1000), unionedSet.ContainsAll(4, 7, 100, 1000, math.MaxUint32), unionedSet.StorageUnitCount == n6.StorageUnitCount+n7OldStorageUnitCount)
}
func TestNSetFullRange(t *testing.T) {