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.
64 lines
1.1 KiB
Go
64 lines
1.1 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package iterator
|
|
|
|
import (
|
|
"sync"
|
|
|
|
"github.com/google/btree"
|
|
)
|
|
|
|
var _ Iterator[any] = (*tree[any])(nil)
|
|
|
|
type tree[T any] struct {
|
|
current T
|
|
next chan T
|
|
releaseOnce sync.Once
|
|
release chan struct{}
|
|
wg sync.WaitGroup
|
|
}
|
|
|
|
// FromTree returns a new iterator of the stakers in [tree] in ascending order.
|
|
// Note that it isn't safe to modify [tree] while iterating over it.
|
|
func FromTree[T any](btree *btree.BTreeG[T]) Iterator[T] {
|
|
if btree == nil {
|
|
return Empty[T]{}
|
|
}
|
|
it := &tree[T]{
|
|
next: make(chan T),
|
|
release: make(chan struct{}),
|
|
}
|
|
it.wg.Add(1)
|
|
go func() {
|
|
defer it.wg.Done()
|
|
btree.Ascend(func(i T) bool {
|
|
select {
|
|
case it.next <- i:
|
|
return true
|
|
case <-it.release:
|
|
return false
|
|
}
|
|
})
|
|
close(it.next)
|
|
}()
|
|
return it
|
|
}
|
|
|
|
func (i *tree[_]) Next() bool {
|
|
next, ok := <-i.next
|
|
i.current = next
|
|
return ok
|
|
}
|
|
|
|
func (i *tree[T]) Value() T {
|
|
return i.current
|
|
}
|
|
|
|
func (i *tree[_]) Release() {
|
|
i.releaseOnce.Do(func() {
|
|
close(i.release)
|
|
})
|
|
i.wg.Wait()
|
|
}
|