1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
|
package strconv
Int_Flag :: enum {
Prefix,
Plus,
Space,
}
Int_Flags :: bit_set[Int_Flag]
MAX_BASE :: 32
digits := "0123456789abcdefghijklmnopqrstuvwxyz"
is_integer_negative :: proc(x: u64, is_signed: bool, bit_size: int) -> (u: u64, neg: bool) {
u = x
if is_signed {
switch bit_size {
case 8:
i := i8(u)
neg = i < 0
u = u64(abs(i64(i)))
case 16:
i := i16(u)
neg = i < 0
u = u64(abs(i64(i)))
case 32:
i := i32(u)
neg = i < 0
u = u64(abs(i64(i)))
case 64:
i := i64(u)
neg = i < 0
u = u64(abs(i))
case:
panic("is_integer_negative: Unknown integer size")
}
}
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")
}
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]
if .Prefix in flags {
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
}
if ok {
i-=1; a[i] = '0'
}
}
switch {
case neg:
i-=1; a[i] = '-'
case .Plus in flags:
i-=1; a[i] = '+'
case .Space in flags:
i-=1; a[i] = ' '
}
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
if is_signed {
switch bit_size {
case 8:
i := i8(u)
neg = i < 0
u = u128(abs(i128(i)))
case 16:
i := i16(u)
neg = i < 0
u = u128(abs(i128(i)))
case 32:
i := i32(u)
neg = i < 0
u = u128(abs(i128(i)))
case 64:
i := i64(u)
neg = i < 0
u = u128(abs(i128(i)))
case 128:
i := i128(u)
neg = i < 0
u = u128(abs(i))
case:
panic("is_integer_negative: Unknown integer size")
}
}
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")
}
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
// rem: u128;
// u = runtime.udivmod128(u, b, &rem);
// u /= b;
rem := u % b
u /= b
idx := u32(rem)
a[i] = digits[idx]
}
i-=1; a[i] = digits[u64(u % b)]
if .Prefix in flags {
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
}
if ok {
i-=1; a[i] = '0'
}
}
switch {
case neg:
i-=1; a[i] = '-'
case .Plus in flags:
i-=1; a[i] = '+'
case .Space in flags:
i-=1; a[i] = ' '
}
out := a[i:]
copy(buf, out)
return string(buf[0:len(out)])
}
|
