这是我的答案版本的快速 jsFiddle:http: //jsfiddle.net/JohnMunsch/3NMGD/
注意:jsFiddle 和下面的代码都已更新,以反映问题的更改要求。
var model = [
{
color: "red",
age: 10,
size: [ "small", "large" ]
},
{
color: "red",
age: 11,
size: [ "small", "large" ]
},
{
color: "red",
age: 9,
size: [ "small", "large" ]
}
];
function findCommonalities(data) {
if (data.length > 0) {
// It's safe enough to get the list of keys from the very first
// element. If the later ones differ, you know that the keys they
// had but the first element didn't are guaranteed not to be in
// the common set anyway because the first element didn't
// have them.
var keys = _.keys(data[0]);
var commonalities = { };
_.each(keys,
function (key) {
var values = _.pluck(data, key);
if (values.length == data.length) {
// Sadly calling _.uniq() won't work when the values
// plucked out are arrays themselves. It calls ===
// and that's not sufficient for arrays.
if (_.isArray(values[0])) {
// However, we can get a little tricky here.
// What if we _.zip() together all of the arrays
// (assuming the ordering for each array is the
// same) then we'll end up with an array of
// arrays where each one can again be tested
// with _.uniq() because each one will contain
// the same value taken from each array.
var zippedValues = _.zip(values);
console.log("zippedValues", zippedValues);
if (!_.find(zippedValues,
function (zippedValue) {
var uniqueValues = _.uniq(zippedValue);
// Note: This test is the inverse of the
// one below. We're trying to find any
// array that has more than one value in
// it. If we do then there's some
// variance.
return uniqueValues.length != 1;
})) {
// We didn't find any arrays that had any
// variance so we want this as well.
commonalities[key] = values[0];
}
} else {
var uniqueValues = _.uniq(values);
if (uniqueValues.length == 1) {
commonalities[key] = uniqueValues[0];
}
}
}
}
);
return commonalities;
} else {
return { };
}
}
console.log("commonalities: ", findCommonalities(model));
少量键和少量项目的性能似乎很好,但是您需要使用一百万条记录和大量键来测试它。