Enum GraphLayout 

pub enum GraphLayout {
    PerGraph,
    Quad,
}

How a build stores the named graphs (the default graph is unaffected).

Variants

PerGraph

One permutation index per graph, in the NAMED_GRAPHS section (kind 5): the graph IRI as text, then a full container per graph. What every rete before 0.4 writes and reads.

Quad

The quad index (kind 10, SPEC.md §6.5): every named-graph quad stored once, the graph as a fourth column of graph-leading permutations in shared tiles, behind a sorted graph directory; graph names become dictionary terms. Far smaller and randomly addressable when graphs are many and small. Readers before 0.4.0 refuse these files (loudly — see docs/compatibility.md). Needs the 3- or 6-permutation set.

Trait Implementations

impl Clone for GraphLayout

fn clone(&self) -> GraphLayout

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphLayout

impl Debug for GraphLayout

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

Formats the value using the given formatter.

impl Default for GraphLayout

fn default() -> GraphLayout

Returns the “default value” for a type.

impl Eq for GraphLayout

impl PartialEq for GraphLayout

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphLayout