对键值进行排序

Ton*_*niq 16 javascript arrays tags sorting

我有一个函数,它按名称排序当前和一组值/键对.

我想知道如何传递正在执行哪种键的键,这样我每次都可以调用相同的函数:

var arr = [{name:'bob', artist:'rudy'},
           {name:'johhny', artist:'drusko'},
           {name:'tiff', artist:'needell'},
           {name:'top', artist:'gear'}];

sort(arr, 'name');   //trying to sort by name
sort(arr, 'artist'); //trying to sort by artist

function sort(arr) {
  arr.sort(function(a, b) {
    var nameA=a.name.toLowerCase(), nameB=b.name.toLowerCase();
    if (nameA < nameB) //sort string ascending
      return -1;
    if (nameA > nameB)
      return 1;
    return 0; //default return value (no sorting)
   });          
}
Run Code Online (Sandbox Code Playgroud)

Dio*_*ode 42

Array.prototype.sortOn = function(key){
    this.sort(function(a, b){
        if(a[key] < b[key]){
            return -1;
        }else if(a[key] > b[key]){
            return 1;
        }
        return 0;
    });
}



var arr = [{name:'bob', artist:'rudy'},{name:'johhny', artist:'drusko'},{name:'tiff', artist:'needell'},{name:'top', artist:'gear'}];

arr.sortOn("name");
arr.sortOn("artist");
Run Code Online (Sandbox Code Playgroud)

  • 比上面更优雅的解决方案! (2认同)

Koo*_*Inc 19

以下是两个可能有用的排序函数:

// sort on values
function srt(desc) {
  return function(a,b){
   return desc ? ~~(a < b) : ~~(a > b);
  };
}

// sort on key values
function keysrt(key,desc) {
  return function(a,b){
   return desc ? ~~(a[key] < b[key]) : ~~(a[key] > b[key]);
  }
}
Run Code Online (Sandbox Code Playgroud)

对于您的阵列,您可以使用以下命令对'name'进行排序

var arr = [ {name:'bob', artist:'rudy'}
           ,{name:'johhny', artist:'drusko'}
           ,{name:'tiff', artist:'needell'}
           ,{name:'top', artist:'gear'}]
          .sort(keysrt('name'));
Run Code Online (Sandbox Code Playgroud)

您还可以组合排序功能:

function srt(desc,key) {
 return function(a,b){
   return desc ? ~~(key ? a[key]<b[key] : a < b) 
               : ~~(key ? a[key] > b[key] : a > b);
  };
}
Run Code Online (Sandbox Code Playgroud)

并使用

var arr = [ {name:'bob', artist:'rudy'}
               ,{name:'johhny', artist:'drusko'}
               ,{name:'tiff', artist:'needell'}
               ,{name:'top', artist:'gear'}]
              .sort(srt(null,'name'));
Run Code Online (Sandbox Code Playgroud)

这是一种一体化的解决方案:

function srt(on,descending) {
 on = on && on.constructor === Object ? on : {};
 return function(a,b){
   if (on.string || on.key) {
     a = on.key ? a[on.key] : a;
     a = on.string ? String(a).toLowerCase() : a;
     b = on.key ? b[on.key] : b;
     b = on.string ? String(b).toLowerCase() : b;
     // if key is not present, move to the end 
     if (on.key && (!b || !a)) {
      return !a && !b ? 1 : !a ? 1 : -1;
     }
   }
   return descending ? ~~(on.string ? b.localeCompare(a) : a < b)
                     : ~~(on.string ? a.localeCompare(b) : a > b);
  };
}
// usage examples
'a,z,x,y,a,b,B,Z,a,i,j,y'.split(',').sort( srt({string:true;}) );
 //=> ,a,a,b,B,i,j,x,y,y,z,Z
[100,7,8,2,2,0,5,1,6,5,-1].sort( srt() );
 //=> -1,0,1,2,2,5,5,6,7,8,100
[100,7,8,2,2,0,5,1,6,5,-1].sort( srt({},true}) );
 //=> 100,8,7,6,5,5,2,2,1,0,-1
var objarr = 
 [ {name:'bob', artist:'rudy'}
  ,{name:'Johhny', artist:'drusko'}
  ,{name:'Tiff', artist:'needell'}
  ,{name:'top', artist:'gear'}]
 .sort( srt({key:'name',string:true}, true) );
for (var i=0;i<objarr.length;i+=1) {
  console.log(objarr[i].name);
}
//=> logs zeb, top, Tiff, Johnny consecutively
Run Code Online (Sandbox Code Playgroud)

  • 它没有在chrome浏览器上工作.我不知道为什么它显示不同于其他浏览器的行为.在firefox,safari,IE.please工作提出任何建议有关此事先谢谢 (2认同)
  • 这不适用于字母数字排序 (2认同)

Pha*_*rus 6

function keysrt(key) {
  return function(a,b){
   if (a[key] > b[key]) return 1;
   if (a[key] < b[key]) return -1;
   return 0;
  }
}

someArrayOfObjects.sort(keysrt('text'));
Run Code Online (Sandbox Code Playgroud)

  • 看起来像 Diode 的答案的副本(但从原型中删除),应该删除。另外,请注意该算法将在“宇航员”之前对“独角兽”进行排序,因为大写字母的 ASCII 值比小写字母小(至少我认为这就是原因:) (2认同)