Struct DumpPlan 

pub struct DumpPlan {
    pub scan: Option<ScanPlan>,
    pub dictionary_bytes: u64,
}

What a filtered dump will cost, before it runs — see Rete::dump_plan.

Fields

scan: Option<ScanPlan>

The routed scan this dump will run. None when it provably matches nothing without touching the index: an absent graph IRI, or a bound term the dictionary does not contain.

dictionary_bytes: u64

The file’s whole dictionary section — the ceiling on what resolving the matched rows’ terms can fault, and on a literal-heavy file the dominant term in a dump’s real cost.

It is deliberately not an estimate. A dump that matches one row faults only the chunks that row’s three terms live in, but nothing in the tile directories says which chunks those are or how big they are, and a preview that guessed would be worse than one that states the bound.

Trait Implementations

impl Clone for DumpPlan

fn clone(&self) -> DumpPlan

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for DumpPlan

impl Debug for DumpPlan

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

Formats the value using the given formatter.

impl Eq for DumpPlan

impl PartialEq for DumpPlan

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for DumpPlan