php字符串字典排序,javascript实现PHP字典排序ksort

/**

* javascript实现PHP字典排序

* @param {Object} vm 当前this

* @param {Array} inputArr 规定要进行排序的数组

* @param {String} sort_flags 规定如何排列数组的元素/项目

*/

export function ksort(vm, inputArr, sort_flags) {

// discuss at: http://phpjs.org/functions/ksort/

// original by: GeekFG (http://geekfg.blogspot.com)

// improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net)

// improved by: Brett Zamir (http://brett-zamir.me)

// note: The examples are correct, this is a new way

// note: This function deviates from PHP in returning a copy of the array instead

// note: of acting by reference and returning true; this was necessary because

// note: IE does not allow deleting and re-adding of properties without caching

// note: of property position; you can set the ini of "phpjs.strictForIn" to true to

// note: get the PHP behavior, but use this only if you are in an environment

// note: such as Firefox extensions where for-in iteration order is fixed and true

// note: property deletion is supported. Note that we intend to implement the PHP

// note: behavior by default if IE ever does allow it; only gives shallow copy since

// note: is by reference in PHP anyways

// note: Since JS objects' keys are always strings, and (the

// note: default) SORT_REGULAR flag distinguishes by key type,

// note: if the content is a numeric string, we treat the

// note: "original type" as numeric.

// depends on: i18n_loc_get_default

// depends on: strnatcmp

// example 1: data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'};

// example 1: data = ksort(data);

// example 1: $result = data

// returns 1: {a: 'orange', b: 'banana', c: 'apple', d: 'lemon'}

// example 2: ini_set('phpjs.strictForIn', true);

// example 2: data = {2: 'van', 3: 'Zonneveld', 1: 'Kevin'};

// example 2: ksort(data);

// example 2: $result = data

// returns 2: {1: 'Kevin', 2: 'van', 3: 'Zonneveld'}

var tmp_arr = {},

keys = [],

sorter, i, k, that = vm,

strictForIn = false,

populateArr = {};

switch (sort_flags) {

case 'SORT_STRING':

// compare items as strings

sorter = function (a, b) {

return that.strnatcmp(a, b);

};

break;

case 'SORT_LOCALE_STRING':

// compare items as strings, original by the current locale (set with i18n_loc_set_default() as of PHP6)

var loc = vm.i18n_loc_get_default();

sorter = vm.php_js.i18nLocales[loc].sorting;

break;

case 'SORT_NUMERIC':

// compare items numerically

sorter = function (a, b) {

return ((a + 0) - (b + 0));

};

break;

// case 'SORT_REGULAR': // compare items normally (don't change types)

default:

sorter = function (a, b) {

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;

}

// Make a list of key names

for (k in inputArr) {

if (inputArr.hasOwnProperty(k)) {

keys.push(k);

}

}

keys.sort(sorter);

// BEGIN REDUNDANT

vm.php_js = vm.php_js || {};

vm.php_js.ini = vm.php_js.ini || {};

// END REDUNDANT

strictForIn = vm.php_js.ini['phpjs.strictForIn'] && vm.php_js.ini['phpjs.strictForIn'].local_value && vm.php_js

.ini['phpjs.strictForIn'].local_value !== 'off';

populateArr = strictForIn ? inputArr : populateArr;

// Rebuild array with sorted key names

for (i = 0; i < keys.length; i++) {

k = keys[i];

tmp_arr[k] = inputArr[k];

if (strictForIn) {

delete inputArr[k];

}

}

for (i in tmp_arr) {

if (tmp_arr.hasOwnProperty(i)) {

populateArr[i] = tmp_arr[i];

}

}

return strictForIn || populateArr;

}

上面写好字典排序方法ksort,然后进行调用

let aa = ksort(

this,

{

'app_id': '10000',

'time_stamp':'1493449657',

'nonce_str':'20e3408a79',

'key1':'腾讯AI开放平台',

'key2':'示例仅供参考',

'sign':''

}

)

最后,字典排序后的顺序为:

bVbrHnU?w=958&h=207

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值