PHP's arsort in TypeScript

How to use

Install via yarn add locutus and import: import { arsort } from 'locutus/php/array/arsort'.

Or with CommonJS: const { arsort } = require('locutus/php/array/arsort')

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.

#codeexpected result
1var $data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'} arsort($data) var $result = $data{a: 'orange', d: 'lemon', b: 'banana', c: 'apple'}
2ini_set('locutus.sortByReference', true) var $data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'} arsort($data) var $result = $data{a: 'orange', d: 'lemon', b: 'banana', c: 'apple'}

PHP arrays and TypeScript/JavaScript

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

  • SORT_STRING (as well as natsort and natcasesort) might also be integrated into all of these functions by adapting the code at https://sourcefrog.net/projects/natsort/natcompare.js The examples are correct, this is a new way Credits to: https://javascript.internet.com/math-related/bubble-sort.html 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 Since JS objects’ keys are always strings, and (the default) SORT_REGULAR flag distinguishes by key type, if the content is a numeric string, we treat the “original type” as numeric.

Dependencies

This function uses the following Locutus functions:

Here's what our current TypeScript equivalent to PHP's arsort looks like.

import { ensurePhpRuntimeState } from '../_helpers/_phpRuntimeState.ts'
import type { PhpRuntimeValue } from '../_helpers/_phpTypes.ts'
import { i18n_loc_get_default as i18lgd } from '../i18n/i18n_loc_get_default.ts'
import { strnatcmp } from '../strings/strnatcmp.ts'

type SortValue = PhpRuntimeValue
type SortFlag = 'SORT_REGULAR' | 'SORT_NUMERIC' | 'SORT_STRING' | 'SORT_LOCALE_STRING'

const toSortablePrimitive = (value: SortValue): string | number | bigint | boolean => {
if (
typeof value === 'string' ||
typeof value === 'number' ||
typeof value === 'bigint' ||
typeof value === 'boolean'
) {
return value
}

return String(value ?? '')
}

export function arsort<T extends SortValue>(
inputArr: Record<string, T>,
sortFlags?: SortFlag,
): boolean | Record<string, T> {
// discuss at: https://locutus.io/php/arsort/
// 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: 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: https://sourcefrog.net/projects/natsort/natcompare.js
// note 1: The examples are correct, this is a new way
// note 1: Credits to: https://javascript.internet.com/math-related/bubble-sort.html
// 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: Since JS objects' keys are always strings, and (the
// note 1: default) SORT_REGULAR flag distinguishes by key type,
// note 1: if the content is a numeric string, we treat the
// note 1: "original type" as numeric.
// example 1: var $data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'}
// example 1: arsort($data)
// example 1: var $result = $data
// returns 1: {a: 'orange', d: 'lemon', b: 'banana', c: 'apple'}
// example 2: ini_set('locutus.sortByReference', true)
// example 2: var $data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'}
// example 2: arsort($data)
// example 2: var $result = $data
// returns 2: {a: 'orange', d: 'lemon', b: 'banana', c: 'apple'}

const runtime = ensurePhpRuntimeState()
const valArr: [string, T][] = []

const regularSortDesc = (leftValue: T, rightValue: T): number => {
const left = toSortablePrimitive(leftValue)
const right = toSortablePrimitive(rightValue)
return left < right ? 1 : left > right ? -1 : 0
}

let sorter: (a: T, b: T) => number = regularSortDesc

switch (sortFlags) {
case 'SORT_STRING':
sorter = (a, b) => Number(strnatcmp(b, a) ?? 0)
break
case 'SORT_LOCALE_STRING': {
const locale = runtime.locales[i18lgd()]
if (locale?.sorting) {
sorter = locale.sorting
}
break
}
case 'SORT_NUMERIC':
sorter = (a, b) => Number(a) - Number(b)
break
case 'SORT_REGULAR':
sorter = regularSortDesc
break
default:
sorter = regularSortDesc
break
}

const iniVal = String(runtime.ini['locutus.sortByReference']?.local_value ?? '') || 'on'
const sortByReference = iniVal === 'on'
const populateArr: Record<string, T> = {}

for (const [key, value] of Object.entries(inputArr)) {
valArr.push([key, value])
if (sortByReference) {
delete inputArr[key]
}
}

valArr.sort((a, b) => sorter(a[1], b[1]))

for (const [key, value] of valArr) {
populateArr[key] = value
if (sortByReference) {
inputArr[key] = value
}
}

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.

View on GitHub · Edit on GitHub · View Raw


« More PHP array functions


Star