VictoriaMetrics/vendor/github.com/valyala/fastjson/fastfloat/parse.go

251 lines
4.3 KiB
Go
Raw Normal View History

2019-05-22 21:16:55 +00:00
package fastfloat
import (
"math"
"strconv"
"strings"
2019-05-22 21:16:55 +00:00
)
// ParseUint64BestEffort parses uint64 number s.
//
// It is equivalent to strconv.ParseUint(s, 10, 64), but is faster.
//
// 0 is returned if the number cannot be parsed.
func ParseUint64BestEffort(s string) uint64 {
if len(s) == 0 {
return 0
}
i := uint(0)
d := uint64(0)
j := i
for i < uint(len(s)) {
if s[i] >= '0' && s[i] <= '9' {
d = d*10 + uint64(s[i]-'0')
i++
if i > 18 {
// The integer part may be out of range for uint64.
// Fall back to slow parsing.
dd, err := strconv.ParseUint(s, 10, 64)
if err != nil {
return 0
}
return dd
}
continue
}
break
}
if i <= j {
return 0
}
if i < uint(len(s)) {
// Unparsed tail left.
return 0
}
return d
}
// ParseInt64BestEffort parses int64 number s.
//
// It is equivalent to strconv.ParseInt(s, 10, 64), but is faster.
//
// 0 is returned if the number cannot be parsed.
func ParseInt64BestEffort(s string) int64 {
if len(s) == 0 {
return 0
}
i := uint(0)
minus := s[0] == '-'
if minus {
i++
if i >= uint(len(s)) {
return 0
}
}
d := int64(0)
j := i
for i < uint(len(s)) {
if s[i] >= '0' && s[i] <= '9' {
d = d*10 + int64(s[i]-'0')
i++
if i > 18 {
// The integer part may be out of range for int64.
// Fall back to slow parsing.
dd, err := strconv.ParseInt(s, 10, 64)
if err != nil {
return 0
}
return dd
}
continue
}
break
}
if i <= j {
return 0
}
if i < uint(len(s)) {
// Unparsed tail left.
return 0
}
if minus {
d = -d
}
return d
}
// Exact powers of 10.
//
// This works faster than math.Pow10, since it avoids additional multiplication.
var float64pow10 = [...]float64{
1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, 1e12, 1e13, 1e14, 1e15, 1e16,
}
2019-05-22 21:16:55 +00:00
// ParseBestEffort parses floating-point number s.
//
// It is equivalent to strconv.ParseFloat(s, 64), but is faster.
//
// 0 is returned if the number cannot be parsed.
func ParseBestEffort(s string) float64 {
if len(s) == 0 {
return 0
}
i := uint(0)
minus := s[0] == '-'
if minus {
i++
if i >= uint(len(s)) {
return 0
}
}
d := uint64(0)
j := i
for i < uint(len(s)) {
if s[i] >= '0' && s[i] <= '9' {
d = d*10 + uint64(s[i]-'0')
i++
if i > 18 {
// The integer part may be out of range for uint64.
// Fall back to slow parsing.
f, err := strconv.ParseFloat(s, 64)
if err != nil && !math.IsInf(f, 0) {
return 0
}
return f
}
continue
}
break
}
if i <= j {
if strings.EqualFold(s[i:], "inf") {
if minus {
return -inf
}
return inf
}
if strings.EqualFold(s[i:], "nan") {
return nan
}
2019-05-22 21:16:55 +00:00
return 0
}
f := float64(d)
if i >= uint(len(s)) {
// Fast path - just integer.
if minus {
f = -f
}
return f
}
if s[i] == '.' {
// Parse fractional part.
i++
if i >= uint(len(s)) {
return 0
}
k := i
2019-05-22 21:16:55 +00:00
for i < uint(len(s)) {
if s[i] >= '0' && s[i] <= '9' {
d = d*10 + uint64(s[i]-'0')
2019-05-22 21:16:55 +00:00
i++
if i-j >= uint(len(float64pow10)) {
// The mantissa is out of range. Fall back to standard parsing.
2019-05-22 21:16:55 +00:00
f, err := strconv.ParseFloat(s, 64)
if err != nil && !math.IsInf(f, 0) {
return 0
}
return f
}
continue
}
break
}
if i < k {
2019-05-22 21:16:55 +00:00
return 0
}
// Convert the entire mantissa to a float at once to avoid rounding errors.
f = float64(d) / float64pow10[i-k]
2019-05-22 21:16:55 +00:00
if i >= uint(len(s)) {
// Fast path - parsed fractional number.
if minus {
f = -f
}
return f
}
}
if s[i] == 'e' || s[i] == 'E' {
// Parse exponent part.
i++
if i >= uint(len(s)) {
return 0
}
expMinus := false
if s[i] == '+' || s[i] == '-' {
expMinus = s[i] == '-'
i++
if i >= uint(len(s)) {
return 0
}
}
exp := int16(0)
j := i
for i < uint(len(s)) {
if s[i] >= '0' && s[i] <= '9' {
exp = exp*10 + int16(s[i]-'0')
i++
if exp > 300 {
// The exponent may be too big for float64.
// Fall back to standard parsing.
f, err := strconv.ParseFloat(s, 64)
if err != nil && !math.IsInf(f, 0) {
return 0
}
return f
}
continue
}
break
}
if i <= j {
return 0
}
if expMinus {
exp = -exp
}
f *= math.Pow10(int(exp))
if i >= uint(len(s)) {
if minus {
f = -f
}
return f
}
}
return 0
}
var inf = math.Inf(1)
var nan = math.NaN()