mirror of
https://github.com/luxfi/node.git
synced 2026-10-30 15:24:05 +00:00
zeekay
7cf87b230b
The module already called itself github.com/luxfi/node while containing no node in Go: cmd/luxd was twenty-one lines that printed the size of a few types, and the Go column of the matrix measured a VM plugin. A repo that fetches the thing it claims to be has not replaced it, so the Go sources move in — 1515 files, the daemon and everything under it — and the build reaches outside this module for nothing. Rust and C++ sit beside it unchanged and are still measured against it by the differential. That is the point of one repo: the reference implementation and the two ports are the same checkout, so parity is a thing you can run rather than a thing you assert. Verified: builds, and the closure carries no lux-private — checked at build time rather than believed. The daemon starts twelve chains on a local network (P X C Q Z A B G K M F, plus D through its plugin) and reports healthy.
88 lines
1.4 KiB
Go
88 lines
1.4 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package pubsub
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/luxfi/math/set"
|
|
"github.com/luxfi/node/pubsub/bloom"
|
|
)
|
|
|
|
type FilterParam struct {
|
|
lock sync.RWMutex
|
|
set set.Set[string]
|
|
filter bloom.Filter
|
|
}
|
|
|
|
func NewFilterParam() *FilterParam {
|
|
return &FilterParam{
|
|
set: make(set.Set[string]),
|
|
}
|
|
}
|
|
|
|
func (f *FilterParam) NewSet() {
|
|
f.lock.Lock()
|
|
defer f.lock.Unlock()
|
|
|
|
f.set = make(set.Set[string])
|
|
f.filter = nil
|
|
}
|
|
|
|
func (f *FilterParam) Filter() bloom.Filter {
|
|
f.lock.RLock()
|
|
defer f.lock.RUnlock()
|
|
|
|
return f.filter
|
|
}
|
|
|
|
func (f *FilterParam) SetFilter(filter bloom.Filter) bloom.Filter {
|
|
f.lock.Lock()
|
|
defer f.lock.Unlock()
|
|
|
|
f.filter = filter
|
|
f.set = nil
|
|
return f.filter
|
|
}
|
|
|
|
func (f *FilterParam) Check(addr []byte) bool {
|
|
f.lock.RLock()
|
|
defer f.lock.RUnlock()
|
|
|
|
if f.filter != nil && f.filter.Check(addr) {
|
|
return true
|
|
}
|
|
return f.set.Contains(string(addr))
|
|
}
|
|
|
|
func (f *FilterParam) Add(bl ...[]byte) error {
|
|
filter := f.Filter()
|
|
if filter != nil {
|
|
filter.Add(bl...)
|
|
return nil
|
|
}
|
|
|
|
f.lock.Lock()
|
|
defer f.lock.Unlock()
|
|
|
|
if f.set == nil {
|
|
return ErrFilterNotInitialized
|
|
}
|
|
|
|
if len(f.set)+len(bl) > MaxAddresses {
|
|
return ErrAddressLimit
|
|
}
|
|
for _, b := range bl {
|
|
f.set.Add(string(b))
|
|
}
|
|
return nil
|
|
}
|
|
|
|
func (f *FilterParam) Len() int {
|
|
f.lock.RLock()
|
|
defer f.lock.RUnlock()
|
|
|
|
return len(f.set)
|
|
}
|