Struct Unordered 

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

Wrapper to view a value without considering the order of the objects entries.

Unordered<T> implements PartialEq/Eq in terms of UnorderedPartialEq, so { "a": 0, "b": 1 } and { "b": 1, "a": 0 } compare equal — unlike the derived PartialEq on Value, which is order-sensitive.

Example

use jstrict::{json, BorrowUnordered, Unordered};

let a = json!({ "a": 0, "b": 1 });
let b = json!({ "b": 1, "a": 0 });

assert_ne!(a, b);
assert_eq!(a.as_unordered(), b.as_unordered());
assert_eq!(Unordered(a), Unordered(b));

Tuple Fields

0: T

Trait Implementations

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

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

Formats the value using the given formatter.

impl<T: UnorderedEq> Eq for Unordered<T>

impl<T: UnorderedHash> Hash for Unordered<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: UnorderedPartialEq> PartialEq for Unordered<T>

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

Equality operator ==.

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

Inequality operator !=.