Here you can find the source of keySort(key, desc)
/*! FUNCTION: ARRAY.KEYSORT(); **/ Array.prototype.keySort = function(key, desc){ this.sort(function(a, b) { var result = desc ? (a[key] < b[key]) : (a[key] > b[key]); return result ? 1 : -1; });/* w ww. j a va 2 s .co m*/ return this; }
'use strict' Array.prototype.ascendSort = function ascendSort() { return this.sort(function(a, b){ return a > b ? 1 : a < b ? -1 : 0; }); };
function xsort(sqs,col,order){ sqs.sort(function(a,b){ return((a[col]-b[col])*order); }); return(sqs); Array.prototype.asort = function(key) { this.sort(function(a, b) { return (a[key] > b[key]) ? 1 : -1; ...
Array.prototype.countingSort = function() { var maxDigit = this[0]; for(var i = 1; i < this.length; i++) { if(this[i] > maxDigit) { maxDigit = this[i]; var bucket = new Array(maxDigit + 1); for(var i = 0; i < this.length; i++) { ...
Array.prototype.descendSort = function ascendSort() { return this.sort(function(a, b){ return a < b ? 1 : a > b ? -1 : 0; }); };
Array.prototype.humanSort = function() { return this.sort(function(a, b) { aa = a.split(/(\d+)/); bb = b.split(/(\d+)/); for(var x = 0; x < Math.max(aa.length, bb.length); x++) { if(aa[x] != bb[x]) { var cmp1 = (isNaN(parseInt(aa[x],10)))? aa[x] : parseInt(aa[x],10); var cmp2 = (isNaN(parseInt(bb[x],10)))? bb[x] : parseInt(bb[x],10); if(cmp1 == undefined || cmp2 == undefined) ...
Array.prototype.listSort=function (sortby,direction){ var objt=this; direction=direction.toUpperCase( ); var obj =objt.slice(0); obj = obj.sort(function (a,b){ if(sortby.indexOf(".")<0){ var codeA=a[sortby]==null?0:a[sortby]; var codeB=b[sortby]==null?0:b[sortby]; else{ var codeA=eval("a."+sortby)==null?0:eval("a."+sortby); var codeB=eval("b."+sortby)==null?0:eval("b."+sortby); if(direction==="DESC"||direction==="ASC"||direction===" "){ if(direction==="DESC"){ t=codeA;codeA=codeB;codeB=t; if (typeof codeB=="string"){ return codeB.localeCompare(codeA ); else if(typeof codeB=="number"){ return codeB>codeA; }); return obj; };
Array.prototype.natsort = function(direction){ direction = (direction ==-1) ? -1 : 1; if(direction == -1){ this.sort(function(a,b){return (b-a);}); } else { this.sort(function(a,b){return (a-b);}); return this; }; ...
Array.prototype.naturalSort= function(){ var a, b, a1, b1, rx=/(\d+)|(\D+)/g, rd=/\d+/; return this.sort(function(as, bs){ a= String(as).toLowerCase().match(rx); b= String(bs).toLowerCase().match(rx); while(a.length && b.length){ a1= a.shift(); b1= b.shift(); if(rd.test(a1) || rd.test(b1)){ ...
Array.prototype.numberSort=function(){ this.sort(function(a,b){ return a-b; });