Enum CanonicalizationAlgorithm

#[non_exhaustive]
pub enum CanonicalizationAlgorithm {
    Unstable,
}

An algorithm used to canonicalize graph and datasets.

See Graph::canonicalize and Dataset::canonicalize.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Unstable

The algorithm preferred by OxRDF.

The canonicalization algorithm is not stable and canonical blank node ids might change between Oxigraph version.

Trait Implementations

impl Clone for CanonicalizationAlgorithm

fn clone(&self) -> CanonicalizationAlgorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for CanonicalizationAlgorithm

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

Formats the value using the given formatter.

impl Default for CanonicalizationAlgorithm

fn default() -> CanonicalizationAlgorithm

Returns the “default value” for a type.

impl Hash for CanonicalizationAlgorithm

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 PartialEq for CanonicalizationAlgorithm

fn eq(&self, other: &CanonicalizationAlgorithm) -> 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 Copy for CanonicalizationAlgorithm

impl Eq for CanonicalizationAlgorithm

impl StructuralPartialEq for CanonicalizationAlgorithm