pub struct CompositeValidator<T, V1, V2> { /* private fields */ }Expand description
A validator that combines two validators with AND logic
Implementations§
Source§impl<T, V1, V2> CompositeValidator<T, V1, V2>
impl<T, V1, V2> CompositeValidator<T, V1, V2>
pub fn new(validator1: V1, validator2: V2) -> CompositeValidator<T, V1, V2>
Trait Implementations§
Source§impl<T, V1, V2> Validator<T> for CompositeValidator<T, V1, V2>
impl<T, V1, V2> Validator<T> for CompositeValidator<T, V1, V2>
Source§fn validate(&self, value: &T, name: &str) -> Result<(), CoreError>
fn validate(&self, value: &T, name: &str) -> Result<(), CoreError>
Validate the value and return Ok(()) if valid, or an error if invalid
Source§fn description(&self) -> String
fn description(&self) -> String
Get a description of what this validator checks
Source§fn and<V>(self, other: V) -> CompositeValidator<T, Self, V>
fn and<V>(self, other: V) -> CompositeValidator<T, Self, V>
Chain this validator with another validator
Auto Trait Implementations§
impl<T, V1, V2> Freeze for CompositeValidator<T, V1, V2>
impl<T, V1, V2> RefUnwindSafe for CompositeValidator<T, V1, V2>
impl<T, V1, V2> Send for CompositeValidator<T, V1, V2>
impl<T, V1, V2> Sync for CompositeValidator<T, V1, V2>
impl<T, V1, V2> Unpin for CompositeValidator<T, V1, V2>
impl<T, V1, V2> UnsafeUnpin for CompositeValidator<T, V1, V2>where
V1: UnsafeUnpin,
V2: UnsafeUnpin,
impl<T, V1, V2> UnwindSafe for CompositeValidator<T, V1, V2>
Blanket Implementations§
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
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§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>
Converts
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>
Converts
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.