-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathbase91.go
220 lines (189 loc) · 6.71 KB
/
base91.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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
/*
* A Go implementation of Joachim Henke's code from http://base91.sourceforge.net.
*
* Original by Joachim Henke, this implementation by Michael Traver.
* License from Joachim Henke's source:
*
* Copyright (c) 2000-2006 Joachim Henke
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* - Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
* - Neither the name of Joachim Henke nor the names of his contributors may be
* used to endorse or promote products derived from this software without
* specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
* ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
// Package base91 implements base91 encoding.
package base91
import (
"fmt"
"math"
)
// An Encoding is a base 91 encoding/decoding scheme defined by a 91-character alphabet.
type Encoding struct {
encode [91]byte
decodeMap [256]byte
}
// encodeStd is the standard base91 encoding alphabet (that is, the one specified
// at http://base91.sourceforge.net). Of the 95 printable ASCII characters, the
// following four are omitted: space (0x20), apostrophe (0x27), hyphen (0x2d),
// and backslash (0x5c).
const encodeStd = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789!#$%&()*+,./:;<=>?@[]^_`{|}~\""
// NewEncoding returns a new Encoding defined by the given alphabet, which must
// be a 91-byte string that does not contain CR or LF ('\r', '\n').
func NewEncoding(encoder string) *Encoding {
if len(encoder) != 91 {
panic("encoding alphabet is not 91 bytes long")
}
for i := 0; i < len(encoder); i++ {
if encoder[i] == '\n' || encoder[i] == '\r' {
panic("encoding alphabet contains newline character")
}
}
e := new(Encoding)
copy(e.encode[:], encoder)
for i := 0; i < len(e.decodeMap); i++ {
// 0xff indicates that this entry in the decode map is not in the encoding alphabet.
e.decodeMap[i] = 0xff
}
for i := 0; i < len(encoder); i++ {
e.decodeMap[encoder[i]] = byte(i)
}
return e
}
// StdEncoding is the standard base91 encoding (that is, the one specified
// at http://base91.sourceforge.net). Of the 95 printable ASCII characters,
// the following four are omitted: space (0x20), apostrophe (0x27),
// hyphen (0x2d), and backslash (0x5c).
var StdEncoding = NewEncoding(encodeStd)
/*
* Encoder
*/
// Encode encodes src using the encoding enc, writing bytes to dst.
// It returns the number of bytes written, because the exact output size cannot
// be known before encoding takes place. EncodedLen(len(src)) may be used to
// determine an upper bound on the output size when allocating a dst slice.
func (enc *Encoding) Encode(dst, src []byte) int {
var queue, numBits uint
n := 0
for i := 0; i < len(src); i++ {
queue |= uint(src[i]) << numBits
numBits += 8
if numBits > 13 {
var v uint = queue & 8191
if v > 88 {
queue >>= 13
numBits -= 13
} else {
// We can take 14 bits.
v = queue & 16383
queue >>= 14
numBits -= 14
}
dst[n] = enc.encode[v%91]
n++
dst[n] = enc.encode[v/91]
n++
}
}
if numBits > 0 {
dst[n] = enc.encode[queue%91]
n++
if numBits > 7 || queue > 90 {
dst[n] = enc.encode[queue/91]
n++
}
}
return n
}
// EncodeToString returns the base91 encoding of src.
func (enc *Encoding) EncodeToString(src []byte) string {
buf := make([]byte, enc.EncodedLen(len(src)))
n := enc.Encode(buf, src)
return string(buf[:n])
}
// EncodedLen returns an upper bound on the length in bytes of the base91 encoding
// of an input buffer of length n. The true encoded length may be shorter.
func (enc *Encoding) EncodedLen(n int) int {
// At worst, base91 encodes 13 bits into 16 bits. Even though 14 bits can
// sometimes be encoded into 16 bits, assume the worst case to get the upper
// bound on encoded length.
return int(math.Ceil(float64(n) * 16.0 / 13.0))
}
/*
* Decoder
*/
// A CorruptInputError is returned if invalid base91 data is encountered during decoding.
type CorruptInputError int64
func (e CorruptInputError) Error() string {
return fmt.Sprintf("illegal base91 data at input byte %d", int64(e))
}
// Decode decodes src using the encoding enc. It writes at most DecodedLen(len(src))
// bytes to dst and returns the number of bytes written. If src contains invalid base91
// data, it will return the number of bytes successfully written and CorruptInputError.
func (enc *Encoding) Decode(dst, src []byte) (int, error) {
var queue, numBits uint
var v int = -1
n := 0
for i := 0; i < len(src); i++ {
if enc.decodeMap[src[i]] == 0xff {
// The character is not in the encoding alphabet.
return n, CorruptInputError(i)
}
if v == -1 {
// Start the next value.
v = int(enc.decodeMap[src[i]])
} else {
v += int(enc.decodeMap[src[i]]) * 91
queue |= uint(v) << numBits
if (v & 8191) > 88 {
numBits += 13
} else {
numBits += 14
}
for ok := true; ok; ok = (numBits > 7) {
dst[n] = byte(queue)
n++
queue >>= 8
numBits -= 8
}
// Mark this value complete.
v = -1
}
}
if v != -1 {
dst[n] = byte(queue | uint(v)<<numBits)
n++
}
return n, nil
}
// DecodeString returns the bytes represented by the base91 string s.
func (enc *Encoding) DecodeString(s string) ([]byte, error) {
dbuf := make([]byte, enc.DecodedLen(len(s)))
n, err := enc.Decode(dbuf, []byte(s))
return dbuf[:n], err
}
// DecodedLen returns the maximum length in bytes of the decoded data
// corresponding to n bytes of base91-encoded data.
func (enc *Encoding) DecodedLen(n int) int {
// At best, base91 encodes 14 bits into 16 bits, so assume that the input is
// optimally encoded to get the upper bound on decoded length.
return int(math.Ceil(float64(n) * 14.0 / 16.0))
}