Examples tested against actual runtime. CI re-verifies continuously. Only documented examples are tested.
How to use
Install via yarn add locutus and import:
import { natcasesort } from 'locutus/php/array/natcasesort'.
Or with CommonJS: const { natcasesort } = require('locutus/php/array/natcasesort')
Use a bundler that supports tree-shaking so you only ship the functions you actually use.
Vite,
webpack,
Rollup, and
Parcel
all handle this. For server-side use this is less of a concern.
Examples
These examples are extracted from test cases that automatically verify our functions against their native counterparts.
#
code
expected result
1
var $array1 = {a:'IMG0.png', b:'img12.png', c:'img10.png', d:'img2.png', e:'img1.png', f:'IMG3.png'}
natcasesort($array1)
var $result = $array1
Please note that Locutus uses TypeScript/JavaScript objects as substitutes for PHP arrays,
they are the closest we can get to this hashtable-like data structure without
rolling our own. While many TypeScript/JavaScript implementations preserve the order of object properties, the
ECMAScript Language Specification
explicitly states that:
The mechanics and order of enumerating the properties is not specified.
In practice most engines preserve insertion order, but if your code depends on key ordering across platforms, keep this caveat in mind.
To influence how Locutus treats objects as arrays, you can check out the locutus.objectsAsArrays setting.
Notes
This function deviates from PHP in returning a copy of the array instead
of acting by reference and returning true; this was necessary because
IE does not allow deleting and re-adding of properties without caching
of property position; you can set the ini of “locutus.sortByReference” to true to
get the PHP behavior, but use this only if you are in an environment
such as Firefox extensions where for-in iteration order is fixed and true
property deletion is supported. Note that we intend to implement the PHP
behavior by default if IE ever does allow it; only gives shallow copy since
is by reference in PHP anyways
We cannot use numbers as keys and have them be reordered since they
adhere to numerical order in some implementations
Dependencies
This function uses the following Locutus functions:
exportfunction natcasesort<T extendsstring | number>(inputArr: Record<string, T>): boolean | Record<string, T> { // discuss at: https://locutus.io/php/natcasesort/ // parity verified: PHP 8.3 // original by: Brett Zamir (https://brett-zamir.me) // improved by: Brett Zamir (https://brett-zamir.me) // improved by: Theriault (https://github.com/Theriault) // note 1: This function deviates from PHP in returning a copy of the array instead // note 1: of acting by reference and returning true; this was necessary because // note 1: IE does not allow deleting and re-adding of properties without caching // note 1: of property position; you can set the ini of "locutus.sortByReference" to true to // note 1: get the PHP behavior, but use this only if you are in an environment // note 1: such as Firefox extensions where for-in iteration order is fixed and true // note 1: property deletion is supported. Note that we intend to implement the PHP // note 1: behavior by default if IE ever does allow it; only gives shallow copy since // note 1: is by reference in PHP anyways // note 1: We cannot use numbers as keys and have them be reordered since they // note 1: adhere to numerical order in some implementations // example 1: var $array1 = {a:'IMG0.png', b:'img12.png', c:'img10.png', d:'img2.png', e:'img1.png', f:'IMG3.png'} // example 1: natcasesort($array1) // example 1: var $result = $array1 // returns 1: {a: 'IMG0.png', e: 'img1.png', d: 'img2.png', f: 'IMG3.png', c: 'img10.png', b: 'img12.png'}
constvalArr: [string, T][] = [] letk: string leti: number let sortByReference = false letpopulateArr: Record<string, T> = {}
// Get key and value arrays for (k in inputArr) { if (inputArr.hasOwnProperty(k)) { const value = inputArr[k] if (value === undefined) { continue } valArr.push([k, value]) if (sortByReference) { delete inputArr[k] } } } valArr.sort(function (a, b) { returnNumber(strnatcasecmp(a[1], b[1]) ?? 0) })
// Repopulate the old array for (i = 0; i < valArr.length; i++) { const pair = valArr[i] if (!pair) { continue } populateArr[pair[0]] = pair[1] }
exportfunctionnatcasesort(inputArr) { // discuss at: https://locutus.io/php/natcasesort/ // parity verified: PHP 8.3 // original by: Brett Zamir (https://brett-zamir.me) // improved by: Brett Zamir (https://brett-zamir.me) // improved by: Theriault (https://github.com/Theriault) // note 1: This function deviates from PHP in returning a copy of the array instead // note 1: of acting by reference and returning true; this was necessary because // note 1: IE does not allow deleting and re-adding of properties without caching // note 1: of property position; you can set the ini of "locutus.sortByReference" to true to // note 1: get the PHP behavior, but use this only if you are in an environment // note 1: such as Firefox extensions where for-in iteration order is fixed and true // note 1: property deletion is supported. Note that we intend to implement the PHP // note 1: behavior by default if IE ever does allow it; only gives shallow copy since // note 1: is by reference in PHP anyways // note 1: We cannot use numbers as keys and have them be reordered since they // note 1: adhere to numerical order in some implementations // example 1: var $array1 = {a:'IMG0.png', b:'img12.png', c:'img10.png', d:'img2.png', e:'img1.png', f:'IMG3.png'} // example 1: natcasesort($array1) // example 1: var $result = $array1 // returns 1: {a: 'IMG0.png', e: 'img1.png', d: 'img2.png', f: 'IMG3.png', c: 'img10.png', b: 'img12.png'}
const valArr = [] let k let i let sortByReference = false let populateArr = {}
// Get key and value arrays for (k in inputArr) { if (inputArr.hasOwnProperty(k)) { const value = inputArr[k] if (value === undefined) { continue } valArr.push([k, value]) if (sortByReference) { delete inputArr[k] } } } valArr.sort(function (a, b) { returnNumber(strnatcasecmp(a[1], b[1]) ?? 0) })
// Repopulate the old array for (i = 0; i < valArr.length; i++) { const pair = valArr[i] if (!pair) { continue } populateArr[pair[0]] = pair[1] }
return { ini, locales, localeCategories, pointers, locale_default: localeDefault, } }
// php/info/ini_get (Locutus dependency module) functionini_get(varname: string): string { // discuss at: https://locutus.io/php/ini_get/ // original by: Brett Zamir (https://brett-zamir.me) // note 1: The ini values must be set by ini_set or manually within an ini file // example 1: ini_set('date.timezone', 'Asia/Hong_Kong') // example 1: ini_get('date.timezone') // returns 1: 'Asia/Hong_Kong'
function_phpCastString(value: CastStringValue): string { // original by: Rafał Kukawski
if (typeof value === 'boolean') { return value ? '1' : '' } if (typeof value === 'string') { return value } if (typeof value === 'number') { if (isNaN(value)) { return'NAN' }
// Check which string ended first // return -1 if a, 1 if b, 0 otherwise if (iBeforeStrEnd && !jBeforeStrEnd) { return1 } if (!iBeforeStrEnd && jBeforeStrEnd) { return -1 } return0 }
// php/array/natcasesort (target function module) function natcasesort<T extendsstring | number>(inputArr: Record<string, T>): boolean | Record<string, T> { // discuss at: https://locutus.io/php/natcasesort/ // parity verified: PHP 8.3 // original by: Brett Zamir (https://brett-zamir.me) // improved by: Brett Zamir (https://brett-zamir.me) // improved by: Theriault (https://github.com/Theriault) // note 1: This function deviates from PHP in returning a copy of the array instead // note 1: of acting by reference and returning true; this was necessary because // note 1: IE does not allow deleting and re-adding of properties without caching // note 1: of property position; you can set the ini of "locutus.sortByReference" to true to // note 1: get the PHP behavior, but use this only if you are in an environment // note 1: such as Firefox extensions where for-in iteration order is fixed and true // note 1: property deletion is supported. Note that we intend to implement the PHP // note 1: behavior by default if IE ever does allow it; only gives shallow copy since // note 1: is by reference in PHP anyways // note 1: We cannot use numbers as keys and have them be reordered since they // note 1: adhere to numerical order in some implementations // example 1: var $array1 = {a:'IMG0.png', b:'img12.png', c:'img10.png', d:'img2.png', e:'img1.png', f:'IMG3.png'} // example 1: natcasesort($array1) // example 1: var $result = $array1 // returns 1: {a: 'IMG0.png', e: 'img1.png', d: 'img2.png', f: 'IMG3.png', c: 'img10.png', b: 'img12.png'}
constvalArr: [string, T][] = [] letk: string leti: number let sortByReference = false letpopulateArr: Record<string, T> = {}
// Get key and value arrays for (k in inputArr) { if (inputArr.hasOwnProperty(k)) { const value = inputArr[k] if (value === undefined) { continue } valArr.push([k, value]) if (sortByReference) { delete inputArr[k] } } } valArr.sort(function (a, b) { returnNumber(strnatcasecmp(a[1], b[1]) ?? 0) })
// Repopulate the old array for (i = 0; i < valArr.length; i++) { const pair = valArr[i] if (!pair) { continue } populateArr[pair[0]] = pair[1] }
return { ini, locales, localeCategories, pointers, locale_default: localeDefault, } }
// php/info/ini_get (Locutus dependency module) functionini_get(varname) { // discuss at: https://locutus.io/php/ini_get/ // original by: Brett Zamir (https://brett-zamir.me) // note 1: The ini values must be set by ini_set or manually within an ini file // example 1: ini_set('date.timezone', 'Asia/Hong_Kong') // example 1: ini_get('date.timezone') // returns 1: 'Asia/Hong_Kong'
if (typeof value === 'boolean') { return value ? '1' : '' } if (typeof value === 'string') { return value } if (typeof value === 'number') { if (isNaN(value)) { return'NAN' }
// Check which string ended first // return -1 if a, 1 if b, 0 otherwise if (iBeforeStrEnd && !jBeforeStrEnd) { return1 } if (!iBeforeStrEnd && jBeforeStrEnd) { return -1 } return0 }
// php/array/natcasesort (target function module) functionnatcasesort(inputArr) { // discuss at: https://locutus.io/php/natcasesort/ // parity verified: PHP 8.3 // original by: Brett Zamir (https://brett-zamir.me) // improved by: Brett Zamir (https://brett-zamir.me) // improved by: Theriault (https://github.com/Theriault) // note 1: This function deviates from PHP in returning a copy of the array instead // note 1: of acting by reference and returning true; this was necessary because // note 1: IE does not allow deleting and re-adding of properties without caching // note 1: of property position; you can set the ini of "locutus.sortByReference" to true to // note 1: get the PHP behavior, but use this only if you are in an environment // note 1: such as Firefox extensions where for-in iteration order is fixed and true // note 1: property deletion is supported. Note that we intend to implement the PHP // note 1: behavior by default if IE ever does allow it; only gives shallow copy since // note 1: is by reference in PHP anyways // note 1: We cannot use numbers as keys and have them be reordered since they // note 1: adhere to numerical order in some implementations // example 1: var $array1 = {a:'IMG0.png', b:'img12.png', c:'img10.png', d:'img2.png', e:'img1.png', f:'IMG3.png'} // example 1: natcasesort($array1) // example 1: var $result = $array1 // returns 1: {a: 'IMG0.png', e: 'img1.png', d: 'img2.png', f: 'IMG3.png', c: 'img10.png', b: 'img12.png'}
const valArr = [] let k let i let sortByReference = false let populateArr = {}
// Get key and value arrays for (k in inputArr) { if (inputArr.hasOwnProperty(k)) { const value = inputArr[k] if (value === undefined) { continue } valArr.push([k, value]) if (sortByReference) { delete inputArr[k] } } } valArr.sort(function (a, b) { returnNumber(strnatcasecmp(a[1], b[1]) ?? 0) })
// Repopulate the old array for (i = 0; i < valArr.length; i++) { const pair = valArr[i] if (!pair) { continue } populateArr[pair[0]] = pair[1] }
return sortByReference || populateArr }
Improve this function
Locutus is a community effort following
The McDonald's Theory:
we ship first iterations, hoping others will improve them.
If you see something that could be better, we'd love your contribution.