generated from milosgajdos/go-repo-template
-
Notifications
You must be signed in to change notification settings - Fork 0
/
tx_edge.go
279 lines (230 loc) · 6.34 KB
/
tx_edge.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
package memory
import (
"context"
"github.com/milosgajdos/orbnet/pkg/graph/api"
"github.com/milosgajdos/orbnet/pkg/graph/memory"
gonum "gonum.org/v1/gonum/graph"
)
// TxEdge wraps memory.Edge
type TxEdge struct {
*memory.Edge
}
// CreateEdge adds a new node to graph.
func (t *Tx) CreateEdge(ctx context.Context, uid string, e *api.Edge) error {
t.db.Lock()
defer t.db.Unlock()
g, ok := t.db.db[uid]
if !ok {
return api.Errorf(api.ENOTFOUND, "graph %s not found", uid)
}
if e.Source == e.Target {
return api.Errorf(api.EINVALID, "self-loops not allowed")
}
source := g.Node(e.Source)
if source == nil {
return api.Errorf(api.ENOTFOUND, "source node %d not found in graph %s", e.Source, uid)
}
target := g.Node(e.Target)
if target == nil {
return api.Errorf(api.ENOTFOUND, "target node %d not found in graph %s", e.Source, uid)
}
if e := g.Edge(source.ID(), target.ID()); e != nil {
return nil
}
var opts []memory.Option
if e.Label != "" {
opts = append(opts, memory.WithLabel(e.Label))
}
if e.Attrs != nil {
opts = append(opts, memory.WithAttrs(e.Attrs))
}
edge, err := memory.NewEdge(source, target, opts...)
if err != nil {
return err
}
g.SetWeightedEdge(edge)
e.Label = edge.Label()
e.Attrs = edge.Attrs()
e.UID = edge.UID()
e.Weight = edge.Weight()
return nil
}
// findEdgeByUID is a helper function that finds a node with the given id ore it returns error.
func (t Tx) findEdgeByUID(ctx context.Context, g *memory.Graph, uid string) (*TxEdge, error) {
edges := g.Edges()
for edges.Next() {
e := edges.Edge().(*memory.Edge)
if e.UID() == uid {
return &TxEdge{
Edge: memory.EdgeDeepCopy(e),
}, nil
}
}
return nil, api.Errorf(api.ENOTFOUND, "edge %s not found", uid)
}
// FindEdgeByUID returns edge with the given UID.
// It returns error if the edge with the given uid could not be found.
func (t *Tx) FindEdgeByUID(ctx context.Context, guid, euid string) (*TxEdge, error) {
t.db.RLock()
defer t.db.RUnlock()
g, ok := t.db.db[guid]
if !ok {
return nil, api.Errorf(api.ENOTFOUND, "graph %s not found", guid)
}
return t.findEdgeByUID(ctx, g, euid)
}
func filterNodeEdges(ctx context.Context, nodes gonum.Nodes, g *memory.Graph, filter api.EdgeFilter) ([]*TxEdge, error) {
var ex []*TxEdge
var e gonum.Edge
for nodes.Next() {
n := nodes.Node().(*memory.Node)
if filter.Source != nil {
e = g.Edge(*filter.Source, n.ID())
} else {
e = g.Edge(n.ID(), *filter.Target)
}
// NOTE: this should never happen
if e == nil {
continue
}
memEdge := e.(*memory.Edge)
if l := filter.Label; l != nil {
if memEdge.Label() == *l {
txEdge := &TxEdge{Edge: memEdge}
ex = append(ex, txEdge)
}
}
}
return ex, nil
}
func filterEdges(ctx context.Context, edges gonum.Edges, g *memory.Graph, filter api.EdgeFilter) ([]*TxEdge, error) {
var ex []*TxEdge
for edges.Next() {
e := edges.Edge().(*memory.Edge)
if l := filter.Label; l != nil {
if e.Label() == *l {
txEdge := &TxEdge{
Edge: memory.EdgeDeepCopy(e),
}
ex = append(ex, txEdge)
}
continue
}
txEdge := &TxEdge{
Edge: memory.EdgeDeepCopy(e),
}
ex = append(ex, txEdge)
}
return ex, nil
}
// FindEdges returns all graph nodes matching the filter.
func (t *Tx) FindEdges(ctx context.Context, uid string, filter api.EdgeFilter) ([]*TxEdge, int, error) {
t.db.RLock()
defer t.db.RUnlock()
g, ok := t.db.db[uid]
if !ok {
return nil, 0, api.Errorf(api.ENOTFOUND, "graph %s not found", uid)
}
var edges []*TxEdge
var err error
// Both Source and Target have been provided
// we are looking for a single edge
if filter.Source != nil && filter.Target != nil {
e := g.Edge(*filter.Source, *filter.Target)
if e == nil {
return edges, 0, nil
}
memEdge := e.(*memory.Edge)
if l := filter.Label; l != nil {
if memEdge.Label() == *l {
txEdge := &TxEdge{Edge: memEdge}
return []*TxEdge{txEdge}, 1, nil
}
return []*TxEdge{}, 0, nil
}
txEdge := &TxEdge{Edge: memEdge}
return []*TxEdge{txEdge}, 1, nil
}
// Source has been provided
if src := filter.Source; src != nil {
edges, err = filterNodeEdges(ctx, g.From(*src), g, filter)
if err != nil {
return nil, 0, err
}
return applyOffsetLimit(edges, filter.Offset, filter.Limit).([]*TxEdge), len(edges), nil
}
// Target has been provided
if target := filter.Target; target != nil {
edges, err = filterNodeEdges(ctx, g.To(*target), g, filter)
if err != nil {
return nil, 0, err
}
return applyOffsetLimit(edges, filter.Offset, filter.Limit).([]*TxEdge), len(edges), nil
}
edges, err = filterEdges(ctx, g.Edges(), g, filter)
if err != nil {
return nil, 0, err
}
return applyOffsetLimit(edges, filter.Offset, filter.Limit).([]*TxEdge), len(edges), nil
}
// UpdateEdgeBetween updates edge between two nodes.
func (t *Tx) UpdateEdgeBetween(ctx context.Context, uid string, src, trgt int64, update api.EdgeUpdate) (*TxEdge, error) {
t.db.Lock()
defer t.db.Unlock()
g, ok := t.db.db[uid]
if !ok {
return nil, api.Errorf(api.ENOTFOUND, "graph %s not found", uid)
}
e := g.Edge(src, trgt)
if e == nil {
return nil, api.Errorf(api.ENOTFOUND, "edge %d->%d not found", src, trgt)
}
edge, ok := e.(*memory.Edge)
if !ok {
return nil, api.Errorf(api.EINTERNAL, "invalid edge data found")
}
if l := update.Label; l != nil {
edge.SetLabel(*l)
}
if a := update.Attrs; a != nil {
for k, v := range a {
edge.Attrs()[k] = v
}
}
if w := update.Weight; w != nil {
edge.SetWeight(*w)
}
return &TxEdge{
Edge: memory.EdgeDeepCopy(edge),
}, nil
}
// DeleteEdge deletes edge with the given uid from graph.
func (t *Tx) DeleteEdge(ctx context.Context, guid, euid string) error {
t.db.Lock()
defer t.db.Unlock()
g, ok := t.db.db[guid]
if !ok {
return api.Errorf(api.ENOTFOUND, "graph %s not found", guid)
}
edges := g.Edges()
for edges.Next() {
e := edges.Edge().(*memory.Edge)
if e.UID() == euid {
g.RemoveEdge(e.From().ID(), e.To().ID())
return nil
}
}
return api.Errorf(api.ENOTFOUND, "edge %s not found", euid)
}
// DeleteEdgeBetween deletes all edges between source and target nodes.
func (t *Tx) DeleteEdgeBetween(ctx context.Context, uid string, source, target int64) error {
t.db.Lock()
defer t.db.Unlock()
g, ok := t.db.db[uid]
if !ok {
return api.Errorf(api.ENOTFOUND, "graph %s not found", uid)
}
e := g.Edge(source, target)
g.RemoveEdge(e.From().ID(), e.To().ID())
return nil
}