0
0
mirror of https://github.com/nodejs/node.git synced 2024-11-30 15:30:56 +01:00
nodejs/lib/querystring.js

211 lines
5.7 KiB
JavaScript
Raw Normal View History

2011-03-10 09:54:52 +01:00
// Copyright Joyent, Inc. and other Node contributors.
//
// Permission is hereby granted, free of charge, to any person obtaining a
// copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to permit
// persons to whom the Software is furnished to do so, subject to the
// following conditions:
//
// The above copyright notice and this permission notice shall be included
// in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR
// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE
// USE OR OTHER DEALINGS IN THE SOFTWARE.
// Query String Utilities
var QueryString = exports;
2010-12-02 03:07:20 +01:00
var urlDecode = process.binding('http_parser').urlDecode;
2010-11-19 00:12:21 +01:00
// If obj.hasOwnProperty has been overridden, then calling
// obj.hasOwnProperty(prop) will break.
// See: https://github.com/joyent/node/issues/1707
function hasOwnProperty(obj, prop) {
2011-09-15 18:46:30 +02:00
return Object.prototype.hasOwnProperty.call(obj, prop);
}
2010-12-02 03:07:20 +01:00
function charCode(c) {
2010-11-19 00:12:21 +01:00
return c.charCodeAt(0);
}
// a safe fast alternative to decodeURIComponent
2010-12-02 03:07:20 +01:00
QueryString.unescapeBuffer = function(s, decodeSpaces) {
2010-11-19 00:12:21 +01:00
var out = new Buffer(s.length);
2010-12-02 03:07:20 +01:00
var state = 'CHAR'; // states: CHAR, HEX0, HEX1
2010-11-19 00:12:21 +01:00
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(' ');
// pass thru
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;
}
2010-12-02 03:07:20 +01:00
out[outIndex++] = 16 * n + m;
2010-11-19 00:12:21 +01:00
break;
}
}
// TODO support returning arbitrary buffers.
2010-12-02 03:07:20 +01:00
return out.slice(0, outIndex - 1);
2010-11-19 00:18:06 +01:00
};
2010-12-02 03:07:20 +01:00
QueryString.unescape = function(s, decodeSpaces) {
2010-11-19 00:18:06 +01:00
return QueryString.unescapeBuffer(s, decodeSpaces).toString();
2010-11-19 00:12:21 +01:00
};
2010-12-02 03:07:20 +01:00
QueryString.escape = function(str) {
return encodeURIComponent(str);
};
var stringifyPrimitive = function(v) {
switch (typeof v) {
2010-12-02 03:07:20 +01:00
case 'string':
return v;
2010-12-02 03:07:20 +01:00
case 'boolean':
return v ? 'true' : 'false';
2010-12-02 03:07:20 +01:00
case 'number':
return isFinite(v) ? v : '';
default:
2010-12-02 03:07:20 +01:00
return '';
}
};
2010-12-02 03:07:20 +01:00
QueryString.stringify = QueryString.encode = function(obj, sep, eq, name) {
sep = sep || '&';
eq = eq || '=';
obj = (obj === null) ? undefined : obj;
2010-04-11 22:46:24 +02:00
switch (typeof obj) {
2010-12-02 03:07:20 +01:00
case 'object':
return Object.keys(obj).map(function(k) {
if (Array.isArray(obj[k])) {
return obj[k].map(function(v) {
return QueryString.escape(stringifyPrimitive(k)) +
eq +
QueryString.escape(stringifyPrimitive(v));
}).join(sep);
} else {
2010-12-02 03:07:20 +01:00
return QueryString.escape(stringifyPrimitive(k)) +
eq +
QueryString.escape(stringifyPrimitive(obj[k]));
}
}).join(sep);
2010-04-11 22:46:24 +02:00
default:
2010-12-02 03:07:20 +01:00
if (!name) return '';
return QueryString.escape(stringifyPrimitive(name)) + eq +
QueryString.escape(stringifyPrimitive(obj));
}
};
// Parse a key=val string.
QueryString.parse = QueryString.decode = function(qs, sep, eq, options) {
2010-12-02 03:07:20 +01:00
sep = sep || '&';
eq = eq || '=';
var obj = {},
maxKeys = 1000;
// Handle maxKeys = 0 case
if (options && typeof options.maxKeys === 'number') {
maxKeys = options.maxKeys;
}
if (typeof qs !== 'string' || qs.length === 0) {
return obj;
}
2012-02-21 20:08:13 +01:00
var regexp = /\+/g;
qs = qs.split(sep);
// maxKeys <= 0 means that we should not limit keys count
if (maxKeys > 0) {
qs = qs.slice(0, maxKeys);
}
2012-02-21 20:08:13 +01:00
for (var i = 0, len = qs.length; i < len; ++i) {
var x = qs[i].replace(regexp, '%20'),
idx = x.indexOf(eq),
kstr = x.substring(0, idx),
vstr = x.substring(idx + 1), k, v;
try {
2012-02-21 20:08:13 +01:00
k = decodeURIComponent(kstr);
v = decodeURIComponent(vstr);
2012-02-23 02:04:07 +01:00
} catch (e) {
2012-02-21 20:08:13 +01:00
k = QueryString.unescape(kstr, true);
v = QueryString.unescape(vstr, true);
}
if (!hasOwnProperty(obj, k)) {
2010-12-02 03:07:20 +01:00
obj[k] = v;
} else if (!Array.isArray(obj[k])) {
2010-12-02 03:07:20 +01:00
obj[k] = [obj[k], v];
} else {
2010-12-02 03:07:20 +01:00
obj[k].push(v);
}
2012-02-21 20:08:13 +01:00
}
return obj;
};