Trait IsSquare 

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

A trait for testing whether a number is a square.

Required Methods

fn is_square(&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 IsSquare for i8

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for i16

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for i32

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for i64

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for i128

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for isize

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for u8

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for u16

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for u32

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for u64

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

impl IsSquare for u128

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

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(): the quadratic-residue prefilters are constant-time and reject most nonsquares, but surviving candidates pay one $O(n)$ 128-bit square root.

Examples

See here.

impl IsSquare for usize

fn is_square(&self) -> bool

Determines whether an integer is a perfect square.

$f(x) = (\exists b \in \Z : b^2 = x)$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors