1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
// Copyright 2018 The dexon-consensus Authors
// This file is part of the dexon-consensus library.
//
// The dexon-consensus library is free software: you can redistribute it
// and/or modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation, either version 3 of the License,
// or (at your option) any later version.
//
// The dexon-consensus library is distributed in the hope that it will be
// useful, but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser
// General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the dexon-consensus library. If not, see
// <http://www.gnu.org/licenses/>.
package test
import (
"time"
"github.com/dexon-foundation/dexon-consensus/core/types"
)
// Event defines a scheduler event.
type Event struct {
// HistoryIndex is the index of this event in history.
HistoryIndex int
// NodeID is the ID of handler that this event deginated to.
NodeID types.NodeID
// Time is the expected execution time of this event.
Time time.Time
// ExecError record the error when handling this event.
ExecError error
// Payload is application specific data carried by this event.
Payload interface{}
// ParentHistoryIndex is the index of parent event in history.
ParentHistoryIndex int
// ExecInterval is the latency to execute this event
ExecInterval time.Duration
}
// eventQueue implements heap.Interface.
type eventQueue []*Event
func (eq eventQueue) Len() int { return len(eq) }
func (eq eventQueue) Less(i, j int) bool {
return eq[i].Time.Before(eq[j].Time)
}
func (eq eventQueue) Swap(i, j int) {
eq[i], eq[j] = eq[j], eq[i]
}
func (eq *eventQueue) Push(x interface{}) {
*eq = append(*eq, x.(*Event))
}
func (eq *eventQueue) Pop() interface{} {
pos := len(*eq) - 1
item := (*eq)[pos]
*eq = (*eq)[0:pos]
return item
}
// NewEvent is the constructor for Event.
func NewEvent(
nID types.NodeID, when time.Time, payload interface{}) *Event {
return &Event{
HistoryIndex: -1,
ParentHistoryIndex: -1,
NodeID: nID,
Time: when,
Payload: payload,
}
}
|
