mirror of
https://github.com/QuilibriumNetwork/ceremonyclient.git
synced 2026-02-21 10:27:26 +08:00
c797d482f9
* wip: conversion of hotstuff from flow into Q-oriented model * bulk of tests * remaining non-integration tests * add integration test, adjust log interface, small tweaks * further adjustments, restore full pacemaker shape * add component lifecycle management+supervisor * further refinements * resolve timeout hanging * mostly finalized state for consensus * bulk of engine swap out * lifecycle-ify most types * wiring nearly complete, missing needed hooks for proposals * plugged in, vetting message validation paths * global consensus, plugged in and verified * app shard now wired in too * do not decode empty keys.yml (#456) * remove obsolete engine.maxFrames config parameter (#454) * default to Info log level unless debug is enabled (#453) * respect config's "logging" section params, remove obsolete single-file logging (#452) * Trivial code cleanup aiming to reduce Go compiler warnings (#451) * simplify range traversal * simplify channel read for single select case * delete rand.Seed() deprecated in Go 1.20 and no-op as of Go 1.24 * simplify range traversal * simplify channel read for single select case * remove redundant type from array * simplify range traversal * simplify channel read for single select case * RC slate * finalize 2.1.0.5 * Update comments in StrictMonotonicCounter Fix comment formatting and clarify description. --------- Co-authored-by: Black Swan <3999712+blacks1ne@users.noreply.github.com>
104 lines
2.1 KiB
Go
104 lines
2.1 KiB
Go
package forest
|
|
|
|
import (
|
|
"errors"
|
|
"fmt"
|
|
|
|
"source.quilibrium.com/quilibrium/monorepo/consensus/models"
|
|
)
|
|
|
|
type Vertex interface {
|
|
// VertexID returns the vertex's ID (in most cases its hash)
|
|
VertexID() models.Identity
|
|
// Level returns the vertex's level
|
|
Level() uint64
|
|
// Parent returns the parent's (level, ID)
|
|
Parent() (models.Identity, uint64)
|
|
}
|
|
|
|
// VertexToString returns a string representation of the vertex.
|
|
func VertexToString(v Vertex) string {
|
|
parentID, parentLevel := v.Parent()
|
|
return fmt.Sprintf(
|
|
"<id=%x level=%d parent_id=%s parent_level=%d>",
|
|
v.VertexID(),
|
|
v.Level(),
|
|
parentID,
|
|
parentLevel,
|
|
)
|
|
}
|
|
|
|
// VertexIterator is a stateful iterator for VertexList.
|
|
// Internally operates directly on the Vertex Containers
|
|
// It has one-element look ahead for skipping empty vertex containers.
|
|
type VertexIterator struct {
|
|
data VertexList
|
|
idx int
|
|
next Vertex
|
|
}
|
|
|
|
func (it *VertexIterator) preLoad() {
|
|
for it.idx < len(it.data) {
|
|
v := it.data[it.idx].vertex
|
|
it.idx++
|
|
if v != nil {
|
|
it.next = v
|
|
return
|
|
}
|
|
}
|
|
it.next = nil
|
|
}
|
|
|
|
// NextVertex returns the next Vertex or nil if there is none
|
|
func (it *VertexIterator) NextVertex() Vertex {
|
|
res := it.next
|
|
it.preLoad()
|
|
return res
|
|
}
|
|
|
|
// HasNext returns true if and only if there is a next Vertex
|
|
func (it *VertexIterator) HasNext() bool {
|
|
return it.next != nil
|
|
}
|
|
|
|
func newVertexIterator(vertexList VertexList) VertexIterator {
|
|
it := VertexIterator{
|
|
data: vertexList,
|
|
}
|
|
it.preLoad()
|
|
return it
|
|
}
|
|
|
|
// InvalidVertexError indicates that a proposed vertex is invalid for insertion
|
|
// to the forest.
|
|
type InvalidVertexError struct {
|
|
// Vertex is the invalid vertex
|
|
Vertex Vertex
|
|
// msg provides additional context
|
|
msg string
|
|
}
|
|
|
|
func (err InvalidVertexError) Error() string {
|
|
return fmt.Sprintf(
|
|
"invalid vertex %s: %s",
|
|
VertexToString(err.Vertex),
|
|
err.msg,
|
|
)
|
|
}
|
|
|
|
func IsInvalidVertexError(err error) bool {
|
|
var target InvalidVertexError
|
|
return errors.As(err, &target)
|
|
}
|
|
|
|
func NewInvalidVertexErrorf(
|
|
vertex Vertex,
|
|
msg string,
|
|
args ...interface{},
|
|
) InvalidVertexError {
|
|
return InvalidVertexError{
|
|
Vertex: vertex,
|
|
msg: fmt.Sprintf(msg, args...),
|
|
}
|
|
}
|