Question

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 14 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 12 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

// Recursive function
_.each(names, function(parent) { 
    if(parent.children.length > 0) { 
        recursiveFunction(parent.children);
    }
});

function recursiveFunction(children){ 
    _.each(children, function(child) { 
        if(child.children.length > 0) { 
            recursiveFunction(child.children)
        }
    });
}; 

// Deeply nested javascript object
var names = {
    name:  name-1 ,
    value: 10,
    valueTotal: 0, // should be 60 (name-1.1 + name-1.2 + name-1.2.1 + name-1.2.2 + name-1.2.2.1 + name-1.2.2.2)
    children: [{
            name:  name-1.1 ,
            value: 10,
            valueTotal: 0,
            children: []
        }, {
            name:  name-1.2 ,
            value: 10,
            valueTotal: 0, // should be 40 (name-1.2.1 + name-1.2.2 + name-1.2.2.1 + name-1.2.2.2)
            children: [{
                name:  name-1.2.1 ,
                value: 10,
                valueTotal: 0,
                children: []
            }, {
                name:  name-1.2.2 ,
                value: 10,
                valueTotal: 0, // should be 20 (name-1.2.2.1 + name-1.2.2.2)
                children: [{
                    name:  name-1.2.2.1 ,
                    value: 10,
                    valueTotal: 0,
                    children: []
                }, {
                    name:  name-1.2.2.2 ,
                    value: 10,
                    valueTotal: 0,
                    children: []
                }]
            }]
        }]
    }
}

Answer 1

So in fact you wanna do sth like this: every elem asks his childs for its values, these do the same and give back their totalValues plus their own value.

function sumUp(object){
  object.totalValue = 0;
  for(child of object.children){
    object.totalValue += sumUp(child);
   }
   return object.totalValue + object.value;
}

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 11 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

const totalofall = sumUp(names);
console.log(names); //your expected result.

Working example: http://jsbin.com/laxiveyoki/edit?console

Answer 2

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 09 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

function calculateValues(o) {
    o.valueTotal = (o.children || []).reduce(function (r, a) {
        calculateValues(a);				
        return r + (a.value || 0) + (a.valueTotal || 0);
    }, 0);
}

var names = { name:  name-1 , value: 10, valueTotal: 0, children: [{ name:  name-1.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2 , value: 10, valueTotal: 0, children: [{ name:  name-1.2.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2.2 , value: 10, valueTotal: 0, children: [{ name:  name-1.2.2.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2.2.2 , value: 10, valueTotal: 0, children: [] }] }] }] };

calculateValues(names);
console.log(names);

.as-console-wrapper { max-height: 100% !important; top: 0; }

Answer 3

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 07 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

// const objectScan = require( object-scan );

const injectSums = (data) => {
  objectScan([ **.children ], {
    filterFn: ({ parent, value: children }) => {
      parent.valueTotal = children
        .map(({ valueTotal, value }) => valueTotal + value)
        .reduce((a, b) => a + b, 0);
    }
  })(data);
};

const names = { name:  name-1 , value: 10, valueTotal: 0, children: [ { name:  name-1.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2 , value: 10, valueTotal: 0, children: [ { name:  name-1.2.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2.2 , value: 10, valueTotal: 0, children: [ { name:  name-1.2.2.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2.2.2 , value: 10, valueTotal: 0, children: [] } ] } ] }] };

injectSums(names);

console.log(names);
// => { name:  name-1 , value: 10, valueTotal: 60, children: [ { name:  name-1.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2 , value: 10, valueTotal: 40, children: [ { name:  name-1.2.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2.2 , value: 10, valueTotal: 20, children: [ { name:  name-1.2.2.1 , value: 10, valueTotal: 0, children: [] }, { name:  name-1.2.2.2 , value: 10, valueTotal: 0, children: [] } ] } ] } ] }

.as-console-wrapper {max-height: 100% !important; top: 0}

<script src="https://bundle.run/[email protected]"></script>

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 06 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

Answer 4

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 04 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

function sumUpTree(obj, key, totalKey, childrenKey) {
  
  let sumUpTreeInner = (obj) => {
    obj[totalKey] =
      obj[key] +
      (obj[childrenKey] || []).reduce(function (r, child) {
        sumUpTreeInner(child);
        return r + (child[totalKey] || 0);
      }, 0);
  };
  sumUpTreeInner(obj);
}

MYMEMORY WARNING: YOU USED ALL AVAILABLE FREE TRANSLATIONS FOR TODAY. NEXT AVAILABLE IN 23 HOURS 58 MINUTES 03 SECONDS VISIT HTTPS://MYMEMORY.TRANSLATED.NET/DOC/USAGELIMITS.PHP TO TRANSLATE MORE

友情链接