Struct deranged::RangedUsize
source · #[repr(transparent)]pub struct RangedUsize<const MIN: usize, const MAX: usize>(pub(crate) Unsafe<usize>);
Expand description
A usize
that is known to be in the range MIN..=MAX
.
Tuple Fields§
§0: Unsafe<usize>
Implementations§
source§impl RangedUsize<0, 0>
impl RangedUsize<0, 0>
pub const fn exact<const VALUE: usize>() -> RangedUsize<VALUE, VALUE>
source§impl<const MIN: usize, const MAX: usize> RangedUsize<MIN, MAX>
impl<const MIN: usize, const MAX: usize> RangedUsize<MIN, MAX>
sourcepub const unsafe fn new_unchecked(value: usize) -> Self
pub const unsafe fn new_unchecked(value: usize) -> Self
Creates a ranged integer without checking the value.
§Safety
The value must be within the range MIN..=MAX
.
pub(crate) const fn get_ref(&self) -> &usize
sourcepub const fn new(value: usize) -> Option<Self>
pub const fn new(value: usize) -> Option<Self>
Creates a ranged integer if the given value is in the range MIN..=MAX
.
sourcepub const fn new_static<const VALUE: usize>() -> Self
pub const fn new_static<const VALUE: usize>() -> Self
Creates a ranged integer with a statically known value. Fails to compile if the value is not in range.
sourcepub const fn new_saturating(value: usize) -> Self
pub const fn new_saturating(value: usize) -> Self
Creates a ranged integer with the given value, saturating if it is out of range.
sourcepub const fn expand<const NEW_MIN: usize, const NEW_MAX: usize>(
self,
) -> RangedUsize<NEW_MIN, NEW_MAX>
pub const fn expand<const NEW_MIN: usize, const NEW_MAX: usize>( self, ) -> RangedUsize<NEW_MIN, NEW_MAX>
Expand the range that the value may be in. Fails to compile if the new range is not a superset of the current range.
sourcepub const fn narrow<const NEW_MIN: usize, const NEW_MAX: usize>(
self,
) -> Option<RangedUsize<NEW_MIN, NEW_MAX>>
pub const fn narrow<const NEW_MIN: usize, const NEW_MAX: usize>( self, ) -> Option<RangedUsize<NEW_MIN, NEW_MAX>>
Attempt to narrow the range that the value may be in. Returns None
if the value
is outside the new range. Fails to compile if the new range is not a subset of
the current range.
sourcepub fn from_str_radix(src: &str, radix: u32) -> Result<Self, ParseIntError>
pub fn from_str_radix(src: &str, radix: u32) -> Result<Self, ParseIntError>
Converts a string slice in a given base to an integer.
The string is expected to be an optional +
or -
sign followed by digits. Leading
and trailing whitespace represent an error. Digits are a subset of these characters,
depending on radix
:
0-9
a-z
A-Z
§Panics
Panics if radix
is not in the range 2..=36
.
§Examples
Basic usage:
assert_eq!(RangedUsize::<5, 10>::from_str_radix("A", 16), Ok(RangedUsize::new_static::<10>()));
sourcepub const fn checked_add(self, rhs: usize) -> Option<Self>
pub const fn checked_add(self, rhs: usize) -> Option<Self>
Checked integer addition. Computes self + rhs
, returning None
if the resulting
value is out of range.
sourcepub const unsafe fn unchecked_add(self, rhs: usize) -> Self
pub const unsafe fn unchecked_add(self, rhs: usize) -> Self
Unchecked integer addition. Computes self + rhs
, assuming that the result is in
range.
§Safety
The result of self + rhs
must be in the range MIN..=MAX
.
sourcepub const fn checked_sub(self, rhs: usize) -> Option<Self>
pub const fn checked_sub(self, rhs: usize) -> Option<Self>
Checked integer addition. Computes self - rhs
, returning None
if the resulting
value is out of range.
sourcepub const unsafe fn unchecked_sub(self, rhs: usize) -> Self
pub const unsafe fn unchecked_sub(self, rhs: usize) -> Self
Unchecked integer subtraction. Computes self - rhs
, assuming that the result is in
range.
§Safety
The result of self - rhs
must be in the range MIN..=MAX
.
sourcepub const fn checked_mul(self, rhs: usize) -> Option<Self>
pub const fn checked_mul(self, rhs: usize) -> Option<Self>
Checked integer addition. Computes self * rhs
, returning None
if the resulting
value is out of range.
sourcepub const unsafe fn unchecked_mul(self, rhs: usize) -> Self
pub const unsafe fn unchecked_mul(self, rhs: usize) -> Self
Unchecked integer multiplication. Computes self * rhs
, assuming that the result is
in range.
§Safety
The result of self * rhs
must be in the range MIN..=MAX
.
sourcepub const fn checked_div(self, rhs: usize) -> Option<Self>
pub const fn checked_div(self, rhs: usize) -> Option<Self>
Checked integer addition. Computes self / rhs
, returning None
if rhs == 0
or
if the resulting value is out of range.
sourcepub const unsafe fn unchecked_div(self, rhs: usize) -> Self
pub const unsafe fn unchecked_div(self, rhs: usize) -> Self
Unchecked integer division. Computes self / rhs
, assuming that rhs != 0
and that
the result is in range.
§Safety
self
must not be zero and the result of self / rhs
must be in the range
MIN..=MAX
.
sourcepub const fn checked_div_euclid(self, rhs: usize) -> Option<Self>
pub const fn checked_div_euclid(self, rhs: usize) -> Option<Self>
Checked Euclidean division. Computes self.div_euclid(rhs)
, returning None
if
rhs == 0
or if the resulting value is out of range.
sourcepub const unsafe fn unchecked_div_euclid(self, rhs: usize) -> Self
pub const unsafe fn unchecked_div_euclid(self, rhs: usize) -> Self
Unchecked Euclidean division. Computes self.div_euclid(rhs)
, assuming that
rhs != 0
and that the result is in range.
§Safety
self
must not be zero and the result of self.div_euclid(rhs)
must be in the
range MIN..=MAX
.
sourcepub const fn rem<const RHS_VALUE: usize>(
self,
rhs: RangedUsize<RHS_VALUE, RHS_VALUE>,
) -> RangedUsize<0, RHS_VALUE>
pub const fn rem<const RHS_VALUE: usize>( self, rhs: RangedUsize<RHS_VALUE, RHS_VALUE>, ) -> RangedUsize<0, RHS_VALUE>
Remainder. Computes self % rhs
, statically guaranteeing that the returned value
is in range.
sourcepub const fn checked_rem(self, rhs: usize) -> Option<Self>
pub const fn checked_rem(self, rhs: usize) -> Option<Self>
Checked integer remainder. Computes self % rhs
, returning None
if rhs == 0
or
if the resulting value is out of range.
sourcepub const unsafe fn unchecked_rem(self, rhs: usize) -> Self
pub const unsafe fn unchecked_rem(self, rhs: usize) -> Self
Unchecked remainder. Computes self % rhs
, assuming that rhs != 0
and that the
result is in range.
§Safety
self
must not be zero and the result of self % rhs
must be in the range
MIN..=MAX
.
sourcepub const fn checked_rem_euclid(self, rhs: usize) -> Option<Self>
pub const fn checked_rem_euclid(self, rhs: usize) -> Option<Self>
Checked Euclidean remainder. Computes self.rem_euclid(rhs)
, returning None
if
rhs == 0
or if the resulting value is out of range.
sourcepub const unsafe fn unchecked_rem_euclid(self, rhs: usize) -> Self
pub const unsafe fn unchecked_rem_euclid(self, rhs: usize) -> Self
Unchecked Euclidean remainder. Computes self.rem_euclid(rhs)
, assuming that
rhs != 0
and that the result is in range.
§Safety
self
must not be zero and the result of self.rem_euclid(rhs)
must be in the
range MIN..=MAX
.
sourcepub const fn checked_neg(self) -> Option<Self>
pub const fn checked_neg(self) -> Option<Self>
Checked negation. Computes -self
, returning None
if the resulting value is out
of range.
sourcepub const unsafe fn unchecked_neg(self) -> Self
pub const unsafe fn unchecked_neg(self) -> Self
Unchecked negation. Computes -self
, assuming that -self
is in range.
§Safety
The result of -self
must be in the range MIN..=MAX
.
sourcepub const fn neg(self) -> Self
pub const fn neg(self) -> Self
Negation. Computes self.neg()
, failing to compile if the result is not
guaranteed to be in range.
sourcepub const fn checked_shl(self, rhs: u32) -> Option<Self>
pub const fn checked_shl(self, rhs: u32) -> Option<Self>
Checked shift left. Computes self << rhs
, returning None
if the resulting value
is out of range.
sourcepub const unsafe fn unchecked_shl(self, rhs: u32) -> Self
pub const unsafe fn unchecked_shl(self, rhs: u32) -> Self
Unchecked shift left. Computes self << rhs
, assuming that the result is in range.
§Safety
The result of self << rhs
must be in the range MIN..=MAX
.
sourcepub const fn checked_shr(self, rhs: u32) -> Option<Self>
pub const fn checked_shr(self, rhs: u32) -> Option<Self>
Checked shift right. Computes self >> rhs
, returning None
if
the resulting value is out of range.
sourcepub const unsafe fn unchecked_shr(self, rhs: u32) -> Self
pub const unsafe fn unchecked_shr(self, rhs: u32) -> Self
Unchecked shift right. Computes self >> rhs
, assuming that the result is in range.
§Safety
The result of self >> rhs
must be in the range MIN..=MAX
.
sourcepub const fn checked_pow(self, exp: u32) -> Option<Self>
pub const fn checked_pow(self, exp: u32) -> Option<Self>
Checked exponentiation. Computes self.pow(exp)
, returning None
if the resulting
value is out of range.
sourcepub const unsafe fn unchecked_pow(self, exp: u32) -> Self
pub const unsafe fn unchecked_pow(self, exp: u32) -> Self
Unchecked exponentiation. Computes self.pow(exp)
, assuming that the result is in
range.
§Safety
The result of self.pow(exp)
must be in the range MIN..=MAX
.
sourcepub const fn saturating_add(self, rhs: usize) -> Self
pub const fn saturating_add(self, rhs: usize) -> Self
Saturating integer addition. Computes self + rhs
, saturating at the numeric
bounds.
sourcepub const fn saturating_sub(self, rhs: usize) -> Self
pub const fn saturating_sub(self, rhs: usize) -> Self
Saturating integer subtraction. Computes self - rhs
, saturating at the numeric
bounds.
sourcepub const fn saturating_mul(self, rhs: usize) -> Self
pub const fn saturating_mul(self, rhs: usize) -> Self
Saturating integer multiplication. Computes self * rhs
, saturating at the numeric
bounds.
sourcepub const fn saturating_pow(self, exp: u32) -> Self
pub const fn saturating_pow(self, exp: u32) -> Self
Saturating integer exponentiation. Computes self.pow(exp)
, saturating at the
numeric bounds.
sourcepub(crate) const fn rem_euclid_unsigned(rhs: usize, range_len: usize) -> usize
pub(crate) const fn rem_euclid_unsigned(rhs: usize, range_len: usize) -> usize
Compute the rem_euclid
of this type with its unsigned type equivalent
sourcepub const fn wrapping_add(self, rhs: usize) -> Self
pub const fn wrapping_add(self, rhs: usize) -> Self
Wrapping integer addition. Computes self + rhs
, wrapping around the numeric
bounds.
sourcepub const fn wrapping_sub(self, rhs: usize) -> Self
pub const fn wrapping_sub(self, rhs: usize) -> Self
Wrapping integer subtraction. Computes self - rhs
, wrapping around the numeric
bounds.
Trait Implementations§
source§impl<const MIN: usize, const MAX: usize> Clone for RangedUsize<MIN, MAX>
impl<const MIN: usize, const MAX: usize> Clone for RangedUsize<MIN, MAX>
source§fn clone(&self) -> RangedUsize<MIN, MAX>
fn clone(&self) -> RangedUsize<MIN, MAX>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read moresource§impl<'de, const MIN: usize, const MAX: usize> Deserialize<'de> for RangedUsize<MIN, MAX>
impl<'de, const MIN: usize, const MAX: usize> Deserialize<'de> for RangedUsize<MIN, MAX>
source§fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>
source§impl<const MIN: usize, const MAX: usize> From<RangedUsize<MIN, MAX>> for OptionRangedUsize<MIN, MAX>
impl<const MIN: usize, const MAX: usize> From<RangedUsize<MIN, MAX>> for OptionRangedUsize<MIN, MAX>
source§fn from(value: RangedUsize<MIN, MAX>) -> Self
fn from(value: RangedUsize<MIN, MAX>) -> Self
source§impl<const MIN: usize, const MAX: usize> From<RangedUsize<MIN, MAX>> for usize
impl<const MIN: usize, const MAX: usize> From<RangedUsize<MIN, MAX>> for usize
source§fn from(value: RangedUsize<MIN, MAX>) -> Self
fn from(value: RangedUsize<MIN, MAX>) -> Self
source§impl<const MIN: usize, const MAX: usize> Ord for RangedUsize<MIN, MAX>
impl<const MIN: usize, const MAX: usize> Ord for RangedUsize<MIN, MAX>
source§fn cmp(&self, other: &RangedUsize<MIN, MAX>) -> Ordering
fn cmp(&self, other: &RangedUsize<MIN, MAX>) -> Ordering
1.21.0 · source§fn max(self, other: Self) -> Selfwhere
Self: Sized,
fn max(self, other: Self) -> Selfwhere
Self: Sized,
source§impl<const MIN_A: usize, const MAX_A: usize, const MIN_B: usize, const MAX_B: usize> PartialEq<RangedUsize<MIN_B, MAX_B>> for RangedUsize<MIN_A, MAX_A>
impl<const MIN_A: usize, const MAX_A: usize, const MIN_B: usize, const MAX_B: usize> PartialEq<RangedUsize<MIN_B, MAX_B>> for RangedUsize<MIN_A, MAX_A>
source§fn eq(&self, other: &RangedUsize<MIN_B, MAX_B>) -> bool
fn eq(&self, other: &RangedUsize<MIN_B, MAX_B>) -> bool
self
and other
values to be equal, and is used
by ==
.source§impl<const MIN_A: usize, const MAX_A: usize, const MIN_B: usize, const MAX_B: usize> PartialOrd<RangedUsize<MIN_B, MAX_B>> for RangedUsize<MIN_A, MAX_A>
impl<const MIN_A: usize, const MAX_A: usize, const MIN_B: usize, const MAX_B: usize> PartialOrd<RangedUsize<MIN_B, MAX_B>> for RangedUsize<MIN_A, MAX_A>
source§fn partial_cmp(&self, other: &RangedUsize<MIN_B, MAX_B>) -> Option<Ordering>
fn partial_cmp(&self, other: &RangedUsize<MIN_B, MAX_B>) -> Option<Ordering>
1.0.0 · source§fn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
self
and other
) and is used by the <=
operator. Read more