Struct PartitionPlan 

pub struct PartitionPlan {
    pub var: String,
    pub form: &'static str,
    pub keys_query: String,
    pub keys_from: &'static str,
    pub offset: usize,
    pub limit: Option<usize>,
    pub dedupe: bool,
}

How to run a query as chunks split by one variable: see crate::partition_plan.

Fields

var: String

The variable split on, without its ?.

form: &'static str

"select" or "construct".

keys_query: String

SELECT DISTINCT ?var …: every value the variable takes in a solution, and possibly more (a key with no solution makes an empty chunk).

keys_from: &'static str

Where the keys query lists them from: "values", a required VALUES list on the variable (no read); "pattern", the cheapest required triple pattern binding it with constants alone (one range scan); "where", the whole WHERE clause, when neither exists — then listing them may cost as much as the query.

offset: usize

The query’s top-level OFFSET and LIMIT. Each chunk drops them; they apply once, to the chunks’ solutions taken in key order.

limit: Option<usize>

dedupe: bool

Whether two chunks can yield the same row, so the merged rows need deduplicating: a DISTINCT that does not project the variable, and every CONSTRUCT (a graph is a set of triples).

Trait Implementations

impl Clone for PartitionPlan

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 PartitionPlan

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

Formats the value using the given formatter.

impl Eq for PartitionPlan

impl PartialEq for PartitionPlan

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

Equality operator ==.

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

Inequality operator !=.

impl Serialize for PartitionPlan

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for PartitionPlan