pub struct Mismatch<N, H> {
pub need: N,
pub have: H,
pub info: &'static str,
}
Expand description
Represents a mismatch between an expected need
and an encountered have
.
With optional contextual information in the info
field.
This struct conveys optional information about the anticipated need
and
the observed have
, allowing for either, both, or none to be specified.
It can be particularly useful for error handling and reporting.
Fields§
§need: N
Information about something that was needed, expected or anticipated.
have: H
Information about something that was obtained, observed, or encountered.
info: &'static str
Contextual static information about the mismatch.
Implementations§
Source§impl<N, H> Mismatch<Interval<N>, H>
impl<N, H> Mismatch<Interval<N>, H>
Sourcepub fn in_point_interval(need_point: N, have: H, info: &'static str) -> Selfwhere
N: Clone,
pub fn in_point_interval(need_point: N, have: H, info: &'static str) -> Selfwhere
N: Clone,
Creates a mismatch where need
is an Interval::point
,
and have
does not match.
Sourcepub fn in_empty_interval(have: H, info: &'static str) -> Selfwhere
N: Default,
pub fn in_empty_interval(have: H, info: &'static str) -> Selfwhere
N: Default,
Creates a mismatch where need
is an Interval::empty
,
but have
was provided.
Sourcepub const fn in_empty_const_interval(have: H, info: &'static str) -> Selfwhere
N: ConstDefault,
pub const fn in_empty_const_interval(have: H, info: &'static str) -> Selfwhere
N: ConstDefault,
Creates a mismatch where need
is an Interval::empty_const
,
but have
was provided.
Sourcepub fn in_empty_interval_with(value: N, have: H, info: &'static str) -> Selfwhere
N: Clone,
pub fn in_empty_interval_with(value: N, have: H, info: &'static str) -> Selfwhere
N: Clone,
Creates a mismatch where need
is an Interval::empty_with
,
but have
was provided.
Sourcepub const fn in_closed_interval(
lower: N,
upper: N,
have: H,
info: &'static str,
) -> Self
pub const fn in_closed_interval( lower: N, upper: N, have: H, info: &'static str, ) -> Self
Creates a mismatch where need
is an Interval::closed
,
and have
is outside it.
Sourcepub const fn in_closed_open_interval(
lower: N,
upper: N,
have: H,
info: &'static str,
) -> Self
pub const fn in_closed_open_interval( lower: N, upper: N, have: H, info: &'static str, ) -> Self
Creates a mismatch where need
is an Interval::closed_open
,
and have
is outside it.
Sourcepub const fn in_open_interval(
lower: N,
upper: N,
have: H,
info: &'static str,
) -> Self
pub const fn in_open_interval( lower: N, upper: N, have: H, info: &'static str, ) -> Self
Creates a mismatch where need
is an Interval::open
,
and have
is outside it.
Trait Implementations§
Source§impl<N: ConstDefault, H: ConstDefault> ConstDefault for Mismatch<N, H>
impl<N: ConstDefault, H: ConstDefault> ConstDefault for Mismatch<N, H>
Source§impl<N: Ord, H: Ord> Ord for Mismatch<N, H>
impl<N: Ord, H: Ord> Ord for Mismatch<N, H>
Source§fn cmp(&self, other: &Self) -> Ordering
fn cmp(&self, other: &Self) -> Ordering
Compare need first. If they are equal, then compare have.
1.21.0 · Source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
Source§impl<N: PartialOrd, H: PartialOrd> PartialOrd for Mismatch<N, H>
impl<N: PartialOrd, H: PartialOrd> PartialOrd for Mismatch<N, H>
impl<N: Copy, H: Copy> Copy for Mismatch<N, H>
impl<N: Eq, H: Eq> Eq for Mismatch<N, H>
Auto Trait Implementations§
impl<N, H> Freeze for Mismatch<N, H>
impl<N, H> RefUnwindSafe for Mismatch<N, H>where
N: RefUnwindSafe,
H: RefUnwindSafe,
impl<N, H> Send for Mismatch<N, H>
impl<N, H> Sync for Mismatch<N, H>
impl<N, H> Unpin for Mismatch<N, H>
impl<N, H> UnwindSafe for Mismatch<N, H>where
N: UnwindSafe,
H: UnwindSafe,
Blanket Implementations§
§impl<T> ArchivePointee for T
impl<T> ArchivePointee for T
§type ArchivedMetadata = ()
type ArchivedMetadata = ()
§fn pointer_metadata(
_: &<T as ArchivePointee>::ArchivedMetadata,
) -> <T as Pointee>::Metadata
fn pointer_metadata( _: &<T as ArchivePointee>::ArchivedMetadata, ) -> <T as Pointee>::Metadata
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> ByteSized for T
impl<T> ByteSized for T
Source§const BYTE_ALIGN: usize = _
const BYTE_ALIGN: usize = _
Source§fn byte_align(&self) -> usize ⓘ
fn byte_align(&self) -> usize ⓘ
Source§fn ptr_size_ratio(&self) -> [usize; 2]
fn ptr_size_ratio(&self) -> [usize; 2]
Source§impl<T, R> Chain<R> for Twhere
T: ?Sized,
impl<T, R> Chain<R> for Twhere
T: ?Sized,
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
§impl<Q, K> Comparable<K> for Q
impl<Q, K> Comparable<K> for Q
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key
and return true
if they are equal.Source§impl<T> ExtAny for T
impl<T> ExtAny for T
Source§fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
fn as_any_mut(&mut self) -> &mut dyn Anywhere
Self: Sized,
Source§impl<T> ExtMem for Twhere
T: ?Sized,
impl<T> ExtMem for Twhere
T: ?Sized,
Source§const NEEDS_DROP: bool = _
const NEEDS_DROP: bool = _
Source§fn mem_align_of_val(&self) -> usize ⓘ
fn mem_align_of_val(&self) -> usize ⓘ
Source§fn mem_size_of_val(&self) -> usize ⓘ
fn mem_size_of_val(&self) -> usize ⓘ
Source§fn mem_needs_drop(&self) -> bool
fn mem_needs_drop(&self) -> bool
true
if dropping values of this type matters. Read moreSource§fn mem_forget(self)where
Self: Sized,
fn mem_forget(self)where
Self: Sized,
self
without running its destructor. Read moreSource§fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
fn mem_replace(&mut self, other: Self) -> Selfwhere
Self: Sized,
Source§unsafe fn mem_zeroed<T>() -> T
unsafe fn mem_zeroed<T>() -> T
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe fn mem_transmute_copy<Src, Dst>(src: &Src) -> Dst
unsafe_layout
only.T
represented by the all-zero byte-pattern. Read moreSource§fn mem_as_bytes(&self) -> &[u8] ⓘ
fn mem_as_bytes(&self) -> &[u8] ⓘ
unsafe_slice
only.§impl<S> FromSample<S> for S
impl<S> FromSample<S> for S
fn from_sample_(s: S) -> S
Source§impl<T> Hook for T
impl<T> Hook for T
§impl<T> Instrument for T
impl<T> Instrument for T
§fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
fn instrument(self, span: Span) -> Instrumented<Self> ⓘ
§fn in_current_span(self) -> Instrumented<Self> ⓘ
fn in_current_span(self) -> Instrumented<Self> ⓘ
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left
is true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
self
into a Left
variant of Either<Self, Self>
if into_left(&self)
returns true
.
Converts self
into a Right
variant of Either<Self, Self>
otherwise. Read more§impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
impl<F, T> IntoSample<T> for Fwhere
T: FromSample<F>,
fn into_sample(self) -> T
§impl<T> LayoutRaw for T
impl<T> LayoutRaw for T
§fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
fn layout_raw(_: <T as Pointee>::Metadata) -> Result<Layout, LayoutError> ⓘ
§impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
impl<T, N1, N2> Niching<NichedOption<T, N1>> for N2
§unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
unsafe fn is_niched(niched: *const NichedOption<T, N1>) -> bool
§fn resolve_niched(out: Place<NichedOption<T, N1>>)
fn resolve_niched(out: Place<NichedOption<T, N1>>)
out
indicating that a T
is niched.