Created
June 22, 2017 08:50
-
-
Save AndiSHFR/61600ef34e47a62baf581cbea21b835a to your computer and use it in GitHub Desktop.
Javascript code to do a natural sort.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function naturalSort(ar, index){ | |
var L= ar.length, i, who, next, | |
isi= typeof index== 'number', | |
rx= /(\.\d+)|(\d+(\.\d+)?)|([^\d.]+)|(\.(\D+|$))/g; | |
function nSort(aa, bb){ | |
var a= aa[0], b= bb[0], a1, b1, i= 0, n, L= a.length; | |
while(i<L){ | |
if(!b[i]) return 1; | |
a1= a[i]; | |
b1= b[i++]; | |
if(a1!== b1){ | |
n= a1-b1; | |
if(!isNaN(n)) return n; | |
return a1>b1? 1: -1; | |
} | |
} | |
return b[i]!= undefined? -1: 0; | |
} | |
for(i= 0; i<L; i++){ | |
who= ar[i]; | |
next= isi? ar[i][index] || '': who; | |
ar[i]= [String(next).toLowerCase().match(rx), who]; | |
} | |
ar.sort(nSort); | |
for(i= 0; i<L; i++){ | |
ar[i]= ar[i][1]; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment