ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-06 15:48:51 +00:00
Code Issues Packages Projects Releases Wiki Activity

bigint: Fast paths for radix code.

Browse Source
This commit is contained in:
Jeroen van Rijn
2021-08-11 20:59:50 +02:00
parent 767948ab46
commit e3d8ac559d
3 changed files with 154 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/math/bigint/log.odin
+3 -3
View File
@@ -11,7 +11,7 @@ package bigint
import "core:fmt"
log_n_int :: proc(a: ^Int, base: int) -> (log: int, err: Error) {
log_n_int :: proc(a: ^Int, base: DIGIT) -> (log: int, err: Error) {
assert_initialized(a);
if is_neg(a) || is_zero(a) || base < 2 || DIGIT(base) > _DIGIT_MAX {
return -1, .Invalid_Input;
@@ -20,7 +20,7 @@ log_n_int :: proc(a: ^Int, base: int) -> (log: int, err: Error) {
/*
Fast path for bases that are a power of two.
*/
if is_power_of_two(base) {
if is_power_of_two(int(base)) {
return _log_power_of_two(a, base), .OK;
}
@@ -44,7 +44,7 @@ log_n :: proc{log_n_int, log_n_digit};
Returns the log2 of an `Int`, provided `base` is a power of two.
Don't call it if it isn't.
*/
_log_power_of_two :: proc(a: ^Int, base: int) -> (log: int) {
_log_power_of_two :: proc(a: ^Int, base: DIGIT) -> (log: int) {
base := base;
y: int;
for y = 0; base & 1 == 0; {