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.
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)
|
|
}
|