Struct Pull

pub struct Pull<P: Implementable> {
    pub variables: Vec<u32>,
    pub paths: Vec<P>,
}

A plan stage for pull queries split into individual paths. So [:parent/name {:parent/child [:child/name]}] would be represented as:

(?parent) <- [:parent/name] | no constraints (?parent :parent/child ?child) <- [:child/name] | [?parent :parent/child ?child]

Fields

variables: Vec<u32>

TODO

paths: Vec<P>

Individual paths to pull.

Trait Implementations

impl<P: Clone + Implementable> Clone for Pull<P>

fn clone(&self) -> Pull<P>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<P: Debug + Implementable> Debug for Pull<P>

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

Formats the value using the given formatter.

impl<'de, P> Deserialize<'de> for Pull<P>

where P: Deserialize<'de> + Implementable,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<P: Hash + Implementable> Hash for Pull<P>

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<P: Implementable> Implementable for Pull<P>

fn dependencies(&self) -> Dependencies

Returns names of any other implementable things that need to be available before implementing this one. Attributes are not mentioned explicitley as dependencies.

fn implement<'b, T, I, S>( &self, nested: &mut Iterative<'b, S, u64>, local_arrangements: &HashMap<String, Variable<Iterative<'b, S, u64>, Vec<Value>, isize>>, context: &mut I, ) -> (Implemented<'b, S>, ShutdownHandle)

where T: Timestamp + Lattice, I: ImplContext<T>, S: Scope<Timestamp = T>,

Implements the type as a simple relation.

fn into_bindings(&self) -> Vec<Binding>

Transforms an implementable into an equivalent set of bindings that can be unified by Hector.

fn datafy(&self) -> Vec<(Eid, Aid, Value)>

@TODO

impl<P: Ord + Implementable> Ord for Pull<P>

fn cmp(&self, other: &Pull<P>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<P: PartialEq + Implementable> PartialEq for Pull<P>

fn eq(&self, other: &Pull<P>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<P: PartialOrd + Implementable> PartialOrd for Pull<P>

fn partial_cmp(&self, other: &Pull<P>) -> 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<P> Serialize for Pull<P>

where P: Serialize + Implementable,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<P: Eq + Implementable> Eq for Pull<P>

impl<P: Implementable> StructuralPartialEq for Pull<P>