Module rdftk_core::graph

Traits which describe the core capabilities of a graph. Note that this crate does not provide an implementation of these traits as they are very dependent on their usage for performance, and any backing storage.

Example

use rdftk_core::Graph;
use rdftk_core::statement::StatementRef;

fn simple_graph_writer(graph: &impl Graph)
{
    for statement in graph.statements() {
        println!("{}", statement);
    }
}

Re-exports

pub use caching::ValueFactory;
pub use mapping::Prefix;
pub use mapping::PrefixMappingRef;
pub use mapping::PrefixMappings;

Modules

caching	Graphs may have mechanisms to cache commonly used values, or those with significant storage overhead. In such cases they provide a value factory that should be used to construct new values for use in the associated graph. It is possible that all graphs provided by some graph store share a common value factory by store rather than by graph.
mapping	A trait for the prefix mappings required by the Graph trait. Prefix mappings can be added to a graph to provide more readable serialization forms.
skolem	Support for the Skolemization process of a graph. For more details on the process, see Skolemization (Informative) and Replacing Blank Nodes with IRIs.

Enums

GraphIndex

This enumeration describes the combination of triples that may be indexed by the Graph. The indexes actually supported by a graph implementation can be retrieved using Graph::has_index or Graph::has_indices.

Traits

Graph	A graph is an unordered list of statements and may include duplicates. Note that this trait represents an immutable graph, a type should also implement the MutableGraph trait for mutation.
GraphFactory	A graph factory provides an interface to create a new graph. This allows for implementations where underlying shared resources are required and so may be owned by the factory.

Type Definitions

GraphFactoryRef	The reference type for a graph factory returned by a graph.
GraphRef	The reference type for a graph returned by a graph factory.