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.
83 lines
1.9 KiB
Go
83 lines
1.9 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package lru
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/luxfi/container/linked"
|
|
)
|
|
|
|
// Evictable allows the object to be notified when it is evicted
|
|
//
|
|
// Deprecated: Remove this once the vertex state no longer uses it.
|
|
type Evictable[K comparable] interface {
|
|
Key() K
|
|
Evict()
|
|
}
|
|
|
|
// Deduplicator is an LRU cache that notifies the objects when they are evicted.
|
|
//
|
|
// Deprecated: Remove this once the vertex state no longer uses it.
|
|
type Deduplicator[K comparable, V Evictable[K]] struct {
|
|
lock sync.Mutex
|
|
entryMap map[K]*linked.ListElement[V]
|
|
entryList *linked.List[V]
|
|
size int
|
|
}
|
|
|
|
// Deprecated: Remove this once the vertex state no longer uses it.
|
|
func NewDeduplicator[K comparable, V Evictable[K]](size int) *Deduplicator[K, V] {
|
|
return &Deduplicator[K, V]{
|
|
entryMap: make(map[K]*linked.ListElement[V]),
|
|
entryList: linked.NewList[V](),
|
|
size: max(size, 1),
|
|
}
|
|
}
|
|
|
|
// Deduplicate returns either the provided value, or a previously provided value
|
|
// with the same ID that hasn't yet been evicted
|
|
func (d *Deduplicator[_, V]) Deduplicate(value V) V {
|
|
d.lock.Lock()
|
|
defer d.lock.Unlock()
|
|
|
|
key := value.Key()
|
|
if e, ok := d.entryMap[key]; !ok {
|
|
if d.entryList.Len() >= d.size {
|
|
e = d.entryList.Front()
|
|
d.entryList.MoveToBack(e)
|
|
|
|
delete(d.entryMap, e.Value.Key())
|
|
e.Value.Evict()
|
|
|
|
e.Value = value
|
|
} else {
|
|
e = &linked.ListElement[V]{
|
|
Value: value,
|
|
}
|
|
d.entryList.PushBack(e)
|
|
}
|
|
d.entryMap[key] = e
|
|
} else {
|
|
d.entryList.MoveToBack(e)
|
|
|
|
value = e.Value
|
|
}
|
|
return value
|
|
}
|
|
|
|
// Flush removes all entries from the cache
|
|
func (d *Deduplicator[_, _]) Flush() {
|
|
d.lock.Lock()
|
|
defer d.lock.Unlock()
|
|
|
|
for d.entryList.Len() > 0 {
|
|
e := d.entryList.Front()
|
|
d.entryList.Remove(e)
|
|
|
|
delete(d.entryMap, e.Value.Key())
|
|
e.Value.Evict()
|
|
}
|
|
}
|