Trait malachite_base::num::logic::traits::SignificantBits

pub trait SignificantBits {
    // Required method
    fn significant_bits(self) -> u64;
}

Required Methods

fn significant_bits(self) -> u64

The number of bits it takes to represent self.

Implementations on Foreign Types

impl SignificantBits for i8

Returns the number of significant bits of a signed primitive integer.

This is the integer’s width minus the number of leading zeros of its absolute value.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 |n| \rfloor + 1 & \text{if} \quad n \neq 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

fn significant_bits(self) -> u64

impl SignificantBits for i16

Returns the number of significant bits of a signed primitive integer.

This is the integer’s width minus the number of leading zeros of its absolute value.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 |n| \rfloor + 1 & \text{if} \quad n \neq 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

fn significant_bits(self) -> u64

impl SignificantBits for i32

Returns the number of significant bits of a signed primitive integer.

This is the integer’s width minus the number of leading zeros of its absolute value.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 |n| \rfloor + 1 & \text{if} \quad n \neq 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

fn significant_bits(self) -> u64

impl SignificantBits for i64

Returns the number of significant bits of a signed primitive integer.

This is the integer’s width minus the number of leading zeros of its absolute value.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 |n| \rfloor + 1 & \text{if} \quad n \neq 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

fn significant_bits(self) -> u64

impl SignificantBits for i128

Returns the number of significant bits of a signed primitive integer.

This is the integer’s width minus the number of leading zeros of its absolute value.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 |n| \rfloor + 1 & \text{if} \quad n \neq 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

fn significant_bits(self) -> u64

impl SignificantBits for isize

Returns the number of significant bits of a signed primitive integer.

This is the integer’s width minus the number of leading zeros of its absolute value.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 |n| \rfloor + 1 & \text{if} \quad n \neq 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

fn significant_bits(self) -> u64

impl SignificantBits for u8

fn significant_bits(self) -> u64

Returns the number of significant bits of an unsigned primitive integer.

This is the integer’s width minus the number of leading zeros.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 n \rfloor + 1 & \text{if} \quad n > 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SignificantBits for u16

fn significant_bits(self) -> u64

Returns the number of significant bits of an unsigned primitive integer.

This is the integer’s width minus the number of leading zeros.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 n \rfloor + 1 & \text{if} \quad n > 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SignificantBits for u32

fn significant_bits(self) -> u64

Returns the number of significant bits of an unsigned primitive integer.

This is the integer’s width minus the number of leading zeros.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 n \rfloor + 1 & \text{if} \quad n > 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SignificantBits for u64

fn significant_bits(self) -> u64

Returns the number of significant bits of an unsigned primitive integer.

This is the integer’s width minus the number of leading zeros.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 n \rfloor + 1 & \text{if} \quad n > 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SignificantBits for u128

fn significant_bits(self) -> u64

Returns the number of significant bits of an unsigned primitive integer.

This is the integer’s width minus the number of leading zeros.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 n \rfloor + 1 & \text{if} \quad n > 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl SignificantBits for usize

fn significant_bits(self) -> u64

Returns the number of significant bits of an unsigned primitive integer.

This is the integer’s width minus the number of leading zeros.

$$ f(n) = \begin{cases} 0 & \text{if} \quad n = 0, \\ \lfloor \log_2 n \rfloor + 1 & \text{if} \quad n > 0. \end{cases} $$

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors