| Commit message (Collapse) | Author | Age | Files | Lines |
|---|
| | |
|
| | |
|
| |
|
|
| |
Now Clippy is happy.
|
| |
|
|
|
| |
Some were fixed, some were ignored because they seem to make a
(negative) performance impact.
|
| |
|
|
|
| |
These tests compare the code for iterative base conversion with the
alternative formula that spits out digits in reverse order.
|
| |
|
|
|
|
| |
Having one function that does both seems to be measurably faster, though
I would have expected the compiler to inline and generate comparable
assembly. Well, seems it didn't.
|
| | |
|
| |
|
|
| |
Seems not to have any performance impact, but still, cleaner this way.
|
| |
|
|
|
|
|
|
|
|
| |
Benchmarks show that MulAssign is quite a bit faster than Mul,
especially since in this case it's mathematically proven that the
multiplication cannot overflow.
Also, removed skipping of leading zeros in long division. With the
switch to multiplication after the first iteration, the chance that
there actually are any leading zeros is on the order of 2^-26.
I think at least. In any case, it's small.
|
| | |
|
| |
|
|
|
|
| |
There are now 2 features that control the amount of precomputed
constants. They can either be 0, 12, or 256. Most users will likely want
to go with the 12, so this is the default feature.
|
| |
|
|
|
| |
It seems English doesn't use the word potency in this context, but
rather uses power.
|
|
|
The maximum power of the base that can fit into a given data type is
constant. There's no point in computing it at runtime, if we can just
store it in a compile-time constants array.
The code isn't the most beautiful, but that's mostly because Rust const
functions are still a bit limited.
One function was duplicated, because it was easy to get a slow version
to compile in const context, and const context doesn't really care...
|
