mirror/v
1
0
Fork 0
mirror of https://github.com/vlang/v.git synced 2023-08-10 21:13:21 +03:00
Code Issues Projects Releases Wiki Activity

all: byte => u8

Browse Source
This commit is contained in:
Alexander Medvednikov
2022-04-15 14:45:52 +03:00
parent 7f3b91e688
commit 014c3c97f0
38 changed files with 201 additions and 201 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
vlib/strconv/atoi.v
View File

@@ -98,7 +98,7 @@ pub fn common_parse_uint2(s string, _base int, _bit_size int) (u64, int) {
} else {
return n, i + 1
}
if d >= byte(base) {
if d >= u8(base) {
return n, i + 1
}
if n >= cutoff {

26
vlib/strconv/f32_str.c.v
View File

@@ -64,7 +64,7 @@ pub fn (d Dec32) get_string_32(neg bool, i_n_digit int, i_pad_digit int) string
fw_zeros = pad_digit - out_len
}
mut buf := []byte{len: int(out_len + 5 + 1 + 1)} // sign + mant_len + . + e + e_sign + exp_len(2) + \0}
mut buf := []u8{len: int(out_len + 5 + 1 + 1)} // sign + mant_len + . + e + e_sign + exp_len(2) + \0}
mut i := 0
if neg {
@@ -92,7 +92,7 @@ pub fn (d Dec32) get_string_32(neg bool, i_n_digit int, i_pad_digit int) string
y := i + out_len
mut x := 0
for x < (out_len - disp - 1) {
buf[y - x] = `0` + byte(out % 10)
buf[y - x] = `0` + u8(out % 10)
out /= 10
i++
x++
@@ -102,7 +102,7 @@ pub fn (d Dec32) get_string_32(neg bool, i_n_digit int, i_pad_digit int) string
if i_n_digit == 0 {
unsafe {
buf[i] = 0
return tos(&byte(&buf[0]), i)
return tos(&u8(&buf[0]), i)
}
}
@@ -113,7 +113,7 @@ pub fn (d Dec32) get_string_32(neg bool, i_n_digit int, i_pad_digit int) string
}
if y - x >= 0 {
buf[y - x] = `0` + byte(out % 10)
buf[y - x] = `0` + u8(out % 10)
i++
}
@@ -139,14 +139,14 @@ pub fn (d Dec32) get_string_32(neg bool, i_n_digit int, i_pad_digit int) string
// Always print two digits to match strconv's formatting.
d1 := exp % 10
d0 := exp / 10
buf[i] = `0` + byte(d0)
buf[i] = `0` + u8(d0)
i++
buf[i] = `0` + byte(d1)
buf[i] = `0` + u8(d1)
i++
buf[i] = 0
return unsafe {
tos(&byte(&buf[0]), i)
tos(&u8(&buf[0]), i)
}
}
@@ -197,7 +197,7 @@ fn f32_to_decimal(mant u32, exp u32) Dec32 {
mut e10 := 0
mut vm_is_trailing_zeros := false
mut vr_is_trailing_zeros := false
mut last_removed_digit := byte(0)
mut last_removed_digit := u8(0)
if e2 >= 0 {
q := log10_pow2(e2)
@@ -215,7 +215,7 @@ fn f32_to_decimal(mant u32, exp u32) Dec32 {
// we've found that 32-bit arithmetic is faster even on
// 64-bit machines.
l := pow5_inv_num_bits_32 + pow5_bits(int(q - 1)) - 1
last_removed_digit = byte(mul_pow5_invdiv_pow2(mv, q - 1, -e2 + int(q - 1) + l) % 10)
last_removed_digit = u8(mul_pow5_invdiv_pow2(mv, q - 1, -e2 + int(q - 1) + l) % 10)
}
if q <= 9 {
// The largest power of 5 that fits in 24 bits is 5^10,
@@ -240,7 +240,7 @@ fn f32_to_decimal(mant u32, exp u32) Dec32 {
vm = mul_pow5_div_pow2(mm, u32(i), j)
if q != 0 && ((vp - 1) / 10) <= vm / 10 {
j = int(q) - 1 - (pow5_bits(i + 1) - pow5_num_bits_32)
last_removed_digit = byte(mul_pow5_div_pow2(mv, u32(i + 1), j) % 10)
last_removed_digit = u8(mul_pow5_div_pow2(mv, u32(i + 1), j) % 10)
}
if q <= 1 {
// {vr,vp,vm} is trailing zeros if {mv,mp,mm} has at
@@ -270,7 +270,7 @@ fn f32_to_decimal(mant u32, exp u32) Dec32 {
for vp / 10 > vm / 10 {
vm_is_trailing_zeros = vm_is_trailing_zeros && (vm % 10) == 0
vr_is_trailing_zeros = vr_is_trailing_zeros && (last_removed_digit == 0)
last_removed_digit = byte(vr % 10)
last_removed_digit = u8(vr % 10)
vr /= 10
vp /= 10
vm /= 10
@@ -279,7 +279,7 @@ fn f32_to_decimal(mant u32, exp u32) Dec32 {
if vm_is_trailing_zeros {
for vm % 10 == 0 {
vr_is_trailing_zeros = vr_is_trailing_zeros && (last_removed_digit == 0)
last_removed_digit = byte(vr % 10)
last_removed_digit = u8(vr % 10)
vr /= 10
vp /= 10
vm /= 10
@@ -301,7 +301,7 @@ fn f32_to_decimal(mant u32, exp u32) Dec32 {
// are relative to this. Loop iterations below (approximately):
// 0: 13.6%, 1: 70.7%, 2: 14.1%, 3: 1.39%, 4: 0.14%, 5+: 0.01%
for vp / 10 > vm / 10 {
last_removed_digit = byte(vr % 10)
last_removed_digit = u8(vr % 10)
vr /= 10
vp /= 10
vm /= 10

22
vlib/strconv/f64_str.c.v
View File

@@ -35,7 +35,7 @@ fn (d Dec64) get_string_64(neg bool, i_n_digit int, i_pad_digit int) string {
fw_zeros = pad_digit - out_len
}
mut buf := []byte{len: (out_len + 6 + 1 + 1 + fw_zeros)} // sign + mant_len + . + e + e_sign + exp_len(2) + \0}
mut buf := []u8{len: (out_len + 6 + 1 + 1 + fw_zeros)} // sign + mant_len + . + e + e_sign + exp_len(2) + \0}
mut i := 0
if neg {
@@ -68,7 +68,7 @@ fn (d Dec64) get_string_64(neg bool, i_n_digit int, i_pad_digit int) string {
y := i + out_len
mut x := 0
for x < (out_len - disp - 1) {
buf[y - x] = `0` + byte(out % 10)
buf[y - x] = `0` + u8(out % 10)
out /= 10
i++
x++
@@ -78,7 +78,7 @@ fn (d Dec64) get_string_64(neg bool, i_n_digit int, i_pad_digit int) string {
if i_n_digit == 0 {
unsafe {
buf[i] = 0
return tos(&byte(&buf[0]), i)
return tos(&u8(&buf[0]), i)
}
}
@@ -89,7 +89,7 @@ fn (d Dec64) get_string_64(neg bool, i_n_digit int, i_pad_digit int) string {
}
if y - x >= 0 {
buf[y - x] = `0` + byte(out % 10)
buf[y - x] = `0` + u8(out % 10)
i++
}
@@ -118,17 +118,17 @@ fn (d Dec64) get_string_64(neg bool, i_n_digit int, i_pad_digit int) string {
d1 := exp % 10
d0 := exp / 10
if d0 > 0 {
buf[i] = `0` + byte(d0)
buf[i] = `0` + u8(d0)
i++
}
buf[i] = `0` + byte(d1)
buf[i] = `0` + u8(d1)
i++
buf[i] = `0` + byte(d2)
buf[i] = `0` + u8(d2)
i++
buf[i] = 0
return unsafe {
tos(&byte(&buf[0]), i)
tos(&u8(&buf[0]), i)
}
}
@@ -243,7 +243,7 @@ fn f64_to_decimal(mant u64, exp u64) Dec64 {
// Step 4: Find the shortest decimal representation
// in the interval of valid representations.
mut removed := 0
mut last_removed_digit := byte(0)
mut last_removed_digit := u8(0)
mut out := u64(0)
// On average, we remove ~2 digits.
if vm_is_trailing_zeros || vr_is_trailing_zeros {
@@ -259,7 +259,7 @@ fn f64_to_decimal(mant u64, exp u64) Dec64 {
vr_mod_10 := vr % 10
vm_is_trailing_zeros = vm_is_trailing_zeros && vm_mod_10 == 0
vr_is_trailing_zeros = vr_is_trailing_zeros && (last_removed_digit == 0)
last_removed_digit = byte(vr_mod_10)
last_removed_digit = u8(vr_mod_10)
vr = vr_div_10
vp = vp_div_10
vm = vm_div_10
@@ -276,7 +276,7 @@ fn f64_to_decimal(mant u64, exp u64) Dec64 {
vr_div_10 := vr / 10
vr_mod_10 := vr % 10
vr_is_trailing_zeros = vr_is_trailing_zeros && (last_removed_digit == 0)
last_removed_digit = byte(vr_mod_10)
last_removed_digit = u8(vr_mod_10)
vr = vr_div_10
vp = vp_div_10
vm = vm_div_10

8
vlib/strconv/format_mem.c.v
View File

@@ -95,7 +95,7 @@ pub fn format_dec_sb(d u64, p BF_param, mut res strings.Builder) {
//===========================================
// Speed version
// max u64 18446744073709551615 => 20 byte
mut buf := [32]byte{}
mut buf := [32]u8{}
mut i := 20
mut n := d
mut d_i := u64(0)
@@ -147,7 +147,7 @@ pub fn f64_to_str_lnd1(f f64, dec_digit int) string {
m_sgn_flag := false
mut sgn := 1
mut b := [26]byte{}
mut b := [26]u8{}
mut d_pos := 1
mut i := 0
mut i1 := 0
@@ -209,7 +209,7 @@ pub fn f64_to_str_lnd1(f f64, dec_digit int) string {
// allocate exp+32 chars for the return string
// mut res := []byte{len:exp+32,init:`0`}
mut res := []byte{len: exp + 32, init: 0}
mut res := []u8{len: exp + 32, init: 0}
mut r_i := 0 // result string buffer index
// println("s:${sgn} b:${b[0]} es:${exp_sgn} exp:${exp}")
@@ -490,7 +490,7 @@ pub fn remove_tail_zeros(s string) string {
mut i_s1 := i_s + 1
mut sum := 0
for i_s1 < s.len && s[i_s1] >= `0` && s[i_s1] <= `9` {
sum += s[i_s1] - byte(`0`)
sum += s[i_s1] - u8(`0`)
i_s1++
}
// decimal part must be copied

8
vlib/strconv/utilities.c.v
View File

@@ -68,7 +68,7 @@ pub fn fxx_to_str_l_parse(s string) string {
m_sgn_flag := false
mut sgn := 1
mut b := [26]byte{}
mut b := [26]u8{}
mut d_pos := 1
mut i := 0
mut i1 := 0
@@ -119,7 +119,7 @@ pub fn fxx_to_str_l_parse(s string) string {
}
// allocate exp+32 chars for the return string
mut res := []byte{len: exp + 32, init: 0}
mut res := []u8{len: exp + 32, init: 0}
mut r_i := 0 // result string buffer index
// println("s:${sgn} b:${b[0]} es:${exp_sgn} exp:${exp}")
@@ -191,7 +191,7 @@ pub fn fxx_to_str_l_parse_no_dot(s string) string {
m_sgn_flag := false
mut sgn := 1
mut b := [26]byte{}
mut b := [26]u8{}
mut d_pos := 1
mut i := 0
mut i1 := 0
@@ -242,7 +242,7 @@ pub fn fxx_to_str_l_parse_no_dot(s string) string {
}
// allocate exp+32 chars for the return string
mut res := []byte{len: exp + 32, init: 0}
mut res := []u8{len: exp + 32, init: 0}
mut r_i := 0 // result string buffer index
// println("s:${sgn} b:${b[0]} es:${exp_sgn} exp:${exp}")