Trait malachite_base::num::arithmetic::traits::ShrRoundAssign

pub trait ShrRoundAssign<RHS> {
    // Required method
    fn shr_round_assign(&mut self, other: RHS, rm: RoundingMode) -> Ordering;
}

Right-shifts a number (divides it by a power of 2) in place, rounding the result according to a specified rounding mode. An Ordering is also returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Rounding might only be necessary if other is positive.

Required Methods

fn shr_round_assign(&mut self, other: RHS, rm: RoundingMode) -> Ordering

Implementations on Foreign Types

impl ShrRoundAssign<i8> for i8

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for i16

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for i32

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for i64

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for i128

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for isize

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for u8

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for u16

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for u32

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for u64

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for u128

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i8> for usize

fn shr_round_assign(&mut self, bits: i8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for i8

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for i16

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for i32

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for i64

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for i128

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for isize

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for u8

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for u16

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for u32

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for u64

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for u128

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i16> for usize

fn shr_round_assign(&mut self, bits: i16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for i8

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for i16

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for i32

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for i64

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for i128

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for isize

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for u8

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for u16

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for u32

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for u64

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for u128

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i32> for usize

fn shr_round_assign(&mut self, bits: i32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for i8

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for i16

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for i32

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for i64

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for i128

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for isize

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for u8

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for u16

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for u32

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for u64

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for u128

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i64> for usize

fn shr_round_assign(&mut self, bits: i64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for i8

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for i16

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for i32

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for i64

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for i128

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for isize

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for u8

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for u16

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for u32

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for u64

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for u128

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<i128> for usize

fn shr_round_assign(&mut self, bits: i128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for i8

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for i16

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for i32

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for i64

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for i128

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for isize

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for u8

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for u16

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for u32

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for u64

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for u128

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<isize> for usize

fn shr_round_assign(&mut self, bits: isize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value. If bits is negative, then the returned Ordering is always Equal, even if the higher bits of the result are lost.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits). Rounding might only be necessary if bits is non-negative.

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if bits is positive and rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for i8

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for i16

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for i32

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for i64

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for i128

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for isize

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for u8

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for u16

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for u32

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for u64

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for u128

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u8> for usize

fn shr_round_assign(&mut self, bits: u8, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for i8

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for i16

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for i32

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for i64

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for i128

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for isize

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for u8

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for u16

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for u32

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for u64

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for u128

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u16> for usize

fn shr_round_assign(&mut self, bits: u16, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for i8

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for i16

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for i32

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for i64

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for i128

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for isize

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for u8

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for u16

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for u32

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for u64

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for u128

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u32> for usize

fn shr_round_assign(&mut self, bits: u32, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for i8

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for i16

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for i32

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for i64

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for i128

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for isize

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for u8

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for u16

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for u32

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for u64

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for u128

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u64> for usize

fn shr_round_assign(&mut self, bits: u64, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for i8

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for i16

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for i32

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for i64

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for i128

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for isize

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for u8

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for u16

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for u32

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for u64

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for u128

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<u128> for usize

fn shr_round_assign(&mut self, bits: u128, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for i8

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for i16

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for i32

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for i64

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for i128

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for isize

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering isreturned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for u8

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for u16

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for u32

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for u64

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for u128

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

impl ShrRoundAssign<usize> for usize

fn shr_round_assign(&mut self, bits: usize, rm: RoundingMode) -> Ordering

Shifts a number right (divides it by a power of 2) and rounds according to the specified rounding mode, in place. An Ordering is returned, indicating whether the assigned value is less than, equal to, or greater than the exact value.

Passing Floor or Down is equivalent to using >>. To test whether Exact can be passed, use self.divisible_by_power_of_2(bits).

See the ShrRound documentation for details.

Worst-case complexity

Constant time and additional memory.

Panics

Panics if rm is Exact but self is not divisible by $2^b$.

Examples

See here.

Implementors