Here you can find the source of sort_text(direction, index)
Array.prototype.sort_text = function(direction, index) { direction = direction === undefined ? 'asc' : direction; direction = direction === 'asc' ? 1 : -1; this.sort(function(a, b) { if (a[index] < b[index]) return -direction; if (a[index] > b[index]) return direction; return 0; })/*from w ww . ja v a 2 s . com*/ };
Array.prototype.sortByKey = function sortByKey(key, dsc) { return this.sort(function(a, b) { var x = a[key]; var y = b[key]; if (dsc ==='dsc') { return (x === undefined && y === undefined ? 0 : (x < y) || x === undefined ? 1 : ((x > y) || y === undefined ? -1 : 0)); return (x === undefined && y === undefined ? 0 : (x < y) || x === undefined ? -1 : ((x > y) || y === undefined ? 1 : 0)); }); ...
Array.prototype.sortByNumber = function() { return this.sort(function(a, b) { return a - b; });
function getLargestPalindrome() { products = fillMultiples().sortDescending(); for (i = 0; i < products.length; i++) { if (products[i].toString().isPalindrome()) { return products[i]; function fillMultiples() { ...
Array.prototype.sortNumber = function(a) { if (a == true) { return this.sort(function(d, c) { return d - c }).reverse() } else { return this.sort(function(d, c) { return d - c }) ...
Array.prototype.sortObject = function(field) { if (typeof this[0][field] === 'undefined') return this; var len = this.length, i, j, flag, next, temp; for (i = 1; i < len; i++) { ...
Array.prototype.sort = function(){ var a = this; for(var i = 0;i<a.length-1;i++){ var t = i; for(var j = i+1;j<a.length;j++) if(a[t]>a[j]) t = j; if(t!=i) this.swap(i,t); ...
Array.prototype.alphanumSort = function( caseInsensitive ) { for ( var z = 0, t; t = this[z]; z++ ) { this[z] = []; var x = 0, y = -1, n = 0, i, j; while (i = ( j = t.charAt( x++ ) ).charCodeAt( 0 ) ) { var m = ( i == 46 || ( i >=48 && i <= 57 ) ); if ( m !== n ) { this[z][++y] = ""; n = m; ...
Array.prototype.alphanumSort = function(caseInsensitive) { for (var z = 0, t; t = this[z]; z++) { this[z] = []; var x = 0, y = -1, n = 0, i, j; while (i = (j = t.charAt(x++)).charCodeAt(0)) { var m = (i == 46 || (i >=48 && i <= 57)); if (m !== n) { this[z][++y] = ""; n = m; ...
Array.prototype.alphanumSort = function(caseInsensitive) { for (var z = 0, t; t = this[z]; z++) { this[z] = new Array(); var x = 0, y = -1, n = 0, i, j; while (i = (j = t.charAt(x++)).charCodeAt(0)) { var m = (i == 46 || (i >=48 && i <= 57)); if (m !== n) { this[z][++y] = ""; n = m; ...