Skip to content

Commit

Permalink
First run of eslint fixes
Browse files Browse the repository at this point in the history
  • Loading branch information
kvz committed Apr 1, 2016
1 parent bffdd8c commit efa1356
Show file tree
Hide file tree
Showing 327 changed files with 6,997 additions and 6,991 deletions.
982 changes: 491 additions & 491 deletions functions/_phpjs_shared/_phpjs_shared_bc.js

Large diffs are not rendered by default.

301 changes: 150 additions & 151 deletions functions/array/array.js

Large diffs are not rendered by default.

18 changes: 9 additions & 9 deletions functions/array/array_change_key_case.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_change_key_case(array, cs) {
function array_change_key_case (array, cs) {
// discuss at: http://phpjs.org/functions/array_change_key_case/
// original by: Ates Goral (http://magnetiq.com)
// improved by: marrtins
Expand All @@ -21,22 +21,22 @@ function array_change_key_case(array, cs) {
// example 7: newArr.splice(1, 1);
// returns 7: {b: 1}

var case_fn, key, tmp_ar = {};
var case_fn, key, tmp_ar = {}

if (Object.prototype.toString.call(array) === '[object Array]') {
return array;
return array
}
if (array && typeof array === 'object' && array.change_key_case) {
// Duck-type check for our own array()-created PHPJS_Array
return array.change_key_case(cs);
return array.change_key_case(cs)
}
if (array && typeof array === 'object') {
case_fn = (!cs || cs === 'CASE_LOWER') ? 'toLowerCase' : 'toUpperCase';
case_fn = (!cs || cs === 'CASE_LOWER') ? 'toLowerCase' : 'toUpperCase'
for (key in array) {
tmp_ar[key[case_fn]()] = array[key];
tmp_ar[key[case_fn]()] = array[key]
}
return tmp_ar;
return tmp_ar
}

return false;
}
return false
}
26 changes: 13 additions & 13 deletions functions/array/array_chunk.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_chunk(input, size, preserve_keys) {
function array_chunk (input, size, preserve_keys) {
// discuss at: http://phpjs.org/functions/array_chunk/
// original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com)
// improved by: Brett Zamir (http://brett-zamir.me)
Expand All @@ -16,40 +16,40 @@ function array_chunk(input, size, preserve_keys) {
i = 0,
c = -1,
l = input.length || 0,
n = [];
n = []

if (size < 1) {
return null;
return null
}

if (Object.prototype.toString.call(input) === '[object Array]') {
if (preserve_keys) {
while (i < l) {
(x = i % size) ? n[c][i] = input[i]: n[++c] = {}, n[c][i] = input[i];
i++;
(x = i % size) ? n[c][i] = input[i] : n[++c] = {}, n[c][i] = input[i]
i++
}
} else {
while (i < l) {
(x = i % size) ? n[c][x] = input[i]: n[++c] = [input[i]];
i++;
(x = i % size) ? n[c][x] = input[i] : n[++c] = [input[i]]
i++
}
}
} else {
if (preserve_keys) {
for (p in input) {
if (input.hasOwnProperty(p)) {
(x = i % size) ? n[c][p] = input[p]: n[++c] = {}, n[c][p] = input[p];
i++;
(x = i % size) ? n[c][p] = input[p] : n[++c] = {}, n[c][p] = input[p]
i++
}
}
} else {
for (p in input) {
if (input.hasOwnProperty(p)) {
(x = i % size) ? n[c][x] = input[p]: n[++c] = [input[p]];
i++;
(x = i % size) ? n[c][x] = input[p] : n[++c] = [input[p]]
i++
}
}
}
}
return n;
}
return n
}
14 changes: 7 additions & 7 deletions functions/array/array_combine.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_combine(keys, values) {
function array_combine (keys, values) {
// discuss at: http://phpjs.org/functions/array_combine/
// original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// improved by: Brett Zamir (http://brett-zamir.me)
Expand All @@ -7,23 +7,23 @@ function array_combine(keys, values) {

var new_array = {},
keycount = keys && keys.length,
i = 0;
i = 0

// input sanitation
if (typeof keys !== 'object' || typeof values !== 'object' || // Only accept arrays or array-like objects
typeof keycount !== 'number' || typeof values.length !== 'number' || !keycount) {
// Require arrays to have a count
return false;
return false
}

// number of elements does not match
if (keycount != values.length) {
return false;
return false
}

for (i = 0; i < keycount; i++) {
new_array[keys[i]] = values[i];
new_array[keys[i]] = values[i]
}

return new_array;
}
return new_array
}
48 changes: 24 additions & 24 deletions functions/array/array_count_values.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_count_values(array) {
function array_count_values (array) {
// discuss at: http://phpjs.org/functions/array_count_values/
// original by: Ates Goral (http://magnetiq.com)
// improved by: Michael White (http://getsprink.com)
Expand All @@ -15,42 +15,42 @@ function array_count_values(array) {

var tmp_arr = {},
key = '',
t = '';
t = ''

var __getType = function(obj) {
var __getType = function (obj) {
// Objects are php associative arrays.
var t = typeof obj;
t = t.toLowerCase();
var t = typeof obj
t = t.toLowerCase()
if (t === 'object') {
t = 'array';
t = 'array'
}
return t;
};
return t
}

var __countValue = function(tmp_arr, value) {
var __countValue = function (tmp_arr, value) {
switch (typeof value) {
case 'number':
if (Math.floor(value) !== value) {
return;
}
case 'number':
if (Math.floor(value) !== value) {
return
}
// Fall-through
case 'string':
if (value in tmp_arr && tmp_arr.hasOwnProperty(value)) {
++tmp_arr[value];
} else {
tmp_arr[value] = 1;
}
case 'string':
if (value in tmp_arr && tmp_arr.hasOwnProperty(value)) {
++tmp_arr[value]
} else {
tmp_arr[value] = 1
}
}
};
}

t = __getType(array);
t = __getType(array)
if (t === 'array') {
for (key in array) {
if (array.hasOwnProperty(key)) {
__countValue.call(this, tmp_arr, array[key]);
__countValue.call(this, tmp_arr, array[key])
}
}
}

return tmp_arr;
}
return tmp_arr
}
14 changes: 7 additions & 7 deletions functions/array/array_diff.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_diff(arr1) {
function array_diff (arr1) {
// discuss at: http://phpjs.org/functions/array_diff/
// original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// improved by: Sanjoy Roy
Expand All @@ -11,20 +11,20 @@ function array_diff(arr1) {
k1 = '',
i = 1,
k = '',
arr = {};
arr = {}

arr1keys: for (k1 in arr1) {
for (i = 1; i < argl; i++) {
arr = arguments[i];
arr = arguments[i]
for (k in arr) {
if (arr[k] === arr1[k1]) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
continue arr1keys
}
}
retArr[k1] = arr1[k1];
retArr[k1] = arr1[k1]
}
}

return retArr;
}
return retArr
}
14 changes: 7 additions & 7 deletions functions/array/array_diff_assoc.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_diff_assoc(arr1) {
function array_diff_assoc (arr1) {
// discuss at: http://phpjs.org/functions/array_diff_assoc/
// original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// bugfixed by: 0m3r
Expand All @@ -11,20 +11,20 @@ function array_diff_assoc(arr1) {
k1 = '',
i = 1,
k = '',
arr = {};
arr = {}

arr1keys: for (k1 in arr1) {
for (i = 1; i < argl; i++) {
arr = arguments[i];
arr = arguments[i]
for (k in arr) {
if (arr[k] === arr1[k1] && k === k1) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
continue arr1keys
}
}
retArr[k1] = arr1[k1];
retArr[k1] = arr1[k1]
}
}

return retArr;
}
return retArr
}
14 changes: 7 additions & 7 deletions functions/array/array_diff_key.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_diff_key(arr1) {
function array_diff_key (arr1) {
// discuss at: http://phpjs.org/functions/array_diff_key/
// original by: Ates Goral (http://magnetiq.com)
// revised by: Brett Zamir (http://brett-zamir.me)
Expand All @@ -13,20 +13,20 @@ function array_diff_key(arr1) {
k1 = '',
i = 1,
k = '',
arr = {};
arr = {}

arr1keys: for (k1 in arr1) {
for (i = 1; i < argl; i++) {
arr = arguments[i];
arr = arguments[i]
for (k in arr) {
if (k === k1) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
continue arr1keys
}
}
retArr[k1] = arr1[k1];
retArr[k1] = arr1[k1]
}
}

return retArr;
}
return retArr
}
16 changes: 8 additions & 8 deletions functions/array/array_diff_uassoc.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_diff_uassoc(arr1) {
function array_diff_uassoc (arr1) {
// discuss at: http://phpjs.org/functions/array_diff_uassoc/
// original by: Brett Zamir (http://brett-zamir.me)
// example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'}
Expand All @@ -12,22 +12,22 @@ function array_diff_uassoc(arr1) {
arr = {},
i = 1,
k1 = '',
k = '';
k = ''
cb = (typeof cb === 'string') ? this.window[cb] : (Object.prototype.toString.call(cb) === '[object Array]') ? this.window[
cb[0]][cb[1]] : cb;
cb[0]][cb[1]] : cb

arr1keys: for (k1 in arr1) {
for (i = 1; i < arglm1; i++) {
arr = arguments[i];
arr = arguments[i]
for (k in arr) {
if (arr[k] === arr1[k1] && cb(k, k1) === 0) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
continue arr1keys
}
}
retArr[k1] = arr1[k1];
retArr[k1] = arr1[k1]
}
}

return retArr;
}
return retArr
}
16 changes: 8 additions & 8 deletions functions/array/array_diff_ukey.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
function array_diff_ukey(arr1) {
function array_diff_ukey (arr1) {
// discuss at: http://phpjs.org/functions/array_diff_ukey/
// original by: Brett Zamir (http://brett-zamir.me)
// example 1: $array1 = {blue: 1, red: 2, green: 3, purple: 4}
Expand All @@ -12,23 +12,23 @@ function array_diff_ukey(arr1) {
arr = {},
i = 1,
k1 = '',
k = '';
k = ''

cb = (typeof cb === 'string') ? this.window[cb] : (Object.prototype.toString.call(cb) === '[object Array]') ? this.window[
cb[0]][cb[1]] : cb;
cb[0]][cb[1]] : cb

arr1keys: for (k1 in arr1) {
for (i = 1; i < arglm1; i++) {
arr = arguments[i];
arr = arguments[i]
for (k in arr) {
if (cb(k, k1) === 0) {
// If it reaches here, it was found in at least one array, so try next value
continue arr1keys;
continue arr1keys
}
}
retArr[k1] = arr1[k1];
retArr[k1] = arr1[k1]
}
}

return retArr;
}
return retArr
}
Loading

0 comments on commit efa1356

Please sign in to comment.