[Javascript] Intro to Recursion - Detecting an Infinite Loop
When using recursion, you must be mindful of the dreaded infinite loop
. Using the recursive function that we’ve built up over the previous lessons, we look at how a simple duplicated configuration item could cause chaos for our program as it has no context of which items it has previously seen. We fix this problem by introducing a parents
array, which can keep track of which top-level commands have already been accessed.
Previous:
let input, config; input = ['dist']; config = { "dist": ["build", "deploy"], "build": ['js', 'css', 'vender'], "js": ['babel', 'ng-Annotate', "uglify"], "css": ["sass", "css-min"] }; var res = getTasks(config, input, []); function getTasks(config, input, initial){ return input.reduce((prev, next)=>{ if(config[next]){ return getTasks(config ,config[next], prev); }else{ return prev.concat(next); } }, initial); }; console.log(res);
----------
Code:
let input, config; input = ['dist']; config = { "dist": ["build", "deploy"], "build": ['js', 'css', 'vender', 'dist'], "js": ['babel', 'ng-Annotate', "uglify"], "css": ["sass", "css-min"] }; var res = getTasks(config, input); function getTasks(config, input, initial, parent){ initial = initial || []; parent = parent || []; return input.reduce((prev, next)=>{ if(parent.indexOf(next) > -1){
console.log('infinite loop detected!'); return prev; } if(config[next]){ return getTasks(config ,config[next], prev, parent.concat(next)); }else{ return prev.concat(next); } }, initial); }; console.log(res);
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· SQL Server 2025 AI相关能力初探
· Linux系列:如何用 C#调用 C方法造成内存泄露
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 阿里最新开源QwQ-32B,效果媲美deepseek-r1满血版,部署成本又又又降低了!
· Manus重磅发布:全球首款通用AI代理技术深度解析与实战指南
· 开源Multi-agent AI智能体框架aevatar.ai,欢迎大家贡献代码
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· AI技术革命,工作效率10个最佳AI工具