Skip to main content

LogicalPlan

Enum LogicalPlan 

Source
pub enum LogicalPlan {
Show 69 variants Union { left: Box<LogicalPlan>, right: Box<LogicalPlan>, all: bool, }, Scan { label_id: u16, labels: Vec<String>, variable: String, filter: Option<Expr>, optional: bool, }, ExtIdLookup { variable: String, ext_id: String, filter: Option<Expr>, optional: bool, }, ScanAll { variable: String, filter: Option<Expr>, optional: bool, }, ScanMainByLabels { labels: Vec<String>, variable: String, filter: Option<Expr>, optional: bool, }, Empty, Unwind { input: Box<LogicalPlan>, expr: Expr, variable: String, }, Traverse {
Show 19 fields input: Box<LogicalPlan>, edge_type_ids: Vec<u32>, direction: Direction, source_variable: String, target_variable: String, target_label_id: u16, step_variable: Option<String>, min_hops: usize, max_hops: usize, optional: bool, target_filter: Option<Expr>, path_variable: Option<String>, edge_properties: HashSet<String>, is_variable_length: bool, optional_pattern_vars: HashSet<String>, scope_match_variables: HashSet<String>, edge_filter_expr: Option<Expr>, path_mode: PathMode, qpp_steps: Option<Vec<QppStepInfo>>,
}, TraverseMainByType {
Show 16 fields type_names: Vec<String>, input: Box<LogicalPlan>, direction: Direction, source_variable: String, target_variable: String, step_variable: Option<String>, min_hops: usize, max_hops: usize, optional: bool, target_filter: Option<Expr>, path_variable: Option<String>, is_variable_length: bool, optional_pattern_vars: HashSet<String>, scope_match_variables: HashSet<String>, edge_filter_expr: Option<Expr>, path_mode: PathMode,
}, Filter { input: Box<LogicalPlan>, predicate: Expr, optional_variables: HashSet<String>, }, Create { input: Box<LogicalPlan>, pattern: Pattern, }, CreateBatch { input: Box<LogicalPlan>, patterns: Vec<Pattern>, }, Merge { input: Box<LogicalPlan>, pattern: Pattern, on_match: Option<SetClause>, on_create: Option<SetClause>, }, Set { input: Box<LogicalPlan>, items: Vec<SetItem>, }, Remove { input: Box<LogicalPlan>, items: Vec<RemoveItem>, }, Delete { input: Box<LogicalPlan>, items: Vec<Expr>, detach: bool, }, Foreach { input: Box<LogicalPlan>, variable: String, list: Expr, body: Vec<LogicalPlan>, }, Sort { input: Box<LogicalPlan>, order_by: Vec<SortItem>, }, Limit { input: Box<LogicalPlan>, skip: Option<usize>, fetch: Option<usize>, }, Aggregate { input: Box<LogicalPlan>, group_by: Vec<Expr>, aggregates: Vec<Expr>, }, Distinct { input: Box<LogicalPlan>, }, Window { input: Box<LogicalPlan>, window_exprs: Vec<Expr>, }, Project { input: Box<LogicalPlan>, projections: Vec<(Expr, Option<String>)>, }, CrossJoin { left: Box<LogicalPlan>, right: Box<LogicalPlan>, }, Apply { input: Box<LogicalPlan>, subquery: Box<LogicalPlan>, input_filter: Option<Expr>, }, RecursiveCTE { cte_name: String, initial: Box<LogicalPlan>, recursive: Box<LogicalPlan>, }, ProcedureCall { procedure_name: String, arguments: Vec<Expr>, yield_items: Vec<(String, Option<String>)>, }, SubqueryCall { input: Box<LogicalPlan>, subquery: Box<LogicalPlan>, }, VectorKnn { label_id: u16, variable: String, property: String, query: Expr, k: usize, threshold: Option<f32>, }, InvertedIndexLookup { label_id: u16, variable: String, property: String, terms: Expr, }, ShortestPath { input: Box<LogicalPlan>, edge_type_ids: Vec<u32>, direction: Direction, source_variable: String, target_variable: String, target_label_id: u16, path_variable: String, min_hops: u32, max_hops: u32, }, AllShortestPaths { input: Box<LogicalPlan>, edge_type_ids: Vec<u32>, direction: Direction, source_variable: String, target_variable: String, target_label_id: u16, path_variable: String, min_hops: u32, max_hops: u32, }, QuantifiedPattern { input: Box<LogicalPlan>, pattern_plan: Box<LogicalPlan>, min_iterations: u32, max_iterations: u32, path_variable: Option<String>, start_variable: String, binding_variable: String, }, CreateVectorIndex { config: VectorIndexConfig, if_not_exists: bool, }, CreateFullTextIndex { config: FullTextIndexConfig, if_not_exists: bool, }, CreateScalarIndex { config: ScalarIndexConfig, if_not_exists: bool, }, CreateJsonFtsIndex { config: JsonFtsIndexConfig, if_not_exists: bool, }, DropIndex { name: String, if_exists: bool, }, ShowIndexes { filter: Option<String>, }, Copy { target: String, source: String, is_export: bool, options: HashMap<String, Value>, }, Backup { destination: String, options: HashMap<String, Value>, }, Explain { plan: Box<LogicalPlan>, }, ShowDatabase, ShowConfig, ShowStatistics, Vacuum, Checkpoint, CopyTo { label: String, path: String, format: String, options: HashMap<String, Value>, }, CopyFrom { label: String, path: String, format: String, options: HashMap<String, Value>, }, CreateLabel(CreateLabel), CreateEdgeType(CreateEdgeType), AlterLabel(AlterLabel), AlterEdgeType(AlterEdgeType), DropLabel(DropLabel), DropEdgeType(DropEdgeType), CreateConstraint(CreateConstraint), DropConstraint(DropConstraint), ShowConstraints(ShowConstraints), Begin, Commit, Rollback, BindZeroLengthPath { input: Box<LogicalPlan>, node_variable: String, path_variable: String, }, BindPath { input: Box<LogicalPlan>, node_variables: Vec<String>, edge_variables: Vec<String>, path_variable: String, }, LocyProgram { strata: Vec<LocyStratum>, commands: Vec<LocyCommand>, derived_scan_registry: Arc<DerivedScanRegistry>, max_iterations: usize, timeout: Duration, max_derived_bytes: usize, deterministic_best_by: bool, strict_probability_domain: bool, probability_epsilon: f64, exact_probability: bool, max_bdd_variables: usize, top_k_proofs: usize, }, LocyFold { input: Box<LogicalPlan>, key_columns: Vec<String>, fold_bindings: Vec<(String, Expr)>, strict_probability_domain: bool, probability_epsilon: f64, }, LocyBestBy { input: Box<LogicalPlan>, key_columns: Vec<String>, criteria: Vec<(Expr, bool)>, }, LocyPriority { input: Box<LogicalPlan>, key_columns: Vec<String>, }, LocyDerivedScan { scan_index: usize, data: Arc<RwLock<Vec<RecordBatch>>>, schema: SchemaRef, }, LocyProject { input: Box<LogicalPlan>, projections: Vec<(Expr, Option<String>)>, target_types: Vec<DataType>, },
}
Expand description

Logical query plan produced by QueryPlanner.

Each variant represents one step in the Cypher execution pipeline. Plans are tree-structured — leaf nodes produce rows, intermediate nodes transform or join them, and the root node defines the final output.

Variants§

§

Union

UNION / UNION ALL of two sub-plans.

Fields

§all: bool

When true, duplicate rows are preserved (UNION ALL semantics).

§

Scan

Scan vertices of a single labeled dataset.

Fields

§label_id: u16
§labels: Vec<String>
§variable: String
§filter: Option<Expr>
§optional: bool
§

ExtIdLookup

Lookup vertices by ext_id using the main vertices table. Used when a query references ext_id without specifying a label.

Fields

§variable: String
§ext_id: String
§filter: Option<Expr>
§optional: bool
§

ScanAll

Scan all vertices from main table (MATCH (n) without label). Used for schemaless queries that don’t specify any label.

Fields

§variable: String
§filter: Option<Expr>
§optional: bool
§

ScanMainByLabels

Scan main table filtering by label name (MATCH (n:Unknown)). Used for labels not defined in schema (schemaless support). Scan main vertices table by label name(s) for schemaless support. When labels has multiple entries, uses intersection semantics (must have ALL labels).

Fields

§labels: Vec<String>
§variable: String
§filter: Option<Expr>
§optional: bool
§

Empty

Produces exactly one empty row (used to bootstrap pipelines with no source).

§

Unwind

UNWIND: expand a list expression into one row per element.

Fields

§expr: Expr
§variable: String
§

Traverse

Fields

§edge_type_ids: Vec<u32>
§direction: Direction
§source_variable: String
§target_variable: String
§target_label_id: u16
§step_variable: Option<String>
§min_hops: usize
§max_hops: usize
§optional: bool
§target_filter: Option<Expr>
§path_variable: Option<String>
§edge_properties: HashSet<String>
§is_variable_length: bool

Whether this is a variable-length pattern (has * range specifier). When true, step_variable holds a list of edges (even for *1..1).

§optional_pattern_vars: HashSet<String>

All variables from this OPTIONAL MATCH pattern. When any hop in the pattern fails, ALL these variables should be set to NULL. This ensures proper multi-hop OPTIONAL MATCH semantics.

§scope_match_variables: HashSet<String>

Variable names (node + edge) from the current MATCH clause scope. Used for relationship uniqueness scoping: only edge ID columns whose associated variable is in this set participate in uniqueness filtering. Variables from previous disconnected MATCH clauses are excluded.

§edge_filter_expr: Option<Expr>

Edge property predicate for VLP inline filtering (instead of post-Filter).

§path_mode: PathMode

Path traversal semantics (Trail by default for OpenCypher).

§qpp_steps: Option<Vec<QppStepInfo>>

QPP steps for multi-hop quantified path patterns. None for simple VLP patterns; Some for QPP with per-step edge types/constraints. When present, min_hops/max_hops are derived from iterations × steps.len().

§

TraverseMainByType

Traverse main edges table filtering by type name(s) (MATCH (a)-[:Unknown]->(b)). Used for edge types not defined in schema (schemaless support). Supports OR relationship types like [:KNOWS|HATES] via multiple type_names.

Fields

§type_names: Vec<String>
§direction: Direction
§source_variable: String
§target_variable: String
§step_variable: Option<String>
§min_hops: usize
§max_hops: usize
§optional: bool
§target_filter: Option<Expr>
§path_variable: Option<String>
§is_variable_length: bool

Whether this is a variable-length pattern (has * range specifier). When true, step_variable holds a list of edges (even for *1..1).

§optional_pattern_vars: HashSet<String>

All variables from this OPTIONAL MATCH pattern. When any hop in the pattern fails, ALL these variables should be set to NULL.

§scope_match_variables: HashSet<String>

Variables belonging to the current MATCH clause scope. Used for relationship uniqueness scoping: only edge columns whose associated variable is in this set participate in uniqueness filtering.

§edge_filter_expr: Option<Expr>

Edge property predicate for VLP inline filtering (instead of post-Filter).

§path_mode: PathMode

Path traversal semantics (Trail by default for OpenCypher).

§

Filter

Fields

§predicate: Expr
§optional_variables: HashSet<String>

Variables from OPTIONAL MATCH that should preserve NULL rows. When evaluating the filter, if any of these variables are NULL, the row is preserved regardless of the predicate result.

§

Create

Fields

§pattern: Pattern
§

CreateBatch

Batched CREATE operations for multiple consecutive CREATE clauses.

This variant combines multiple CREATE patterns into a single plan node to avoid deep recursion when executing many CREATEs sequentially.

Fields

§patterns: Vec<Pattern>
§

Merge

Fields

§pattern: Pattern
§on_match: Option<SetClause>
§on_create: Option<SetClause>
§

Set

Fields

§items: Vec<SetItem>
§

Remove

Fields

§

Delete

Fields

§items: Vec<Expr>
§detach: bool
§

Foreach

FOREACH (variable IN list | clauses)

Fields

§variable: String
§list: Expr
§

Sort

Fields

§order_by: Vec<SortItem>
§

Limit

Fields

§fetch: Option<usize>
§

Aggregate

Fields

§group_by: Vec<Expr>
§aggregates: Vec<Expr>
§

Distinct

Fields

§

Window

Fields

§window_exprs: Vec<Expr>
§

Project

Fields

§projections: Vec<(Expr, Option<String>)>
§

CrossJoin

Fields

§

Apply

Fields

§subquery: Box<LogicalPlan>
§input_filter: Option<Expr>
§

RecursiveCTE

Fields

§cte_name: String
§initial: Box<LogicalPlan>
§recursive: Box<LogicalPlan>
§

ProcedureCall

Fields

§procedure_name: String
§arguments: Vec<Expr>
§yield_items: Vec<(String, Option<String>)>
§

SubqueryCall

Fields

§subquery: Box<LogicalPlan>
§

VectorKnn

Fields

§label_id: u16
§variable: String
§property: String
§query: Expr
§threshold: Option<f32>
§

InvertedIndexLookup

Fields

§label_id: u16
§variable: String
§property: String
§terms: Expr
§

ShortestPath

Fields

§edge_type_ids: Vec<u32>
§direction: Direction
§source_variable: String
§target_variable: String
§target_label_id: u16
§path_variable: String
§min_hops: u32

Minimum number of hops (edges) in the path. Default is 1.

§max_hops: u32

Maximum number of hops (edges) in the path. Default is u32::MAX (unlimited).

§

AllShortestPaths

allShortestPaths() - Returns all paths with minimum length

Fields

§edge_type_ids: Vec<u32>
§direction: Direction
§source_variable: String
§target_variable: String
§target_label_id: u16
§path_variable: String
§min_hops: u32

Minimum number of hops (edges) in the path. Default is 1.

§max_hops: u32

Maximum number of hops (edges) in the path. Default is u32::MAX (unlimited).

§

QuantifiedPattern

Fields

§pattern_plan: Box<LogicalPlan>
§min_iterations: u32
§max_iterations: u32
§path_variable: Option<String>
§start_variable: String
§binding_variable: String
§

CreateVectorIndex

Fields

§if_not_exists: bool
§

CreateFullTextIndex

Fields

§if_not_exists: bool
§

CreateScalarIndex

Fields

§if_not_exists: bool
§

CreateJsonFtsIndex

Fields

§if_not_exists: bool
§

DropIndex

Fields

§name: String
§if_exists: bool
§

ShowIndexes

Fields

§filter: Option<String>
§

Copy

Fields

§target: String
§source: String
§is_export: bool
§

Backup

Fields

§destination: String
§

Explain

Fields

§

ShowDatabase

§

ShowConfig

§

ShowStatistics

§

Vacuum

§

Checkpoint

§

CopyTo

Fields

§label: String
§path: String
§format: String
§

CopyFrom

Fields

§label: String
§path: String
§format: String
§

CreateLabel(CreateLabel)

§

CreateEdgeType(CreateEdgeType)

§

AlterLabel(AlterLabel)

§

AlterEdgeType(AlterEdgeType)

§

DropLabel(DropLabel)

§

DropEdgeType(DropEdgeType)

§

CreateConstraint(CreateConstraint)

§

DropConstraint(DropConstraint)

§

ShowConstraints(ShowConstraints)

§

Begin

§

Commit

§

Rollback

§

BindZeroLengthPath

Bind a zero-length path (single node pattern with path variable). E.g., p = (a) creates a Path with one node and zero edges.

Fields

§node_variable: String
§path_variable: String
§

BindPath

Bind a fixed-length path from already-computed node and edge columns. E.g., p = (a)-[r]->(b) or p = (a)-[r1]->(b)-[r2]->(c).

Fields

§node_variables: Vec<String>
§edge_variables: Vec<String>
§path_variable: String
§

LocyProgram

Top-level Locy program: stratified rules + commands.

Fields

§commands: Vec<LocyCommand>
§derived_scan_registry: Arc<DerivedScanRegistry>
§max_iterations: usize
§timeout: Duration
§max_derived_bytes: usize
§deterministic_best_by: bool
§strict_probability_domain: bool
§probability_epsilon: f64
§exact_probability: bool
§max_bdd_variables: usize
§top_k_proofs: usize
§

LocyFold

FOLD operator: lattice-join non-key columns per KEY group.

Fields

§key_columns: Vec<String>
§fold_bindings: Vec<(String, Expr)>
§strict_probability_domain: bool
§probability_epsilon: f64
§

LocyBestBy

BEST BY operator: select best row per KEY group by ordered criteria.

Fields

§key_columns: Vec<String>
§criteria: Vec<(Expr, bool)>

(expression, ascending) pairs.

§

LocyPriority

PRIORITY operator: keep only highest-priority clause’s rows per KEY group.

Fields

§key_columns: Vec<String>
§

LocyDerivedScan

Scan a derived relation’s in-memory buffer during fixpoint iteration.

Fields

§scan_index: usize
§schema: SchemaRef
§

LocyProject

Compact projection for Locy YIELD — emits ONLY the listed expressions, without carrying through helper/property columns like the regular Project.

Fields

§projections: Vec<(Expr, Option<String>)>
§target_types: Vec<DataType>

Expected output Arrow type per projection (for CAST support).

Trait Implementations§

Source§

impl Clone for LogicalPlan

Source§

fn clone(&self) -> LogicalPlan

Returns a duplicate of the value. Read more
1.0.0 · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for LogicalPlan

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

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> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> Conv for T

Source§

fn conv<T>(self) -> T
where Self: Into<T>,

Converts self into T using Into<T>. Read more
Source§

impl<T> Downcast for T
where T: Any,

Source§

fn into_any(self: Box<T>) -> Box<dyn Any>

Converts Box<dyn Trait> (where Trait: Downcast) to Box<dyn Any>, which can then be downcast into Box<dyn ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>

Converts Rc<Trait> (where Trait: Downcast) to Rc<Any>, which can then be further downcast into Rc<ConcreteType> where ConcreteType implements Trait.
Source§

fn as_any(&self) -> &(dyn Any + 'static)

Converts &Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &Any’s vtable from &Trait’s.
Source§

fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)

Converts &mut Trait (where Trait: Downcast) to &Any. This is needed since Rust cannot generate &mut Any’s vtable from &mut Trait’s.
Source§

impl<T> DowncastSend for T
where T: Any + Send,

Source§

fn into_any_send(self: Box<T>) -> Box<dyn Any + Send>

Converts Box<Trait> (where Trait: DowncastSend) to Box<dyn Any + Send>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> DowncastSync for T
where T: Any + Send + Sync,

Source§

fn into_any_sync(self: Box<T>) -> Box<dyn Any + Sync + Send>

Converts Box<Trait> (where Trait: DowncastSync) to Box<dyn Any + Send + Sync>, which can then be downcast into Box<ConcreteType> where ConcreteType implements Trait.
Source§

fn into_any_arc(self: Arc<T>) -> Arc<dyn Any + Sync + Send>

Converts Arc<Trait> (where Trait: DowncastSync) to Arc<Any>, which can then be downcast into Arc<ConcreteType> where ConcreteType implements Trait.
Source§

impl<T> FmtForward for T

Source§

fn fmt_binary(self) -> FmtBinary<Self>
where Self: Binary,

Causes self to use its Binary implementation when Debug-formatted.
Source§

fn fmt_display(self) -> FmtDisplay<Self>
where Self: Display,

Causes self to use its Display implementation when Debug-formatted.
Source§

fn fmt_lower_exp(self) -> FmtLowerExp<Self>
where Self: LowerExp,

Causes self to use its LowerExp implementation when Debug-formatted.
Source§

fn fmt_lower_hex(self) -> FmtLowerHex<Self>
where Self: LowerHex,

Causes self to use its LowerHex implementation when Debug-formatted.
Source§

fn fmt_octal(self) -> FmtOctal<Self>
where Self: Octal,

Causes self to use its Octal implementation when Debug-formatted.
Source§

fn fmt_pointer(self) -> FmtPointer<Self>
where Self: Pointer,

Causes self to use its Pointer implementation when Debug-formatted.
Source§

fn fmt_upper_exp(self) -> FmtUpperExp<Self>
where Self: UpperExp,

Causes self to use its UpperExp implementation when Debug-formatted.
Source§

fn fmt_upper_hex(self) -> FmtUpperHex<Self>
where Self: UpperHex,

Causes self to use its UpperHex implementation when Debug-formatted.
Source§

fn fmt_list(self) -> FmtList<Self>
where &'a Self: for<'a> IntoIterator,

Formats each item in a sequence. 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<Unshared, Shared> IntoShared<Shared> for Unshared
where Shared: FromUnshared<Unshared>,

Source§

fn into_shared(self) -> Shared

Creates a shared type from an unshared type.
Source§

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

Source§

fn pipe<R>(self, func: impl FnOnce(Self) -> R) -> R
where Self: Sized,

Pipes by value. This is generally the method you want to use. Read more
Source§

fn pipe_ref<'a, R>(&'a self, func: impl FnOnce(&'a Self) -> R) -> R
where R: 'a,

Borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_ref_mut<'a, R>(&'a mut self, func: impl FnOnce(&'a mut Self) -> R) -> R
where R: 'a,

Mutably borrows self and passes that borrow into the pipe function. Read more
Source§

fn pipe_borrow<'a, B, R>(&'a self, func: impl FnOnce(&'a B) -> R) -> R
where Self: Borrow<B>, B: 'a + ?Sized, R: 'a,

Borrows self, then passes self.borrow() into the pipe function. Read more
Source§

fn pipe_borrow_mut<'a, B, R>( &'a mut self, func: impl FnOnce(&'a mut B) -> R, ) -> R
where Self: BorrowMut<B>, B: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.borrow_mut() into the pipe function. Read more
Source§

fn pipe_as_ref<'a, U, R>(&'a self, func: impl FnOnce(&'a U) -> R) -> R
where Self: AsRef<U>, U: 'a + ?Sized, R: 'a,

Borrows self, then passes self.as_ref() into the pipe function.
Source§

fn pipe_as_mut<'a, U, R>(&'a mut self, func: impl FnOnce(&'a mut U) -> R) -> R
where Self: AsMut<U>, U: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.as_mut() into the pipe function.
Source§

fn pipe_deref<'a, T, R>(&'a self, func: impl FnOnce(&'a T) -> R) -> R
where Self: Deref<Target = T>, T: 'a + ?Sized, R: 'a,

Borrows self, then passes self.deref() into the pipe function.
Source§

fn pipe_deref_mut<'a, T, R>( &'a mut self, func: impl FnOnce(&'a mut T) -> R, ) -> R
where Self: DerefMut<Target = T> + Deref, T: 'a + ?Sized, R: 'a,

Mutably borrows self, then passes self.deref_mut() into the pipe function.
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

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

Source§

fn and<P, B, E>(self, other: P) -> And<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow only if self and other return Action::Follow. Read more
Source§

fn or<P, B, E>(self, other: P) -> Or<T, P>
where T: Policy<B, E>, P: Policy<B, E>,

Create a new Policy that returns Action::Follow if either self or other returns Action::Follow. Read more
Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<T> Tap for T

Source§

fn tap(self, func: impl FnOnce(&Self)) -> Self

Immutable access to a value. Read more
Source§

fn tap_mut(self, func: impl FnOnce(&mut Self)) -> Self

Mutable access to a value. Read more
Source§

fn tap_borrow<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Immutable access to the Borrow<B> of a value. Read more
Source§

fn tap_borrow_mut<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Mutable access to the BorrowMut<B> of a value. Read more
Source§

fn tap_ref<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Immutable access to the AsRef<R> view of a value. Read more
Source§

fn tap_ref_mut<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Mutable access to the AsMut<R> view of a value. Read more
Source§

fn tap_deref<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Immutable access to the Deref::Target of a value. Read more
Source§

fn tap_deref_mut<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Mutable access to the Deref::Target of a value. Read more
Source§

fn tap_dbg(self, func: impl FnOnce(&Self)) -> Self

Calls .tap() only in debug builds, and is erased in release builds.
Source§

fn tap_mut_dbg(self, func: impl FnOnce(&mut Self)) -> Self

Calls .tap_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_borrow_dbg<B>(self, func: impl FnOnce(&B)) -> Self
where Self: Borrow<B>, B: ?Sized,

Calls .tap_borrow() only in debug builds, and is erased in release builds.
Source§

fn tap_borrow_mut_dbg<B>(self, func: impl FnOnce(&mut B)) -> Self
where Self: BorrowMut<B>, B: ?Sized,

Calls .tap_borrow_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_ref_dbg<R>(self, func: impl FnOnce(&R)) -> Self
where Self: AsRef<R>, R: ?Sized,

Calls .tap_ref() only in debug builds, and is erased in release builds.
Source§

fn tap_ref_mut_dbg<R>(self, func: impl FnOnce(&mut R)) -> Self
where Self: AsMut<R>, R: ?Sized,

Calls .tap_ref_mut() only in debug builds, and is erased in release builds.
Source§

fn tap_deref_dbg<T>(self, func: impl FnOnce(&T)) -> Self
where Self: Deref<Target = T>, T: ?Sized,

Calls .tap_deref() only in debug builds, and is erased in release builds.
Source§

fn tap_deref_mut_dbg<T>(self, func: impl FnOnce(&mut T)) -> Self
where Self: DerefMut<Target = T> + Deref, T: ?Sized,

Calls .tap_deref_mut() only in debug builds, and is erased in release builds.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T> TryConv for T

Source§

fn try_conv<T>(self) -> Result<T, Self::Error>
where Self: TryInto<T>,

Attempts to convert self into T using TryInto<T>. 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<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V

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
Source§

impl<G1, G2> Within<G2> for G1
where G2: Contains<G1>,

Source§

fn is_within(&self, b: &G2) -> bool

Source§

impl<T> Fruit for T
where T: Send + Downcast,

Source§

impl<T> MaybeSend for T
where T: Send,