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
// Copyright (c) 2026 Austin Han <austinhan1024@gmail.com>
//
// This file is part of RocksGraph.
//
// RocksGraph is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 2 of the License, or
// (at your option) any later version.
//
// RocksGraph is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with RocksGraph. If not, see <https://www.gnu.org/licenses/>.
use crate::types::keys::CanonicalEdgeKey;
use crate::types::PIPELINE_PRODUCE_SIZE;
use std::rc::Rc;
use smallvec::SmallVec;
use crate::engine::volcano::steps::traits::ExplainNode;
use crate::{
engine::{
context::GraphCtx,
traverser::Traverser,
volcano::steps::traits::{CoreStep, StepRef},
},
types::{
error::StoreError,
gvalue::{GValue, Primitive, PrimitivePredicate},
},
};
/// Pre-parsed edge-id predicate — avoids per-traverser allocation (see §6 of
/// `docs/design_edge_id_string.md`). Strings in the raw `PrimitivePredicate`
/// are parsed into `CanonicalEdgeKey` once at construction.
#[derive(Debug, Clone)]
enum EdgeIdPredicate {
Eq(CanonicalEdgeKey),
Ne(CanonicalEdgeKey),
Within(Vec<CanonicalEdgeKey>),
Without(Vec<CanonicalEdgeKey>),
/// All elements match — used when `Ne`/`Without` operands fail to parse
/// (nothing equals garbage, so the negation is universally true).
AlwaysTrue,
}
impl EdgeIdPredicate {
fn matches(&self, cek: &CanonicalEdgeKey) -> bool {
match self {
Self::Eq(k) => cek == k,
Self::Ne(k) => cek != k,
Self::Within(ks) => ks.iter().any(|k| cek == k),
Self::Without(ks) => !ks.iter().any(|k| cek == k),
Self::AlwaysTrue => true,
}
}
}
/// Try to parse string operand(s) of a `PrimitivePredicate` into `CanonicalEdgeKey`.
/// Returns `None` if the predicate has no string operands (vertex-id only).
fn try_parse_edge_pred(pred: &PrimitivePredicate) -> Option<EdgeIdPredicate> {
fn parse_one(s: &Primitive) -> Option<CanonicalEdgeKey> {
if let Primitive::String(s) = s {
s.parse().ok()
} else {
None
}
}
match pred {
PrimitivePredicate::Eq(v) => parse_one(v).map(EdgeIdPredicate::Eq),
PrimitivePredicate::Ne(v) => {
// Ne(garbage) = true for all elements — nothing equals garbage.
Some(parse_one(v).map(EdgeIdPredicate::Ne).unwrap_or(EdgeIdPredicate::AlwaysTrue))
}
PrimitivePredicate::Within(vs) => {
let keys: Vec<CanonicalEdgeKey> = vs.iter().filter_map(parse_one).collect();
if keys.is_empty() {
None
} else {
Some(EdgeIdPredicate::Within(keys))
}
}
PrimitivePredicate::Without(vs) => {
let keys: Vec<CanonicalEdgeKey> = vs.iter().filter_map(parse_one).collect();
if keys.is_empty() {
Some(EdgeIdPredicate::AlwaysTrue)
} else {
Some(EdgeIdPredicate::Without(keys))
}
}
// Gt/Gte/Lt/Lte/Between don't make sense for string edge ids; fall back to None.
_ => None,
}
}
/// A physical step that filters traversers based on their vertex ID or edge canonical id.
#[derive(Debug)]
pub struct HasIdStep {
upstream: Option<StepRef>,
/// The predicate for vertex-id matching (existing path).
pred: PrimitivePredicate,
/// Pre-parsed edge-id predicate — constructed once, matched per traverser
/// without allocation. `None` when the predicate has no string operands.
edge_pred: Option<EdgeIdPredicate>,
}
impl HasIdStep {
pub fn new(pred: PrimitivePredicate) -> Self {
let edge_pred = try_parse_edge_pred(&pred);
Self { upstream: None, pred, edge_pred }
}
}
impl CoreStep for HasIdStep {
fn add_upper(&mut self, upstream: StepRef) {
self.upstream = Some(upstream);
}
fn produce(
&mut self,
ctx: &mut dyn GraphCtx,
) -> Result<Option<SmallVec<[Rc<Traverser>; PIPELINE_PRODUCE_SIZE]>>, StoreError> {
let Some(upstream) = self.upstream.as_ref() else { return Ok(None) };
let mut batch = SmallVec::with_capacity(PIPELINE_PRODUCE_SIZE);
while batch.len() < PIPELINE_PRODUCE_SIZE {
let Some(t) = upstream.next(ctx)? else { break };
match &t.value {
GValue::Vertex(vk) if self.pred.evaluate(&Primitive::Int64(*vk)) => {
batch.push(t);
}
GValue::Edge(ek) => {
if let Some(edge_pred) = &self.edge_pred {
if edge_pred.matches(&ek.canonical_edge_key()) {
batch.push(t);
}
}
}
_ => {}
}
}
if batch.is_empty() {
Ok(None)
} else {
Ok(Some(batch))
}
}
fn reset(&mut self) {
if let Some(up) = &self.upstream {
up.reset();
}
}
fn upper(&self) -> Option<StepRef> {
self.upstream.clone()
}
fn explain(&self) -> ExplainNode {
let params = vec![("pred", format!("{:?}", self.pred))];
ExplainNode::new("HasIdStep").with_params(params)
}
}