phpjs
Version:
157 lines (140 loc) • 5.57 kB
Markdown
---
layout: page
title: "JavaScript rsort function"
comments: true
sharing: true
footer: true
alias:
- /functions/view/rsort:506
- /functions/view/rsort
- /functions/view/506
- /functions/rsort:506
- /functions/506
---
<!-- Generated by Rakefile:build -->
A JavaScript equivalent of PHP's rsort
{% codeblock array/rsort.js lang:js https://raw.github.com/kvz/phpjs/master/functions/array/rsort.js raw on github %}
function rsort (inputArr, sort_flags) {
// From: http://phpjs.org/functions
// + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)
// + revised by: Brett Zamir (http://brett-zamir.me)
// + improved by: Brett Zamir (http://brett-zamir.me)
// % note 1: SORT_STRING (as well as natsort and natcasesort) might also be
// % note 1: integrated into all of these functions by adapting the code at
// % note 1: http://sourcefrog.net/projects/natsort/natcompare.js
// % note 2: This function deviates from PHP in returning a copy of the array instead
// % note 2: of acting by reference and returning true; this was necessary because
// % note 2: IE does not allow deleting and re-adding of properties without caching
// % note 2: of property position; you can set the ini of "phpjs.strictForIn" to true to
// % note 2: get the PHP behavior, but use this only if you are in an environment
// % note 2: such as Firefox extensions where for-in iteration order is fixed and true
// % note 2: property deletion is supported. Note that we intend to implement the PHP
// % note 2: behavior by default if IE ever does allow it; only gives shallow copy since
// % note 2: is by reference in PHP anyways
// % note 3: Since JS objects' keys are always strings, and (the
// % note 3: default) SORT_REGULAR flag distinguishes by key type,
// % note 3: if the content is a numeric string, we treat the
// % note 3: "original type" as numeric.
// - depends on: i18n_loc_get_default
// * example 1: rsort(['Kevin', 'van', 'Zonneveld']);
// * returns 1: ['van', 'Zonneveld', 'Kevin']
// * example 2: ini_set('phpjs.strictForIn', true);
// * example 2: fruits = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'};
// * example 2: rsort(fruits);
// * results 2: fruits == {0: 'orange', 1: 'lemon', 2: 'banana', 3: 'apple'}
// * returns 2: true
var valArr = [],
k = '',
i = 0,
sorter = false,
that = this,
strictForIn = false,
populateArr = [];
switch (sort_flags) {
case 'SORT_STRING':
// compare items as strings
sorter = function (a, b) {
return that.strnatcmp(b, a);
};
break;
case 'SORT_LOCALE_STRING':
// compare items as strings, based on the current locale (set with i18n_loc_set_default() as of PHP6)
var loc = this.i18n_loc_get_default();
sorter = this.php_js.i18nLocales[loc].sorting;
break;
case 'SORT_NUMERIC':
// compare items numerically
sorter = function (a, b) {
return (b - a);
};
break;
case 'SORT_REGULAR':
// compare items normally (don't change types)
default:
sorter = function (b, a) {
var aFloat = parseFloat(a),
bFloat = parseFloat(b),
aNumeric = aFloat + '' === a,
bNumeric = bFloat + '' === b;
if (aNumeric && bNumeric) {
return aFloat > bFloat ? 1 : aFloat < bFloat ? -1 : 0;
} else if (aNumeric && !bNumeric) {
return 1;
} else if (!aNumeric && bNumeric) {
return -1;
}
return a > b ? 1 : a < b ? -1 : 0;
};
break;
}
// BEGIN REDUNDANT
this.php_js = this.php_js || {};
this.php_js.ini = this.php_js.ini || {};
// END REDUNDANT
strictForIn = this.php_js.ini['phpjs.strictForIn'] && this.php_js.ini['phpjs.strictForIn'].local_value && this.php_js.ini['phpjs.strictForIn'].local_value !== 'off';
populateArr = strictForIn ? inputArr : populateArr;
for (k in inputArr) { // Get key and value arrays
if (inputArr.hasOwnProperty(k)) {
valArr.push(inputArr[k]);
if (strictForIn) {
delete inputArr[k];
}
}
}
valArr.sort(sorter);
for (i = 0; i < valArr.length; i++) { // Repopulate the old array
populateArr[i] = valArr[i];
}
return strictForIn || populateArr;
}
{% endcodeblock %}
- [Raw function on GitHub](https://github.com/kvz/phpjs/blob/master/functions/array/rsort.js)
Please note that php.js uses JavaScript objects as substitutes for PHP arrays, they are
the closest match to this hashtable-like data structure.
Please also note that php.js offers community built functions and goes by the
[McDonald's Theory](https://medium.com/what-i-learned-building/9216e1c9da7d). We'll put online
functions that are far from perfect, in the hopes to spark better contributions.
Do you have one? Then please just:
- [Edit on GitHub](https://github.com/kvz/phpjs/edit/master/functions/array/rsort.js)
### Example 1
This code
{% codeblock lang:js example %}
rsort(['Kevin', 'van', 'Zonneveld']);
{% endcodeblock %}
Should return
{% codeblock lang:js returns %}
['van', 'Zonneveld', 'Kevin']
{% endcodeblock %}
### Example 2
This code
{% codeblock lang:js example %}
ini_set('phpjs.strictForIn', true);
fruits = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'};
rsort(fruits);
{% endcodeblock %}
Should return
{% codeblock lang:js returns %}
true
{% endcodeblock %}
### Other PHP functions in the array extension
{% render_partial _includes/custom/array.html %}