mirror of
https://github.com/nabbar/golib.git
synced 2025-09-27 04:06:05 +08:00
e3239db998
Package Monitoring : - use packag dedicated to monitor component - each monitor work as standalone server to monitor health - collect metrics to export them to prometheus exporter Package Prometheus : - review to simplify use for API and not API metrics - optimize code Package Status : - Rework to use Monitor package - Rework to use native json / text Marshaller interface Context : - rework context config (context var) to use sync map and sync RWMutex (WORM) - move gin context to dedicated sub package (dependancies of logger make circular dependencies) - optimize code Config : - rework to optimize sync / collect of component - rework status to monitor - remove monitor managment from config to each component - add a func to set default logger to implement inherit default logger options - optimize code IOUtils : - isolate logger / closer interface as a usable & public interface & instance - this interface / instance allow to collect io.closer over a context to close all if context is done Logger : - rework to use context.config map - rework to use ioutils closer - rework to allow options to inherit a default options, or the last version of options - optimize code Size : - Add package Size to calculate and manipulate size Byte or bit - Add encoding : Text/JSON/Yaml/Toml... - Add option to défine default unit : Byte or bit Other : - adjust following code - optimize code - limit use of atomic value - rework to use RWMutex instead of sync.Mutex to maximize capabilities of read instead of write - remove 32bit build for CI/CD - add darwin/arm64 build for CI/CD Bump Dependencies
100 lines
2.2 KiB
Go
100 lines
2.2 KiB
Go
/*
|
|
* MIT License
|
|
*
|
|
* Copyright (c) 2022 Nicolas JUHEL
|
|
*
|
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
* of this software and associated documentation files (the "Software"), to deal
|
|
* in the Software without restriction, including without limitation the rights
|
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
* copies of the Software, and to permit persons to whom the Software is
|
|
* furnished to do so, subject to the following conditions:
|
|
*
|
|
* The above copyright notice and this permission notice shall be included in all
|
|
* copies or substantial portions of the Software.
|
|
*
|
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
|
* SOFTWARE.
|
|
*
|
|
*
|
|
*/
|
|
|
|
package bloom
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/bits-and-blooms/bitset"
|
|
)
|
|
|
|
const defaultSize = 2 << 24
|
|
|
|
var seeds = []uint{7, 11, 13, 31, 37, 61}
|
|
|
|
type bloomFilter struct {
|
|
m sync.Mutex
|
|
Set *bitset.BitSet
|
|
Funcs [6]simpleHash
|
|
}
|
|
|
|
type BloomFilter interface {
|
|
Add(value string)
|
|
Contains(value string) bool
|
|
}
|
|
|
|
func NewBloomFilter() BloomFilter {
|
|
bf := new(bloomFilter)
|
|
|
|
for i := 0; i < len(bf.Funcs); i++ {
|
|
bf.Funcs[i] = simpleHash{defaultSize, seeds[i]}
|
|
}
|
|
|
|
bf.Set = bitset.New(defaultSize)
|
|
|
|
return bf
|
|
}
|
|
|
|
func (bf *bloomFilter) Add(value string) {
|
|
bf.m.Lock()
|
|
defer bf.m.Unlock()
|
|
|
|
for _, f := range bf.Funcs {
|
|
bf.Set.Set(f.hash(value))
|
|
}
|
|
}
|
|
|
|
func (bf *bloomFilter) Contains(value string) bool {
|
|
if value == "" {
|
|
return false
|
|
}
|
|
|
|
ret := true
|
|
|
|
bf.m.Lock()
|
|
defer bf.m.Unlock()
|
|
|
|
for _, f := range bf.Funcs {
|
|
ret = ret && bf.Set.Test(f.hash(value))
|
|
}
|
|
|
|
return ret
|
|
}
|
|
|
|
type simpleHash struct {
|
|
Cap uint
|
|
Seed uint
|
|
}
|
|
|
|
func (s *simpleHash) hash(value string) uint {
|
|
var result uint = 0
|
|
for i := 0; i < len(value); i++ {
|
|
result = result*s.Seed + uint(value[i])
|
|
}
|
|
return (s.Cap - 1) & result
|
|
}
|