mirror of
https://github.com/luxfi/util.git
synced 2026-10-30 15:13:56 +00:00
zeekayandHanzo Dev
b45161c43f
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]>
49 lines
888 B
Go
49 lines
888 B
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package heap
|
|
|
|
// NewSet returns a heap without duplicates ordered by its values
|
|
func NewSet[T comparable](less func(a, b T) bool) Set[T] {
|
|
return Set[T]{
|
|
set: NewMap[T, T](less),
|
|
}
|
|
}
|
|
|
|
type Set[T comparable] struct {
|
|
set Map[T, T]
|
|
}
|
|
|
|
// Push returns if the entry was added
|
|
func (s Set[T]) Push(t T) bool {
|
|
_, hadValue := s.set.Push(t, t)
|
|
return !hadValue
|
|
}
|
|
|
|
func (s Set[T]) Pop() (T, bool) {
|
|
pop, _, ok := s.set.Pop()
|
|
return pop, ok
|
|
}
|
|
|
|
func (s Set[T]) Peek() (T, bool) {
|
|
peek, _, ok := s.set.Peek()
|
|
return peek, ok
|
|
}
|
|
|
|
func (s Set[T]) Len() int {
|
|
return s.set.Len()
|
|
}
|
|
|
|
func (s Set[T]) Remove(t T) bool {
|
|
_, existed := s.set.Remove(t)
|
|
return existed
|
|
}
|
|
|
|
func (s Set[T]) Fix(t T) {
|
|
s.set.Fix(t)
|
|
}
|
|
|
|
func (s Set[T]) Contains(t T) bool {
|
|
return s.set.Contains(t)
|
|
}
|