ed/Odin
1
0
Fork 0
mirror of https://github.com/Ed94/Odin.git synced 2026-08-06 23:58:50 +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:21:13 +01:00
parent b176af2742
commit 251da264ed
187 changed files with 27227 additions and 27227 deletions
Download Patch File Download Diff File Expand all files Collapse all files
core/strconv/integers.odin
+82 -82
View File
@@ -5,163 +5,163 @@ Int_Flag :: enum {
Plus,
Space,
}
Int_Flags :: bit_set[Int_Flag];
Int_Flags :: bit_set[Int_Flag]
MAX_BASE :: 32;
digits := "0123456789abcdefghijklmnopqrstuvwxyz";
MAX_BASE :: 32
digits := "0123456789abcdefghijklmnopqrstuvwxyz"
is_integer_negative :: proc(x: u64, is_signed: bool, bit_size: int) -> (u: u64, neg: bool) {
u = x;
u = x
if is_signed {
switch bit_size {
case 8:
i := i8(u);
neg = i < 0;
u = u64(abs(i64(i)));
i := i8(u)
neg = i < 0
u = u64(abs(i64(i)))
case 16:
i := i16(u);
neg = i < 0;
u = u64(abs(i64(i)));
i := i16(u)
neg = i < 0
u = u64(abs(i64(i)))
case 32:
i := i32(u);
neg = i < 0;
u = u64(abs(i64(i)));
i := i32(u)
neg = i < 0
u = u64(abs(i64(i)))
case 64:
i := i64(u);
neg = i < 0;
u = u64(abs(i));
i := i64(u)
neg = i < 0
u = u64(abs(i))
case:
panic("is_integer_negative: Unknown integer size");
panic("is_integer_negative: Unknown integer size")
}
}
return;
return
}
append_bits :: proc(buf: []byte, x: u64, base: int, is_signed: bool, bit_size: int, digits: string, flags: Int_Flags) -> string {
if base < 2 || base > MAX_BASE {
panic("strconv: illegal base passed to append_bits");
panic("strconv: illegal base passed to append_bits")
}
a: [129]byte;
i := len(a);
u, neg := is_integer_negative(x, is_signed, bit_size);
b := u64(base);
a: [129]byte
i := len(a)
u, neg := is_integer_negative(x, is_signed, bit_size)
b := u64(base)
for u >= b {
i-=1; a[i] = digits[u % b];
u /= b;
i-=1; a[i] = digits[u % b]
u /= b
}
i-=1; a[i] = digits[u % b];
i-=1; a[i] = digits[u % b]
if .Prefix in flags {
ok := true;
ok := true
switch base {
case 2: i-=1; a[i] = 'b';
case 8: i-=1; a[i] = 'o';
case 2: i-=1; a[i] = 'b'
case 8: i-=1; a[i] = 'o'
// case 10: i-=1; a[i] = 'd';
case 12: i-=1; a[i] = 'z';
case 16: i-=1; a[i] = 'x';
case: ok = false;
case 12: i-=1; a[i] = 'z'
case 16: i-=1; a[i] = 'x'
case: ok = false
}
if ok {
i-=1; a[i] = '0';
i-=1; a[i] = '0'
}
}
switch {
case neg:
i-=1; a[i] = '-';
i-=1; a[i] = '-'
case .Plus in flags:
i-=1; a[i] = '+';
i-=1; a[i] = '+'
case .Space in flags:
i-=1; a[i] = ' ';
i-=1; a[i] = ' '
}
out := a[i:];
copy(buf, out);
return string(buf[0:len(out)]);
out := a[i:]
copy(buf, out)
return string(buf[0:len(out)])
}
is_integer_negative_128 :: proc(x: u128, is_signed: bool, bit_size: int) -> (u: u128, neg: bool) {
u = x;
u = x
if is_signed {
switch bit_size {
case 8:
i := i8(u);
neg = i < 0;
u = u128(abs(i128(i)));
i := i8(u)
neg = i < 0
u = u128(abs(i128(i)))
case 16:
i := i16(u);
neg = i < 0;
u = u128(abs(i128(i)));
i := i16(u)
neg = i < 0
u = u128(abs(i128(i)))
case 32:
i := i32(u);
neg = i < 0;
u = u128(abs(i128(i)));
i := i32(u)
neg = i < 0
u = u128(abs(i128(i)))
case 64:
i := i64(u);
neg = i < 0;
u = u128(abs(i128(i)));
i := i64(u)
neg = i < 0
u = u128(abs(i128(i)))
case 128:
i := i128(u);
neg = i < 0;
u = u128(abs(i));
i := i128(u)
neg = i < 0
u = u128(abs(i))
case:
panic("is_integer_negative: Unknown integer size");
panic("is_integer_negative: Unknown integer size")
}
}
return;
return
}
// import "core:runtime"
append_bits_128 :: proc(buf: []byte, x: u128, base: int, is_signed: bool, bit_size: int, digits: string, flags: Int_Flags) -> string {
if base < 2 || base > MAX_BASE {
panic("strconv: illegal base passed to append_bits");
panic("strconv: illegal base passed to append_bits")
}
a: [140]byte;
i := len(a);
u, neg := is_integer_negative_128(x, is_signed, bit_size);
b := u128(base);
a: [140]byte
i := len(a)
u, neg := is_integer_negative_128(x, is_signed, bit_size)
b := u128(base)
for u >= b && i >= 0 {
i-=1;
i-=1
// rem: u128;
// u = runtime.udivmod128(u, b, &rem);
// u /= b;
rem := u % b;
u /= b;
rem := u % b
u /= b
idx := u32(rem);
a[i] = digits[idx];
idx := u32(rem)
a[i] = digits[idx]
}
i-=1; a[i] = digits[u64(u % b)];
i-=1; a[i] = digits[u64(u % b)]
if .Prefix in flags {
ok := true;
ok := true
switch base {
case 2: i-=1; a[i] = 'b';
case 8: i-=1; a[i] = 'o';
case 10: i-=1; a[i] = 'd';
case 12: i-=1; a[i] = 'z';
case 16: i-=1; a[i] = 'x';
case: ok = false;
case 2: i-=1; a[i] = 'b'
case 8: i-=1; a[i] = 'o'
case 10: i-=1; a[i] = 'd'
case 12: i-=1; a[i] = 'z'
case 16: i-=1; a[i] = 'x'
case: ok = false
}
if ok {
i-=1; a[i] = '0';
i-=1; a[i] = '0'
}
}
switch {
case neg:
i-=1; a[i] = '-';
i-=1; a[i] = '-'
case .Plus in flags:
i-=1; a[i] = '+';
i-=1; a[i] = '+'
case .Space in flags:
i-=1; a[i] = ' ';
i-=1; a[i] = ' '
}
out := a[i:];
copy(buf, out);
return string(buf[0:len(out)]);
out := a[i:]
copy(buf, out)
return string(buf[0:len(out)])
}