state

type BlockTree struct {
	DeserializeF  DeserializeQurumCert
	NewQurumCertF NewQurumCert
	FF            SerializeID
	// contains filtered or unexported fields
}

type ConsensusConfig struct {
	StartRound      int64
	StartTimeoutIdx int64
	StartID         string
	StartValue      []byte
	StartValidators []PeerID
}

type DefaultElection struct {
	// contains filtered or unexported fields
}

type DefaultPacemaker struct {
	// contains filtered or unexported fields
}

type DefaultQuorumCert struct {
	Round       int64  `json:"round"`
	ID          []byte `json:"id"`
	ParentRound int64  `json:"parent_round"`
	ParentID    []byte `json:"parent_id"`
	SenderID    string `json:"sender"`

	Signs map[string]DefaultSign `json:"signs"`
}

type DefaultSafetyRules struct {
	// contains filtered or unexported fields
}

type DefaultSign struct {
	PeerID    string
	PublicKey []byte
	Sign      []byte
	Type      int
}

type DefaultTimeoutTicker struct {
	// contains filtered or unexported fields
}

type DeserializeQurumCert func(input []byte) (qc QuorumCert, err error)

type MsgInfo interface {
	Validate() error
	String() string
}

type NewQurumCert func(senderID string, sign []byte, round int64, id []byte,
	parentRound int64, parentID []byte) (qc QuorumCert, err error)

type Pacemaker interface {
	// GetCurrentRound return current round of this node.
	GetCurrentRound() int64
	// AdvanceRound increase the round number when the input is valid,
	// it will invoke next_round_event().
	AdvanceRound(qc QuorumCert) error
	// ProcessTimeoutRound decides the next round when the node has enough timeoutMSG,
	// developer can choose different procedures like advance_round only or rollback to the previous round,
	// it will invoke next_round_event().
	// When the builder can accept a recyclic round, which means the next round of round A can also be round A under timeout situation,
	// the next round is calculated by the specific election. Conversely it should return round + 1 when the system cannot rollback.
	ProcessTimeoutRound(qc QuorumCert) error
}

type PeerID string

type ProposerElection interface {
	// roundTimeoutIdxMap map[int64]int64 is an index-look-up map
	// stores the timeout times in the same round of a rollback system.
	// round-timeoutidx can specialize the unique round on the system.
	Validators(round int64, roundTimeoutIdxMap map[int64]int64) []PeerID
	Leader(round int64, roundTimeoutIdxMap map[int64]int64) PeerID
	// User can dynamically change the validators at runtime by the commands if needed.
	Update(round int64, next []PeerID) error
}

type QuorumCert interface {
	Proposal() (round int64, id []byte, err error) // QC's id shoud be unique.
	ParentProposal() (round int64, id []byte, err error)
	Sender() (senderID string)
	Signatures(peerID string) (signType int, sign []byte, pk []byte, err error)
	Serialize() ([]byte, error)
	String() string
}

type RoundTimeoutSet struct {
	// contains filtered or unexported fields
}

type RoundVoteSet struct {
	// contains filtered or unexported fields
}

type SafetyRules interface {
	UpdatePreferredRound(round int64) error
	CheckProposal(new, parent QuorumCert) error
	CheckVote(qc QuorumCert) error
	CheckTimeout(qc QuorumCert) error
}

type SerializeID func(input []byte) string

type State struct {
	// contains filtered or unexported fields
}

type StepValidators struct {
	Start      int64
	Validators []PeerID
}

type TimeoutSet struct {
	// contains filtered or unexported fields
}

type TimeoutTicker interface {
	Start()
	Stop()
	Chan() <-chan timeoutInfo       // on which to receive a timeout
	ScheduleTimeout(ti timeoutInfo) // reset the timer
}

type VoteSet struct {
	// contains filtered or unexported fields
}

type WAL interface {
	Write(WALMessage) error
	WriteSync(WALMessage) error
	FlushAndSync() error

	SearchForEndHeight(height int64) (rd io.ReadCloser, found bool, err error)

	// service methods
	Start() error
	Stop() error
	Wait()
}

type WALMessage interface{}