pub struct PgJsonVisitor<'a, 'b> { /* private fields */ }Expand description
Formats plans to display as postgresql plan json format.
There are already many existing visualizer for this format, for example dalibo. Unfortunately, there is no formal spec for this format, but it is widely used in the PostgreSQL community.
Here is an example of the format:
[
{
"Plan": {
"Node Type": "Sort",
"Output": [
"question_1.id",
"question_1.title",
"question_1.text",
"question_1.file",
"question_1.type",
"question_1.source",
"question_1.exam_id"
],
"Sort Key": [
"question_1.id"
],
"Plans": [
{
"Node Type": "Seq Scan",
"Parent Relationship": "Left",
"Relation Name": "question",
"Schema": "public",
"Alias": "question_1",
"Output": [
"question_1.id",
"question_1.title",
"question_1.text",
"question_1.file",
"question_1.type",
"question_1.source",
"question_1.exam_id"
],
"Filter": "(question_1.exam_id = 1)"
}
]
}
}
]
Implementations§
source§impl<'a, 'b> PgJsonVisitor<'a, 'b>
impl<'a, 'b> PgJsonVisitor<'a, 'b>
pub fn new(f: &'a mut Formatter<'b>) -> PgJsonVisitor<'a, 'b>
sourcepub fn with_schema(&mut self, with_schema: bool)
pub fn with_schema(&mut self, with_schema: bool)
Sets a flag which controls if the output schema is displayed
Trait Implementations§
source§impl<'n, 'a, 'b> TreeNodeVisitor<'n> for PgJsonVisitor<'a, 'b>
impl<'n, 'a, 'b> TreeNodeVisitor<'n> for PgJsonVisitor<'a, 'b>
source§type Node = LogicalPlan
type Node = LogicalPlan
The node type which is visitable.
source§fn f_down(
&mut self,
node: &'n LogicalPlan,
) -> Result<TreeNodeRecursion, DataFusionError>
fn f_down( &mut self, node: &'n LogicalPlan, ) -> Result<TreeNodeRecursion, DataFusionError>
Invoked while traversing down the tree, before any children are visited.
Default implementation continues the recursion.
source§fn f_up(
&mut self,
_node: &<PgJsonVisitor<'a, 'b> as TreeNodeVisitor<'n>>::Node,
) -> Result<TreeNodeRecursion, DataFusionError>
fn f_up( &mut self, _node: &<PgJsonVisitor<'a, 'b> as TreeNodeVisitor<'n>>::Node, ) -> Result<TreeNodeRecursion, DataFusionError>
Invoked while traversing up the tree after children are visited. Default
implementation continues the recursion.
Auto Trait Implementations§
impl<'a, 'b> Freeze for PgJsonVisitor<'a, 'b>
impl<'a, 'b> !RefUnwindSafe for PgJsonVisitor<'a, 'b>
impl<'a, 'b> !Send for PgJsonVisitor<'a, 'b>
impl<'a, 'b> !Sync for PgJsonVisitor<'a, 'b>
impl<'a, 'b> Unpin for PgJsonVisitor<'a, 'b>
impl<'a, 'b> !UnwindSafe for PgJsonVisitor<'a, 'b>
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> Instrument for T
impl<T> Instrument for T
source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 more