9bdcbe0447
Major integrations and fixes: - Added BACKBEAT SDK integration for P2P operation timing - Implemented beat-aware status tracking for distributed operations - Added Docker secrets support for secure license management - Resolved KACHING license validation via HTTPS/TLS - Updated docker-compose configuration for clean stack deployment - Disabled rollback policies to prevent deployment failures - Added license credential storage (CHORUS-DEV-MULTI-001) Technical improvements: - BACKBEAT P2P operation tracking with phase management - Enhanced configuration system with file-based secrets - Improved error handling for license validation - Clean separation of KACHING and CHORUS deployment stacks 🤖 Generated with [Claude Code](https://claude.ai/code) Co-Authored-By: Claude <noreply@anthropic.com>
60 lines
1.2 KiB
Go
60 lines
1.2 KiB
Go
package bitset
|
|
|
|
import "math/bits"
|
|
|
|
func popcntSlice(s []uint64) uint64 {
|
|
var cnt int
|
|
for _, x := range s {
|
|
cnt += bits.OnesCount64(x)
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntMaskSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
// this explicit check eliminates a bounds check in the loop
|
|
if len(m) < len(s) {
|
|
panic("mask slice is too short")
|
|
}
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] &^ m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntAndSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
// this explicit check eliminates a bounds check in the loop
|
|
if len(m) < len(s) {
|
|
panic("mask slice is too short")
|
|
}
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] & m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntOrSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
// this explicit check eliminates a bounds check in the loop
|
|
if len(m) < len(s) {
|
|
panic("mask slice is too short")
|
|
}
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] | m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|
|
|
|
func popcntXorSlice(s, m []uint64) uint64 {
|
|
var cnt int
|
|
// this explicit check eliminates a bounds check in the loop
|
|
if len(m) < len(s) {
|
|
panic("mask slice is too short")
|
|
}
|
|
for i := range s {
|
|
cnt += bits.OnesCount64(s[i] ^ m[i])
|
|
}
|
|
return uint64(cnt)
|
|
}
|