/
path.go
218 lines (195 loc) · 4.35 KB
/
path.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
package shape
import (
"context"
"github.com/cayleygraph/cayley/graph"
"github.com/cayleygraph/cayley/graph/iterator"
"github.com/cayleygraph/cayley/quad"
)
func IntersectShapes(s1, s2 Shape) Shape {
switch s1 := s1.(type) {
case AllNodes:
return s2
case Intersect:
if s2, ok := s2.(Intersect); ok {
return append(s1, s2...)
}
return append(s1, s2)
}
return Intersect{s1, s2}
}
func UnionShapes(s1, s2 Shape) Union {
if s1, ok := s1.(Union); ok {
if s2, ok := s2.(Union); ok {
return append(s1, s2...)
}
return append(s1, s2)
}
return Union{s1, s2}
}
func buildOut(from, via, labels Shape, tags []string, in bool) Shape {
start, goal := quad.Subject, quad.Object
if in {
start, goal = goal, start
}
if len(tags) != 0 {
via = Save{From: via, Tags: tags}
}
quads := make(Quads, 0, 3)
if _, ok := from.(AllNodes); !ok {
quads = append(quads, QuadFilter{
Dir: start, Values: from,
})
}
if _, ok := via.(AllNodes); !ok {
quads = append(quads, QuadFilter{
Dir: quad.Predicate, Values: via,
})
}
if labels != nil {
if _, ok := labels.(AllNodes); !ok {
quads = append(quads, QuadFilter{
Dir: quad.Label, Values: labels,
})
}
}
return NodesFrom{Quads: quads, Dir: goal}
}
func Out(from, via, labels Shape, tags ...string) Shape {
return buildOut(from, via, labels, tags, false)
}
func In(from, via, labels Shape, tags ...string) Shape {
return buildOut(from, via, labels, tags, true)
}
// InWithTags, OutWithTags, Both, BothWithTags
func Predicates(from Shape, in bool) Shape {
dir := quad.Subject
if in {
dir = quad.Object
}
return Unique{NodesFrom{
Quads: Quads{
{Dir: dir, Values: from},
},
Dir: quad.Predicate,
}}
}
func SavePredicates(from Shape, in bool, tag string) Shape {
preds := Save{
From: AllNodes{},
Tags: []string{tag},
}
start := quad.Subject
if in {
start = quad.Object
}
var save Shape = NodesFrom{
Quads: Quads{
{Dir: quad.Predicate, Values: preds},
},
Dir: start,
}
return IntersectShapes(from, save)
}
func Labels(from Shape) Shape {
return Unique{NodesFrom{
Quads: Union{
Quads{
{Dir: quad.Subject, Values: from},
},
Quads{
{Dir: quad.Object, Values: from},
},
},
Dir: quad.Label,
}}
}
func SaveVia(from, via Shape, tag string, rev, opt bool) Shape {
return SaveViaLabels(from, via, AllNodes{}, tag, rev, opt)
}
func SaveViaLabels(from, via, labels Shape, tag string, rev, opt bool) Shape {
nodes := Save{
From: AllNodes{},
Tags: []string{tag},
}
start, goal := quad.Subject, quad.Object
if rev {
start, goal = goal, start
}
quads := Quads{
{Dir: goal, Values: nodes},
{Dir: quad.Predicate, Values: via},
}
if labels != nil {
if _, ok := labels.(AllNodes); !ok {
quads = append(quads, QuadFilter{
Dir: quad.Label, Values: labels,
})
}
}
var save Shape = NodesFrom{
Quads: quads,
Dir: start,
}
if opt {
save = Optional{save}
}
return IntersectShapes(from, save)
}
func Has(from, via, nodes Shape, rev bool) Shape {
return HasLabels(from, via, AllNodes{}, nodes, rev)
}
func HasLabels(from, via, nodes, labels Shape, rev bool) Shape {
start, goal := quad.Subject, quad.Object
if rev {
start, goal = goal, start
}
quads := make(Quads, 0, 3)
if _, ok := nodes.(AllNodes); !ok {
quads = append(quads, QuadFilter{
Dir: goal, Values: nodes,
})
}
if _, ok := via.(AllNodes); !ok {
quads = append(quads, QuadFilter{
Dir: quad.Predicate, Values: via,
})
}
if labels != nil {
if _, ok := labels.(AllNodes); !ok {
quads = append(quads, QuadFilter{
Dir: quad.Label, Values: labels,
})
}
}
if len(quads) == 0 {
panic("empty has")
}
return IntersectShapes(from, NodesFrom{
Quads: quads, Dir: start,
})
}
func AddFilters(nodes Shape, filters ...ValueFilter) Shape {
if len(filters) == 0 {
return nodes
}
if s, ok := nodes.(Filter); ok {
arr := make([]ValueFilter, 0, len(s.Filters)+len(filters))
arr = append(arr, s.Filters...)
arr = append(arr, filters...)
return Filter{From: s.From, Filters: arr}
}
if nodes == nil {
nodes = AllNodes{}
}
return Filter{
From: nodes,
Filters: filters,
}
}
func Compare(nodes Shape, op iterator.Operator, v quad.Value) Shape {
return AddFilters(nodes, Comparison{Op: op, Val: v})
}
func Iterate(ctx context.Context, qs graph.QuadStore, s Shape) *graph.IterateChain {
it := BuildIterator(qs, s)
return graph.Iterate(ctx, it).On(qs)
}