pub struct GqlQuery {
pub pattern: MatchPattern,
pub additional_patterns: Vec<MatchPattern>,
pub where_clause: WhereExpr,
pub return_items: Vec<ReturnItem>,
pub distinct: bool,
pub order_by: Vec<OrderItem>,
pub offset: usize,
pub limit: Option<usize>,
}Expand description
A parsed query: pattern, predicates, projections, ordering, offset, and optional limit.
Fields§
§pattern: MatchPatternRequired first path; single-path queries leave additional_patterns empty.
additional_patterns: Vec<MatchPattern>Connected canonical paths following commas in GQL’s MATCH clause.
where_clause: WhereExpr§return_items: Vec<ReturnItem>§distinct: boolDeduplicate requested result values after grouping and before pagination.
order_by: Vec<OrderItem>Caller ordering followed by the compiler’s deterministic tie order.
An empty vector uses identity/traversal order for ordinary queries, and returned-value order for distinct or grouped queries.
offset: usizeNumber of deterministically ordered matches to skip before returning rows.
GQL supplies this through SKIP; SPARQL currently always sets it to zero.
limit: Option<usize>Implementations§
Source§impl GqlQuery
impl GqlQuery
Sourcepub fn patterns(&self) -> impl Iterator<Item = &MatchPattern>
pub fn patterns(&self) -> impl Iterator<Item = &MatchPattern>
Iterate every MATCH path in textual order, including the required first path.
Sourcepub fn patterns_mut(&mut self) -> impl Iterator<Item = &mut MatchPattern>
pub fn patterns_mut(&mut self) -> impl Iterator<Item = &mut MatchPattern>
Mutably iterate every MATCH path in textual order.