kglite 0.16.0

//! Schema validation pass — runs after parse, before optimize.
//!
//! Catches unknown property references inside **pattern-literal syntax**
//! (`{prop: value}`) before the executor commits to a scan. These are
//! unambiguously property names — a typo here can never be a virtual
//! column or computed alias, so rejecting produces zero false positives.
//!
//! Covers:
//! - Variable scope across projections, subqueries, expressions, and updates.
//! - `MATCH (n:T {prop: v})` and `OPTIONAL MATCH` (read patterns).
//! - `EXISTS { MATCH (n:T {prop: v}) }` inside WHERE / AND / OR / NOT
//!   subqueries.
//! - **`CREATE (n:T {prop: v})`** and `CREATE`-style multi-element paths.
//! - **`MERGE (n:T {prop: v})`** including the embedded `CREATE` shape.
//!
//! Deliberately *does not reject* (these are legal, so they are warned about
//! non-fatally instead — see below — never turned into errors):
//! - Unknown node types in MATCH **on an open schema** (`MATCH
//!   (n:Nonexistent)` legitimately returns zero rows and is a common
//!   existence-check idiom). Under `lock_schema()` this *is* rejected —
//!   see [`validate_label`] and the note below.
//! - Unknown connection types (same rationale, both schema states — an
//!   edge type is not yet part of what a schema lock covers).
//!
//! ## Locked schemas reject unknown labels
//!
//! `lock_schema()` is the opt-in "catch my typos" mechanism, and it must
//! cover labels and properties symmetrically. Before this check, a locked
//! schema rejected `MATCH (i:Issue {titel: 1})` (unknown property) but
//! silently returned `[]` for `MATCH (i:Isue)` (unknown label) — and an
//! empty result set reads as "no matching data" rather than "you made a
//! mistake", so the typo survived review and reached production. The write
//! path had already made this call: `CREATE (i:Isue)` under a lock has
//! always failed with `Unknown node type 'Isue'`. [`validate_label`]
//! applies the same rule, and the same message, to reads.
//!
//! The open-schema default is untouched — schemalessness is the product,
//! and the check is gated entirely on `graph.schema_locked`.
//!
//! Deliberately *ignores entirely*:
//! - Property references in WHERE / RETURN expressions (virtual columns,
//!   timeseries sub-nodes, aliases can be legitimate `n.prop` accesses
//!   not present in `node_type_metadata`).
//! - `SET n.prop = X` and `REMOVE n.prop` — SET may legitimately
//!   introduce new properties depending on kglite's mutation policy;
//!   REMOVE of a non-existent property is benign.
//!
//! ## Non-fatal "did you mean?" warnings
//!
//! [`collect_unknown_pattern_warnings`] / [`warn_unknown_pattern_refs`] flag
//! MATCH patterns that reference an unknown node label or relationship type —
//! the most common "why is my query empty?" typo — with an edit-distance hint,
//! *without* rejecting (the zero-row existence-check idiom stays valid). The
//! wrapper emits to stderr (kglite's existing `warning:` convention); routing
//! the same messages into `QueryDiagnostics` so MCP/agent callers see them
//! structurally is the natural next step.
//!
//! Both surfaces — the fatal check and these warnings — reach patterns through
//! the single traversal in [`walk_query_patterns`], so a typo warns wherever a
//! read pattern can appear (`CALL {}` bodies, `WHERE EXISTS {}`, `UNION`
//! branches) rather than only at the top level. The one exception is
//! [`absent_property_warnings`], which needs a var → label map and so stays
//! top-level-only for want of a scope model.
//!
//! ## Pipeline placement
//!
//! Called by three downstream Cypher consumers after `parse_cypher` and
//! before the planner's `optimize_with_disabled`:
//! - `src/graph/pyapi/kg_core.rs::cypher` (Python boundary)
//! - `crates/kglite-mcp-server/src/tools.rs::cypher_query`
//! - `crates/kglite-bolt-server/src/backend.rs::execute`

use super::super::ast::*;
use super::super::executor::helpers::expression_to_string;
use super::simplification::collect_expression_refs;
use crate::graph::core::pattern_matching::{Pattern, PatternElement};
use crate::graph::mutation::validation::did_you_mean;
use crate::graph::schema::{DirGraph, InternedKey};
use std::collections::{HashMap, HashSet};
use std::convert::Infallible;

/// Built-in fields valid on any node type — mirrors BUILTIN_FIELDS in
/// `mutation/validation.rs`. Listed explicitly so it's obvious what's
/// tolerated without a metadata entry.
const BUILTIN_FIELDS: &[&str] = &["id", "title", "name", "type"];

#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum SchemaErrorKind {
    UnknownProperty,
    /// Raised **only under a locked schema** — see [`validate_label`].
    UnknownNodeType,
    UndefinedVariable,
}

#[derive(Debug, Clone)]
pub struct SchemaError {
    #[allow(dead_code)] // Test-only.
    pub kind: SchemaErrorKind,
    pub message: String,
}

impl std::fmt::Display for SchemaError {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.message)
    }
}

impl std::error::Error for SchemaError {}

/// Validate a parsed Cypher query against the graph schema.
///
/// Runs in O(clauses) with O(1) lookups against `node_type_metadata`.
/// Returns early on the first violation.
///
/// Skips validation entirely when the graph has neither declared node
/// types (`node_type_metadata`) nor live nodes (`type_indices`) — that
/// state appears in tests and during initial construction.
pub fn validate_schema(query: &CypherQuery, graph: &DirGraph) -> Result<(), SchemaError> {
    validate_scope(query, &HashSet::new())?;

    // If the graph has no declared node types at all, there is nothing to
    // validate against — skip. This covers fresh graphs and construction
    // before any nodes/edges exist.
    if graph.node_type_metadata.is_empty() && graph.type_indices.is_empty() {
        return Ok(());
    }

    validate_query(query, graph)
}

fn undefined_variable(name: &str) -> SchemaError {
    SchemaError {
        kind: SchemaErrorKind::UndefinedVariable,
        message: format!("Undefined variable '{}'", name),
    }
}

fn require_variable(name: &str, scope: &HashSet<String>) -> Result<(), SchemaError> {
    if scope.contains(name) {
        Ok(())
    } else {
        Err(undefined_variable(name))
    }
}

fn bind_pattern(pattern: &Pattern, scope: &mut HashSet<String>) {
    for element in &pattern.elements {
        match element {
            PatternElement::Node(node) => scope.extend(node.variable.iter().cloned()),
            PatternElement::Edge(edge) => scope.extend(edge.variable.iter().cloned()),
        }
    }
}

fn bind_create_pattern(pattern: &CreatePattern, scope: &mut HashSet<String>) {
    for element in &pattern.elements {
        match element {
            CreateElement::Node(node) => scope.extend(node.variable.iter().cloned()),
            CreateElement::Edge(edge) => scope.extend(edge.variable.iter().cloned()),
        }
    }
}

/// Validate a row source's own expression against the scope it sees, then
/// declare the variable it binds.
///
/// `UNWIND` and `LOAD CSV` are the only clauses that originate rows and bind
/// exactly one variable, and the rule is identical for both, so it lives here
/// rather than twice in [`validate_scope`]. For `LOAD CSV` the incoming scope is
/// always empty (it is leading-position only), which is what lets `FROM $path`
/// through while rejecting `FROM n.path`.
fn bind_row_source(clause: &Clause, scope: &mut HashSet<String>) -> Result<(), SchemaError> {
    let (source, variable) = match clause {
        Clause::Unwind(unwind) => (&unwind.expression, &unwind.alias),
        Clause::LoadCsv(load) => (&load.source, &load.variable),
        // Unreachable: the caller matches exactly these two variants.
        _ => return Ok(()),
    };
    validate_expression_scope(source, scope)?;
    scope.insert(variable.clone());
    Ok(())
}

/// What a trailing `ORDER BY` may reference after an **aggregating** RETURN.
///
/// An aggregating RETURN emits one row per group. Only two kinds of thing have
/// a defined value on that row: the projected columns, and the variables the
/// grouping keys pin down (the executor carries their bindings forward — see
/// `executor::helpers::carry_group_bindings`). Ordering by anything else is
/// what Neo4j rejects outright: `count(c)` collapses many `c`s into a scalar,
/// so `ORDER BY c.label` has no single value to sort on.
///
/// kglite splits the difference: the well-defined half sorts correctly, the
/// ambiguous half is rejected with a message naming the fix. What it must
/// never do — and did before this check existed — is evaluate the sort key to
/// NULL on every row and hand back insertion order as though the clause had
/// been honoured.
struct AggregateOrderScope {
    /// Projected column names plus every variable the grouping keys read.
    allowed: HashSet<String>,
    /// Rendered aggregate projections → their alias, if any. `ORDER BY count(p)`
    /// resolves at runtime only when `count(p)` is projected *unaliased*, since
    /// then the result column is literally named `count(p)`; aliasing it moves
    /// the value to the alias and leaves the expression form unresolvable.
    aggregates: HashMap<String, Option<String>>,
    /// Projected aliases, listed in the error message as the way out.
    aliases: Vec<String>,
}

impl AggregateOrderScope {
    /// `None` when no restriction applies — either the projection does not
    /// aggregate (a plain projection keeps every binding on its rows, so
    /// ordering by a non-projected expression stays well defined), or it
    /// contains `*` and we cannot enumerate what it carries.
    fn for_projection(items: &[ReturnItem]) -> Option<Self> {
        if !items
            .iter()
            .any(|item| is_aggregate_expression(&item.expression))
        {
            return None;
        }
        if items
            .iter()
            .any(|item| matches!(item.expression, Expression::Star))
        {
            return None;
        }

        let mut allowed = HashSet::new();
        let mut aliases = Vec::new();
        let mut aggregates = HashMap::new();
        for item in items {
            if let Some(alias) = &item.alias {
                allowed.insert(alias.clone());
                aliases.push(alias.clone());
            } else if let Expression::Variable(name) = &item.expression {
                allowed.insert(name.clone());
                aliases.push(name.clone());
            }
            if is_aggregate_expression(&item.expression) {
                aggregates.insert(expression_to_string(&item.expression), item.alias.clone());
            } else {
                collect_expression_refs(&item.expression, &mut allowed);
            }
        }
        Some(AggregateOrderScope {
            allowed,
            aggregates,
            aliases,
        })
    }

    fn projected_hint(&self) -> String {
        if self.aliases.is_empty() {
            String::new()
        } else {
            format!(
                ", or order by a projected column ({})",
                self.aliases.join(", ")
            )
        }
    }

    fn validate(&self, order: &OrderByClause) -> Result<(), SchemaError> {
        for item in &order.items {
            if is_aggregate_expression(&item.expression) {
                let rendered = expression_to_string(&item.expression);
                match self.aggregates.get(&rendered) {
                    // Projected unaliased — the executor resolves the sort key
                    // from the identically-named result column.
                    Some(None) => continue,
                    Some(Some(alias)) => {
                        return Err(SchemaError {
                            kind: SchemaErrorKind::UndefinedVariable,
                            message: format!(
                                "ORDER BY '{rendered}' cannot be resolved after an aggregating \
                                 RETURN because that aggregate is projected as '{alias}'. \
                                 Order by the alias instead (`ORDER BY {alias}`)."
                            ),
                        });
                    }
                    None => {
                        return Err(SchemaError {
                            kind: SchemaErrorKind::UndefinedVariable,
                            message: format!(
                                "ORDER BY cannot compute the aggregate '{rendered}' after an \
                                 aggregating RETURN. Project it first \
                                 (e.g. `RETURN ..., {rendered} AS sort_key ORDER BY sort_key`){}.",
                                self.projected_hint()
                            ),
                        });
                    }
                }
            }
            let mut refs = HashSet::new();
            collect_expression_refs(&item.expression, &mut refs);
            for name in refs {
                if !self.allowed.contains(&name) {
                    return Err(SchemaError {
                        kind: SchemaErrorKind::UndefinedVariable,
                        message: format!(
                            "ORDER BY cannot use '{name}' after an aggregating RETURN: \
                             '{name}' is not part of the grouping keys, so it has no single \
                             value per group. Add the sort key to the RETURN list \
                             (e.g. `RETURN ..., {name}.<property> AS sort_key ORDER BY sort_key`){}.",
                            self.projected_hint()
                        ),
                    });
                }
            }
        }
        Ok(())
    }
}

/// Validate a RETURN's own expressions, then produce the scope its trailing
/// clauses see: everything already in scope plus the projection's aliases.
///
/// RETURN is terminal for the pipeline, so unlike WITH it does not narrow the
/// scope — HAVING and a trailing ORDER BY may still name pre-projection
/// variables. Whether an *aggregating* RETURN leaves those variables with a
/// usable value is a separate question, answered by [`AggregateOrderScope`].
fn scope_after_return(
    return_clause: &ReturnClause,
    scope: HashSet<String>,
) -> Result<HashSet<String>, SchemaError> {
    for item in &return_clause.items {
        validate_expression_scope(&item.expression, &scope)?;
    }
    let mut having_scope = scope;
    having_scope.extend(
        return_clause
            .items
            .iter()
            .filter_map(|item| item.alias.clone()),
    );
    if let Some(having) = &return_clause.having {
        validate_predicate_scope(having, &having_scope)?;
    }
    Ok(having_scope)
}

/// Validate a WITH's own expressions, then produce the scope it projects
/// forward: only the aliases and bare variables it names, unless it carries
/// `*` (which preserves the incoming scope wholesale).
fn scope_after_with(
    with_clause: &WithClause,
    scope: HashSet<String>,
) -> Result<HashSet<String>, SchemaError> {
    for item in &with_clause.items {
        validate_expression_scope(&item.expression, &scope)?;
    }
    let preserves_all = with_clause
        .items
        .iter()
        .any(|item| matches!(item.expression, Expression::Star));
    let mut projected = if preserves_all { scope } else { HashSet::new() };
    for item in &with_clause.items {
        if let Some(alias) = &item.alias {
            projected.insert(alias.clone());
        } else if let Expression::Variable(name) = &item.expression {
            projected.insert(name.clone());
        }
    }
    if let Some(where_clause) = &with_clause.where_clause {
        validate_predicate_scope(&where_clause.predicate, &projected)?;
    }
    Ok(projected)
}

fn validate_scope(query: &CypherQuery, initial: &HashSet<String>) -> Result<(), SchemaError> {
    let mut scope = initial.clone();
    // Set by an aggregating RETURN, consumed by the ORDER BY that follows it.
    // Rides through a trailing SKIP/LIMIT; any other clause clears it.
    let mut aggregate_order_scope: Option<AggregateOrderScope> = None;
    for clause in &query.clauses {
        if !matches!(
            clause,
            Clause::OrderBy(_) | Clause::Skip(_) | Clause::Limit(_)
        ) {
            aggregate_order_scope = None;
        }
        match clause {
            Clause::Match(m) | Clause::OptionalMatch(m) => {
                for pattern in &m.patterns {
                    bind_pattern(pattern, &mut scope);
                }
                scope.extend(m.path_assignments.iter().map(|path| path.variable.clone()));
            }
            Clause::Where(where_clause) => {
                validate_predicate_scope(&where_clause.predicate, &scope)?
            }
            Clause::Return(return_clause) => {
                scope = scope_after_return(return_clause, scope)?;
                aggregate_order_scope = AggregateOrderScope::for_projection(&return_clause.items);
            }
            Clause::With(with_clause) => {
                scope = scope_after_with(with_clause, scope)?;
            }
            Clause::OrderBy(order) => {
                for item in &order.items {
                    validate_expression_scope(&item.expression, &scope)?;
                }
                if let Some(restriction) = &aggregate_order_scope {
                    restriction.validate(order)?;
                }
            }
            Clause::Skip(skip) => validate_expression_scope(&skip.count, &scope)?,
            Clause::Limit(limit) => validate_expression_scope(&limit.count, &scope)?,
            // The two row sources: validate the source expression, then declare
            // the single variable it binds. See `bind_row_source`.
            Clause::Unwind(_) | Clause::LoadCsv(_) => bind_row_source(clause, &mut scope)?,
            Clause::Union(union) => validate_scope(&union.query, initial)?,
            Clause::Create(create) => {
                for pattern in &create.patterns {
                    bind_create_pattern(pattern, &mut scope);
                    for element in &pattern.elements {
                        let properties = match element {
                            CreateElement::Node(node) => &node.properties,
                            CreateElement::Edge(edge) => &edge.properties,
                        };
                        for (_, expression) in properties {
                            validate_expression_scope(expression, &scope)?;
                        }
                    }
                }
            }
            Clause::Set(set) => {
                for item in &set.items {
                    match item {
                        SetItem::Property {
                            variable,
                            expression,
                            ..
                        }
                        | SetItem::Map {
                            variable,
                            expression,
                            ..
                        } => {
                            require_variable(variable, &scope)?;
                            validate_expression_scope(expression, &scope)?;
                        }
                        SetItem::Label { variable, .. } => require_variable(variable, &scope)?,
                    }
                }
            }
            Clause::Delete(delete) => {
                for expression in &delete.expressions {
                    validate_expression_scope(expression, &scope)?;
                }
            }
            Clause::Remove(remove) => {
                for item in &remove.items {
                    let variable = match item {
                        RemoveItem::Property { variable, .. }
                        | RemoveItem::Label { variable, .. } => variable,
                    };
                    require_variable(variable, &scope)?;
                }
            }
            Clause::Merge(merge) => {
                bind_create_pattern(&merge.pattern, &mut scope);
                for element in &merge.pattern.elements {
                    let properties = match element {
                        CreateElement::Node(node) => &node.properties,
                        CreateElement::Edge(edge) => &edge.properties,
                    };
                    for (_, expression) in properties {
                        validate_expression_scope(expression, &scope)?;
                    }
                }
                for items in [&merge.on_create, &merge.on_match].into_iter().flatten() {
                    for item in items {
                        match item {
                            SetItem::Property {
                                variable,
                                expression,
                                ..
                            }
                            | SetItem::Map {
                                variable,
                                expression,
                                ..
                            } => {
                                require_variable(variable, &scope)?;
                                validate_expression_scope(expression, &scope)?;
                            }
                            SetItem::Label { variable, .. } => require_variable(variable, &scope)?,
                        }
                    }
                }
            }
            Clause::Foreach {
                variable,
                list,
                body,
            } => {
                validate_expression_scope(list, &scope)?;
                let mut inner = scope.clone();
                inner.insert(variable.clone());
                validate_scope(
                    &CypherQuery {
                        clauses: body.clone(),
                        explain: false,
                        profile: false,
                        output_format: OutputFormat::Default,
                        optimizer_tags: Vec::new(),
                    },
                    &inner,
                )?;
            }
            Clause::Call(call) => {
                for (_, expression) in &call.parameters {
                    validate_expression_scope(expression, &scope)?;
                }
                scope.extend(
                    call.yield_items
                        .iter()
                        .map(|item| item.alias.as_ref().unwrap_or(&item.name).clone()),
                );
            }
            Clause::CallSubquery { import, body } => {
                for name in import {
                    require_variable(name, &scope)?;
                }
                let imported: HashSet<String> = import.iter().cloned().collect();
                validate_scope(body, &imported)?;
                if let Some(Clause::Return(return_clause)) = body
                    .clauses
                    .iter()
                    .rev()
                    .find(|clause| matches!(clause, Clause::Return(_)))
                {
                    for item in &return_clause.items {
                        if let Some(alias) = &item.alias {
                            scope.insert(alias.clone());
                        } else if let Expression::Variable(name) = &item.expression {
                            scope.insert(name.clone());
                        }
                    }
                }
            }
            // Physical clauses exist only after validation.
            _ => {}
        }
    }
    Ok(())
}

fn validate_predicate_scope(
    predicate: &Predicate,
    scope: &HashSet<String>,
) -> Result<(), SchemaError> {
    match predicate {
        Predicate::And(left, right) | Predicate::Or(left, right) | Predicate::Xor(left, right) => {
            validate_predicate_scope(left, scope)?;
            validate_predicate_scope(right, scope)
        }
        Predicate::Not(inner) => validate_predicate_scope(inner, scope),
        Predicate::Comparison { left, right, .. } => {
            validate_expression_scope(left, scope)?;
            validate_expression_scope(right, scope)
        }
        Predicate::IsNull(expression)
        | Predicate::IsNotNull(expression)
        | Predicate::InLiteralSet {
            expr: expression, ..
        } => validate_expression_scope(expression, scope),
        Predicate::In { expr, list } => {
            validate_expression_scope(expr, scope)?;
            for item in list {
                validate_expression_scope(item, scope)?;
            }
            Ok(())
        }
        Predicate::InExpression { expr, list_expr } => {
            validate_expression_scope(expr, scope)?;
            validate_expression_scope(list_expr, scope)
        }
        Predicate::StartsWith { expr, pattern }
        | Predicate::EndsWith { expr, pattern }
        | Predicate::Contains { expr, pattern } => {
            validate_expression_scope(expr, scope)?;
            validate_expression_scope(pattern, scope)
        }
        Predicate::LabelCheck { variable, .. } => require_variable(variable, scope),
        Predicate::Exists {
            patterns,
            where_clause,
            ..
        } => {
            let mut inner = scope.clone();
            for pattern in patterns {
                bind_pattern(pattern, &mut inner);
            }
            if let Some(where_clause) = where_clause {
                validate_predicate_scope(where_clause, &inner)?;
            }
            Ok(())
        }
    }
}

fn validate_expression_scope(
    expression: &Expression,
    scope: &HashSet<String>,
) -> Result<(), SchemaError> {
    match expression {
        Expression::Variable(name) | Expression::PropertyAccess { variable: name, .. } => {
            require_variable(name, scope)
        }
        Expression::FunctionCall { args, .. } | Expression::ListLiteral(args) => {
            for argument in args {
                validate_expression_scope(argument, scope)?;
            }
            Ok(())
        }
        Expression::Add(left, right)
        | Expression::Subtract(left, right)
        | Expression::Multiply(left, right)
        | Expression::Divide(left, right)
        | Expression::Modulo(left, right)
        | Expression::Concat(left, right)
        | Expression::IndexAccess {
            expr: left,
            index: right,
        } => {
            validate_expression_scope(left, scope)?;
            validate_expression_scope(right, scope)
        }
        Expression::Negate(inner)
        | Expression::IsNull(inner)
        | Expression::IsNotNull(inner)
        | Expression::ExprPropertyAccess { expr: inner, .. } => {
            validate_expression_scope(inner, scope)
        }
        Expression::Case {
            operand,
            when_clauses,
            else_expr,
        } => {
            if let Some(operand) = operand {
                validate_expression_scope(operand, scope)?;
            }
            for (condition, result) in when_clauses {
                match condition {
                    CaseCondition::Predicate(predicate) => {
                        validate_predicate_scope(predicate, scope)?
                    }
                    CaseCondition::Expression(expression) => {
                        validate_expression_scope(expression, scope)?
                    }
                }
                validate_expression_scope(result, scope)?;
            }
            if let Some(else_expr) = else_expr {
                validate_expression_scope(else_expr, scope)?;
            }
            Ok(())
        }
        Expression::ListComprehension {
            variable,
            list_expr,
            filter,
            map_expr,
        } => {
            validate_expression_scope(list_expr, scope)?;
            let mut inner = scope.clone();
            inner.insert(variable.clone());
            if let Some(filter) = filter {
                validate_predicate_scope(filter, &inner)?;
            }
            if let Some(map_expr) = map_expr {
                validate_expression_scope(map_expr, &inner)?;
            }
            Ok(())
        }
        Expression::ListSlice { expr, start, end } => {
            validate_expression_scope(expr, scope)?;
            if let Some(start) = start {
                validate_expression_scope(start, scope)?;
            }
            if let Some(end) = end {
                validate_expression_scope(end, scope)?;
            }
            Ok(())
        }
        Expression::MapProjection { variable, items } => {
            require_variable(variable, scope)?;
            for item in items {
                if let MapProjectionItem::Alias { expr, .. } = item {
                    validate_expression_scope(expr, scope)?;
                }
            }
            Ok(())
        }
        Expression::MapLiteral(entries) => {
            for (_, expression) in entries {
                validate_expression_scope(expression, scope)?;
            }
            Ok(())
        }
        Expression::QuantifiedList {
            variable,
            list_expr,
            filter,
            ..
        } => {
            validate_expression_scope(list_expr, scope)?;
            let mut inner = scope.clone();
            inner.insert(variable.clone());
            validate_predicate_scope(filter, &inner)
        }
        Expression::Reduce {
            accumulator,
            init,
            variable,
            list_expr,
            body,
        } => {
            validate_expression_scope(init, scope)?;
            validate_expression_scope(list_expr, scope)?;
            let mut inner = scope.clone();
            inner.insert(accumulator.clone());
            inner.insert(variable.clone());
            validate_expression_scope(body, &inner)
        }
        Expression::PredicateExpr(predicate) => validate_predicate_scope(predicate, scope),
        Expression::WindowFunction {
            partition_by,
            order_by,
            ..
        } => {
            for expression in partition_by {
                validate_expression_scope(expression, scope)?;
            }
            for item in order_by {
                validate_expression_scope(&item.expression, scope)?;
            }
            Ok(())
        }
        Expression::CountSubquery {
            patterns,
            where_clause,
            ..
        } => {
            let mut inner = scope.clone();
            for pattern in patterns {
                bind_pattern(pattern, &mut inner);
            }
            if let Some(where_clause) = where_clause {
                validate_predicate_scope(where_clause, &inner)?;
            }
            Ok(())
        }
        Expression::Literal(_) | Expression::Parameter(_) | Expression::Star => Ok(()),
    }
}

/// Best-effort, NON-FATAL warnings for `WHERE var.prop …` where `prop` exists
/// on **no** node of `var`'s label — so `null <op> x` is false and the
/// predicate silently filters out every row (operator feedback A1b 2026-06-17).
/// A warning, not an error: a legitimately-sparse property is still in the
/// type's metadata (set on ≥1 node), so only a *genuinely-absent* property
/// trips this — no false positive on nullable columns.
fn absent_property_warnings(query: &CypherQuery, graph: &DirGraph) -> Vec<String> {
    if graph.node_type_metadata.is_empty() {
        return Vec::new();
    }
    // var → single known node label, from MATCH/OPTIONAL MATCH node patterns.
    // Multi-label / unknown-label vars are dropped (can't reason precisely).
    let mut var_label: HashMap<&str, &str> = HashMap::new();
    for clause in &query.clauses {
        if let Clause::Match(m) | Clause::OptionalMatch(m) = clause {
            for pattern in &m.patterns {
                for el in &pattern.elements {
                    if let PatternElement::Node(np) = el {
                        if let (Some(var), Some(label)) =
                            (np.variable.as_deref(), np.node_type.as_deref())
                        {
                            if np.extra_labels.is_empty()
                                && graph.node_type_metadata.contains_key(label)
                            {
                                var_label.insert(var, label);
                            } else {
                                var_label.remove(var);
                            }
                        }
                    }
                }
            }
        }
    }
    if var_label.is_empty() {
        return Vec::new();
    }

    let mut seen: HashSet<(&str, &str)> = HashSet::new();
    let mut out = Vec::new();
    for clause in &query.clauses {
        let pred = match clause {
            Clause::Where(w) => Some(&w.predicate),
            Clause::With(w) => w.where_clause.as_ref().map(|wc| &wc.predicate),
            _ => None,
        };
        if let Some(p) = pred {
            warn_absent_in_predicate(p, &var_label, graph, &mut seen, &mut out);
        }
    }
    out
}

/// True when `prop` is neither a built-in field nor in `node_type`'s declared
/// metadata (and the type *has* declared metadata — empty ⇒ skip, as
/// [`validate_property`] does, to avoid false positives on under-declared graphs).
fn property_absent(graph: &DirGraph, node_type: &str, prop: &str) -> bool {
    if BUILTIN_FIELDS.contains(&prop) {
        return false;
    }
    match graph.node_type_metadata.get(node_type) {
        Some(tp) => !tp.is_empty() && !tp.contains_key(prop),
        None => false,
    }
}

fn warn_absent_in_predicate<'q>(
    pred: &'q Predicate,
    var_label: &HashMap<&'q str, &'q str>,
    graph: &DirGraph,
    seen: &mut HashSet<(&'q str, &'q str)>,
    out: &mut Vec<String>,
) {
    match pred {
        Predicate::And(a, b) | Predicate::Or(a, b) | Predicate::Xor(a, b) => {
            warn_absent_in_predicate(a, var_label, graph, seen, out);
            warn_absent_in_predicate(b, var_label, graph, seen, out);
        }
        Predicate::Not(p) => warn_absent_in_predicate(p, var_label, graph, seen, out),
        Predicate::Comparison { left, right, .. } => {
            warn_absent_in_expr(left, var_label, graph, seen, out);
            warn_absent_in_expr(right, var_label, graph, seen, out);
        }
        Predicate::In { expr, .. }
        | Predicate::InLiteralSet { expr, .. }
        | Predicate::InExpression { expr, .. }
        | Predicate::StartsWith { expr, .. }
        | Predicate::EndsWith { expr, .. }
        | Predicate::Contains { expr, .. }
        | Predicate::IsNull(expr)
        | Predicate::IsNotNull(expr) => {
            warn_absent_in_expr(expr, var_label, graph, seen, out);
        }
        _ => {}
    }
}

fn warn_absent_in_expr<'q>(
    expr: &'q Expression,
    var_label: &HashMap<&'q str, &'q str>,
    graph: &DirGraph,
    seen: &mut HashSet<(&'q str, &'q str)>,
    out: &mut Vec<String>,
) {
    match expr {
        Expression::PropertyAccess { variable, property } => {
            if let Some(&label) = var_label.get(variable.as_str()) {
                if property_absent(graph, label, property)
                    && seen.insert((variable.as_str(), property.as_str()))
                {
                    let candidates: Vec<&str> = graph
                        .node_type_metadata
                        .get(label)
                        .map(|m| m.keys().map(|s| s.as_str()).collect())
                        .unwrap_or_default();
                    out.push(format!(
                        "WHERE references property '{property}' which no {label} node has — the \
                         comparison is null (always false), so this filters out every row.{}",
                        did_you_mean(property, &candidates)
                    ));
                }
            }
        }
        Expression::Add(a, b)
        | Expression::Subtract(a, b)
        | Expression::Multiply(a, b)
        | Expression::Divide(a, b)
        | Expression::Modulo(a, b)
        | Expression::Concat(a, b) => {
            warn_absent_in_expr(a, var_label, graph, seen, out);
            warn_absent_in_expr(b, var_label, graph, seen, out);
        }
        Expression::Negate(e) => warn_absent_in_expr(e, var_label, graph, seen, out),
        Expression::FunctionCall { args, .. } => {
            for a in args {
                warn_absent_in_expr(a, var_label, graph, seen, out);
            }
        }
        Expression::ListLiteral(items) => {
            for it in items {
                warn_absent_in_expr(it, var_label, graph, seen, out);
            }
        }
        _ => {}
    }
}

/// Non-fatal counterpart to [`validate_schema`]: collect "did you mean?"
/// warnings for MATCH patterns that reference a node label or relationship
/// type the graph has never seen (a zero-row existence check is legal Cypher,
/// so this is *not* an error), plus the absent-property warnings from
/// [`absent_property_warnings`]. Pure (no I/O), so directly testable;
/// [`warn_unknown_pattern_refs`] is the stderr-emitting wrapper.
pub fn collect_unknown_pattern_warnings(query: &CypherQuery, graph: &DirGraph) -> Vec<String> {
    let have_node_schema =
        !graph.node_type_metadata.is_empty() || graph.type_indices.keys().next().is_some();
    let have_edge_schema = !graph.connection_type_metadata.is_empty();
    if !have_node_schema && !have_edge_schema {
        return Vec::new();
    }

    // Walk every read pattern — top-level MATCH / OPTIONAL MATCH *and* the
    // ones nested in `CALL {}`, `WHERE EXISTS {}` and `UNION` branches (see
    // [`walk_query_patterns`]) — checking each label/relationship against the
    // schema directly. The all-valid path (the overwhelming common case)
    // allocates nothing: only confirmed-unknown, not-yet-seen names are
    // recorded, and the candidate lists for "did you mean?" are built lazily
    // only if there's at least one unknown.
    let mut seen: HashSet<String> = HashSet::new();
    let mut unknown_labels: Vec<String> = Vec::new();
    let mut unknown_rels: Vec<String> = Vec::new();

    for_each_query_pattern(query, &mut |site| {
        // Write patterns are deliberately skipped: on an open schema
        // `CREATE (n:NewType)` is how a type comes into existence.
        let PatternSite::Read(pattern) = site else {
            return;
        };
        for element in &pattern.elements {
            match element {
                PatternElement::Node(np) if have_node_schema => {
                    for label in np.node_type.iter().chain(np.extra_labels.iter()) {
                        // A label is known if it's a declared primary
                        // type OR a secondary label applied via
                        // add_label (`MATCH (n:Reviewer)` is valid even
                        // though `Reviewer` is no node's primary type).
                        let known = graph.node_type_metadata.contains_key(label)
                            || graph.type_indices.contains_key(label)
                            || graph
                                .secondary_label_index
                                .contains_key(&InternedKey::from_str(label));
                        if !known && seen.insert(format!("L:{label}")) {
                            unknown_labels.push(label.clone());
                        }
                    }
                }
                PatternElement::Edge(ep) if have_edge_schema => {
                    let single = ep.connection_type.iter();
                    let multi = ep.connection_types.iter().flatten();
                    for rel in single.chain(multi) {
                        if !graph.connection_type_metadata.contains_key(rel)
                            && seen.insert(format!("R:{rel}"))
                        {
                            unknown_rels.push(rel.clone());
                        }
                    }
                }
                _ => {}
            }
        }
    });

    // Seed with the absent-property warnings (A1b) so they're emitted alongside
    // the unknown-label/rel ones even when the labels/rels are all valid.
    let mut out: Vec<String> = absent_property_warnings(query, graph);
    if unknown_labels.is_empty() && unknown_rels.is_empty() {
        return out;
    }

    out.reserve(unknown_labels.len() + unknown_rels.len());
    if !unknown_labels.is_empty() {
        let candidates: Vec<&str> = graph
            .node_type_metadata
            .keys()
            .map(|s| s.as_str())
            .chain(graph.type_indices.keys())
            .collect();
        for label in &unknown_labels {
            out.push(format!(
                "MATCH references unknown node label '{label}' — the graph has no such type, \
                 so this pattern returns no rows.{}",
                did_you_mean(label, &candidates)
            ));
        }
    }
    if !unknown_rels.is_empty() {
        let candidates: Vec<&str> = graph
            .connection_type_metadata
            .keys()
            .map(|s| s.as_str())
            .collect();
        for rel in &unknown_rels {
            out.push(format!(
                "MATCH references unknown relationship type '{rel}' — the graph has no such \
                 edge type, so this pattern returns no rows.{}",
                did_you_mean(rel, &candidates)
            ));
        }
    }
    out
}

/// Emit [`collect_unknown_pattern_warnings`] to stderr (matching kglite's
/// existing `warning:`-prefixed convention for non-fatal query/load issues).
/// Called from the shared execute path so every binding gets the signal.
pub fn warn_unknown_pattern_refs(query: &CypherQuery, graph: &DirGraph) {
    for msg in collect_unknown_pattern_warnings(query, graph) {
        eprintln!("warning: {msg}");
    }
}

fn validate_query(query: &CypherQuery, graph: &DirGraph) -> Result<(), SchemaError> {
    walk_query_patterns(query, &mut |site| match site {
        PatternSite::Read(pattern) => validate_pattern(pattern, graph),
        PatternSite::Write(pattern) => validate_create_pattern(pattern, graph),
    })
}

/// A pattern the shared traversal hands to its visitor.
///
/// Read and write patterns are kept apart because the two consumers treat them
/// differently: [`validate_schema`] checks pattern-literal property names in
/// both, while [`collect_unknown_pattern_warnings`] must stay silent on writes
/// — `CREATE (n:NewType)` on an open schema is how a type comes into
/// existence, not a typo.
enum PatternSite<'q> {
    Read(&'q Pattern),
    Write(&'q CreatePattern),
}

/// The one traversal that answers "where can a pattern appear in a query?".
///
/// Both schema surfaces route through it — [`validate_schema`] (fatal, locked
/// schemas) and [`collect_unknown_pattern_warnings`] (non-fatal, open
/// schemas) — and that is the point. The warning collector used to walk
/// top-level `MATCH` / `OPTIONAL MATCH` itself, so a typo'd label inside
/// `CALL {}`, `WHERE EXISTS {}` or a `UNION` branch produced no warning while
/// the identical typo at top level did: exactly the incomplete-coverage bug
/// the fatal path had already been extended to fix. Two walkers drift; there
/// is now one, and a newly-covered nesting form lands on both surfaces at
/// once.
///
/// Covers, recursively so nesting composes: `MATCH` / `OPTIONAL MATCH`,
/// `EXISTS {}` at any `AND` / `OR` / `XOR` / `NOT` depth inside a `WHERE`
/// (standalone or attached to a `WITH`), `CALL {}` bodies, `UNION` branches,
/// and `CREATE` / `MERGE` write patterns.
///
/// Not covered — equally for both consumers, which is what keeps them in
/// step: `COUNT {}` subqueries and `EXISTS {}` in expression position (both
/// reach patterns through [`Expression`] rather than [`Predicate`]), and
/// update clauses inside `FOREACH`.
fn walk_query_patterns<E>(
    query: &CypherQuery,
    visit: &mut impl FnMut(PatternSite<'_>) -> Result<(), E>,
) -> Result<(), E> {
    for clause in &query.clauses {
        walk_clause_patterns(clause, visit)?;
    }
    Ok(())
}

fn walk_clause_patterns<E>(
    clause: &Clause,
    visit: &mut impl FnMut(PatternSite<'_>) -> Result<(), E>,
) -> Result<(), E> {
    match clause {
        Clause::Match(m) | Clause::OptionalMatch(m) => {
            for pattern in &m.patterns {
                visit(PatternSite::Read(pattern))?;
            }
        }
        Clause::Where(w) => walk_predicate_patterns(&w.predicate, visit)?,
        Clause::With(w) => {
            if let Some(wc) = &w.where_clause {
                walk_predicate_patterns(&wc.predicate, visit)?;
            }
        }
        Clause::Union(u) => walk_query_patterns(&u.query, visit)?,
        // The importing `WITH` was stripped at parse time, so the body is a
        // self-contained sub-pipeline: recurse into it as into a UNION branch.
        Clause::CallSubquery { body, .. } => walk_query_patterns(body, visit)?,
        Clause::Create(c) => {
            for pattern in &c.patterns {
                visit(PatternSite::Write(pattern))?;
            }
        }
        // MERGE's `ON CREATE SET` / `ON MATCH SET` use `SetItem`, which the
        // schema check intentionally skips — see the module doc-comment.
        Clause::Merge(m) => visit(PatternSite::Write(&m.pattern))?,
        // LOAD CSV binds an untyped map/list, so it carries no pattern —
        // same as UNWIND.
        _ => {}
    }
    Ok(())
}

/// Descend a predicate to the `EXISTS { ... }` patterns nested inside it.
fn walk_predicate_patterns<E>(
    predicate: &Predicate,
    visit: &mut impl FnMut(PatternSite<'_>) -> Result<(), E>,
) -> Result<(), E> {
    match predicate {
        Predicate::And(a, b) | Predicate::Or(a, b) | Predicate::Xor(a, b) => {
            walk_predicate_patterns(a, visit)?;
            walk_predicate_patterns(b, visit)?;
        }
        Predicate::Not(p) => walk_predicate_patterns(p, visit)?,
        Predicate::Exists {
            patterns,
            where_clause,
            ..
        } => {
            for pattern in patterns {
                visit(PatternSite::Read(pattern))?;
            }
            if let Some(w) = where_clause {
                walk_predicate_patterns(w, visit)?;
            }
        }
        _ => {}
    }
    Ok(())
}

/// Infallible companion to [`walk_query_patterns`] for visitors that only
/// collect — the warning path never rejects, so it should not have to spell
/// out an error type it cannot produce.
fn for_each_query_pattern(query: &CypherQuery, visit: &mut impl FnMut(PatternSite<'_>)) {
    let outcome = walk_query_patterns(query, &mut |site| -> Result<(), Infallible> {
        visit(site);
        Ok(())
    });
    match outcome {
        Ok(()) => {}
        // `Infallible` is uninhabited — this arm cannot be constructed.
        Err(never) => match never {},
    }
}

/// Validate a CREATE / MERGE pattern's node-pattern property names
/// against the schema. Edge-pattern properties aren't validated —
/// `connection_type_metadata` is keyed differently and edge schemas
/// in kglite are looser; revisit if a real divergence shows up.
fn validate_create_pattern(pattern: &CreatePattern, graph: &DirGraph) -> Result<(), SchemaError> {
    for element in &pattern.elements {
        if let CreateElement::Node(np) = element {
            if let Some(ref node_type) = np.label {
                for (prop_name, _expr) in &np.properties {
                    validate_property(node_type, prop_name, graph)?;
                }
            }
        }
    }
    Ok(())
}

/// Validate a read pattern's labels (locked schemas only) and its
/// pattern-literal property names.
///
/// A node pattern carrying no explicit label is skipped entirely: property
/// validation needs a node type, and kglite does not infer one from an outer
/// binding, so `CALL { WITH p MATCH (p {prp: v}) }` is not checked.
fn validate_pattern(pattern: &Pattern, graph: &DirGraph) -> Result<(), SchemaError> {
    for element in &pattern.elements {
        if let PatternElement::Node(np) = element {
            // Label check first: on a locked schema an unknown label is a
            // typo, not an empty result set. Checked before the property
            // loop so `MATCH (i:Isue {titel: 1})` reports the label — the
            // outer mistake — rather than a property of a type that does
            // not exist.
            if graph.schema_locked {
                for label in np.node_type.iter().chain(np.extra_labels.iter()) {
                    validate_label(label, graph)?;
                }
            }
            if let Some(ref node_type) = np.node_type {
                if let Some(ref props) = np.properties {
                    for prop_name in props.keys() {
                        validate_property(node_type, prop_name, graph)?;
                    }
                }
            }
        }
    }
    Ok(())
}

/// A label is "known" if it is a declared primary type, currently has live
/// nodes, or is a secondary label applied via `add_label` — `MATCH
/// (n:Reviewer)` is valid even though `Reviewer` is no node's primary type.
/// Mirrors the identical three-way test in
/// [`collect_unknown_pattern_warnings`]; keep the two in step.
fn label_known(label: &str, graph: &DirGraph) -> bool {
    graph.node_type_metadata.contains_key(label)
        || graph.type_indices.contains_key(label)
        || graph
            .secondary_label_index
            .contains_key(&InternedKey::from_str(label))
}

/// Reject an unknown node label. **Caller gates on `graph.schema_locked`.**
///
/// On an open schema kglite is schemaless by design and `MATCH
/// (n:Nonexistent)` legitimately returns zero rows (the existence-check
/// idiom), so this is never reached and
/// [`collect_unknown_pattern_warnings`] delivers the typo hint non-fatally
/// instead. `lock_schema()` is the opt-in "catch my typos" mechanism: it
/// already rejects an unknown *property* here, and an unknown *node type*
/// on the CREATE write path
/// ([`validate_node_creation`](crate::graph::mutation::validation::validate_node_creation)).
/// This closes the read side, where a typo'd label previously returned `[]`
/// — indistinguishable from "no matching data".
///
/// The message deliberately reuses the write path's wording so a locked
/// schema reports the same mistake identically whether it is read or
/// written, and enumerates the valid set exactly like the unknown-property
/// message above it.
fn validate_label(label: &str, graph: &DirGraph) -> Result<(), SchemaError> {
    if label_known(label, graph) {
        return Ok(());
    }
    // Cold path only — the candidate list is built solely to explain a
    // confirmed typo.
    let mut valid: Vec<&str> = graph
        .node_type_metadata
        .keys()
        .map(|s| s.as_str())
        .chain(graph.type_indices.keys())
        .collect();
    // `try_resolve`, not `resolve`: the latter panics on a key the interner
    // has no entry for, and an error-message builder must never be the thing
    // that takes the process down. A key we cannot name is simply omitted
    // from the hint.
    valid.extend(
        graph
            .secondary_label_index
            .keys()
            .filter_map(|k| graph.interner.try_resolve(*k)),
    );
    valid.sort_unstable();
    valid.dedup();
    let hint = did_you_mean(label, &valid);
    Err(SchemaError {
        kind: SchemaErrorKind::UnknownNodeType,
        message: format!(
            "Unknown node type '{}'.{}\n  Valid types: {}",
            label,
            hint,
            valid.join(", ")
        ),
    })
}

/// Whether `property` is named by the graph's *declared* schema for
/// `node_type` — `define_schema`'s `required` / `optional` / `types`, the
/// declared primary key, and any `unique` tuple.
///
/// `node_type_metadata` is observed, not declared: it is populated from the
/// values that have actually been written, so a property a caller declared up
/// front but has not stored yet is absent from it. Reading only that map made
/// the typo-guard reject `CREATE (n:Item {p1: 1})` on a type whose schema
/// declares `p1` — a declaration the user wrote precisely to say "this property
/// is expected". The guard itself is deliberate for *undeclared* properties and
/// stays; this closes the case where the answer is written down.
fn property_is_declared(node_type: &str, property: &str, graph: &DirGraph) -> bool {
    let Some(schema) = graph.schema_definition.as_ref() else {
        return false;
    };
    let Some(node) = schema.node_schemas.get(node_type) else {
        return false;
    };
    node.required_fields.iter().any(|f| f == property)
        || node.optional_fields.iter().any(|f| f == property)
        || node.field_types.contains_key(property)
        || node.primary_key.as_deref() == Some(property)
        || node
            .unique
            .iter()
            .flatten()
            .any(|tuple| tuple.iter().any(|f| f == property))
}

fn validate_property(node_type: &str, property: &str, graph: &DirGraph) -> Result<(), SchemaError> {
    if BUILTIN_FIELDS.contains(&property) {
        return Ok(());
    }
    let Some(type_props) = graph.node_type_metadata.get(node_type) else {
        // No declared property metadata for this type — skip rather than
        // false-positive on dynamically-typed or under-declared graphs.
        return Ok(());
    };
    if type_props.is_empty() || type_props.contains_key(property) {
        return Ok(());
    }
    if property_is_declared(node_type, property, graph) {
        return Ok(());
    }
    let candidates: Vec<&str> = type_props.keys().map(|s| s.as_str()).collect();
    let hint = did_you_mean(property, &candidates);
    let mut sorted = candidates;
    sorted.sort();
    Err(SchemaError {
        kind: SchemaErrorKind::UnknownProperty,
        message: format!(
            "Unknown property '{}' on {}.{}\n  Valid properties: {}",
            property,
            node_type,
            hint,
            sorted.join(", ")
        ),
    })
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::graph::languages::cypher::parser::parse_cypher;

    fn graph_with_schema() -> DirGraph {
        let mut g = DirGraph::new();
        let mut person_props = HashMap::new();
        person_props.insert("age".to_string(), "int".to_string());
        person_props.insert("email".to_string(), "string".to_string());
        g.upsert_node_type_metadata("Person", person_props);
        let mut paper_props = HashMap::new();
        paper_props.insert("year".to_string(), "int".to_string());
        g.upsert_node_type_metadata("Paper", paper_props);
        g.upsert_connection_type_metadata("KNOWS", "Person", "Person", HashMap::new());
        g.upsert_connection_type_metadata("AUTHORED", "Person", "Paper", HashMap::new());
        g
    }

    /// A property the graph's schema *declares* is not a typo, even though the
    /// type has never carried a value for it.
    ///
    /// The unknown-property guard reads `node_type_metadata`, which is built
    /// from values that were actually written. So the first `CREATE` naming a
    /// declared-but-unwritten property was rejected with "Did you mean ...?" —
    /// and since a `CREATE` is how the property would come to be written, the
    /// rejection was self-perpetuating: a Cypher statement stream literally
    /// could not grow a type's schema, whatever the caller declared.
    #[test]
    fn a_declared_property_is_not_a_typo() {
        use crate::graph::schema::{NodeSchemaDefinition, SchemaDefinition, SchemaInstall};

        let mut g = graph_with_schema();
        let mut declared = SchemaDefinition::default();
        let mut person = NodeSchemaDefinition {
            required_fields: vec!["age".to_string()],
            optional_fields: vec!["nickname".to_string()],
            ..Default::default()
        };
        person
            .field_types
            .insert("height".to_string(), "float64".to_string());
        person.unique = Some(vec![vec!["passport".to_string()]]);
        declared.node_schemas.insert("Person".to_string(), person);
        g.set_schema(declared, SchemaInstall::Replace)
            .expect("schema installs on an empty graph");

        for query in [
            "CREATE (n:Person {nickname: 'Al'})",
            "CREATE (n:Person {height: 1.8})",
            "CREATE (n:Person {passport: 'X1'})",
            "MATCH (n:Person {nickname: 'Al'}) RETURN n",
        ] {
            let q = parse_cypher(query).unwrap();
            assert!(
                validate_schema(&q, &g).is_ok(),
                "declared property rejected by the typo-guard: {query} -> {:?}",
                validate_schema(&q, &g).unwrap_err().message
            );
        }

        // The guard itself is unchanged for a property nobody declared.
        let q = parse_cypher("CREATE (n:Person {nicknmae: 'Al'})").unwrap();
        let err = validate_schema(&q, &g).expect_err("undeclared property must still be rejected");
        assert!(
            err.message.contains("Unknown property 'nicknmae'"),
            "{}",
            err.message
        );
    }

    #[test]
    fn validates_known_node_type() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:Person) RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn tolerates_unknown_node_type() {
        // `MATCH (n:Nonexistent) RETURN n` is valid Cypher — returns 0
        // rows. Phase 3 will surface a "did you mean?" hint via
        // diagnostics rather than rejecting.
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:person) RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn tolerates_unknown_connection_type() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (a:Person)-[:nonexistent]->(b:Person) RETURN a").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn warns_unknown_node_label_with_hint() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:Persn) RETURN n").unwrap();
        let warnings = collect_unknown_pattern_warnings(&q, &g);
        assert_eq!(warnings.len(), 1, "got: {warnings:?}");
        assert!(warnings[0].contains("unknown node label 'Persn'"));
        assert!(
            warnings[0].contains("Did you mean 'Person'?"),
            "got: {}",
            warnings[0]
        );
    }

    #[test]
    fn warns_unknown_relationship_type_with_hint() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (a:Person)-[:KNOWZ]->(b:Person) RETURN a").unwrap();
        let warnings = collect_unknown_pattern_warnings(&q, &g);
        assert_eq!(warnings.len(), 1, "got: {warnings:?}");
        assert!(warnings[0].contains("unknown relationship type 'KNOWZ'"));
        assert!(
            warnings[0].contains("Did you mean 'KNOWS'?"),
            "got: {}",
            warnings[0]
        );
    }

    #[test]
    fn no_warning_for_secondary_label() {
        // A label applied via add_label is valid in MATCH even though it is no
        // node's primary type — must NOT be flagged as unknown (regression
        // guard for a false positive: the warning once claimed `:Reviewer`
        // was unknown and "returns no rows" while it returned rows).
        let mut g = graph_with_schema();
        g.secondary_label_index
            .entry(InternedKey::from_str("Reviewer"))
            .or_default();
        let q = parse_cypher("MATCH (n:Reviewer) RETURN n").unwrap();
        assert!(collect_unknown_pattern_warnings(&q, &g).is_empty());
        // And it still warns on a genuine typo of the secondary label.
        let q2 = parse_cypher("MATCH (n:Reviewr) RETURN n").unwrap();
        assert_eq!(collect_unknown_pattern_warnings(&q2, &g).len(), 1);
    }

    #[test]
    fn no_warning_for_known_label_and_relationship() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (a:Person)-[:KNOWS]->(b:Person) RETURN a").unwrap();
        assert!(collect_unknown_pattern_warnings(&q, &g).is_empty());
    }

    #[test]
    fn no_warning_on_schemaless_graph() {
        // A fresh graph has nothing to compare against → never warns.
        let g = DirGraph::new();
        let q = parse_cypher("MATCH (n:Anything) RETURN n").unwrap();
        assert!(collect_unknown_pattern_warnings(&q, &g).is_empty());
    }

    #[test]
    fn rejects_unknown_property_in_pattern_literal() {
        // The `{agee: 30}` form is unambiguous — validate.
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:Person {agee: 30}) RETURN n").unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
        assert!(err.message.contains("age"), "got: {}", err.message);
    }

    #[test]
    fn tolerates_unknown_property_in_where_expression() {
        // `n.prop` accesses in WHERE may reference virtual columns
        // (timeseries sub-nodes, computed aliases). Do not flag.
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:Person) WHERE n.birth_yr = 1900 RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn tolerates_unknown_property_in_return_expression() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:Person) RETURN n.agee").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn allows_builtin_fields_in_pattern_literal() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:Person {id: 1}) RETURN n.title").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn skips_validation_on_empty_schema() {
        let g = DirGraph::new();
        let q = parse_cypher("MATCH (n:Anything) RETURN n.whatever").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn validates_untyped_patterns_permissively() {
        // Untyped patterns (no :Label) are common and legal — we only
        // validate when the user has declared intent via a label.
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n) WHERE n.whatever = 1 RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn rejects_unknown_property_on_multi_hop_pattern_literal() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (a:Person)-[:KNOWS]->(b:Person {agee: 30}) RETURN a").unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
    }

    #[test]
    fn allows_order_by_and_return_of_known_properties() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n:Person) RETURN n.age ORDER BY n.email").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn tolerates_unknown_label_in_where_label_check() {
        let g = graph_with_schema();
        let q = parse_cypher("MATCH (n) WHERE n:person RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn rejects_unknown_property_in_create_pattern_literal() {
        // CREATE typos slip through silently today: `CREATE (:Person {ttle: 'x'})`
        // adds a node with a `ttle` property instead of `title`. Pre-flight
        // validation surfaces the typo with a "did you mean?" hint.
        let g = graph_with_schema();
        let q = parse_cypher("CREATE (:Person {agee: 30})").unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
        assert!(err.message.contains("age"), "got: {}", err.message);
    }

    #[test]
    fn allows_known_property_in_create() {
        let g = graph_with_schema();
        let q = parse_cypher("CREATE (:Person {age: 30, email: 'a@b'})").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn rejects_unknown_property_in_create_multi_element_path() {
        // CREATE (a:Person {age: 30})-[:KNOWS]->(b:Person {agee: 25})
        // — typo on the second node.
        let g = graph_with_schema();
        let q =
            parse_cypher("CREATE (a:Person {age: 30})-[:KNOWS]->(b:Person {agee: 25}) RETURN a, b")
                .unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
    }

    #[test]
    fn rejects_unknown_property_in_merge_pattern_literal() {
        let g = graph_with_schema();
        let q = parse_cypher("MERGE (n:Person {agee: 30}) RETURN n").unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
    }

    #[test]
    fn allows_known_property_in_merge() {
        let g = graph_with_schema();
        let q = parse_cypher("MERGE (n:Person {email: 'a@b'}) RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn create_with_untyped_node_is_permissive() {
        // CREATE (n {anything: 1}) — no label, no type metadata to
        // check against. Permissive (matches MATCH behavior).
        let g = graph_with_schema();
        let q = parse_cypher("CREATE (n {anything_at_all: 1}) RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn create_on_unknown_node_type_is_permissive() {
        // Symmetric with `tolerates_unknown_node_type` for MATCH —
        // unknown labels are not rejected here either (consistent
        // rule: only validate when metadata is declared).
        let g = graph_with_schema();
        let q = parse_cypher("CREATE (n:NewType {whatever: 1}) RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn create_builtin_field_is_allowed() {
        let g = graph_with_schema();
        let q = parse_cypher("CREATE (n:Person {id: 99, title: 'Eve'}) RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn validates_property_inside_call_subquery_body() {
        // A pattern-literal typo inside a CALL { } body must be caught with
        // the same "did you mean?" quality as a top-level pattern.
        let g = graph_with_schema();
        let q = parse_cypher("CALL { MATCH (n:Person {agee: 1}) RETURN n.name AS nm } RETURN nm")
            .unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
        assert!(err.message.contains("age"), "got: {}", err.message);
    }

    #[test]
    fn validates_labeled_pattern_literal_inside_correlated_call_body() {
        // A correlated body that introduces a NEW labeled node with a
        // property typo is caught (same rule as a top-level labeled
        // pattern literal). `f:Person {agee:...}` inside the body is
        // invalid.
        let g = graph_with_schema();
        let q = parse_cypher(
            "MATCH (p:Person) CALL { WITH p MATCH (p)-[:KNOWS]->(f:Person {agee: 1}) RETURN count(f) AS c } RETURN p.name, c",
        )
        .unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
        assert!(err.message.contains("age"), "got: {}", err.message);
    }

    #[test]
    fn call_subquery_body_non_imported_var_is_fresh_scope() {
        // A bare body variable that shadows an outer name is a FRESH
        // variable (§1.2 rule 1) — without the import, the body's `n` has
        // no declared type, so a property reference is permissively allowed
        // (matches top-level untyped behaviour). No false positive.
        let g = graph_with_schema();
        let q = parse_cypher(
            "MATCH (p:Person) CALL { MATCH (n) RETURN n.anything AS a } RETURN p.name, a",
        )
        .unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn validates_property_inside_exists_nested_pattern() {
        // Pattern literals inside EXISTS { MATCH ... } should be
        // validated too.
        let g = graph_with_schema();
        let q = parse_cypher(
            "MATCH (a:Person) WHERE EXISTS { MATCH (a)-[:KNOWS]->(b:Person {agee: 1}) } RETURN a",
        )
        .unwrap();
        let err = validate_schema(&q, &g).unwrap_err();
        assert_eq!(err.kind, SchemaErrorKind::UnknownProperty);
    }

    // ── A1b: WHERE-clause absent-property warnings (non-fatal) ──────────────

    #[test]
    fn warns_on_where_property_absent_from_label() {
        let g = graph_with_schema();
        // `is_external` is not a Person property → the comparison is always
        // null/false and filters everything; warn (non-fatal) + did-you-mean.
        let q = parse_cypher("MATCH (p:Person) WHERE p.is_external = false RETURN p").unwrap();
        let w = collect_unknown_pattern_warnings(&q, &g);
        assert_eq!(w.len(), 1, "{w:?}");
        assert!(
            w[0].contains("is_external") && w[0].contains("Person"),
            "{}",
            w[0]
        );
        // A near-miss still gets a suggestion.
        let q2 = parse_cypher("MATCH (p:Person) WHERE p.agee = 1 RETURN p").unwrap();
        let w2 = collect_unknown_pattern_warnings(&q2, &g);
        assert!(
            w2.iter().any(|m| m.contains("Did you mean 'age'")),
            "{w2:?}"
        );
    }

    #[test]
    fn no_warning_on_present_or_builtin_property() {
        let g = graph_with_schema();
        // Declared property → no warning.
        let q = parse_cypher("MATCH (p:Person) WHERE p.age = 30 RETURN p").unwrap();
        assert!(collect_unknown_pattern_warnings(&q, &g).is_empty());
        // Built-in field → no warning.
        let q2 = parse_cypher("MATCH (p:Person) WHERE p.id = 1 RETURN p").unwrap();
        assert!(collect_unknown_pattern_warnings(&q2, &g).is_empty());
    }

    #[test]
    fn no_warning_on_untyped_var() {
        let g = graph_with_schema();
        // No label on the var → can't reason about its properties → no warning
        // (avoids false positives on dynamically-typed graphs).
        let q = parse_cypher("MATCH (n) WHERE n.whatever = 1 RETURN n").unwrap();
        assert!(collect_unknown_pattern_warnings(&q, &g).is_empty());
    }

    // ── Locked-schema label rejection ────────────────────────────────────
    //
    // `lock_schema()` is the "catch my typos" mechanism; it has always
    // rejected an unknown *property*, and an unknown *node type* on the
    // CREATE write path. These cover the read side. Every clause that can
    // carry a label gets a case — a fix covering only MATCH would recreate
    // the same asymmetry one level down.

    /// Adds an `Issue` type so `Isue` has a real near-miss to suggest —
    /// this is the scenario from the field report, verbatim.
    fn locked_graph() -> DirGraph {
        let mut g = graph_with_schema();
        let mut issue_props = HashMap::new();
        issue_props.insert("status".to_string(), "string".to_string());
        g.upsert_node_type_metadata("Issue", issue_props);
        g.schema_locked = true;
        g
    }

    /// The one assertion that matters: the offending label is named AND the
    /// valid set is enumerated, exactly like the unknown-property message.
    fn assert_rejects_isue(query: &str) {
        let g = locked_graph();
        let q = parse_cypher(query).unwrap();
        let err =
            validate_schema(&q, &g).expect_err(&format!("locked schema should reject: {query}"));
        assert_eq!(err.kind, SchemaErrorKind::UnknownNodeType, "for `{query}`");
        assert_eq!(
            err.message,
            "Unknown node type 'Isue'. Did you mean 'Issue'?\n  Valid types: Issue, Paper, Person",
            "for `{query}`"
        );
    }

    #[test]
    fn locked_schema_rejects_unknown_label_in_match() {
        assert_rejects_isue("MATCH (i:Isue) RETURN i");
    }

    #[test]
    fn locked_schema_rejects_unknown_label_in_optional_match() {
        assert_rejects_isue("MATCH (p:Person) OPTIONAL MATCH (i:Isue) RETURN p, i");
    }

    #[test]
    fn locked_schema_rejects_unknown_label_in_where_pattern_predicate() {
        assert_rejects_isue("MATCH (p:Person) WHERE EXISTS { MATCH (i:Isue) } RETURN p");
    }

    #[test]
    fn locked_schema_rejects_unknown_label_in_call_subquery() {
        assert_rejects_isue("CALL { MATCH (i:Isue) RETURN i } RETURN i");
    }

    #[test]
    fn locked_schema_rejects_unknown_label_in_union_branch() {
        assert_rejects_isue("MATCH (p:Person) RETURN p UNION MATCH (i:Isue) RETURN i");
    }

    #[test]
    fn locked_schema_rejects_unknown_extra_label() {
        // `(n:A:B)` puts the first label in `node_type` and the rest in
        // `extra_labels` — a typo in the tail must be caught too.
        let g = locked_graph();
        let q = parse_cypher("MATCH (n:Person:Revewer) RETURN n").unwrap();
        let err = validate_schema(&q, &g).expect_err("extra label typo should be rejected");
        assert_eq!(err.kind, SchemaErrorKind::UnknownNodeType);
        assert!(
            err.message.starts_with("Unknown node type 'Revewer'."),
            "got: {}",
            err.message
        );
    }

    #[test]
    fn locked_schema_offers_did_you_mean_for_near_miss() {
        let g = locked_graph();
        let q = parse_cypher("MATCH (n:Persn) RETURN n").unwrap();
        let err = validate_schema(&q, &g).expect_err("near-miss label should be rejected");
        assert_eq!(
            err.message,
            "Unknown node type 'Persn'. Did you mean 'Person'?\n  Valid types: Issue, Paper, Person"
        );
    }

    #[test]
    fn locked_schema_accepts_known_labels_everywhere() {
        let g = locked_graph();
        for query in [
            "MATCH (p:Person) RETURN p",
            "MATCH (p:Person) OPTIONAL MATCH (q:Paper) RETURN p, q",
            "MATCH (p:Person) WHERE EXISTS { MATCH (q:Paper) } RETURN p",
            "CALL { MATCH (q:Paper) RETURN q } RETURN q",
            "MATCH (p:Person) RETURN p UNION MATCH (q:Paper) RETURN q",
            // Untyped patterns carry no label to check.
            "MATCH (n) RETURN n",
        ] {
            let q = parse_cypher(query).unwrap();
            assert!(
                validate_schema(&q, &g).is_ok(),
                "locked schema wrongly rejected `{query}`: {:?}",
                validate_schema(&q, &g).err()
            );
        }
    }

    #[test]
    fn locked_schema_reports_the_label_before_the_property() {
        // When both are wrong, the label is the outer mistake — reporting a
        // property of a type that does not exist would be nonsense.
        let g = locked_graph();
        let q = parse_cypher("MATCH (i:Isue {titel: 'x'}) RETURN i").unwrap();
        let err = validate_schema(&q, &g).expect_err("should reject");
        assert_eq!(err.kind, SchemaErrorKind::UnknownNodeType);
    }

    #[test]
    fn open_schema_still_tolerates_unknown_label() {
        // The schemaless default is the product — the zero-row
        // existence-check idiom must keep working untouched. This is the
        // regression guard for the gate on `schema_locked`.
        let g = graph_with_schema();
        assert!(!g.schema_locked);
        for query in [
            "MATCH (i:Isue) RETURN i",
            "MATCH (p:Person) OPTIONAL MATCH (i:Isue) RETURN p, i",
            "MATCH (p:Person) WHERE EXISTS { MATCH (i:Isue) } RETURN p",
            "CALL { MATCH (i:Isue) RETURN i } RETURN i",
            "MATCH (p:Person) RETURN p UNION MATCH (i:Isue) RETURN i",
            "MATCH (n:Person:Revewer) RETURN n",
        ] {
            let q = parse_cypher(query).unwrap();
            assert!(
                validate_schema(&q, &g).is_ok(),
                "open schema must not reject `{query}`"
            );
        }
    }

    #[test]
    fn locked_schema_leaves_unknown_relationship_types_alone() {
        // Edge types are not part of what a schema lock covers on the read
        // path; only the node-label gap was asymmetric with properties.
        let g = locked_graph();
        let q = parse_cypher("MATCH (a:Person)-[:NOSUCH]->(b:Person) RETURN a").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
    }

    #[test]
    fn locked_schema_accepts_secondary_labels() {
        // A label applied via `add_label` is legitimately matchable even
        // though it is no node's primary type — rejecting it would be a
        // false positive.
        let mut g = locked_graph();
        let key = g.interner.try_get_or_intern("Reviewer").unwrap();
        g.secondary_label_index.insert(key, Vec::new());
        g.has_secondary_labels = true;
        let q = parse_cypher("MATCH (n:Reviewer) RETURN n").unwrap();
        assert!(validate_schema(&q, &g).is_ok());
        // …and it appears in the enumerated valid set for a real typo.
        let q2 = parse_cypher("MATCH (n:Isue) RETURN n").unwrap();
        let err = validate_schema(&q2, &g).expect_err("should reject");
        assert_eq!(
            err.message,
            "Unknown node type 'Isue'. Did you mean 'Issue'?\n  Valid types: Issue, Paper, Person, Reviewer"
        );
    }

    // ── Open-schema warnings reach every nested clause ───────────────────
    //
    // The counterpart to the locked-schema block above. The warning
    // collector once walked top-level MATCH / OPTIONAL MATCH only, so the
    // same typo warned at top level and said nothing one level down —
    // precisely the asymmetry the locked path had already been fixed for.
    // Both now share [`walk_query_patterns`], so each clause form gets a
    // case here and stays covered.

    /// Open (unlocked) schema with an `Issue` type, so `Isue` has a real
    /// near-miss to suggest — the locked block's scenario, unlocked.
    fn open_graph_with_issue() -> DirGraph {
        let mut g = graph_with_schema();
        let mut issue_props = HashMap::new();
        issue_props.insert("status".to_string(), "string".to_string());
        g.upsert_node_type_metadata("Issue", issue_props);
        assert!(!g.schema_locked, "this block is about the open-schema path");
        g
    }

    /// Exactly one warning, naming the typo'd label and suggesting the real
    /// one — and still no error, because a zero-row read stays legal.
    fn assert_warns_isue(query: &str) {
        let g = open_graph_with_issue();
        let q = parse_cypher(query).unwrap();
        let warnings = collect_unknown_pattern_warnings(&q, &g);
        assert_eq!(warnings.len(), 1, "for `{query}`, got: {warnings:?}");
        assert_eq!(
            warnings[0],
            "MATCH references unknown node label 'Isue' — the graph has no such type, so this \
             pattern returns no rows. Did you mean 'Issue'?",
            "for `{query}`"
        );
        assert!(
            validate_schema(&q, &g).is_ok(),
            "warning must stay non-fatal on an open schema: `{query}`"
        );
    }

    #[test]
    fn warns_unknown_label_in_top_level_match() {
        // Control: the surface that already worked must keep working, with
        // the identical message the nested cases assert.
        assert_warns_isue("MATCH (i:Isue) RETURN i");
        assert_warns_isue("MATCH (p:Person) OPTIONAL MATCH (i:Isue) RETURN p, i");
    }

    #[test]
    fn warns_unknown_label_in_call_subquery() {
        assert_warns_isue("CALL { MATCH (i:Isue) RETURN i } RETURN i");
    }

    #[test]
    fn warns_unknown_label_in_where_exists() {
        assert_warns_isue("MATCH (p:Person) WHERE EXISTS { MATCH (i:Isue) } RETURN p");
        // …and behind boolean nesting, which the predicate walk descends.
        assert_warns_isue(
            "MATCH (p:Person) WHERE p.age > 1 AND NOT EXISTS { MATCH (i:Isue) } RETURN p",
        );
        // …and on a WITH's WHERE, not just a standalone one.
        assert_warns_isue("MATCH (p:Person) WITH p WHERE EXISTS { MATCH (i:Isue) } RETURN p");
    }

    #[test]
    fn warns_unknown_label_in_union_branch() {
        assert_warns_isue("MATCH (p:Person) RETURN p UNION MATCH (i:Isue) RETURN i");
    }

    #[test]
    fn warns_unknown_label_nested_two_deep() {
        // Nesting composes: an EXISTS inside a CALL body is reached by the
        // same recursion, so no clause form needs its own special case.
        assert_warns_isue(
            "CALL { MATCH (p:Person) WHERE EXISTS { MATCH (i:Isue) } RETURN p } RETURN p",
        );
    }

    #[test]
    fn warns_unknown_relationship_type_in_nested_clauses() {
        // The relationship half of the same walk — one warning per query,
        // wherever the pattern sits.
        let g = open_graph_with_issue();
        for query in [
            "CALL { MATCH (a:Person)-[:KNOWZ]->(b:Person) RETURN a } RETURN a",
            "MATCH (p:Person) WHERE EXISTS { MATCH (a:Person)-[:KNOWZ]->(b:Person) } RETURN p",
            "MATCH (p:Person) RETURN p UNION MATCH (a:Person)-[:KNOWZ]->(b:Person) RETURN a",
        ] {
            let q = parse_cypher(query).unwrap();
            let warnings = collect_unknown_pattern_warnings(&q, &g);
            assert_eq!(warnings.len(), 1, "for `{query}`, got: {warnings:?}");
            assert!(
                warnings[0].contains("unknown relationship type 'KNOWZ'")
                    && warnings[0].contains("Did you mean 'KNOWS'?"),
                "for `{query}`, got: {}",
                warnings[0]
            );
        }
    }

    #[test]
    fn no_warning_for_known_labels_in_nested_clauses() {
        // The other half of the coverage: descending must not invent
        // warnings for valid nested patterns.
        let g = open_graph_with_issue();
        for query in [
            "CALL { MATCH (i:Issue) RETURN i } RETURN i",
            "MATCH (p:Person) WHERE EXISTS { MATCH (i:Issue) } RETURN p",
            "MATCH (p:Person) RETURN p UNION MATCH (i:Issue) RETURN i",
            "CALL { MATCH (a:Person)-[:KNOWS]->(b:Person) RETURN a } RETURN a",
        ] {
            let q = parse_cypher(query).unwrap();
            assert!(
                collect_unknown_pattern_warnings(&q, &g).is_empty(),
                "spurious warning for `{query}`: {:?}",
                collect_unknown_pattern_warnings(&q, &g)
            );
        }
    }

    #[test]
    fn no_warning_for_new_label_in_nested_write() {
        // Write patterns are how a type comes into existence on an open
        // schema — warning "the graph has no such type" for a CREATE would
        // be wrong. The shared walk visits them (the fatal check needs their
        // property names), so the warning collector must skip them by kind.
        // (A write inside `CALL { }` is rejected by the parser, so top-level
        // CREATE / MERGE are the reachable cases.)
        let g = open_graph_with_issue();
        for query in [
            "CREATE (i:Ticket {title: 'x'})",
            "MERGE (i:Ticket {title: 'x'})",
            "MATCH (p:Person) MERGE (p)-[:KNOWZ]->(t:Ticket {title: 'x'})",
        ] {
            let q = parse_cypher(query).unwrap();
            assert!(
                collect_unknown_pattern_warnings(&q, &g).is_empty(),
                "write pattern wrongly warned for `{query}`: {:?}",
                collect_unknown_pattern_warnings(&q, &g)
            );
        }
    }
}