File: setop_other.go

package info (click to toggle)
golang-github-greatroar-blobloom 0.7.1-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, forky, sid, trixie
  • size: 252 kB
  • sloc: sh: 10; makefile: 3
file content (115 lines) | stat: -rw-r--r-- 2,829 bytes parent folder | download
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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// Copyright 2020 the Blobloom authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

//go:build (!amd64 && !arm64) || nounsafe
// +build !amd64,!arm64 nounsafe

package blobloom

import (
	"math/bits"
	"sync/atomic"
)

func (f *Filter) intersect(g *Filter) {
	for i := range f.b {
		f.b[i].intersect(&g.b[i])
	}
}

func (f *Filter) union(g *Filter) {
	for i := range f.b {
		f.b[i].union(&g.b[i])
	}
}

func (b *block) intersect(c *block) {
	b[0] &= c[0]
	b[1] &= c[1]
	b[2] &= c[2]
	b[3] &= c[3]
	b[4] &= c[4]
	b[5] &= c[5]
	b[6] &= c[6]
	b[7] &= c[7]
	b[8] &= c[8]
	b[9] &= c[9]
	b[10] &= c[10]
	b[11] &= c[11]
	b[12] &= c[12]
	b[13] &= c[13]
	b[14] &= c[14]
	b[15] &= c[15]
}

func (b *block) union(c *block) {
	b[0] |= c[0]
	b[1] |= c[1]
	b[2] |= c[2]
	b[3] |= c[3]
	b[4] |= c[4]
	b[5] |= c[5]
	b[6] |= c[6]
	b[7] |= c[7]
	b[8] |= c[8]
	b[9] |= c[9]
	b[10] |= c[10]
	b[11] |= c[11]
	b[12] |= c[12]
	b[13] |= c[13]
	b[14] |= c[14]
	b[15] |= c[15]
}

func onescount(b *block) (n int) {
	n += bits.OnesCount32(b[0])
	n += bits.OnesCount32(b[1])
	n += bits.OnesCount32(b[2])
	n += bits.OnesCount32(b[3])
	n += bits.OnesCount32(b[4])
	n += bits.OnesCount32(b[5])
	n += bits.OnesCount32(b[6])
	n += bits.OnesCount32(b[7])
	n += bits.OnesCount32(b[8])
	n += bits.OnesCount32(b[9])
	n += bits.OnesCount32(b[10])
	n += bits.OnesCount32(b[11])
	n += bits.OnesCount32(b[12])
	n += bits.OnesCount32(b[13])
	n += bits.OnesCount32(b[14])
	n += bits.OnesCount32(b[15])

	return n
}

func onescountAtomic(b *block) (n int) {
	n += bits.OnesCount32(atomic.LoadUint32(&b[0]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[1]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[2]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[3]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[4]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[5]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[6]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[7]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[8]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[9]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[10]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[11]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[12]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[13]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[14]))
	n += bits.OnesCount32(atomic.LoadUint32(&b[15]))

	return n
}