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
use super::{
dependency_graph::{DependencyGraph, PosNeg},
node_constraint::NodeConstraint,
shape::Shape,
};
use crate::{Expr, Pred, ShapeLabelIdx, ir::schema_ir::SchemaIR};
use std::{
collections::{HashMap, HashSet},
fmt::Display,
vec,
};
#[derive(Debug, PartialEq, Clone, Default)]
pub enum ShapeExpr {
ShapeOr {
exprs: Vec<ShapeLabelIdx>,
},
ShapeAnd {
exprs: Vec<ShapeLabelIdx>,
},
ShapeNot {
expr: ShapeLabelIdx,
},
NodeConstraint(NodeConstraint),
Shape(Box<Shape>),
External {},
Ref {
idx: ShapeLabelIdx,
},
#[default]
Empty,
}
impl ShapeExpr {
pub fn mk_ref(idx: ShapeLabelIdx) -> ShapeExpr {
ShapeExpr::Ref { idx }
}
pub fn direct_references(&self) -> Vec<ShapeLabelIdx> {
match self {
ShapeExpr::ShapeOr { exprs, .. } => exprs.to_vec(),
ShapeExpr::ShapeAnd { exprs, .. } => exprs.to_vec(),
ShapeExpr::ShapeNot { expr, .. } => vec![*expr],
ShapeExpr::NodeConstraint(_) => vec![],
ShapeExpr::Shape(_s) => vec![],
ShapeExpr::External {} => vec![],
ShapeExpr::Ref { idx } => vec![*idx],
ShapeExpr::Empty => vec![],
}
}
pub fn get_triple_exprs(&self, schema: &SchemaIR) -> Vec<Expr> {
match self {
ShapeExpr::ShapeOr { .. } => Vec::new(), // Should be an error? extending from OR
ShapeExpr::ShapeAnd { exprs, .. } => exprs
.iter()
.flat_map(|e| {
let info = schema.find_shape_idx(e).unwrap();
info.expr().get_triple_exprs(schema)
})
.collect(),
ShapeExpr::ShapeNot { .. } => Vec::new(), /*schema
.find_shape_idx(expr)
.map(|info| info.expr().get_triple_exprs(schema))
.unwrap_or_default() */
ShapeExpr::NodeConstraint(_nc) => vec![],
ShapeExpr::Shape(s) => vec![s.triple_expr().clone()],
ShapeExpr::External {} => vec![],
ShapeExpr::Ref { idx } => {
let info = schema.find_shape_idx(idx).unwrap();
info.expr().get_triple_exprs(schema)
},
ShapeExpr::Empty => vec![],
}
}
/// Get the references in this shape expression.
pub fn references(&self, schema: &SchemaIR) -> HashMap<Pred, Vec<ShapeLabelIdx>> {
match self {
ShapeExpr::ShapeOr { exprs, .. } => exprs.iter().fold(HashMap::new(), |mut acc, expr| {
let refs = schema
.find_shape_idx(expr)
.map(|info| info.expr().references(schema))
.unwrap_or_default();
for (p, v) in refs {
acc.entry(p).or_default().extend(v);
}
acc
}),
ShapeExpr::ShapeAnd { exprs, .. } => exprs.iter().fold(HashMap::new(), |mut acc, expr| {
let refs = schema
.find_shape_idx(expr)
.map(|info| info.expr().references(schema))
.unwrap_or_default();
for (p, v) in refs {
acc.entry(p).or_default().extend(v);
}
acc
}),
ShapeExpr::ShapeNot { expr, .. } => schema
.find_shape_idx(expr)
.map(|info| info.expr().references(schema))
.unwrap_or_default(),
ShapeExpr::NodeConstraint(_nc) => HashMap::new(),
ShapeExpr::Shape(s) => s.references(schema).clone(),
ShapeExpr::External {} => HashMap::new(),
ShapeExpr::Ref { idx } => {
let mut map = HashMap::new();
map.insert(Pred::default(), vec![*idx]);
map
},
ShapeExpr::Empty => HashMap::new(),
}
}
/// Get the predicates used in this shape expression.
/// For ShapeOr, ShapeAnd and ShapeNot, it will recursively get the predicates from
/// the referenced shapes.
/// For Shape, it will get the predicates from the shape.
/// For NodeConstraint and External, it will return an empty set.
/// For Ref, it will get the predicates from the referenced shape.
/// For Empty, it will return an empty set.
/// This will used the direct predicates of the shape, not the ones from extends.
/// To get the predicates including extends, use the method preds_extends of `SchemaIR`
pub fn preds(&self, schema: &SchemaIR) -> HashSet<Pred> {
let mut visited = HashSet::new();
self.preds_visited(schema, &mut visited)
}
fn preds_visited(&self, schema: &SchemaIR, visited: &mut HashSet<ShapeLabelIdx>) -> HashSet<Pred> {
let mut preds = HashSet::new();
match self {
ShapeExpr::ShapeOr { exprs, .. } => {
for e in exprs {
let info = schema.find_shape_idx(e).unwrap();
visited.insert(*e);
let expr = info.expr();
preds.extend(expr.preds_visited(schema, visited));
}
},
ShapeExpr::ShapeAnd { exprs, .. } => {
for e in exprs {
let info = schema.find_shape_idx(e).unwrap();
visited.insert(*e);
let expr = info.expr();
preds.extend(expr.preds_visited(schema, visited));
}
},
ShapeExpr::ShapeNot { expr, .. } => {
let info = schema.find_shape_idx(expr).unwrap();
visited.insert(*expr);
let expr = info.expr();
preds.extend(expr.preds_visited(schema, visited));
},
ShapeExpr::NodeConstraint(_nc) => {},
ShapeExpr::Shape(s) => {
preds.extend(s.preds());
},
ShapeExpr::External {} => {},
ShapeExpr::Ref { idx } => {
if visited.contains(idx) {
return preds;
}
visited.insert(*idx);
let info = schema.find_shape_idx(idx).unwrap();
let expr = info.expr();
preds.extend(expr.preds(schema));
},
ShapeExpr::Empty => {},
}
preds
}
/// Adds PosNeg edges to the dependency graph.
pub(crate) fn add_edges<'a>(
&'a self,
source: ShapeLabelIdx,
graph: &mut DependencyGraph,
pos_neg: PosNeg,
schema: &'a SchemaIR,
visited: &mut Vec<&'a ShapeExpr>,
) {
match self {
ShapeExpr::ShapeOr { exprs, .. } => {
for expr in exprs {
if let Some(info) = schema.find_shape_idx(expr) {
let expr = info.expr();
if visited.contains(&expr) {
continue;
} else {
visited.push(expr);
expr.add_edges(source, graph, pos_neg, schema, visited);
}
}
}
},
ShapeExpr::ShapeAnd { exprs, .. } => {
for expr in exprs {
if let Some(info) = schema.find_shape_idx(expr) {
let expr = info.expr();
if visited.contains(&expr) {
continue;
} else {
visited.push(expr);
expr.add_edges(source, graph, pos_neg, schema, visited);
}
}
}
},
ShapeExpr::ShapeNot { expr, .. } => {
if let Some(info) = schema.find_shape_idx(expr) {
let expr = info.expr();
if visited.contains(&expr) {
} else {
visited.push(expr);
expr.add_edges(source, graph, pos_neg.change(), schema, visited);
}
}
},
ShapeExpr::NodeConstraint(_) => {},
ShapeExpr::Shape(s) => s.add_edges(source, graph, pos_neg),
ShapeExpr::External {} => {},
ShapeExpr::Ref { idx } => {
graph.add_edge(source, *idx, pos_neg);
},
ShapeExpr::Empty => {},
}
}
// TODO: Improve the visualization of shape expressions
/*pub fn show_qualified(&self, prefixmap: &prefixmap::PrefixMap) -> String {
match self {
ShapeExpr::ShapeOr { exprs, .. } => format!(
"({})",
exprs
.iter()
.map(|e| e.to_string())
.collect::<Vec<_>>()
.join(" OR ")
),
ShapeExpr::ShapeAnd { exprs, .. } => format!(
"({})",
exprs
.iter()
.map(|e| e.to_string())
.collect::<Vec<_>>()
.join(" AND ")
),
ShapeExpr::ShapeNot { expr, .. } => format!("(NOT {})", expr.to_string()),
ShapeExpr::NodeConstraint(nc) => nc.to_string(),
ShapeExpr::Shape(shape) => shape.show_qualified(prefixmap),
ShapeExpr::External {} => "External".to_string(),
ShapeExpr::Ref { idx } => format!("@{}", idx),
ShapeExpr::Empty => "{}".to_string(),
}
}*/
}
impl Display for ShapeExpr {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
match self {
ShapeExpr::ShapeOr { exprs, .. } => write!(
f,
"OR({})",
exprs.iter().map(|e| format!("{e}")).collect::<Vec<_>>().join(", ")
),
ShapeExpr::ShapeAnd { exprs, .. } => write!(
f,
"AND({})",
exprs.iter().map(|e| format!("{e}")).collect::<Vec<_>>().join(", ")
),
ShapeExpr::ShapeNot { expr, .. } => write!(f, "NOT {expr}"),
ShapeExpr::NodeConstraint(nc) => write!(f, "{nc}"),
ShapeExpr::Shape(shape) => write!(f, "{shape}"),
ShapeExpr::External {} => write!(f, "External"),
ShapeExpr::Ref { idx } => write!(f, "@{idx}"),
ShapeExpr::Empty => write!(f, "<Empty>"),
}
}
}