pub struct PlanContext<T: Sized> {
pub plan: Arc<dyn ExecutionPlan>,
pub data: T,
pub children: Vec<Self>,
}
Expand description
A node object beneficial for writing optimizer rules, encapsulating an ExecutionPlan
node with a payload.
Since there are two ways to access child plans—directly from the plan and through child nodes—it’s recommended
to perform mutable operations via Self::update_plan_from_children
.
Fields§
§plan: Arc<dyn ExecutionPlan>
The execution plan associated with this context.
data: T
Custom data payload of the node.
children: Vec<Self>
Child contexts of this node.
Implementations§
Source§impl<T> PlanContext<T>
impl<T> PlanContext<T>
pub fn new(plan: Arc<dyn ExecutionPlan>, data: T, children: Vec<Self>) -> Self
pub fn update_plan_from_children(self) -> Result<Self>
Source§impl<T: Default> PlanContext<T>
impl<T: Default> PlanContext<T>
pub fn new_default(plan: Arc<dyn ExecutionPlan>) -> Self
Trait Implementations§
Source§impl<T> ConcreteTreeNode for PlanContext<T>
impl<T> ConcreteTreeNode for PlanContext<T>
Source§fn take_children(self) -> (Self, Vec<Self>)
fn take_children(self) -> (Self, Vec<Self>)
Detaches the node from its children, returning the node itself and its detached children.
Source§fn with_new_children(self, children: Vec<Self>) -> Result<Self>
fn with_new_children(self, children: Vec<Self>) -> Result<Self>
Reattaches updated child nodes to the node, returning the updated node.
Auto Trait Implementations§
impl<T> Freeze for PlanContext<T>where
T: Freeze,
impl<T> !RefUnwindSafe for PlanContext<T>
impl<T> Send for PlanContext<T>where
T: Send,
impl<T> Sync for PlanContext<T>where
T: Sync,
impl<T> Unpin for PlanContext<T>where
T: Unpin,
impl<T> !UnwindSafe for PlanContext<T>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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 moreSource§impl<T> TreeNode for Twhere
T: ConcreteTreeNode,
impl<T> TreeNode for Twhere
T: ConcreteTreeNode,
Source§fn apply_children<'n, F>(
&'n self,
f: F,
) -> Result<TreeNodeRecursion, DataFusionError>
fn apply_children<'n, F>( &'n self, f: F, ) -> Result<TreeNodeRecursion, DataFusionError>
Low-level API used to implement other APIs. Read more
Source§fn map_children<F>(self, f: F) -> Result<Transformed<T>, DataFusionError>
fn map_children<F>(self, f: F) -> Result<Transformed<T>, DataFusionError>
Low-level API used to implement other APIs. Read more
Source§fn visit<'n, V>(
&'n self,
visitor: &mut V,
) -> Result<TreeNodeRecursion, DataFusionError>where
V: TreeNodeVisitor<'n, Node = Self>,
fn visit<'n, V>(
&'n self,
visitor: &mut V,
) -> Result<TreeNodeRecursion, DataFusionError>where
V: TreeNodeVisitor<'n, Node = Self>,
Visit the tree node with a
TreeNodeVisitor
, performing a
depth-first walk of the node and its children. Read moreSource§fn rewrite<R>(
self,
rewriter: &mut R,
) -> Result<Transformed<Self>, DataFusionError>where
R: TreeNodeRewriter<Node = Self>,
fn rewrite<R>(
self,
rewriter: &mut R,
) -> Result<Transformed<Self>, DataFusionError>where
R: TreeNodeRewriter<Node = Self>,
Rewrite the tree node with a
TreeNodeRewriter
, performing a
depth-first walk of the node and its children. Read moreSource§fn apply<'n, F>(&'n self, f: F) -> Result<TreeNodeRecursion, DataFusionError>
fn apply<'n, F>(&'n self, f: F) -> Result<TreeNodeRecursion, DataFusionError>
Applies
f
to the node then each of its children, recursively (a
top-down, pre-order traversal). Read moreSource§fn transform<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>
fn transform<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>
Recursively rewrite the node’s children and then the node using
f
(a bottom-up post-order traversal). Read moreSource§fn transform_down<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>
fn transform_down<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>
Recursively rewrite the tree using
f
in a top-down (pre-order)
fashion. Read moreSource§fn transform_up<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>
fn transform_up<F>(self, f: F) -> Result<Transformed<Self>, DataFusionError>
Recursively rewrite the node using
f
in a bottom-up (post-order)
fashion. Read moreSource§fn transform_down_up<FD, FU>(
self,
f_down: FD,
f_up: FU,
) -> Result<Transformed<Self>, DataFusionError>where
FD: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,
FU: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,
fn transform_down_up<FD, FU>(
self,
f_down: FD,
f_up: FU,
) -> Result<Transformed<Self>, DataFusionError>where
FD: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,
FU: FnMut(Self) -> Result<Transformed<Self>, DataFusionError>,
Transforms the node using
f_down
while traversing the tree top-down
(pre-order), and using f_up
while traversing the tree bottom-up
(post-order). Read more