gotosocial/vendor/github.com/tdewolff/parse/v2/strconv/number.go
kim d2f13e7564 [chore] update direct Go dependencies (#4162)
- update gruf/go-stroage v0.2.0 -> v0.2.1
- update KimMachineGun/automemlimit v0.7.1 -> v0.7.2
- update miekg/dns v1.1.65 -> v1.1.66
- update ncruces/go-sqlite3 v0.25.1 -> v0.25.2
- update spf13/cast v1.7.1 -> v1.8.0
- update tdewolff/minify/v2 v2.23.1 -> v2.23.5
- update x/crypto v0.37.0 -> v0.38.0
- update x/image v0.26.0 -> v0.27.0
- update x/net v0.39.0 -> v0.40.0
- update x/oauth2 v0.29.0 -> v0.30.0
- update x/sys v0.32.0 -> v0.33.0
- update x/text v0.24.0 -> v0.25.0

Reviewed-on: https://codeberg.org/superseriousbusiness/gotosocial/pulls/4162
Co-authored-by: kim <grufwub@gmail.com>
Co-committed-by: kim <grufwub@gmail.com>
2025-05-10 14:27:25 +00:00

125 lines
2.3 KiB
Go

package strconv
import (
"math"
"unicode/utf8"
)
// ParseNumber parses a byte-slice and returns the number it represents and the amount of decimals.
// If an invalid character is encountered, it will stop there.
func ParseNumber(b []byte, groupSym rune, decSym rune) (int64, int, int) {
n, dec := 0, 0
sign := int64(1)
num := int64(0)
hasDecimals := false
if 0 < len(b) && b[0] == '-' {
sign = -1
n++
}
for n < len(b) {
if '0' <= b[n] && b[n] <= '9' {
digit := sign * int64(b[n]-'0')
if sign == 1 && (math.MaxInt64/10 < num || math.MaxInt64-digit < num*10) {
break
} else if sign == -1 && (num < math.MinInt64/10 || num*10 < math.MinInt64-digit) {
break
}
num *= 10
num += digit
if hasDecimals {
dec++
}
n++
} else if r, size := utf8.DecodeRune(b[n:]); !hasDecimals && (r == groupSym || r == decSym) {
if r == decSym {
hasDecimals = true
}
n += size
} else {
break
}
}
return num, dec, n
}
// AppendNumber will append an int64 formatted as a number with the given number of decimal digits.
func AppendNumber(b []byte, num int64, dec int, groupSize int, groupSym rune, decSym rune) []byte {
if dec < 0 {
dec = 0
}
if utf8.RuneLen(groupSym) == -1 {
groupSym = '.'
}
if utf8.RuneLen(decSym) == -1 {
decSym = ','
}
sign := int64(1)
if num < 0 {
sign = -1
}
// calculate size
n := LenInt(num)
if dec < n && 0 < groupSize && groupSym != 0 {
n += utf8.RuneLen(groupSym) * (n - dec - 1) / groupSize
}
if 0 < dec {
if n <= dec {
n = 1 + dec // zero and decimals
}
n += utf8.RuneLen(decSym)
}
if sign == -1 {
n++
}
// resize byte slice
i := len(b)
if cap(b) < i+n {
b = append(b, make([]byte, n)...)
} else {
b = b[:i+n]
}
// print fractional-part
i += n - 1
if 0 < dec {
for 0 < dec {
c := byte(sign*(num%10)) + '0'
num /= 10
b[i] = c
dec--
i--
}
i -= utf8.RuneLen(decSym)
utf8.EncodeRune(b[i+1:], decSym)
}
// print integer-part
if num == 0 {
b[i] = '0'
if sign == -1 {
b[i-1] = '-'
}
return b
}
j := 0
for num != 0 {
if 0 < groupSize && groupSym != 0 && 0 < j && j%groupSize == 0 {
i -= utf8.RuneLen(groupSym)
utf8.EncodeRune(b[i+1:], groupSym)
}
c := byte(sign*(num%10)) + '0'
num /= 10
b[i] = c
i--
j++
}
if sign == -1 {
b[i] = '-'
}
return b
}