ec1f89217a
Full Mattermost server source with integrated Community Enterprise features. Includes vendor directory for offline/air-gapped builds. Structure: - enterprise-impl/: Enterprise feature implementations - enterprise-community/: Init files that register implementations - enterprise/: Bridge imports (community_imports.go) - vendor/: All dependencies for offline builds Build (online): go build ./cmd/mattermost Build (offline/air-gapped): go build -mod=vendor ./cmd/mattermost 🤖 Generated with [Claude Code](https://claude.com/claude-code) Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
53 lines
1.3 KiB
Go
53 lines
1.3 KiB
Go
package bitset
|
|
|
|
import "math/bits"
|
|
|
|
func popcntSlice(s []uint64) (cnt uint64) {
|
|
for _, x := range s {
|
|
cnt += uint64(bits.OnesCount64(x))
|
|
}
|
|
return
|
|
}
|
|
|
|
func popcntMaskSlice(s, m []uint64) (cnt uint64) {
|
|
// The next line is to help the bounds checker, it matters!
|
|
_ = m[len(s)-1] // BCE
|
|
for i := range s {
|
|
cnt += uint64(bits.OnesCount64(s[i] &^ m[i]))
|
|
}
|
|
return
|
|
}
|
|
|
|
// popcntAndSlice computes the population count of the AND of two slices.
|
|
// It assumes that len(m) >= len(s) > 0.
|
|
func popcntAndSlice(s, m []uint64) (cnt uint64) {
|
|
// The next line is to help the bounds checker, it matters!
|
|
_ = m[len(s)-1] // BCE
|
|
for i := range s {
|
|
cnt += uint64(bits.OnesCount64(s[i] & m[i]))
|
|
}
|
|
return
|
|
}
|
|
|
|
// popcntOrSlice computes the population count of the OR of two slices.
|
|
// It assumes that len(m) >= len(s) > 0.
|
|
func popcntOrSlice(s, m []uint64) (cnt uint64) {
|
|
// The next line is to help the bounds checker, it matters!
|
|
_ = m[len(s)-1] // BCE
|
|
for i := range s {
|
|
cnt += uint64(bits.OnesCount64(s[i] | m[i]))
|
|
}
|
|
return
|
|
}
|
|
|
|
// popcntXorSlice computes the population count of the XOR of two slices.
|
|
// It assumes that len(m) >= len(s) > 0.
|
|
func popcntXorSlice(s, m []uint64) (cnt uint64) {
|
|
// The next line is to help the bounds checker, it matters!
|
|
_ = m[len(s)-1] // BCE
|
|
for i := range s {
|
|
cnt += uint64(bits.OnesCount64(s[i] ^ m[i]))
|
|
}
|
|
return
|
|
}
|