-
Notifications
You must be signed in to change notification settings - Fork 1
/
m3forward.go
138 lines (119 loc) · 3.38 KB
/
m3forward.go
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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
package m3space
import (
"github.com/freddy33/qsm-go/m3point"
"github.com/freddy33/qsm-go/m3util"
"sort"
"sync"
)
var LogStat = m3util.NewStatLogger("m3stat", m3util.INFO)
type ThreeIds [3]EventID
var NilThreeIds = ThreeIds{NilEvent, NilEvent, NilEvent}
type ForwardResult struct {
pointsPerThreeIds map[ThreeIds][]m3point.Point
}
func MakeForwardResult() *ForwardResult {
res := ForwardResult{make(map[ThreeIds][]m3point.Point, 16)}
return &res
}
func (fr *ForwardResult) addPoint(tIds []ThreeIds, p m3point.Point) {
for _, tid := range tIds {
pList, ok := fr.pointsPerThreeIds[tid]
if !ok {
pList = make([]m3point.Point, 1)
pList[0] = p
} else {
pList = append(pList, p)
}
fr.pointsPerThreeIds[tid] = pList
}
}
func (space *Space) ForwardTime() *ForwardResult {
nbLatest := 0
expectedLatestNodes := 0
for _, evt := range space.events {
if evt != nil {
nbLatest += evt.pathContext.GetNumberOfOpenNodes()
expectedLatestNodes += evt.pathContext.PredictedNextOpenNodesLen()
}
}
space.latestNodes = make([]Node, 0, expectedLatestNodes)
if Log.IsInfo() {
Log.Infof("Stepping up to %d: %d events, %d actNodes, %d actConn, %d latestOpen, %d expectedOpen",
space.currentTime+1, space.GetNbEvents(), len(space.activeNodes), len(space.activeLinks), nbLatest, expectedLatestNodes)
}
LogStat.Infof("%4d: %d: %d: %d: %d: %d",
space.currentTime, space.GetNbEvents(), len(space.activeNodes), len(space.activeLinks), nbLatest, expectedLatestNodes)
wg := sync.WaitGroup{}
for _, evt := range space.events {
if evt != nil {
wg.Add(1)
go evt.moveToNext(&wg)
}
}
wg.Wait()
space.currentTime++
for _, evt := range space.events {
if evt != nil {
for _, opn := range evt.pathContext.GetAllOpenPathNodes() {
// TODO: Remove PathNodeMap need. Use DB
evt.pathNodeMap.AddPathNode(opn)
}
}
}
newActiveNodes := NodeList(make([]Node, 0, expectedLatestNodes))
newActiveLinks := NodeLinkList(make([]NodeLink, 0, expectedLatestNodes))
res := MakeForwardResult()
for _, n := range space.latestNodes {
space.populateActiveNodesAndLinks(n, res, &newActiveNodes, &newActiveLinks)
}
for _, n := range space.activeNodes {
space.populateActiveNodesAndLinks(n, res, &newActiveNodes, &newActiveLinks)
}
space.activeNodes = newActiveNodes
space.activeLinks = newActiveLinks
return res
}
func (space *Space) populateActiveNodesAndLinks(n Node, res *ForwardResult, nodes *NodeList, links *NodeLinkList) {
nbActive := n.GetNbActiveEvents(space)
point := n.GetPoint()
if point != nil && point.IsMainPoint() && nbActive >= m3point.THREE {
tIds := MakeThreeIds(n.GetActiveEventIds(space))
res.addPoint(tIds, *point)
}
if nbActive > 0 {
nodes.addNode(n)
links.addAll(n.GetActiveLinks(space))
}
}
func (evt *Event) moveToNext(wg *sync.WaitGroup) {
evt.pathContext.MoveToNextNodes()
wg.Done()
}
func SortEventIDs(ids *[]EventID) {
sort.Slice(*ids, func(i, j int) bool {
return (*ids)[i] < (*ids)[j]
})
}
func MakeThreeIds(ids []EventID) []ThreeIds {
SortEventIDs(&ids)
if len(ids) == 3 {
return []ThreeIds{{ids[0], ids[1], ids[2]}}
} else if len(ids) == 4 {
return []ThreeIds{
{ids[0], ids[1], ids[2]},
{ids[0], ids[2], ids[3]},
{ids[0], ids[1], ids[3]},
{ids[1], ids[2], ids[3]},
}
}
Log.Fatal("WHAT!")
return nil
}
func (tIds ThreeIds) contains(id EventID) bool {
for _, tid := range tIds {
if tid == id {
return true
}
}
return false
}