/
set.go
35 lines (30 loc) · 1.08 KB
/
set.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
package solver
import (
"github.com/RoaringBitmap/roaring"
)
// ParIntersect returns the intersection of all given units
func ParIntersect(units ...*roaring.Bitmap) *roaring.Bitmap {
// Since dataset is relatively small, parallelism performs worse than single thread
return roaring.ParAnd(1, units...)
}
// ParIntersectCells returns the intersection of all given cells
func ParIntersectCells(cells []*Cell) *roaring.Bitmap {
marks := make([]*roaring.Bitmap, 0)
for _, cell := range cells {
marks = append(marks, roaring.BitmapOf(cell.Marks.ToArray()...))
}
return ParIntersect(marks...)
}
// ParUnion returns the union of all given units
func ParUnion(units ...*roaring.Bitmap) *roaring.Bitmap {
// Since dataset is relatively small, parallelism performs worse than single thread
return roaring.ParOr(1, units...)
}
// ParUnionCells returns the union of all given cells
func ParUnionCells(cells []*Cell) *roaring.Bitmap {
marks := make([]*roaring.Bitmap, 0)
for _, cell := range cells {
marks = append(marks, roaring.BitmapOf(cell.Marks.ToArray()...))
}
return ParUnion(marks...)
}