pub struct IntegerRange<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64>;Expand description
An inclusive ASN.1 INTEGER value interval with independently optional bounds.
Bounds use i64 because generated Rust values use the compact Small variant
in that range. Arbitrary-size Big values are also handled exactly: their
canonical representation proves that they lie strictly outside the i64
interval, so only their sign is needed at runtime.
Trait Implementations§
Source§impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Clone for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Clone for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Source§fn clone(&self) -> IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
fn clone(&self) -> IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl<'a, const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Pred<Integer<'a>> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<'a, const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Pred<Integer<'a>> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Source§impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Pred<i16> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Pred<i16> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Source§impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Pred<i8> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Pred<i8> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Source§impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> SpecPred<i16> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> SpecPred<i16> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Source§impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> SpecPred<i8> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> SpecPred<i8> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Source§impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> SpecPred<int> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> SpecPred<int> for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Copy for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
Auto Trait Implementations§
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Freeze for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> RefUnwindSafe for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Send for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Sync for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> Unpin for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> UnsafeUnpin for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
impl<const HAS_MIN: bool, const MIN: i64, const HAS_MAX: bool, const MAX: i64> UnwindSafe for IntegerRange<HAS_MIN, MIN, HAS_MAX, MAX>
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