-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathbase.go
104 lines (80 loc) · 1.78 KB
/
base.go
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
package k4id
import (
"bytes"
"errors"
)
var Base36 = NewBase([]rune("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"))
var Base63 = NewBase([]rune("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz?"))
func NewBase(alpha []rune) *Base {
b := &Base{
base: len(alpha),
alpha: alpha,
baseMap: make(map[rune]int),
}
for i := 0; i < b.base; i++ {
b.baseMap[b.alpha[i]] = i
}
return b
}
type Base struct {
base int
alpha []rune
baseMap map[rune]int
}
func (b Base) Encode(source []byte) string {
if len(source) == 0 {
return ""
}
digits := []int{0}
for i := 0; i < len(source); i++ {
carry := int(source[i])
for j := 0; j < len(digits); j++ {
carry += digits[j] << 8
digits[j] = carry % b.base
carry = carry / b.base
}
for carry > 0 {
digits = append(digits, carry%b.base)
carry = carry / b.base
}
}
var res bytes.Buffer
for k := 0; source[k] == 0 && k < len(source)-1; k++ {
res.WriteRune(b.alpha[0])
}
for q := len(digits) - 1; q >= 0; q-- {
res.WriteRune(b.alpha[digits[q]])
}
return res.String()
}
func (b Base) Decode(source string) ([]byte, error) {
if len(source) == 0 {
return []byte{}, nil
}
runes := []rune(source)
byts := []byte{0}
for i := 0; i < len(runes); i++ {
value, ok := b.baseMap[runes[i]]
if !ok {
return nil, errors.New("non base62 character")
}
carry := value
for j := 0; j < len(byts); j++ {
carry += int(byts[j]) * b.base
byts[j] = byte(carry & 0xff)
carry >>= 8
}
for carry > 0 {
byts = append(byts, byte(carry&0xff))
carry >>= 8
}
}
for k := 0; runes[k] == b.alpha[0] && k < len(runes)-1; k++ {
byts = append(byts, 0)
}
// Reverse bytes
for i, j := 0, len(byts)-1; i < j; i, j = i+1, j-1 {
byts[i], byts[j] = byts[j], byts[i]
}
return byts, nil
}