Struct GraphRemoveNode 

pub struct GraphRemoveNode {
    pub input: Arc<LogicalPlan>,
    pub targets: Vec<RemoveTarget>,
    pub type_id_to_entity_name: HashMap<u32, String>,
    pub dir: PathBuf,
    pub mode: OntologyMode,
    /* private fields */
}

Logical node for REMOVE <prop> (#791): the value-less dual of GraphSetNode. Emits a one-row summary properties_removed.

Fields

input: Arc<LogicalPlan>

Input plan whose rows carry the matched entities’ identities + columns.

targets: Vec<RemoveTarget>

The properties to remove, with resolved node/edge kind.

type_id_to_entity_name: HashMap<u32, String>

Maps a node type_id to its property-file entity stem (see GraphSetNode::type_id_to_entity_name).

dir: PathBuf

Target project directory.

mode: OntologyMode

Ontology mode (drives node property-file routing).

Implementations

impl GraphRemoveNode

pub fn summary_schema() -> Arc<Schema>

Build the write-summary Arrow schema (properties_removed).

pub fn new( input: Arc<LogicalPlan>, targets: Vec<RemoveTarget>, type_id_to_entity_name: HashMap<u32, String>, dir: PathBuf, mode: OntologyMode, ) -> Self

Create a new graph-remove node over input.

Trait Implementations

impl Clone for GraphRemoveNode

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphRemoveNode

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for GraphRemoveNode

impl Hash for GraphRemoveNode

fn hash<H: Hasher>(&self, state: &mut H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GraphRemoveNode

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for GraphRemoveNode

fn partial_cmp(&self, _other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl UserDefinedLogicalNodeCore for GraphRemoveNode

fn name(&self) -> &str

Return the plan’s name.

fn inputs(&self) -> Vec<&LogicalPlan>

Return the logical plan’s inputs.

fn schema(&self) -> &DFSchemaRef

Return the output schema of this logical plan node.

fn expressions(&self) -> Vec<Expr>

Returns all expressions in the current logical plan node. This should not include expressions of any inputs (aka non-recursively). These expressions are used for optimizer passes and rewrites.

fn fmt_for_explain(&self, f: &mut Formatter<'_>) -> Result

Write a single line, human readable string to f for use in explain plan.

fn with_exprs_and_inputs( &self, _exprs: Vec<Expr>, inputs: Vec<LogicalPlan>, ) -> DfResult<Self>

Create a new UserDefinedLogicalNode with the specified children and expressions. This function is used during optimization when the plan is being rewritten and a new instance of the UserDefinedLogicalNode must be created.

fn check_invariants( &self, _check: InvariantLevel, ) -> Result<(), DataFusionError>

Perform check of invariants for the extension node.

fn prevent_predicate_push_down_columns(&self) -> HashSet<String>

A list of output columns (e.g. the names of columns in self.schema()) for which predicates can not be pushed below this node without changing the output.

fn necessary_children_exprs( &self, _output_columns: &[usize], ) -> Option<Vec<Vec<usize>>>

Returns the necessary input columns for this node required to compute the columns in the output schema

fn supports_limit_pushdown(&self) -> bool

Returns true if a limit can be safely pushed down through this UserDefinedLogicalNode node.