FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
node/lib/querystring.js at master · greenjava/node · GitHub
greenjava
/
node
Public
forked from
nodejs/node
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Wiki
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
node
/
lib
/
querystring.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
265 lines (227 loc) · 6.29 KB
Breadcrumbs
node
/
lib
/
querystring.js
Copy path
File metadata and controls
265 lines (227 loc) · 6.29 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
// Query String Utilities
'use strict'
;
const
QueryString
=
exports
;
const
Buffer
=
require
(
'buffer'
)
.
Buffer
;
function
charCode
(
c
)
{
return
c
.
charCodeAt
(
0
)
;
}
// a safe fast alternative to decodeURIComponent
QueryString
.
unescapeBuffer
=
function
(
s
,
decodeSpaces
)
{
var
out
=
new
Buffer
(
s
.
length
)
;
var
state
=
'CHAR'
;
// states: CHAR, HEX0, HEX1
var
n
,
m
,
hexchar
;
for
(
var
inIndex
=
0
,
outIndex
=
0
;
inIndex
<=
s
.
length
;
inIndex
++
)
{
var
c
=
s
.
charCodeAt
(
inIndex
)
;
switch
(
state
)
{
case
'CHAR'
:
switch
(
c
)
{
case
charCode
(
'%'
)
:
n
=
0
;
m
=
0
;
state
=
'HEX0'
;
break
;
case
charCode
(
'+'
)
:
if
(
decodeSpaces
)
c
=
charCode
(
' '
)
;
// falls through
default
:
out
[
outIndex
++
]
=
c
;
break
;
}
break
;
case
'HEX0'
:
state
=
'HEX1'
;
hexchar
=
c
;
if
(
charCode
(
'0'
)
<=
c
&&
c
<=
charCode
(
'9'
)
)
{
n
=
c
-
charCode
(
'0'
)
;
}
else
if
(
charCode
(
'a'
)
<=
c
&&
c
<=
charCode
(
'f'
)
)
{
n
=
c
-
charCode
(
'a'
)
+
10
;
}
else
if
(
charCode
(
'A'
)
<=
c
&&
c
<=
charCode
(
'F'
)
)
{
n
=
c
-
charCode
(
'A'
)
+
10
;
}
else
{
out
[
outIndex
++
]
=
charCode
(
'%'
)
;
out
[
outIndex
++
]
=
c
;
state
=
'CHAR'
;
break
;
}
break
;
case
'HEX1'
:
state
=
'CHAR'
;
if
(
charCode
(
'0'
)
<=
c
&&
c
<=
charCode
(
'9'
)
)
{
m
=
c
-
charCode
(
'0'
)
;
}
else
if
(
charCode
(
'a'
)
<=
c
&&
c
<=
charCode
(
'f'
)
)
{
m
=
c
-
charCode
(
'a'
)
+
10
;
}
else
if
(
charCode
(
'A'
)
<=
c
&&
c
<=
charCode
(
'F'
)
)
{
m
=
c
-
charCode
(
'A'
)
+
10
;
}
else
{
out
[
outIndex
++
]
=
charCode
(
'%'
)
;
out
[
outIndex
++
]
=
hexchar
;
out
[
outIndex
++
]
=
c
;
break
;
}
out
[
outIndex
++
]
=
16
*
n
+
m
;
break
;
}
}
// TODO support returning arbitrary buffers.
return
out
.
slice
(
0
,
outIndex
-
1
)
;
}
;
QueryString
.
unescape
=
function
(
s
,
decodeSpaces
)
{
try
{
return
decodeURIComponent
(
s
)
;
}
catch
(
e
)
{
return
QueryString
.
unescapeBuffer
(
s
,
decodeSpaces
)
.
toString
(
)
;
}
}
;
var
hexTable
=
new
Array
(
256
)
;
for
(
var
i
=
0
;
i
<
256
;
++
i
)
hexTable
[
i
]
=
'%'
+
(
(
i
<
16
?
'0'
:
''
)
+
i
.
toString
(
16
)
)
.
toUpperCase
(
)
;
QueryString
.
escape
=
function
(
str
)
{
// replaces encodeURIComponent
// http://www.ecma-international.org/ecma-262/5.1/#sec-15.1.3.4
str
=
''
+
str
;
var
len
=
str
.
length
;
var
out
=
''
;
var
i
,
c
;
if
(
len
===
0
)
return
str
;
for
(
i
=
0
;
i
<
len
;
++
i
)
{
c
=
str
.
charCodeAt
(
i
)
;
// These characters do not need escaping (in order):
// ! - . _ ~
// ' ( ) *
// digits
// alpha (uppercase)
// alpha (lowercase)
if
(
c
===
0x21
||
c
===
0x2D
||
c
===
0x2E
||
c
===
0x5F
||
c
===
0x7E
||
(
c
>=
0x27
&&
c
<=
0x2A
)
||
(
c
>=
0x30
&&
c
<=
0x39
)
||
(
c
>=
0x41
&&
c
<=
0x5A
)
||
(
c
>=
0x61
&&
c
<=
0x7A
)
)
{
out
+=
str
[
i
]
;
continue
;
}
// Other ASCII characters
if
(
c
<
0x80
)
{
out
+=
hexTable
[
c
]
;
continue
;
}
// Multi-byte characters ...
if
(
c
<
0x800
)
{
out
+=
hexTable
[
0xC0
|
(
c
>>
6
)
]
+
hexTable
[
0x80
|
(
c
&
0x3F
)
]
;
continue
;
}
if
(
c
<
0xD800
||
c
>=
0xE000
)
{
out
+=
hexTable
[
0xE0
|
(
c
>>
12
)
]
+
hexTable
[
0x80
|
(
(
c
>>
6
)
&
0x3F
)
]
+
hexTable
[
0x80
|
(
c
&
0x3F
)
]
;
continue
;
}
// Surrogate pair
++
i
;
c
=
0x10000
+
(
(
(
c
&
0x3FF
)
<<
10
)
|
(
str
.
charCodeAt
(
i
)
&
0x3FF
)
)
;
out
+=
hexTable
[
0xF0
|
(
c
>>
18
)
]
+
hexTable
[
0x80
|
(
(
c
>>
12
)
&
0x3F
)
]
+
hexTable
[
0x80
|
(
(
c
>>
6
)
&
0x3F
)
]
+
hexTable
[
0x80
|
(
c
&
0x3F
)
]
;
}
return
out
;
}
;
var
stringifyPrimitive
=
function
(
v
)
{
if
(
typeof
v
===
'string'
)
return
v
;
if
(
typeof
v
===
'number'
&&
isFinite
(
v
)
)
return
''
+
v
;
if
(
typeof
v
===
'boolean'
)
return
v
?
'true'
:
'false'
;
return
''
;
}
;
QueryString
.
stringify
=
QueryString
.
encode
=
function
(
obj
,
sep
,
eq
,
options
)
{
sep
=
sep
||
'&'
;
eq
=
eq
||
'='
;
var
encode
=
QueryString
.
escape
;
if
(
options
&&
typeof
options
.
encodeURIComponent
===
'function'
)
{
encode
=
options
.
encodeURIComponent
;
}
if
(
obj
!==
null
&&
typeof
obj
===
'object'
)
{
var
keys
=
Object
.
keys
(
obj
)
;
var
len
=
keys
.
length
;
var
flast
=
len
-
1
;
var
fields
=
''
;
for
(
var
i
=
0
;
i
<
len
;
++
i
)
{
var
k
=
keys
[
i
]
;
var
v
=
obj
[
k
]
;
var
ks
=
encode
(
stringifyPrimitive
(
k
)
)
+
eq
;
if
(
Array
.
isArray
(
v
)
)
{
var
vlen
=
v
.
length
;
var
vlast
=
vlen
-
1
;
for
(
var
j
=
0
;
j
<
vlen
;
++
j
)
{
fields
+=
ks
+
encode
(
stringifyPrimitive
(
v
[
j
]
)
)
;
if
(
j
<
vlast
)
fields
+=
sep
;
}
if
(
vlen
&&
i
<
flast
)
fields
+=
sep
;
}
else
{
fields
+=
ks
+
encode
(
stringifyPrimitive
(
v
)
)
;
if
(
i
<
flast
)
fields
+=
sep
;
}
}
return
fields
;
}
return
''
;
}
;
// Parse a key=val string.
QueryString
.
parse
=
QueryString
.
decode
=
function
(
qs
,
sep
,
eq
,
options
)
{
sep
=
sep
||
'&'
;
eq
=
eq
||
'='
;
const
eqLen
=
eq
.
length
;
var
obj
=
{
}
;
if
(
typeof
qs
!==
'string'
||
qs
.
length
===
0
)
{
return
obj
;
}
var
regexp
=
/
\+
/
g
;
qs
=
qs
.
split
(
sep
)
;
var
maxKeys
=
1000
;
if
(
options
&&
typeof
options
.
maxKeys
===
'number'
)
{
maxKeys
=
options
.
maxKeys
;
}
var
len
=
qs
.
length
;
// maxKeys <= 0 means that we should not limit keys count
if
(
maxKeys
>
0
&&
len
>
maxKeys
)
{
len
=
maxKeys
;
}
var
decode
=
QueryString
.
unescape
;
if
(
options
&&
typeof
options
.
decodeURIComponent
===
'function'
)
{
decode
=
options
.
decodeURIComponent
;
}
var
keys
=
[
]
;
for
(
var
i
=
0
;
i
<
len
;
++
i
)
{
var
x
=
qs
[
i
]
.
replace
(
regexp
,
'%20'
)
,
idx
=
x
.
indexOf
(
eq
)
,
k
,
v
;
if
(
idx
>=
0
)
{
k
=
decodeStr
(
x
.
substring
(
0
,
idx
)
,
decode
)
;
v
=
decodeStr
(
x
.
substring
(
idx
+
eqLen
)
,
decode
)
;
}
else
{
k
=
decodeStr
(
x
,
decode
)
;
v
=
''
;
}
if
(
keys
.
indexOf
(
k
)
===
-
1
)
{
obj
[
k
]
=
v
;
keys
.
push
(
k
)
;
}
else
if
(
Array
.
isArray
(
obj
[
k
]
)
)
{
obj
[
k
]
.
push
(
v
)
;
}
else
{
obj
[
k
]
=
[
obj
[
k
]
,
v
]
;
}
}
return
obj
;
}
;
function
decodeStr
(
s
,
decoder
)
{
try
{
return
decoder
(
s
)
;
}
catch
(
e
)
{
return
QueryString
.
unescape
(
s
,
true
)
;
}
}
Back
|
FazBrowse Home
|
New Git URL