pub trait Pow {
fn pow_int(&self, n: i32) -> Self;
fn pow_uint(&self, n: u32) -> Self;
fn pow_2(&self) -> Self;
fn pow_3(&self) -> Self;
fn pow_4(&self) -> Self;
fn pow_5(&self) -> Self;
fn pow_6(&self) -> Self;
fn pow_7(&self) -> Self;
fn pow_8(&self) -> Self;
fn pow_9(&self) -> Self;
}
Required methods
This routine computes the power x^n for integer n. The power is computed efficiently—for example, x^8 is computed as ((x^2)^2)^2, requiring only 3 multiplications. A version of this function which also computes the numerical error in the result is available as gsl_sf_pow_int_e.
This routine computes the power x^n for integer n. The power is computed efficiently—for example, x^8 is computed as ((x^2)^2)^2, requiring only 3 multiplications. A version of this function which also computes the numerical error in the result is available as gsl_sf_pow_int_e.
This function can be used to compute small integer powers x^2, x^3, etc. efficiently.
This function can be used to compute small integer powers x^2, x^3, etc. efficiently.
This function can be used to compute small integer powers x^2, x^3, etc. efficiently.
This function can be used to compute small integer powers x^2, x^3, etc. efficiently.
This function can be used to compute small integer powers x^2, x^3, etc. efficiently.
This function can be used to compute small integer powers x^2, x^3, etc. efficiently.
This function can be used to compute small integer powers x^2, x^3, etc. efficiently.