/
collate_raw.go
199 lines (187 loc) · 4 KB
/
collate_raw.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
package walrus
import (
"fmt"
"strconv"
"unicode/utf8"
)
type token int8
// JSON input tokens. The order is significant: it's the collation ordering defined by CouchDB.
const (
kEndArray = token(iota)
kEndObject
kComma
kColon
kNull
kFalse
kTrue
kNumber
kString
kArray
kObject
)
// Collates raw JSON data without unmarshaling it.
// THE INPUTS MUST BE VALID JSON, WITH NO WHITESPACE!
// Invalid input will result in a panic, or perhaps just bogus output.
func (c *JSONCollator) CollateRaw(key1, key2 []byte) int {
depth := 0
for {
c1 := key1[0]
c2 := key2[0]
tok1 := tokenize(c1)
tok2 := tokenize(c2)
// If token types don't match, stop and return their relative ordering:
if tok1 != tok2 {
return compareTokens(tok1, tok2)
} else {
switch tok1 {
case kNull, kTrue:
advance(&key1, 4)
advance(&key2, 4)
case kFalse:
advance(&key1, 5)
advance(&key2, 5)
case kNumber:
if diff := compareFloats(readNumber(&key1), readNumber(&key2)); diff != 0 {
return diff
}
case kString:
if diff := c.compareStrings(c.readString(&key1), c.readString(&key2)); diff != 0 {
return diff
}
case kArray, kObject:
advance(&key1, 1)
advance(&key2, 1)
depth++
case kEndArray, kEndObject:
advance(&key1, 1)
advance(&key2, 1)
depth--
case kComma, kColon:
advance(&key1, 1)
advance(&key2, 1)
}
}
if depth == 0 {
return 0
}
}
}
func tokenize(c byte) token {
switch c {
case 'n':
return kNull
case 'f':
return kFalse
case 't':
return kTrue
case '0', '1', '2', '3', '4', '5', '6', '7', '8', '9', '-':
return kNumber
case '"':
return kString
case ']':
return kEndArray
case '}':
return kEndObject
case ',':
return kComma
case ':':
return kColon
case '[':
return kArray
case '{':
return kObject
default:
panic(fmt.Sprintf("Unexpected character '%c' parsing JSON", c))
}
}
// Removes n bytes from the start of the slice
func advance(s *[]byte, n int) {
*s = (*s)[n:]
}
// Simple byte comparison
func compareTokens(a, b token) int {
if a < b {
return -1
} else if a > b {
return 1
}
return 0
}
// Parse a JSON number from the input stream
func readNumber(input *[]byte) float64 {
// Look for the end of the number, either at a delimiter or at end of input:
end := len(*input)
for i, c := range *input {
if c == ',' || c == ']' || c == '}' {
end = i
break
}
}
numPart := string((*input)[0:end])
result, _ := strconv.ParseFloat(numPart, 64)
*input = (*input)[end:]
return result
}
// Parse a JSON string from the input stream (starting at the opening quote)
func (c *JSONCollator) readString(input *[]byte) string {
// Look for the quote marking the end of the string. Count up escape sequence:
i := 1
escapes := 0
for {
c := (*input)[i]
if c == '"' {
break
} else if c == '\\' {
escapes++
i++
if (*input)[i] == 'u' {
i += 4 // skip past Unicode escape /uxxxx
}
}
i++
}
var str string
if escapes > 0 {
str = c.readEscapedString((*input)[1:i], i-escapes) // slower case
} else {
str = string((*input)[1:i])
}
*input = (*input)[i+1:] // Skip the closing quote as well
return str
}
// Parse a string, interpreting JSON escape sequences:
func (c *JSONCollator) readEscapedString(input []byte, bufSize int) string {
decoded := make([]byte, 0, bufSize)
for i := 0; i < len(input); i++ {
c := input[i]
if c == '\\' {
i++
c = input[i]
if c == 'u' {
// Decode a Unicode escape:
r, _ := strconv.ParseUint(string(input[i+1:i+5]), 16, 32)
i += 4
var utf [8]byte
size := utf8.EncodeRune(utf[0:], rune(r))
decoded = append(decoded, utf[0:size]...)
} else {
switch c {
case 'b':
c = '\b'
case 'n':
c = '\n'
case 'r':
c = '\r'
case 't':
c = '\t'
}
decoded = append(decoded, c)
}
} else {
decoded = append(decoded, c)
}
}
return string(decoded)
// This can be optimized by scanning through input for the next backslash,
// then appending all the chars up to it in one append() call.
}