Struct CteScope 

pub(crate) struct CteScope {
    stack: Vec<BTreeSet<String>>,
}

Stack-based tracker for CTE names currently in scope.

Each level in the stack corresponds to one WITH clause. Names from all levels are visible (inner scopes shadow outer ones, though in practice CTE names don’t conflict with each other — they conflict with table names).

Fields

stack: Vec<BTreeSet<String>>

Implementations

impl CteScope

pub(crate) fn new() -> Self

Create an empty scope with no CTE names.

pub(crate) fn push(&mut self, names: BTreeSet<String>)

Push a new set of CTE names onto the scope stack.

Call this when entering a WITH clause. The names remain visible until pop is called.

pub(crate) fn pop(&mut self)

Pop the most recent CTE scope.

Call this when leaving a WITH clause.

pub(crate) fn insert_current(&mut self, name: String)

Add a single CTE name to the most-recently-pushed scope level.

Used to introduce simple-CTE names incrementally: push an empty scope on entering the WITH clause, visit each CTE body, then call this after each so that subsequent siblings (and the main query body) see the name, while the CTE’s own body resolved against the catalog. Has no effect if the stack is empty.

pub(crate) fn is_cte(&self, name: &str) -> bool

Check whether name is a CTE in any active scope level.

Returns true if the name matches a CTE at any depth in the stack. Only unqualified single-identifier references should be checked — multi-part names (e.g., schema.name) are always database object references.

pub(crate) fn collect_cte_names(ctes: &CteBlock<Raw>) -> BTreeSet<String>

Extract all CTE names from a CteBlock into a single set.

Appropriate for MutuallyRecursive blocks, where every name is visible to every definition up front. Simple blocks must instead introduce names incrementally via insert_current; see the module docs.