vieter-v
/
v
2
0
Fork 0
Code Issues Pull Requests Releases Activity

strconv: optimize functions 

also make it the responsibility if the caller to properly trim whitespace
pull/2404/head
joe-conigliaro 2019-10-18 16:20:03 +11:00 committed by Alexander Medvednikov
parent c355e967ad
commit 6dea2359ab
1 changed files with 72 additions and 74 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

78
vlib/strconv/atoi.v
View File

@ -20,17 +20,17 @@ fn byte_to_lower(c byte) byte {
}
// parse_uint is like parse_int but for unsigned numbers.
pub fn parse_uint(_s string, _base int, _bit_size int) u64 {
mut s := _s.trim_space()
pub fn parse_uint(s string, _base int, _bit_size int) u64 {
mut bit_size := _bit_size
mut base := _base
if s == "" || !underscore_ok(s) {
if s.len < 1 || !underscore_ok(s) {
// return error('parse_uint: syntax error $s')
return u64(0)
}
base0 := base == 0
s0 := s
mut start_index := 0
if 2 <= base && base <= 36 {
// valid base; nothing to do
} else if base == 0 {
@ -39,30 +39,30 @@ pub fn parse_uint(_s string, _base int, _bit_size int) u64 {
if s[0] == `0` {
if s.len >= 3 && byte_to_lower(s[1]) == `b` {
base = 2
s = s.right(2)
start_index += 2
}
else if s.len >= 3 && byte_to_lower(s[1]) == `o` {
base = 8
s = s.right(2)
start_index += 2
}
else if s.len >= 3 && byte_to_lower(s[1]) == `x` {
base = 16
s = s.right(2)
start_index += 2
}
else {
base = 8
s = s.right(1)
start_index++
}
}
} else {
// return error('parse_uint: base error $s0 - $base')
// return error('parse_uint: base error $s - $base')
return u64(0)
}
if bit_size == 0 {
bit_size = int(int_size)
} else if bit_size < 0 || bit_size > 64 {
// return error('parse_uint: bitsize error $s0 - $bit_size')
// return error('parse_uint: bitsize error $s - $bit_size')
return u64(0)
}
@ -70,18 +70,17 @@ pub fn parse_uint(_s string, _base int, _bit_size int) u64 {
// Use compile-time constants for common cases.
cutoff := u64(max_u64/u64(base)) + u64(1)
max_val := if bit_size == 64 {
// TODO: investigate
// u64(1)<<64(bit_size) - u64(1)
max_u64
} else {
u64(u32(1)<<u32(bit_size - u32(1)))
u64(u64(1)<<u64(bit_size))-u64(1)
}
mut underscores := false
mut n := u64(0)
for _, c in s {
mut d := byte(0)
for i in start_index..s.len {
c := s[i]
cl := byte_to_lower(c)
mut d := byte(0)
if c == `_` && base0 {
// underscore_ok already called
underscores = true
@ -90,29 +89,29 @@ pub fn parse_uint(_s string, _base int, _bit_size int) u64 {
else if `0` <= c && c <= `9` { d = c - `0` }
else if `a` <= cl && cl <= `z` { d = cl - `a` + 10 }
else {
// return error('parse_uint: syntax error $s0')
// return error('parse_uint: syntax error $s')
return u64(0)
}
if d >= byte(base) {
// return error('parse_uint: syntax error $s0')
// return error('parse_uint: syntax error $s')
return u64(0)
}
if n >= cutoff {
// n*base overflows
// return error('parse_uint: range error $s0')
// return error('parse_uint: range error $s')
return max_val
}
n *= u64(base)
n1 := n + u64(d)
if n1 < n || n1 > u64(max_val) {
if n1 < n || n1 > max_val {
// n+v overflows
// return error('parse_uint: range error $s0')
// return error('parse_uint: range error $s')
return max_val
}
n = n1
}
if underscores && !underscore_ok(s0) {
// return error('parse_uint: syntax error $s0')
if underscores && !underscore_ok(s) {
// return error('parse_uint: syntax error $s')
return u64(0)
}
@ -135,12 +134,11 @@ pub fn parse_int(_s string, base int, _bit_size int) i64 {
mut s := _s
mut bit_size := _bit_size
if s == '' {
if s.len < 1 {
// return error('parse_int: syntax error $s')
return i64(0)
}
// Pick off leading sign.
s0 := s
mut neg := false
if s[0] == `+` {
s = s.right(1)
@ -178,24 +176,22 @@ pub fn parse_int(_s string, base int, _bit_size int) i64 {
// atoi is equivalent to parse_int(s, 10, 0), converted to type int.
pub fn atoi(_s string) int {
mut s := _s
pub fn atoi(s string) int {
if (int_size == 32 && (0 < s.len && s.len < 10)) ||
(int_size == 64 && (0 < s.len && s.len < 19)) {
// Fast path for small integers that fit int type.
s0 := s
mut start_idx := 0
if s[0] == `-` || s[0] == `+` {
s = s.right(1)
if s.len < 1 {
start_idx++
if s.len-start_idx < 1 {
// return 0, &NumError{fnAtoi, s0, ErrSyntax}
return 0
}
}
mut n := 0
for _, ch0 in s {
ch := ch0 - `0`
for i in start_idx..s.len {
ch := s[i] - `0`
if ch > 9 {
// return 0, &NumError{fnAtoi, s0, ErrSyntax}
return 0
@ -203,7 +199,7 @@ pub fn atoi(_s string) int {
n = n*10 + int(ch)
}
return if s0[0] == `-` { -n } else { n }
return if s[0] == `-` { -n } else { n }
}
// Slow path for invalid, big, or underscored integers.
@ -215,8 +211,7 @@ pub fn atoi(_s string) int {
// underscore_ok reports whether the underscores in s are allowed.
// Checking them in this one function lets all the parsers skip over them simply.
// Underscore must appear only between digits or between a base prefix and a digit.
fn underscore_ok(_s string) bool {
mut s := _s
fn underscore_ok(s string) bool {
// saw tracks the last character (class) we saw:
// ^ for beginning of number,
// 0 for a digit or base prefix,
@ -227,21 +222,23 @@ fn underscore_ok(_s string) bool {
// Optional sign.
if s.len >= 1 && (s[0] == `-` || s[0] == `+`) {
s = s.right(1)
i++
}
// Optional base prefix.
mut hex := false
if s.len >= 2 && s[0] == `0` && (byte_to_lower(s[1]) == `b` || byte_to_lower(s[1]) == `o` || byte_to_lower(s[1]) == `x`) {
i = 2
if s.len-i >= 2 && s[i] == `0` &&
(byte_to_lower(s[i+1]) == `b` || byte_to_lower(s[i+1]) == `o` || byte_to_lower(s[i+1]) == `x`) {
saw = `0` // base prefix counts as a digit for "underscore as digit separator"
hex = byte_to_lower(s[1]) == `x`
hex = byte_to_lower(s[i+1]) == `x`
i+=2
}
// Number proper.
for ; i < s.len; i++ {
// Digits are always okay.
if (`0` <= s[i] && s[i] <= `9`) || (hex && `a` <= byte_to_lower(s[i]) && byte_to_lower(s[i]) <= `f`) {
if (`0` <= s[i] && s[i] <= `9`) ||
(hex && `a` <= byte_to_lower(s[i]) && byte_to_lower(s[i]) <= `f`) {
saw = `0`
continue
}
@ -262,3 +259,4 @@ fn underscore_ok(_s string) bool {
}
return saw != `_`
}