Remove invalid keys from the array, and sort and limit with the highest value

Question

How can I remove entries such as this from an array

• _id = 0
• _id = ""
• _id = undefined
• _id = null

and then sort and limit the output to only 7 items with the highest costs?

MyArray

[
{_id : "" , M : "4", S : "2", Costs: "6"},
{_id : "0", M : "1", S : "0", Costs: "1"},
{_id : "1", M : "1", S : "0", Costs: "1"},
{_id : "2", M : "1", S : "0", Costs: "1"},
{_id : "3", M : "0", S : "3", Costs: "3"},
{_id : "4",  M : "1", S : "0", Costs: "1"},
{_id : "5",  M : "1", S : "0", Costs: "5"},
{_id : "6",  M : "1", S : "0", Costs: "2"},
{_id : "7",  M : "1", S : "0", Costs: "5"},
{_id : "8",  M : "1", S : "0", Costs: "1"},
{_id : "9",  M : "1", S : "0", Costs: "10"}
]

DESIRED OUTPUT

[
{_id : "9",  M : "1", S : "0", Costs: "10"},
{_id : "7",  M : "1", S : "0", Costs: "5"},
{_id : "5",  M : "1", S : "0", Costs: "5"},
{_id : "3", M : "0", S : "3", Costs: "3"},
{_id : "6",  M : "1", S : "0", Costs: "2"},
{_id : "1", M : "1", S : "0", Costs: "1"},
{_id : "2", M : "1", S : "0", Costs: "1"}
]

Answer 1

You don't need underscore to do this, you can just do it in plain javascript plus it is more efficient to do so since native methods are faster. The way to go is to filter out the falsey values, then sort by Costs , and finally slice the top 7 results:

Note the sort function using - , check out here why

Using plain JS

var top7 = myArray.filter(function(item) {
  return !!item; // filters out all falsey values
}).sort(function(a, b) {
  return parseInt(b.Costs) - parseInt(a.Costs); // sort descending by Costs
}).slice(0, 7); // extracts the top 7 results

Running example:

 var myArray = [ {_id : "" , M : "4", S : "2", Costs: "6"}, {_id : "0", M : "1", S : "0", Costs: "1"}, {_id : "1", M : "1", S : "0", Costs: "1"}, {_id : "2", M : "1", S : "0", Costs: "1"}, {_id : "3", M : "0", S : "3", Costs: "3"}, {_id : "4", M : "1", S : "0", Costs: "1"}, {_id : "5", M : "1", S : "0", Costs: "5"}, {_id : "6", M : "1", S : "0", Costs: "2"}, {_id : "7", M : "1", S : "0", Costs: "5"}, {_id : "8", M : "1", S : "0", Costs: "1"}, {_id : "9", M : "1", S : "0", Costs: "10"} ]; var top7 = myArray.filter(function(item) { return !!item; // filters out all falsey values }).sort(function(a, b) { return parseInt(b.Costs) - parseInt(a.Costs); // sort descending by Costs }).slice(0, 7); console.log(top7); 

Using underscore

Note : Since underscore only has a sortBy method that always sorts ascending, we have to sort on the inverse of Costs to achieve the descending order:

// filter out all falsey values
var filtered = _.filter(myArray, function(item) {
  return !!item;
});

// sort descending by Costs
var sorted = _.sortBy(filtered, function(item) {
  return -parseInt(item.Costs); // Notice the '-' sign to achieve descending order
}); 

// slice the top 7 results 
var top7 = sorted.slice(0, 7);

Running example:

 var myArray = [ {_id : "" , M : "4", S : "2", Costs: "6"}, {_id : "0", M : "1", S : "0", Costs: "1"}, {_id : "1", M : "1", S : "0", Costs: "1"}, {_id : "2", M : "1", S : "0", Costs: "1"}, {_id : "3", M : "0", S : "3", Costs: "3"}, {_id : "4", M : "1", S : "0", Costs: "1"}, {_id : "5", M : "1", S : "0", Costs: "5"}, {_id : "6", M : "1", S : "0", Costs: "2"}, {_id : "7", M : "1", S : "0", Costs: "5"}, {_id : "8", M : "1", S : "0", Costs: "1"}, {_id : "9", M : "1", S : "0", Costs: "10"} ]; var filtered = _.filter(myArray, function(item) { return !!item; // filters out all falsey values }); var sorted = _.sortBy(filtered, function(item) { return -parseInt(item.Costs); // sort descending by Costs }); var top7 = sorted.slice(0, 7); console.log(top7); 

 <script src="https://cdnjs.cloudflare.com/ajax/libs/underscore.js/1.8.3/underscore-min.js"></script> 

Answer 2

You could filter and then sort and then slice chaining them as below.

var result = arr.filter(function(doc){
    return !!parseInt(doc._id);
}).sort(function(a,b){
    return (parseInt(b.Costs) - parseInt(a.Costs));
}).slice(0,7);

Answer 3

Another answer using underscore which uses reject to remove items with an invalid id, sortBy to sort the items and first to limit the number in the result set:

var invalidId = function(item){
    return item._id == "0" || item._id == "" || item._id == undefined || item._id == null;
}

var negateCosts = function(item){
    return -parseInt(item.Costs, 10)
}

var result = _.chain(data)
    .reject(invalidId)
    .sortBy(negateCosts)
    .first(7)
    .value()