-
Notifications
You must be signed in to change notification settings - Fork 0
/
node.go
147 lines (134 loc) · 2.88 KB
/
node.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
package graph
import (
"github.com/15mga/kiwi/ds"
"github.com/15mga/kiwi/util"
)
type INode interface {
IGraphElem
HasIn(name string) bool
HasOut(name string) bool
AddIn(t TPoint, name string) *util.Err
AddOut(t TPoint, name string) *util.Err
GetIn(name string) (IIn, *util.Err)
GetOut(name string) (IOut, *util.Err)
Out(name string, m any) *util.Err
ProcessData(msg IMsg) *util.Err
BindFn(point string, fn MsgToErr)
}
func NewNode(g IGraph, name string) *node {
n := &node{
IGraphElem: newGraphElem(g, name),
typeToIn: make(map[string]IIn),
typeToOut: make(map[string]IOut),
processor: make(map[string]*ds.FnErrLink1[IMsg]),
}
return n
}
type node struct {
IGraphElem
typeToIn map[string]IIn
typeToOut map[string]IOut
processor map[string]*ds.FnErrLink1[IMsg]
}
func (n *node) HasIn(name string) bool {
_, ok := n.typeToIn[name]
return ok
}
func (n *node) HasOut(name string) bool {
_, ok := n.typeToOut[name]
return ok
}
func (n *node) AddIn(t TPoint, name string) *util.Err {
if _, ok := n.typeToIn[name]; ok {
return util.NewErr(util.EcExist, util.M{
"error": "exist in node",
"path": n.Path(),
"name": name,
})
}
in := newPIn(n, t, name)
n.typeToIn[name] = in
plugin := n.Graph().Plugin()
if plugin != nil {
plugin.OnAddIn(in)
}
return nil
}
func (n *node) AddOut(t TPoint, name string) *util.Err {
if _, ok := n.typeToOut[name]; ok {
return util.NewErr(util.EcExist, util.M{
"error": "exist out node",
"path": n.Path(),
"name": name,
})
}
out := newOut(n, t, name)
n.typeToOut[name] = out
plugin := n.Graph().Plugin()
if plugin != nil {
plugin.OnAddOut(out)
}
return nil
}
func (n *node) GetIn(name string) (IIn, *util.Err) {
in, ok := n.typeToIn[name]
if !ok {
return nil, util.NewErr(util.EcNotExist, util.M{
"path": n.Path(),
"out node": name,
})
}
return in, nil
}
func (n *node) GetOut(name string) (IOut, *util.Err) {
out, ok := n.typeToOut[name]
if !ok {
return nil, util.NewErr(util.EcNotExist, util.M{
"path": n.Path(),
"out node": name,
})
}
return out, nil
}
func (n *node) Out(name string, data any) *util.Err {
out, ok := n.typeToOut[name]
if !ok {
return util.NewErr(util.EcNotExist, util.M{
"path": n.Path(),
"out node": name,
})
}
return out.Send(&Msg{
typ: out.Type(),
outNode: n.Name(),
outPoint: name,
data: data,
})
}
func (n *node) ProcessData(msg IMsg) *util.Err {
if !n.Enabled() {
return nil
}
p, ok := n.processor[msg.InPoint()]
if !ok {
return util.NewErr(util.EcNotExist, util.M{
"path": n.Path(),
"processor": msg.InPoint(),
})
}
msg.SetInNode(n)
err := p.Invoke(msg)
if err != nil {
err.AddParam("node", n.Path())
return err
}
return nil
}
func (n *node) BindFn(point string, fn MsgToErr) {
lnk, ok := n.processor[point]
if !ok {
lnk = ds.NewFnErrLink1[IMsg]()
n.processor[point] = lnk
}
lnk.Push(fn)
}