var epcArray = new Array();
epcArray[0] = "11100100101AA018C8000002";
epcArray[1] = "11100100101AA018C8000001";
epcArray[2] = "11100100101AA018C8000004";
epcArray[3] = "11100100101AA018C8000006";
epcArray[4] = "11100100102AA018C8000001";
epcArray[5] = "11100100101AA018C8000008";
epcArray[6] = "11100100102AB018C8000001";
epcArray[7] = "11100100101AA018C8000007";
epcArray[8] = "11100100101AA018C8000003";
epcArray[9] = "11100100101AA018C8000005";
function getSortedArray(){
console.log("排序前:");
for(var j=0; j<epcArray.length; j++){
console.log(epcArray[j]);
}
//对自定义排序规则的调用
epcArray.sort(epcCompare);
console.log("排序后:");
for(var k=0; k<epcArray.length; k++){
console.log(epcArray[k]);
}
}
//定义自然顺序排序规则,兼容IE8非自然排序,此方法作为数组对象的sort方法参数传入
function epcCompare(a, b){
for(var i = 0; i < a.length; i++){
var tempA = a.substring(i, i+1);
var tempB = b.substring(i, i+1);
var codeA = tempA.charCodeAt();
var codeB = tempB.charCodeAt();
var result = codeB-codeA;
if(result > 0){
return -1;
}else if(result < 0){
return 1;
}else{
continue;
}
}
return 0;
}
JavaScript 兼容IE8默认非自然排序的解决方法
最新推荐文章于 2024-07-24 16:53:23 发布