-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmanager.go
316 lines (287 loc) · 8.25 KB
/
manager.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
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
package behavior
import (
"github.com/billyplus/behavior/config"
"github.com/pkg/errors"
)
// NewBehaviorManager 加载behavior3格式的project配置
func NewBehaviorManager(cfg *config.BH3Project) (*BehaviorManager, error) {
mgr := &BehaviorManager{
treelist: make(map[string]*BehaviorTree, len(cfg.Trees)),
arrTree: make([]BehaviorTree, len(cfg.Trees)),
}
// nodeid := make(map[string]int)
// roots := make(map[string]int, len(cfg.Trees))
trees := make(map[string]*config.BH3Tree, len(cfg.Trees))
allNode := make(map[string]*config.BH3Node)
for idx, tcfg := range cfg.Trees {
trees[tcfg.ID] = tcfg
mgr.arrTree[idx].id = tcfg.ID
mgr.treelist[tcfg.Title] = &mgr.arrTree[idx]
// collect all node
for _, tnode := range tcfg.Nodes {
allNode[tnode.ID] = tnode
}
}
var collectTreeNode func(tcfg *config.BH3Tree)
// index := 0
for _, tcfg := range cfg.Trees {
// generate index
// guidlist := make(map[string]int)
nodemap := make(map[string]*config.BH3Node)
visited := make(map[string]struct{})
treenodemap := make(map[string]*config.BH3Node)
// subtreelist := make([]string, 0)
// subtreelist = append(subtreelist, tcfg.ID)
collectTreeNode = func(treecfg *config.BH3Tree) {
if _, ok := visited[treecfg.ID]; ok {
return
}
visited[treecfg.ID] = struct{}{}
for _, tnode := range treecfg.Nodes {
if ncfg, ok := trees[tnode.Name]; ok {
// is subtree
treenodemap[tnode.ID] = tnode
collectTreeNode(ncfg)
} else if _, ok := nodemap[tnode.ID]; !ok {
nodemap[tnode.ID] = tnode
}
}
}
collectTreeNode(tcfg)
// for subindex := 0; ; {
// if subindex >= len(subtreelist) {
// break
// }
// subtreeid := subtreelist[subindex]
// tcfg := trees[subtreeid]
// for guid, cfg := range tcfg.Nodes {
// if _, ok := guidlist[guid]; !ok {
// guidlist[guid] = 0
// nodelist = append(nodelist, cfg)
// }
// }
// for _, node := range tcfg.Nodes {
// if len(node.Children) > 0 {
// for _, childid := range node.Children {
// if _, ok := trees[childid]; ok {
// // 是个subtree
// // guidlist[childid] = 0
// subtreelist = append(subtreelist, childid)
// }
// }
// }
// if len(node.Child) > 0 {
// if _, ok := trees[node.Child]; ok {
// // 是个subtree
// // guidlist[node.Child] = 0
// subtreelist = append(subtreelist, node.Child)
// }
// }
// }
// subindex++
// }
nodelist := make([]*config.BH3Node, 0, len(nodemap))
for _, n := range nodemap {
nodelist = append(nodelist, n)
}
tree := mgr.treelist[tcfg.Title]
wraplist := make([]Wrapper, len(nodelist))
for i, node := range nodelist {
var treenode Node
var err error
// if _, ok := trees[node.Name]; ok {
// // 是个subtree
// for idx := range mgr.arrTree {
// t := &mgr.arrTree[idx]
// if t.id == node.Name {
// treenode = t
// }
// }
// if treenode == nil {
// return nil, errors.Errorf("subtree missing: %s", node.Name)
// }
// } else {
// }
// fatory function for node
treenode, err = createNodeByName(node.Name)
if err != nil {
return nil, err
}
nw := &wraplist[i]
nw.Node = treenode
nw.name = node.Name
nw.index = i
// set root node
if node.ID == tcfg.Root {
tree.root = nw
}
// add child
if len(node.Child) > 0 {
found := false
for childindex, child := range nodelist {
if child.ID == node.Child {
childwr := &wraplist[childindex]
nw.AddChild(childwr)
found = true
}
}
if !found {
// sub tree
childnode := treenodemap[node.Child]
if childnode == nil {
return nil, errors.Errorf("unknown child node guid '%s'", node.Child)
}
subt := trees[childnode.Name]
if subt == nil {
return nil, errors.Errorf("unknown tree guid '%s'", childnode.Name)
}
for childindex, child := range nodelist {
if child.ID == subt.Root {
childwr := &wraplist[childindex]
nw.AddChild(childwr)
found = true
}
}
}
if !found {
return nil, errors.Errorf("unknow child guid '%s'", node.Child)
}
}
// add children
if len(node.Children) > 0 {
for _, childguid := range node.Children {
found := false
for childindex, child := range nodelist {
if child.ID == childguid {
childwr := &wraplist[childindex]
nw.AddChild(childwr)
found = true
}
}
if !found {
// sub tree
childnode := treenodemap[childguid]
if childnode == nil {
return nil, errors.Errorf("unknown child node guid '%s'", childguid)
}
subt := trees[childnode.Name]
if subt == nil {
return nil, errors.Errorf("unknown tree guid '%s'", childnode.Name)
}
for childindex, child := range nodelist {
if child.ID == subt.Root {
childwr := &wraplist[childindex]
nw.AddChild(childwr)
found = true
}
}
}
if !found {
return nil, errors.Errorf("unknown child guid '%s'", childguid)
}
}
}
// Initialize treenode when finish adding children
if err = treenode.Initialize(node); err != nil {
return nil, err
}
}
tree.nodelist = wraplist
}
return mgr, nil
}
// NewBehaviorManager 加载behavior3格式的project配置
// func NewBehaviorManager(cfg *config.BH3Project) (*BehaviorManager, error) {
// mgr := &BehaviorManager{
// treelist: make(map[string]*BehaviorTree, len(cfg.Trees)),
// }
// nodeid := make(map[string]int)
// roots := make(map[string]int, len(cfg.Trees))
// index := 0
// for _, tcfg := range cfg.Trees {
// // generate index
// for guid := range tcfg.Nodes {
// if _, ok := nodeid[guid]; !ok {
// nodeid[guid] = index
// index++
// }
// }
// roots[tcfg.ID] = nodeid[tcfg.Root]
// }
// // generate node
// mgr.nodelist = make([]Wrapper, index)
// for _, tcfg := range cfg.Trees {
// // log.Logger.Debug().Msg("NewBehaviorManager new tree")
// tree := BehaviorTree{}
// // guid
// tree.id = tcfg.ID
// tree.title = tcfg.Title
// // root node
// rootid := roots[tcfg.ID]
// tree.root = &mgr.nodelist[rootid]
// mgr.treelist[tree.title] = &tree
// for guid, c := range tcfg.Nodes {
// id := nodeid[guid]
// name := c.Name
// // fatory function for node
// treenode, err := createNodeByName(name)
// if err != nil {
// return nil, err
// }
// // log.Logger.Debug().Msgf("NewBehaviorManager new node %+v", treenode)
// nw := &mgr.nodelist[id]
// nw.Node = treenode
// nw.index = id
// // log.Logger.Debug().Msgf("NewBehaviorManager nw is %+v", nw)
// // add child
// if len(c.Child) > 0 {
// if childid, ok := nodeid[c.Child]; ok {
// // log.Logger.Debug().Msgf("NewBehaviorManager child index is %d", childid)
// childnode := &mgr.nodelist[childid]
// nw.AddChild(childnode)
// } else if childid, ok := roots[c.Child]; ok {
// // sub tree
// childnode := &mgr.nodelist[childid]
// nw.AddChild(childnode)
// } else {
// return nil, errors.Errorf("unknow child guid '%s'", c.Child)
// }
// }
// // add children
// if len(c.Children) > 0 {
// for _, child := range c.Children {
// if childid, ok := nodeid[child]; ok {
// // log.Logger.Debug().Msgf("NewBehaviorManager child index is %d", childid)
// childnode := &mgr.nodelist[childid]
// nw.AddChild(childnode)
// } else {
// return nil, errors.Errorf("unknow child guid '%s'", child)
// }
// }
// }
// // Initialize treenode when finish adding children
// if err = treenode.Initialize(&c); err != nil {
// return nil, err
// }
// }
// }
// // log.Logger.Debug().Msgf("tree list %+v", mgr.treelist["A behavior tree"].root.Node)
// return mgr, nil
// }
type BehaviorManager struct {
treelist map[string]*BehaviorTree
arrTree []BehaviorTree
}
func (mgr *BehaviorManager) SelectBehaviorTree(name string) *BehaviorTree {
return mgr.treelist[name]
}
// func (mgr *BehaviorManager) NodeCount() int {
// return len(mgr.nodelist)
// }
// func (mgr *BehaviorManager) NewBlackboard() *Blackboard {
// bb := newBlackboard(mgr.NodeCount())
// for i := 0; i < mgr.NodeCount(); i++ {
// bb.nodeMemo[i] = mgr.nodelist[i].Node.CreateMemo()
// }
// return bb
// }