Struct DependencyEnumerator 

pub struct DependencyEnumerator<'a> {
    seen: IndexMap<&'a PhysicalSortExpr, IndexSet<&'a PhysicalSortExpr>>,
}

Contains a mapping of all dependencies we have processed for each sort expr

Fields

seen: IndexMap<&'a PhysicalSortExpr, IndexSet<&'a PhysicalSortExpr>>

Maps expr –> [exprs] that have previously been processed

Implementations

impl<'a> DependencyEnumerator<'a>

pub fn new() -> Self

fn insert( &mut self, target: &'a PhysicalSortExpr, dep: &'a PhysicalSortExpr, ) -> bool

Insert a new dependency,

returns false if the dependency was already in the map returns true if the dependency was newly inserted

pub fn construct_orderings( &mut self, referred_sort_expr: &'a PhysicalSortExpr, dependency_map: &'a DependencyMap, ) -> Vec<LexOrdering>

This function recursively analyzes the dependencies of the given sort expression within the given dependency map to construct lexicographical orderings that include the sort expression and its dependencies.

Parameters

• referred_sort_expr: A reference to the sort expression (PhysicalSortExpr) for which lexicographical orderings satisfying its dependencies are to be constructed.
• dependency_map: A reference to the DependencyMap that contains dependencies for different PhysicalSortExprs.

Returns

A vector of lexicographical orderings (Vec<LexOrdering>) based on the given sort expression and its dependencies.