Kin*_*ull 7 tree recursion nested node.js async.js
我正在尝试使用async.js遍历嵌套项目的树.遍历仅一个分支后遍历终止.
var count=0;
exports.buildFamily = function(item_id, mback){
var extendedFamily={};
exports.getItembyId(item_id, function(err, item){
extendedFamily=item;
if(item.descendants){
extendedFamily.kids=[];
count=+item.descendants.length;
console.log('outercount ' + count);
async.eachSeries(item.descendants, function(item){
count--
console.log('item: ' + item)
exports.buildFamily(item, function(err, family){
console.log('deepcount: ' + count);
extendedFamily.kids.push(family);
if(count===0){ return mback(null, extendedFamily);}
else {extendedFamily.kids.push(family);}
})
})
}
else{
if(count===0){ return mback(null, extendedFamily);}
else{
extendedFamily.kids.push(family);
return;
}
}
});
};
Run Code Online (Sandbox Code Playgroud)
callback()我误解了图书馆中的用法async.js。这篇文章帮助我理解:http://www.sebastianseilund.com/nodejs-async-in-practice
这是我的解决方案:
exports.buildFamily = function(item_id, done){
console.log('API:buildFamily');
var extendedFamily={}
exports.getItembyId(item_id, function(err, item){
if(err){throw err}
extendedFamily=item;
if(item.descendants){
extendedFamily.kids=[]
async.eachSeries(item.descendants, function(item_id, callback){
exports.getItembyId(item_id, function(err, item){
if(err){throw err}
if(item.descendants){
exports.buildFamily(item.item_id, function(err, family){
extendedFamily.kids.push(family);
callback();
})
}else{
extendedFamily.kids.push(item);
callback();
}
})
}, function(err){
done(null, extendedFamily)
})
}else{
done(null, extendedFamily)
}
});
}
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
387 次 |
| 最近记录: |