Struct Leaf

#[repr(transparent)]
pub struct Leaf<T: ?Sized>(pub T);

Serialize/Deserialize/Any leaf

This wraps Serialize, Deserialize, and Any into Tree a leaf node.

use miniconf::{json_core, Leaf, Tree};
let mut s = Leaf(0);
json_core::set(&mut s, "", b"7").unwrap();
assert!(matches!(*s, 7));

Tuple Fields

0: T

Trait Implementations

impl<T: Clone + ?Sized> Clone for Leaf<T>

fn clone(&self) -> Leaf<T>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Debug + ?Sized> Debug for Leaf<T>

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

Formats the value using the given formatter.

impl<T: Default + ?Sized> Default for Leaf<T>

fn default() -> Leaf<T>

Returns the “default value” for a type.

impl<T: ?Sized> Deref for Leaf<T>

type Target = T

The resulting type after dereferencing.

fn deref(&self) -> &Self::Target

Dereferences the value.

impl<T: ?Sized> DerefMut for Leaf<T>

fn deref_mut(&mut self) -> &mut Self::Target

Mutably dereferences the value.

impl<'de, T> Deserialize<'de> for Leaf<T>

where T: Deserialize<'de> + ?Sized,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T: Display> Display for Leaf<T>

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

Formats the value using the given formatter.

impl<T: Hash + ?Sized> Hash for Leaf<T>

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<T: Ord + ?Sized> Ord for Leaf<T>

fn cmp(&self, other: &Leaf<T>) -> 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<T: PartialEq + ?Sized> PartialEq for Leaf<T>

fn eq(&self, other: &Leaf<T>) -> 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<T: PartialOrd + ?Sized> PartialOrd for Leaf<T>

fn partial_cmp(&self, other: &Leaf<T>) -> 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<T> Serialize for Leaf<T>

where T: Serialize + ?Sized,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<T: Any> TreeAny for Leaf<T>

fn ref_any_by_key(&self, keys: impl Keys) -> Result<&dyn Any, ValueError>

Obtain a reference to a dyn Any trait object for a leaf node.

fn mut_any_by_key( &mut self, keys: impl Keys, ) -> Result<&mut dyn Any, ValueError>

Obtain a mutable reference to a dyn Any trait object for a leaf node.

fn ref_by_key<T: Any>(&self, keys: impl IntoKeys) -> Result<&T, ValueError>

Obtain a reference to a leaf of known type by key.

fn mut_by_key<T: Any>( &mut self, keys: impl IntoKeys, ) -> Result<&mut T, ValueError>

Obtain a mutable reference to a leaf of known type by key.

impl<'de, T: Deserialize<'de>> TreeDeserialize<'de> for Leaf<T>

fn deserialize_by_key<D: Deserializer<'de>>( &mut self, keys: impl Keys, de: D, ) -> Result<(), SerdeError<D::Error>>

Deserialize a leaf node by its keys.

fn probe_by_key<D: Deserializer<'de>>( keys: impl Keys, de: D, ) -> Result<(), SerdeError<D::Error>>

Blind deserialize a leaf node by its keys.

impl<T: ?Sized> TreeSchema for Leaf<T>

const SCHEMA: &'static Schema = leaf::SCHEMA

Schema for this tree level

impl<T: Serialize + ?Sized> TreeSerialize for Leaf<T>

fn serialize_by_key<S: Serializer>( &self, keys: impl Keys, ser: S, ) -> Result<S::Ok, SerdeError<S::Error>>

Serialize a node by keys.

impl<T: Copy + ?Sized> Copy for Leaf<T>

impl<T: Eq + ?Sized> Eq for Leaf<T>

impl<T: ?Sized> StructuralPartialEq for Leaf<T>