add: add bufferpool for dict

internal/dict/dict.go

@@ -19,9 +19,10 @@ const (
 )
 
 var (
+	bufferpool    = pkg.NewBufferPool()
 	dictAllocator = pkg.NewAllocator[string, Idx]()
 )
- 
+
 // Dict is the hashmap for Rotom.
 type Dict struct {
 	mask   uint32
@@ -37,7 +38,7 @@ func New(options Options) *Dict {
 		dict.shards[i] = &shard{
 			options: &options,
 			index:   swiss.New(options.IndexSize, swiss.WithAllocator(dictAllocator)),
-			data:    make([]byte, 0, options.BufferSize),
+			data:    bufferpool.Get(options.BufferSize)[:0],
 		}
 	}
 	return dict
@@ -203,7 +204,7 @@ func (s *shard) evictExpired() {
 
 // migrate transfers valid key-value pairs to a new container to save memory.
 func (s *shard) migrate() {
-	newData := make([]byte, 0, len(s.data))
+	newData := bufferpool.Get(len(s.data))[:0]
 	nanosec := time.Now().UnixNano()
 	newIndex := swiss.New(s.index.Len(), swiss.WithAllocator(dictAllocator))
 
@@ -218,6 +219,7 @@ func (s *shard) migrate() {
 	})
 
 	s.index.Close()
+	bufferpool.Put(s.data)
 	s.index = newIndex
 	s.data = newData
 	s.unused = 0

internal/pkg/allocator.go

@@ -2,14 +2,14 @@ package pkg
 
 import (
 	"sync"
-	"sync/atomic"
 
 	"github.com/cockroachdb/swiss"
 )
 
+// Allocator is a group pool for swissmap.
 type Allocator[K comparable, V any] struct {
 	pool      *sync.Pool
-	miss, hit atomic.Uint64
+	miss, hit uint64
 }
 
 func NewAllocator[K comparable, V any]() *Allocator[K, V] {
@@ -25,11 +25,11 @@ func (p *Allocator[K, V]) Alloc(want int) []swiss.Group[K, V] {
 
 	if cap(*buf) < want {
 		*buf = make([]swiss.Group[K, V], want)
-		p.miss.Add(1)
+		p.miss++
 
 	} else {
 		*buf = (*buf)[:want]
-		p.hit.Add(1)
+		p.hit++
 	}
 
 	return *buf
@@ -40,9 +40,9 @@ func (p *Allocator[K, V]) Free(b []swiss.Group[K, V]) {
 }
 
 func (p *Allocator[K, V]) Miss() uint64 {
-	return p.miss.Load()
+	return p.miss
 }
 
 func (p *Allocator[K, V]) Hit() uint64 {
-	return p.hit.Load()
+	return p.hit
 }

internal/pkg/bufferpool.go

@@ -2,13 +2,12 @@ package pkg
 
 import (
 	"sync"
-	"sync/atomic"
 )
 
 // BufferPool is a bytes buffer pool.
 type BufferPool struct {
 	pool      *sync.Pool
-	miss, hit atomic.Uint64
+	miss, hit uint64
 }
 
 // Get returns buffer with length of want.
@@ -17,11 +16,11 @@ func (p *BufferPool) Get(want int) []byte {
 
 	if cap(*buf) < want {
 		*buf = make([]byte, want)
-		p.miss.Add(1)
+		p.miss++
 
 	} else {
 		*buf = (*buf)[:want]
-		p.hit.Add(1)
+		p.hit++
 	}
 
 	return *buf