Trait RemovePowerAssign 

pub trait RemovePowerAssign<RHS = Self> {
    // Required method
    fn remove_power_assign(&mut self, other: RHS) -> u64;
}

A trait for replacing a number with itself divided by the largest power of a factor, returning how many times the factor was removed.

Required Methods

fn remove_power_assign(&mut self, other: RHS) -> u64

Dyn Compatibility

This trait is dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementations on Foreign Types

impl RemovePowerAssign for i8

fn remove_power_assign(&mut self, other: i8) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for i16

fn remove_power_assign(&mut self, other: i16) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for i32

fn remove_power_assign(&mut self, other: i32) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for i64

fn remove_power_assign(&mut self, other: i64) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for i128

fn remove_power_assign(&mut self, other: i128) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for isize

fn remove_power_assign(&mut self, other: isize) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for u8

fn remove_power_assign(&mut self, other: u8) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for u16

fn remove_power_assign(&mut self, other: u16) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for u32

fn remove_power_assign(&mut self, other: u32) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for u64

fn remove_power_assign(&mut self, other: u64) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for u128

fn remove_power_assign(&mut self, other: u128) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

impl RemovePowerAssign for usize

fn remove_power_assign(&mut self, other: usize) -> u64

Divides a number by the largest power of a factor that divides it, in place, returning the exponent of that power.

The factor need not be prime. Zero is left alone, with an exponent of 0.

Worst-case complexity

$T(n) = O(n)$

$M(n) = O(1)$

where $T$ is time, $M$ is additional memory, and $n$ is self.significant_bits(): each division by other, which is at least 2, removes at least one bit.

Panics

Panics if other is 0 or 1, or, for signed types, -1.

Examples

See here.

Implementors