Struct DerivationAlgorithm 

pub struct DerivationAlgorithm { /* private fields */ }

Stable identity of the transformation that produced a derived evidence record.

The name is a bounded, non-empty, stable identifier (for example http.form-control-names). The version distinguishes incompatible revisions of the same transformation so a consumer can tell exactly which algorithm produced a child, not merely that some transformation did.

Implementations

impl DerivationAlgorithm

pub fn new( name: impl Into<String>, version: u32, ) -> Result<Self, ReasoningModelError>

Creates a validated algorithm identity from a bounded name and version.

pub fn name(&self) -> &str

Returns the stable algorithm name.

pub fn version(&self) -> u32

Returns the algorithm revision.

Trait Implementations

impl Clone for DerivationAlgorithm

fn clone(&self) -> DerivationAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DerivationAlgorithm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for DerivationAlgorithm

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for DerivationAlgorithm

impl Hash for DerivationAlgorithm

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 Ord for DerivationAlgorithm

fn cmp(&self, other: &DerivationAlgorithm) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for DerivationAlgorithm

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

Equality operator ==.

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

Inequality operator !=.

impl PartialOrd for DerivationAlgorithm

fn partial_cmp(&self, other: &DerivationAlgorithm) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for DerivationAlgorithm

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 DerivationAlgorithm