admin管理员组文章数量:1022641
I have an array of arrays similar to the structure below. I am trying to reduce the array as efficiently as possible based on the Company Name (ex. Company A). So basically, where the pany names are the same, bine the inner array so that the numbers in each position get added to the matching array's numbers in the corresponding position. Also if one of the arrays has a missing email or phone, take the email or phone position that has a value. The resultArray at the bottom shows the result I am trying to achieve.
*Note - I don't know the length of numbers following a pany. The length is dynamically set, but the length of each inner array will always be the same. So sometimes all the innerArray's are 6 values, other times they could be 20 values in length.
var array = [
[Company A, A-Email, A-Phone, 2, 5, 10],
[Company A, A-Email, , 1, 10, 7],
[Company A, , A-Phone, 3, 2, 4],
[Company B, B-Email, , 1, 10, 7],
[Company B, B-Email, B-Phone, 5, 10, 8],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
var resultArray = [
[Company A, A-Email, A-Phone, 6, 17, 21],
[Company B, B-Email, B-Phone, 6, 20, 15],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
So originally I was trying something like this because the array had already been sorted by pany name:
for (var i = 0; i < array.length - 1; i++) {
var firstArray = array[i]
var nextArray = array[i + 1]
if (nextArray[0] == firstArray[0]) {
for (var t = 3; t <= firstArray.length; t++) {
firstArray[t] = firstArray[t] + nextArray[t]
}
resultArray.push(firstArray);
} else {continue;}
I have a large set of data and doing it this way was really operation heavy and my function timed out so I'm not pletely sure if it even worked. I started to try to do a reduce method with a hash table but I couldn't quite figure it out. Any idea's on how to do this most efficiently?
Also I can't use jQuery, so purely vanilla javascript please.
I have an array of arrays similar to the structure below. I am trying to reduce the array as efficiently as possible based on the Company Name (ex. Company A). So basically, where the pany names are the same, bine the inner array so that the numbers in each position get added to the matching array's numbers in the corresponding position. Also if one of the arrays has a missing email or phone, take the email or phone position that has a value. The resultArray at the bottom shows the result I am trying to achieve.
*Note - I don't know the length of numbers following a pany. The length is dynamically set, but the length of each inner array will always be the same. So sometimes all the innerArray's are 6 values, other times they could be 20 values in length.
var array = [
[Company A, A-Email, A-Phone, 2, 5, 10],
[Company A, A-Email, , 1, 10, 7],
[Company A, , A-Phone, 3, 2, 4],
[Company B, B-Email, , 1, 10, 7],
[Company B, B-Email, B-Phone, 5, 10, 8],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
var resultArray = [
[Company A, A-Email, A-Phone, 6, 17, 21],
[Company B, B-Email, B-Phone, 6, 20, 15],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
So originally I was trying something like this because the array had already been sorted by pany name:
for (var i = 0; i < array.length - 1; i++) {
var firstArray = array[i]
var nextArray = array[i + 1]
if (nextArray[0] == firstArray[0]) {
for (var t = 3; t <= firstArray.length; t++) {
firstArray[t] = firstArray[t] + nextArray[t]
}
resultArray.push(firstArray);
} else {continue;}
I have a large set of data and doing it this way was really operation heavy and my function timed out so I'm not pletely sure if it even worked. I started to try to do a reduce method with a hash table but I couldn't quite figure it out. Any idea's on how to do this most efficiently?
Also I can't use jQuery, so purely vanilla javascript please.
Share Improve this question edited Apr 17, 2018 at 16:37 MattMcCode asked Apr 17, 2018 at 16:22 MattMcCodeMattMcCode 3077 silver badges20 bronze badges3 Answers
Reset to default 6You can use ES6 reduce
to summarize the array into an object. And use Object.values
to convert the object into an array.
Note: Fiddle does not (currently) working. So you might need to test it on your browser.
var array=[['Company A','A-Email','A-Phone',2,5,10],['Company A','A-Email',,1,10,7],['Company A',,'A-Phone',3,2,4],['Company B','B-Email',,1,10,7],['Company B','B-Email','B-Phone',5,10,8],['Company C','C-Email','C-Phone',3,2,1]];
var resultArray = Object.values(array.reduce((c, v) => {
c[v[0]] = c[v[0]] || [v[0], null, null].concat(new Array(v.length - 3).fill(0));
c[v[0]][1] = c[v[0]][1] || v[1]; //Update Email
c[v[0]][2] = c[v[0]][2] || v[2]; //Update Phone
//Loop thru the numbers and add
for (var i = 3; i < v.length; i++) c[v[0]][i] += ( v[i] || 0 );
return c;
}, {}));
console.log(resultArray);
Hash tables would be the correct approach (assuming 'Company A' etc are strings; otherwise it's a Map).
var panies = {};
for ( var i = 0; i < array.length; i++ ) {
var item = array[ i ];
var name = item[ 0 ];
var phone = item[ 1 ];
var num1 = item[ 2 ];
var num2 = item[ 3 ];
var num3 = item[ 4 ];
if ( panies[ name ] ) {
var record = panies[ name ];
record[ 1 ] = record[ 1 ] || email;
record[ 2 ] = record[ 2 ] || phone;
record[ 2 ] += num1;
record[ 3 ] += num2;
record[ 4 ] += num3;
} else {
panies[ name ] = [ name, email, phone, num1, num2, num3 ]
}
}
var resultArray = Object.values( panies );
You can try something like below. The main point is to use reduce()
to get an object full of correct data then flatten it back into arrays using Object.values()
.
//initial data
var data = [
['Company A', 'A - Email', 'A - Phone', 2, 5, 10],
['Company A', 'A - Email', , 1, 10, 7],
['Company A', , 'A - Phone', 3, 2, 4],
['Company B', 'B - Email', , 1, 10, 7],
['Company B', 'B - Email', 'B - Phone', 5, 10, 8],
['Company C', 'C - Email', 'C - Phone', 3, 2, 1]
];
//reduce function to organize data
var reducer = function(accumulator, currentValue, currentIdx) {
var [panyId, email, phone, i, j, k] = currentValue;
accumulator[panyId] = {
email: !accumulator[panyId] ? email : !accumulator[panyId].email ? email : accumulator[panyId].email,
phone: !accumulator[panyId] ? phone : !accumulator[panyId].phone ? phone : accumulator[panyId].phone,
i: (accumulator[panyId] ? accumulator[panyId].i : 0) + i,
j: (accumulator[panyId] ? accumulator[panyId].j : 0) + j,
k: (accumulator[panyId] ? accumulator[panyId].k : 0) + k
}
return accumulator;
}
var rawData = data.reduce(reducer, {});
//organize data back into array of arrays
var formattedData = [];
for (key in rawData) {
formattedData.push([key].concat(Object.values(rawData[key])));
}
console.log(formattedData);
I have an array of arrays similar to the structure below. I am trying to reduce the array as efficiently as possible based on the Company Name (ex. Company A). So basically, where the pany names are the same, bine the inner array so that the numbers in each position get added to the matching array's numbers in the corresponding position. Also if one of the arrays has a missing email or phone, take the email or phone position that has a value. The resultArray at the bottom shows the result I am trying to achieve.
*Note - I don't know the length of numbers following a pany. The length is dynamically set, but the length of each inner array will always be the same. So sometimes all the innerArray's are 6 values, other times they could be 20 values in length.
var array = [
[Company A, A-Email, A-Phone, 2, 5, 10],
[Company A, A-Email, , 1, 10, 7],
[Company A, , A-Phone, 3, 2, 4],
[Company B, B-Email, , 1, 10, 7],
[Company B, B-Email, B-Phone, 5, 10, 8],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
var resultArray = [
[Company A, A-Email, A-Phone, 6, 17, 21],
[Company B, B-Email, B-Phone, 6, 20, 15],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
So originally I was trying something like this because the array had already been sorted by pany name:
for (var i = 0; i < array.length - 1; i++) {
var firstArray = array[i]
var nextArray = array[i + 1]
if (nextArray[0] == firstArray[0]) {
for (var t = 3; t <= firstArray.length; t++) {
firstArray[t] = firstArray[t] + nextArray[t]
}
resultArray.push(firstArray);
} else {continue;}
I have a large set of data and doing it this way was really operation heavy and my function timed out so I'm not pletely sure if it even worked. I started to try to do a reduce method with a hash table but I couldn't quite figure it out. Any idea's on how to do this most efficiently?
Also I can't use jQuery, so purely vanilla javascript please.
I have an array of arrays similar to the structure below. I am trying to reduce the array as efficiently as possible based on the Company Name (ex. Company A). So basically, where the pany names are the same, bine the inner array so that the numbers in each position get added to the matching array's numbers in the corresponding position. Also if one of the arrays has a missing email or phone, take the email or phone position that has a value. The resultArray at the bottom shows the result I am trying to achieve.
*Note - I don't know the length of numbers following a pany. The length is dynamically set, but the length of each inner array will always be the same. So sometimes all the innerArray's are 6 values, other times they could be 20 values in length.
var array = [
[Company A, A-Email, A-Phone, 2, 5, 10],
[Company A, A-Email, , 1, 10, 7],
[Company A, , A-Phone, 3, 2, 4],
[Company B, B-Email, , 1, 10, 7],
[Company B, B-Email, B-Phone, 5, 10, 8],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
var resultArray = [
[Company A, A-Email, A-Phone, 6, 17, 21],
[Company B, B-Email, B-Phone, 6, 20, 15],
[Company C, C-Email, C-Phone, 3, 2, 1]
]
So originally I was trying something like this because the array had already been sorted by pany name:
for (var i = 0; i < array.length - 1; i++) {
var firstArray = array[i]
var nextArray = array[i + 1]
if (nextArray[0] == firstArray[0]) {
for (var t = 3; t <= firstArray.length; t++) {
firstArray[t] = firstArray[t] + nextArray[t]
}
resultArray.push(firstArray);
} else {continue;}
I have a large set of data and doing it this way was really operation heavy and my function timed out so I'm not pletely sure if it even worked. I started to try to do a reduce method with a hash table but I couldn't quite figure it out. Any idea's on how to do this most efficiently?
Also I can't use jQuery, so purely vanilla javascript please.
Share Improve this question edited Apr 17, 2018 at 16:37 MattMcCode asked Apr 17, 2018 at 16:22 MattMcCodeMattMcCode 3077 silver badges20 bronze badges3 Answers
Reset to default 6You can use ES6 reduce
to summarize the array into an object. And use Object.values
to convert the object into an array.
Note: Fiddle does not (currently) working. So you might need to test it on your browser.
var array=[['Company A','A-Email','A-Phone',2,5,10],['Company A','A-Email',,1,10,7],['Company A',,'A-Phone',3,2,4],['Company B','B-Email',,1,10,7],['Company B','B-Email','B-Phone',5,10,8],['Company C','C-Email','C-Phone',3,2,1]];
var resultArray = Object.values(array.reduce((c, v) => {
c[v[0]] = c[v[0]] || [v[0], null, null].concat(new Array(v.length - 3).fill(0));
c[v[0]][1] = c[v[0]][1] || v[1]; //Update Email
c[v[0]][2] = c[v[0]][2] || v[2]; //Update Phone
//Loop thru the numbers and add
for (var i = 3; i < v.length; i++) c[v[0]][i] += ( v[i] || 0 );
return c;
}, {}));
console.log(resultArray);
Hash tables would be the correct approach (assuming 'Company A' etc are strings; otherwise it's a Map).
var panies = {};
for ( var i = 0; i < array.length; i++ ) {
var item = array[ i ];
var name = item[ 0 ];
var phone = item[ 1 ];
var num1 = item[ 2 ];
var num2 = item[ 3 ];
var num3 = item[ 4 ];
if ( panies[ name ] ) {
var record = panies[ name ];
record[ 1 ] = record[ 1 ] || email;
record[ 2 ] = record[ 2 ] || phone;
record[ 2 ] += num1;
record[ 3 ] += num2;
record[ 4 ] += num3;
} else {
panies[ name ] = [ name, email, phone, num1, num2, num3 ]
}
}
var resultArray = Object.values( panies );
You can try something like below. The main point is to use reduce()
to get an object full of correct data then flatten it back into arrays using Object.values()
.
//initial data
var data = [
['Company A', 'A - Email', 'A - Phone', 2, 5, 10],
['Company A', 'A - Email', , 1, 10, 7],
['Company A', , 'A - Phone', 3, 2, 4],
['Company B', 'B - Email', , 1, 10, 7],
['Company B', 'B - Email', 'B - Phone', 5, 10, 8],
['Company C', 'C - Email', 'C - Phone', 3, 2, 1]
];
//reduce function to organize data
var reducer = function(accumulator, currentValue, currentIdx) {
var [panyId, email, phone, i, j, k] = currentValue;
accumulator[panyId] = {
email: !accumulator[panyId] ? email : !accumulator[panyId].email ? email : accumulator[panyId].email,
phone: !accumulator[panyId] ? phone : !accumulator[panyId].phone ? phone : accumulator[panyId].phone,
i: (accumulator[panyId] ? accumulator[panyId].i : 0) + i,
j: (accumulator[panyId] ? accumulator[panyId].j : 0) + j,
k: (accumulator[panyId] ? accumulator[panyId].k : 0) + k
}
return accumulator;
}
var rawData = data.reduce(reducer, {});
//organize data back into array of arrays
var formattedData = [];
for (key in rawData) {
formattedData.push([key].concat(Object.values(rawData[key])));
}
console.log(formattedData);
本文标签: javascriptReduce an Array of Arrays by valueStack Overflow
版权声明:本文标题:javascript - Reduce an Array of Arrays by value - Stack Overflow 内容由热心网友自发贡献,该文观点仅代表作者本人, 转载请联系作者并注明出处:http://it.en369.cn/questions/1745511658a2153852.html, 本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容,一经查实,本站将立刻删除。
发表评论