optd_core::cascades

Struct CascadesOptimizer

Source
pub struct CascadesOptimizer<T: RelNodeTyp, M: Memo<T> = NaiveMemo<T>> {
    pub ctx: OptimizerContext,
    pub prop: OptimizerProperties,
    /* private fields */
}

Fields§

§ctx: OptimizerContext§prop: OptimizerProperties

Implementations§

Source§

impl<T: RelNodeTyp> CascadesOptimizer<T, NaiveMemo<T>>

Source

pub fn new( rules: Vec<Arc<RuleWrapper<T, Self>>>, cost: Box<dyn CostModel<T, NaiveMemo<T>>>, property_builders: Vec<Box<dyn PropertyBuilderAny<T>>>, ) -> Self

Source

pub fn new_with_prop( rules: Vec<Arc<RuleWrapper<T, Self>>>, cost: Box<dyn CostModel<T, NaiveMemo<T>>>, property_builders: Vec<Box<dyn PropertyBuilderAny<T>>>, prop: OptimizerProperties, ) -> Self

Source

pub fn step_clear(&mut self)

Clear the memo table and all optimizer states.

Source

pub fn step_clear_winner(&mut self)

Clear the winner so that the optimizer can continue to explore the group.

Source§

impl<T: RelNodeTyp, M: Memo<T>> CascadesOptimizer<T, M>

Source

pub fn panic_on_explore_limit(&mut self, enabled: bool)

Source

pub fn cost(&self) -> Arc<dyn CostModel<T, M>>

Source

pub fn rules(&self) -> Arc<[Arc<RuleWrapper<T, Self>>]>

Source

pub fn disable_rule(&mut self, rule_id: usize)

Source

pub fn enable_rule(&mut self, rule_id: usize)

Source

pub fn is_rule_disabled(&self, rule_id: usize) -> bool

Source

pub fn dump(&self)

Source

pub fn step_optimize_rel(&mut self, root_rel: RelNodeRef<T>) -> Result<GroupId>

Optimize a RelNode.

Source

pub fn step_get_optimize_rel( &self, group_id: GroupId, meta: &mut Option<RelNodeMetaMap>, ) -> Result<RelNodeRef<T>>

Gets the group binding.

Source

pub fn resolve_group_id(&self, root_rel: RelNodeRef<T>) -> GroupId

Source

pub fn add_new_expr(&mut self, rel_node: RelNodeRef<T>) -> (GroupId, ExprId)

Source

pub fn add_expr_to_group( &mut self, rel_node: RelNodeRef<T>, group_id: GroupId, ) -> Option<ExprId>

Source

pub fn get_property_by_group<P: PropertyBuilder<T>>( &self, group_id: GroupId, idx: usize, ) -> P::Prop

Get the properties of a Cascades group P is the type of the property you expect idx is the idx of the property you want. The order of properties is defined by the property_builders parameter in CascadesOptimizer::new()

Source

pub fn get_predicate_binding(&self, group_id: GroupId) -> Option<RelNodeRef<T>>

Source

pub fn memo(&self) -> &M

Trait Implementations§

Source§

impl<T: RelNodeTyp, M: Memo<T>> Optimizer<T> for CascadesOptimizer<T, M>

Source§

fn optimize(&mut self, root_rel: RelNodeRef<T>) -> Result<RelNodeRef<T>>

Source§

fn get_property<P: PropertyBuilder<T>>( &self, root_rel: RelNodeRef<T>, idx: usize, ) -> P::Prop

Auto Trait Implementations§

§

impl<T, M> Freeze for CascadesOptimizer<T, M>
where M: Freeze,

§

impl<T, M = NaiveMemo<T>> !RefUnwindSafe for CascadesOptimizer<T, M>

§

impl<T, M> Send for CascadesOptimizer<T, M>

§

impl<T, M> Sync for CascadesOptimizer<T, M>

§

impl<T, M> Unpin for CascadesOptimizer<T, M>
where M: Unpin,

§

impl<T, M = NaiveMemo<T>> !UnwindSafe for CascadesOptimizer<T, M>

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T> Instrument for T

Source§

fn instrument(self, span: Span) -> Instrumented<Self>

Instruments this type with the provided Span, returning an Instrumented wrapper. Read more
Source§

fn in_current_span(self) -> Instrumented<Self>

Instruments this type with the current Span, returning an Instrumented wrapper. Read more
Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<T> WithSubscriber for T

Source§

fn with_subscriber<S>(self, subscriber: S) -> WithDispatch<Self>
where S: Into<Dispatch>,

Attaches the provided Subscriber to this type, returning a WithDispatch wrapper. Read more
Source§

fn with_current_subscriber(self) -> WithDispatch<Self>

Attaches the current default Subscriber to this type, returning a WithDispatch wrapper. Read more