Skip to content

Commit f63db8a

Browse files
committed
fixed tab/space issues
1 parent 05b31ff commit f63db8a

File tree

3 files changed

+75
-75
lines changed

3 files changed

+75
-75
lines changed

querystring-parse.js

+21-21
Original file line numberDiff line numberDiff line change
@@ -46,13 +46,13 @@ var util = require("./util");
4646
var parse = function (qs, sep, eq) {
4747
// wouldn't Array(qs.split()).map(pieceParser(eq)).reduce(mergeParams) be prettier?
4848
return util.reduce(
49-
util.map(
50-
qs.split(sep || "&"),
51-
pieceParser(eq || "=")
52-
),
49+
util.map(
50+
qs.split(sep || "&"),
51+
pieceParser(eq || "=")
52+
),
5353
{},
54-
mergeParams
55-
);
54+
mergeParams
55+
);
5656
};
5757

5858
var unescape = function (s) {
@@ -75,9 +75,9 @@ var pieceParser = function (eq) {
7575
// key=val, called from the map/reduce
7676
key = key.split(eq);
7777
return parsePiece(
78-
unescape(key.shift()),
79-
unescape(key.join(eq))
80-
);
78+
unescape(key.shift()),
79+
unescape(key.join(eq))
80+
);
8181
}
8282
key = key.replace(/^\s+|\s+$/g, '');
8383
if (util.isString(val)) {
@@ -110,19 +110,19 @@ var pieceParser = function (eq) {
110110
// the reducer function that merges each query piece together into one set of params
111111
function mergeParams (params, addition) {
112112
var ret;
113-
113+
114114
if (!params){
115-
// if it's uncontested, then just return the addition.
116-
ret = addition;
115+
// if it's uncontested, then just return the addition.
116+
ret = addition;
117117
} else if (util.isArray(params)) {
118-
// if the existing value is an array, then concat it.
119-
ret = params.concat(addition);
118+
// if the existing value is an array, then concat it.
119+
ret = params.concat(addition);
120120
} else if (!util.isObject(params) || !util.isObject(addition)) {
121-
// if the existing value is not an array, and either are not objects, arrayify it.
122-
ret = [params].concat(addition);
121+
// if the existing value is not an array, and either are not objects, arrayify it.
122+
ret = [params].concat(addition);
123123
} else {
124-
// else merge them as objects, which is a little more complex
125-
ret = mergeObjects(params, addition);
124+
// else merge them as objects, which is a little more complex
125+
ret = mergeObjects(params, addition);
126126
}
127127
return ret;
128128
};
@@ -132,13 +132,13 @@ function mergeParams (params, addition) {
132132
// out the simple cases, and need to do the for-in business.
133133
function mergeObjects (params, addition) {
134134
for (var i in addition) if (i && addition.hasOwnProperty(i)) {
135-
params[i] = mergeParams(params[i], addition[i]);
136-
}
135+
params[i] = mergeParams(params[i], addition[i]);
136+
}
137137
return params;
138138
};
139139

140140

141141

142142

143143
/* exports */
144-
exports.parse = parse;
144+
exports.parse = parse;

querystring-stringify.js

+6-6
Original file line numberDiff line numberDiff line change
@@ -53,18 +53,18 @@ var stringify = function (obj, sep, eq, name) {
5353

5454
// Check for cyclical references in nested objects
5555
for (var i = stack.length - 1; i >= 0; --i) if (stack[i] === obj) {
56-
throw new Error("stringify. Cyclical reference");
57-
}
56+
throw new Error("stringify. Cyclical reference");
57+
}
5858

5959
stack.push(obj);
6060

6161
var s = [];
6262
var begin = name ? name + '[' : '';
6363
var end = name ? ']' : '';
6464
for (var i in obj) if (obj.hasOwnProperty(i)) {
65-
var n = begin + i + end;
66-
s.push(stringify(obj[i], sep, eq, n));
67-
}
65+
var n = begin + i + end;
66+
s.push(stringify(obj[i], sep, eq, n));
67+
}
6868

6969
stack.pop();
7070

@@ -75,4 +75,4 @@ var stringify = function (obj, sep, eq, name) {
7575

7676
/* exports */
7777

78-
exports.stringify = stringify;
78+
exports.stringify = stringify;

util.js

+48-48
Original file line numberDiff line numberDiff line change
@@ -12,59 +12,59 @@
1212

1313
if (!Array.map) {
1414
Array.map = function(arr, fun /*, thisp*/)
15-
{
16-
var len = arr.length;
17-
if (typeof fun != "function")
18-
throw new TypeError();
19-
20-
var res = new Array(len);
21-
var thisp = arguments[2];
22-
for (var i = 0; i < len; i++) {
23-
if (i in arr)
24-
res[i] = fun.call(thisp, arr[i], i, arr);
25-
}
26-
27-
return res;
28-
};
15+
{
16+
var len = arr.length;
17+
if (typeof fun != "function")
18+
throw new TypeError();
19+
20+
var res = new Array(len);
21+
var thisp = arguments[2];
22+
for (var i = 0; i < len; i++) {
23+
if (i in arr)
24+
res[i] = fun.call(thisp, arr[i], i, arr);
25+
}
26+
27+
return res;
28+
};
2929
}
3030

3131

3232
if (!Array.reduce) {
3333
Array.reduce = function(arr, initial, fun /*, context*/) {
34-
var len = arr.length;
35-
if (typeof fun != "function") {
36-
throw new TypeError();
37-
}
38-
39-
// no value to return if no initial value and an empty array
40-
if (len == 0 && arguments.length == 1) {
41-
throw new TypeError();
42-
}
43-
44-
var i = 0;
45-
if (arguments.length >= 2) {
46-
var rv = arguments[1]; /* initial */
47-
} else{
48-
do {
49-
if (i in arr) {
50-
rv = arr[i++];
51-
break;
52-
}
53-
54-
// if array contains no values, no initial value to return
55-
if (++i >= len) {
56-
throw new TypeError();
57-
}
58-
} while (true);
59-
}
60-
61-
for (; i < len; i++) {
62-
if (i in arr) {
63-
rv = fun.call(null, rv, arr[i], i, arr);
64-
}
65-
}
66-
67-
return rv;
34+
var len = arr.length;
35+
if (typeof fun != "function") {
36+
throw new TypeError();
37+
}
38+
39+
// no value to return if no initial value and an empty array
40+
if (len == 0 && arguments.length == 1) {
41+
throw new TypeError();
42+
}
43+
44+
var i = 0;
45+
if (arguments.length >= 2) {
46+
var rv = arguments[1]; /* initial */
47+
} else{
48+
do {
49+
if (i in arr) {
50+
rv = arr[i++];
51+
break;
52+
}
53+
54+
// if array contains no values, no initial value to return
55+
if (++i >= len) {
56+
throw new TypeError();
57+
}
58+
} while (true);
59+
}
60+
61+
for (; i < len; i++) {
62+
if (i in arr) {
63+
rv = fun.call(null, rv, arr[i], i, arr);
64+
}
65+
}
66+
67+
return rv;
6868
};
6969
}
7070

0 commit comments

Comments
 (0)