Trait malachite_base::num::arithmetic::traits::ModSquareAssign

source · 
pub trait ModSquareAssign<M = Self> {
    fn mod_square_assign(&mut self, m: M);
}
Expand description

Squares a number modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.

Required Methods§

Implementations on Foreign Types§

Squares a number modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.

$x \gets y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.

$x \gets y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.

$x \gets y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.

$x \gets y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.

$x \gets y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Squares a number modulo another number $m$, in place. Assumes the input is already reduced modulo $m$.

$x \gets y$, where $x, y < m$ and $x^2 \equiv y \mod m$.

Worst-case complexity

Constant time and additional memory.

Examples

See here.

Implementors§