Skip to content

@mystix /natural-sort.js
Created

Embed URL

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP
Javascript sorting algorithms
/*!*
natcompare.js -- Perform 'natural order' comparisons of strings in JavaScript.
Copyright (C) 2005 by SCK-CEN (Belgian Nucleair Research Centre)
Written by Kristof Coomans <kristof[dot]coomans[at]sckcen[dot]be>
Based on the Java version by Pierre-Luc Paour, of which this is more or less a straight conversion.
Copyright (C) 2003 by Pierre-Luc Paour <natorder@paour.com>
The Java version was based on the C version by Martin Pool.
Copyright (C) 2000 by Martin Pool <mbp@humbug.org.au>
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
RP = { // optimised from http://sourcefrog.net/projects/natsort/natcompare.js
natcompare: (function() {
function isWhitespaceChar(a) {
return a.charCodeAt(0) <= 32;
}
function isDigitChar(a) {
var charCode = a.charCodeAt(0);
return charCode >= 48 && charCode <= 57;
}
function compareRight(a, b) {
var bias = 0,
ia = 0,
ib = 0,
ca,
cb;
// The longest run of digits wins. That aside, the greatest
// value wins, but we can't know that it will until we've scanned
// both numbers to know that they have the same magnitude, so we
// remember it in BIAS.
for (;; ia++, ib++) {
ca = a.charAt(ia);
cb = b.charAt(ib);
if (!isDigitChar(ca) && !isDigitChar(cb)) {
return bias;
} else if (!isDigitChar(ca)) {
return -1;
} else if (!isDigitChar(cb)) {
return 1;
} else if (ca < cb) {
if (bias === 0) {
bias = -1;
}
} else if (ca > cb) {
if (bias === 0) {
bias = 1;
}
} else if (ca === '0' && cb === '0') {
return bias;
}
}
}
return function(a, b) {
var ia = 0,
ib = 0,
nza = 0,
nzb = 0,
ca,
cb,
result;
while (true) {
// only count the number of zeroes leading the last number compared
nza = nzb = 0;
ca = a.charAt(ia);
cb = b.charAt(ib);
// skip over leading spaces or zeros
while (isWhitespaceChar(ca) || ca === '0') {
if (ca === '0') {
nza++;
} else {
// only count consecutive zeroes
nza = 0;
}
ca = a.charAt(++ia);
}
while (isWhitespaceChar(cb) || cb === '0') {
if (cb === '0') {
nzb++;
} else {
// only count consecutive zeroes
nzb = 0;
}
cb = b.charAt(++ib);
}
// process run of digits
if (isDigitChar(ca) && isDigitChar(cb)) {
result = compareRight(a.substring(ia), b.substring(ib));
if (result !== 0) {
return result;
}
}
if (ca === '0' && cb === '0') {
// The strings compare the same. Perhaps the caller
// will want to call strcmp to break the tie.
return nza - nzb;
}
if (ca < cb) {
return -1;
} else if (ca > cb) {
return 1;
}
++ia;
++ib;
}
};
})()
};
RP = {
radixSort: (function() { // adapted from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Radix/
function digit(m, dig) {
var str = Math.round(m).toString();
if (dig >= str.length) {
return 0;
}
return str.charAt(str.length - 1 - dig) - 0;
}
function pass(a, N, dig) {
var counter = [],
temp = [],
i,
d;
for (d = 0; d <= 9; d++) {
counter[d] = 0;
}
for (i = 1; i <= N; i++) {
counter[digit(a[i], dig)]++;
}
for (d = 1; d <= 9; d++) {
counter[d] += counter[d - 1];
}
for (i = N; i >= 1; i--) {
temp[counter[digit(a[i], dig)]--] = a[i];
}
for (i = 1; i <= N; i++) {
a[i] = temp[i];
}
return a;
}
return function(a) {
var maxLen = 0,
p,
i,
len,
str;
for (i = 1, len = a.length - 1; i <= len; i++) {
str = Math.round(a[i]).toString();
if (str.length > maxLen) {
maxLen = str.length;
}
}
for (p = 0; p < maxLen; p++) {
pass(a, len, p);
}
};
})()
}
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.