Skip to content

Commit 1df07e4

Browse files
TheriaultTheriault
Theriault
authored and
Theriault
committed
Removing tabs.
1 parent 2b59f27 commit 1df07e4

File tree

5 files changed

+12
-13
lines changed

5 files changed

+12
-13
lines changed

functions/array/arsort.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -91,8 +91,8 @@ function arsort (inputArr, sort_flags) {
9191
}
9292
}
9393
valArr.sort(function (a, b) {
94-
return sorter(a[1], b[1]);
95-
});
94+
return sorter(a[1], b[1]);
95+
});
9696

9797
// Repopulate the old array
9898
for (i = 0; i < valArr.length; i++) {

functions/array/asort.js

+2-3
Original file line numberDiff line numberDiff line change
@@ -96,12 +96,11 @@ function asort (inputArr, sort_flags) {
9696
}
9797

9898
valArr.sort(function (a, b) {
99-
return sorter(a[1], b[1]);
100-
});
99+
return sorter(a[1], b[1]);
100+
});
101101

102102
// Repopulate the old array
103103
for (i = 0; i < valArr.length; i++) {
104-
alert(valArr[i]);
105104
populateArr[valArr[i][0]] = valArr[i][1];
106105
}
107106

functions/array/natcasesort.js

+4-4
Original file line numberDiff line numberDiff line change
@@ -39,10 +39,10 @@ function natcasesort (inputArr) {
3939
}
4040
}
4141
}
42-
valArr.sort(function (a, b) {
43-
return that.strnatcasecmp(a[1], b[1]);
44-
});
45-
42+
valArr.sort(function (a, b) {
43+
return that.strnatcasecmp(a[1], b[1]);
44+
});
45+
4646
// Repopulate the old array
4747
for (i = 0; i < valArr.length; i++) {
4848
populateArr[valArr[i][0]] = valArr[i][1];

functions/array/natsort.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -38,8 +38,8 @@ function natsort (inputArr) {
3838
}
3939
}
4040
valArr.sort(function (a, b) {
41-
return that.strnatcmp(a[1], b[1]);
42-
});
41+
return that.strnatcmp(a[1], b[1]);
42+
});
4343

4444
// Repopulate the old array
4545
for (i = 0; i < valArr.length; i++) {

functions/array/uasort.js

+2-2
Original file line numberDiff line numberDiff line change
@@ -44,8 +44,8 @@ function uasort (inputArr, sorter) {
4444
}
4545
}
4646
valArr.sort(function (a, b) {
47-
return sorter(a[1], b[1]);
48-
});
47+
return sorter(a[1], b[1]);
48+
});
4949

5050
for (i = 0; i < valArr.length; i++) { // Repopulate the old array
5151
populateArr[valArr[i][0]] = valArr[i][1];

0 commit comments

Comments
 (0)