Trait IsSquare
Source pub trait IsSquare {
// Required method
fn is_square(&self) -> bool;
}
Expand description
A trait for testing whether a number is a square.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.
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.