pub trait FloorLogBasePowerOf2<POW> {
type Output;
// Required method
fn floor_log_base_power_of_2(self, pow: POW) -> Self::Output;
}
Expand description
Calculates the floor of the base-$2^k$ logarithm of a number.
Returns the floor of the base-$2^k$ logarithm of a positive float.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self or pow are 0.
§Examples
See here.
Returns the floor of the base-$2^k$ logarithm of a positive float.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self or pow are 0.
§Examples
See here.
Returns the floor of the base-$2^k$ logarithm of a positive integer.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self is infinite, NaN, or less than or equal to zero, or if pow is
zero.
§Examples
See here.
Returns the floor of the base-$2^k$ logarithm of a positive integer.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self is infinite, NaN, or less than or equal to zero, or if pow is
zero.
§Examples
See here.
Returns the floor of the base-$2^k$ logarithm of a positive integer.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self is infinite, NaN, or less than or equal to zero, or if pow is
zero.
§Examples
See here.
Returns the floor of the base-$2^k$ logarithm of a positive integer.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self is infinite, NaN, or less than or equal to zero, or if pow is
zero.
§Examples
See here.
Returns the floor of the base-$2^k$ logarithm of a positive integer.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self is infinite, NaN, or less than or equal to zero, or if pow is
zero.
§Examples
See here.
Returns the floor of the base-$2^k$ logarithm of a positive integer.
$f(x, k) = \lfloor\log_{2^k} x\rfloor$.
§Worst-case complexity
Constant time and additional memory.
§Panics
Panics if self is infinite, NaN, or less than or equal to zero, or if pow is
zero.
§Examples
See here.