[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);
复制代码

 

posted @   Zhentiw  阅读(270)  评论(0编辑  收藏  举报
(评论功能已被禁用)
编辑推荐:
· 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工具
点击右上角即可分享
微信分享提示