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

Remove unneeded semicolons from the core library

Browse Source
This commit is contained in:
gingerBill
2021-08-31 22:32:53 +01:00
parent 2db6fea665
commit f57201bbd1
19 changed files with 80 additions and 80 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/math/big/internal.odin
+10 -10
View File
@@ -852,7 +852,7 @@ internal_div :: proc { internal_int_div, }
Asssumes quotient, numerator and denominator to have been initialized and not to be nil.
*/
internal_int_mod :: proc(remainder, numerator, denominator: ^Int, allocator := context.allocator) -> (err: Error) {
#force_inline internal_int_divmod(nil, remainder, numerator, denominator, allocator) or_return;
#force_inline internal_int_divmod(nil, remainder, numerator, denominator, allocator) or_return
if remainder.used == 0 || denominator.sign == remainder.sign { return nil; }
@@ -869,7 +869,7 @@ internal_mod :: proc{ internal_int_mod, internal_int_mod_digit}
remainder = (number + addend) % modulus.
*/
internal_int_addmod :: proc(remainder, number, addend, modulus: ^Int, allocator := context.allocator) -> (err: Error) {
#force_inline internal_add(remainder, number, addend, allocator) or_return;
#force_inline internal_add(remainder, number, addend, allocator) or_return
return #force_inline internal_mod(remainder, remainder, modulus, allocator)
}
internal_addmod :: proc { internal_int_addmod, }
@@ -878,7 +878,7 @@ internal_addmod :: proc { internal_int_addmod, }
remainder = (number - decrease) % modulus.
*/
internal_int_submod :: proc(remainder, number, decrease, modulus: ^Int, allocator := context.allocator) -> (err: Error) {
#force_inline internal_sub(remainder, number, decrease, allocator) or_return;
#force_inline internal_sub(remainder, number, decrease, allocator) or_return
return #force_inline internal_mod(remainder, remainder, modulus, allocator)
}
internal_submod :: proc { internal_int_submod, }
@@ -887,7 +887,7 @@ internal_submod :: proc { internal_int_submod, }
remainder = (number * multiplicand) % modulus.
*/
internal_int_mulmod :: proc(remainder, number, multiplicand, modulus: ^Int, allocator := context.allocator) -> (err: Error) {
#force_inline internal_mul(remainder, number, multiplicand, allocator) or_return;
#force_inline internal_mul(remainder, number, multiplicand, allocator) or_return
return #force_inline internal_mod(remainder, remainder, modulus, allocator)
}
internal_mulmod :: proc { internal_int_mulmod, }
@@ -896,7 +896,7 @@ internal_mulmod :: proc { internal_int_mulmod, }
remainder = (number * number) % modulus.
*/
internal_int_sqrmod :: proc(remainder, number, modulus: ^Int, allocator := context.allocator) -> (err: Error) {
#force_inline internal_sqr(remainder, number, allocator) or_return;
#force_inline internal_sqr(remainder, number, allocator) or_return
return #force_inline internal_mod(remainder, remainder, modulus, allocator)
}
internal_sqrmod :: proc { internal_int_sqrmod, }
@@ -919,7 +919,7 @@ internal_int_factorial :: proc(res: ^Int, n: int, allocator := context.allocator
return #force_inline internal_set(res, _factorial_table[n])
}
#force_inline internal_set(res, _factorial_table[i - 1]) or_return;
#force_inline internal_set(res, _factorial_table[i - 1]) or_return
for {
if err = #force_inline internal_mul(res, res, DIGIT(i)); err != nil || i == n {
return err
@@ -1695,7 +1695,7 @@ internal_int_set_from_integer :: proc(dest: ^Int, src: $T, minimize := false, al
internal_set :: proc { internal_int_set_from_integer, internal_int_copy }
internal_copy_digits :: #force_inline proc(dest, src: ^Int, digits: int, offset := int(0)) -> (err: Error) {
#force_inline internal_error_if_immutable(dest) or_return;
#force_inline internal_error_if_immutable(dest) or_return
/*
If dest == src, do nothing
@@ -2069,7 +2069,7 @@ internal_int_get :: proc(a: ^Int, $T: typeid) -> (res: T, err: Error) where intr
res |= T(a.digit[i])
if size_in_bits <= _DIGIT_BITS {
break
};
}
}
when !intrinsics.type_is_unsigned(T) {
@@ -2499,7 +2499,7 @@ internal_int_shl_digit :: proc(quotient: ^Int, digits: int, allocator := context
/*
Resize `quotient` to accomodate extra digits.
*/
#force_inline internal_grow(quotient, quotient.used + digits) or_return;
#force_inline internal_grow(quotient, quotient.used + digits) or_return
/*
Increment the used by the shift amount then copy upwards.
@@ -2597,7 +2597,7 @@ internal_int_rand :: proc(dest: ^Int, bits: int, r: ^rnd.Rand = nil, allocator :
digits += 1
}
#force_inline internal_grow(dest, digits) or_return;
#force_inline internal_grow(dest, digits) or_return
for i := 0; i < digits; i += 1 {
dest.digit[i] = int_random_digit(r) & _MASK