Files
zeekayandHanzo Dev b45161c43f Take in units, heap and iterator ahead of the node's retirement
These three sit in luxfi/node under utils/, and P-Chain and X-Chain reach for
them. Both chains have to leave that repository before it can be archived, and
a chain should not have to depend on a node to measure a quantity in nLUX, keep
a heap, or walk a sequence. units imports nothing at all; heap wanted only
Zero, which is already here; iterator wanted heap and Zero.

Three of iterator's tests exercise it against platformvm's state iterators.
They stay with the node, and travel with platformvm, because a generic
sequence should not be tested through one virtual machine's idea of state.
What remains here covers the package on its own terms.

Co-authored-by: Hanzo Dev <[email protected]>
2026-09-06 04:10:58 -07:00

54 lines
1.0 KiB
Go

// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package iterator
import "github.com/luxfi/math/set"
var _ Iterator[any] = (*filtered[any])(nil)
type filtered[T any] struct {
it Iterator[T]
filter func(T) bool
}
// Filter returns an iterator that skips the elements in [it] that return true
// from [filter].
func Filter[T any](it Iterator[T], filter func(T) bool) Iterator[T] {
return &filtered[T]{
it: it,
filter: filter,
}
}
// Deduplicate returns an iterator that skips the elements that have already
// been returned from [it].
func Deduplicate[T comparable](it Iterator[T]) Iterator[T] {
seen := set.Of[T]()
return Filter(it, func(e T) bool {
if seen.Contains(e) {
return true
}
seen.Add(e)
return false
})
}
func (i *filtered[_]) Next() bool {
for i.it.Next() {
element := i.it.Value()
if !i.filter(element) {
return true
}
}
return false
}
func (i *filtered[T]) Value() T {
return i.it.Value()
}
func (i *filtered[_]) Release() {
i.it.Release()
}