Trait IsPower 

pub trait IsPower {
    // Required method
    fn is_power(&self) -> bool;
}

A trait for testing whether a number is a perfect power.

Required Methods

fn is_power(&self) -> bool

Dyn Compatibility

This trait is dyn compatible.

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

Implementations on Foreign Types

impl IsPower for i8

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for i16

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for i32

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for i64

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for i128

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for isize

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for u8

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for u16

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for u32

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for u64

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for u128

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsPower for usize

fn is_power(&self) -> bool

Determines whether an integer is a perfect power. We define a perfect power as any number of the form $a^x$ where $x > 1$, with $a$ and $x$ both integers. In particular 0 and 1 are considered perfect powers.

$f(x) = (\exists b \in \Z, e \in \N : e > 1 \ \text{and} \ b^e = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors