如何解决Chrome 开发工具粉碎无限抛出大量消息
下面的 JavaScript 代码声明了一个函数 MoveStandard_1Step
,它有 4 个整数参数。
当我使用某些参数集在 Chrome 开发工具的控制台上运行此程序时,Chrome 开发工具将失去控制。
Example 1:
MoveStandard_1Step(2,2,1)
->它完成没有问题。
Example 2
(让我修
后三个参数的集合 (2,1) )
MoveStandard_1Step(20,1)
->它不会抛出任何错误,但是 Chrome 开发工具开始无限地抛出大量消息并且控制台不接受任何命令。
就连Chrome浏览器本身也出错了,所有的tab都被压死了,最后不得不用任务管理器强行终止Chrome。
以下是说明 MoveStandard_1Step
函数的完整代码:
let kLatticeSize = 100;
let kLatticeHalfSize = 50;
//A vector notation designating the 4 neighborhoods of the cell on which we put the grains.
const kDx = [1,-1,0];
const kDy = [0,1,-1];
const LCoord = () => {
return {x:-1,y:-1}
}
const MoveStandard_1Step = (n,ih,kLatticeSize,kLatticeHalfSize) => {
let z_lat = new Array(kLatticeSize).fill().map(i => new Array(kLatticeSize).fill(ih));
// models the standard lattice Z^2
let v_sites = new Array(kLatticeSize).fill().map(i => new Array(kLatticeSize).fill(false));
// vertices of Z^2 which were visited during the process//which means the neighborhood cells onto which the toppled grains fall.
v_sites[kLatticeHalfSize][kLatticeHalfSize] = true;
let to_be_moved = new Array(kLatticeSize).fill().map(i => new Array(kLatticeSize).fill(false));
// vertices of Z^2 which are already in the walking stack//which means the cell from which a toppling occurs.
let odometer = new Array(kLatticeSize).fill().map(i => new Array(kLatticeSize).fill(0));
// total number of topplings of a given vertex of Z^2
let top = -1;
let walking = new Array(kLatticeSize*kLatticeSize).fill().map(i => LCoord());
//"top" is the number of sites which need to topple in the present avalanche.
//"top = 3" means "3 sites to topple are remaining"
//When we find a site to topple,we increment "top",//and then stack the site into "walking[top]"
//So,"top" can take 0,...,(kLatticeSize * kLatticeSize - 1).
let x = 0,y = 0,lx = 0,ly = 0;
//(x,y): a site to topple
//(lx,ly): a next site to topple
let max_of_top = 0;//max of top in a simulation.
let n_of_moves = 0;//the number of moves occured on this simulation.
for(let i = n;i>=0;i--){
//focusing on the origin
if(++z_lat[kLatticeHalfSize][kLatticeHalfSize] >= 4){// one grain out of 'n' grains being put on the origin,and evaluating if the height of the origin is bigger or equal to 4(the upper limit value of height with which the cell stays stable.).
walking[++top].x = kLatticeHalfSize;
walking[top].y = kLatticeHalfSize;
}
console.log(`i:${i}\n`);
//avalanche
while(top >= 0){
n_of_moves += 1;
console.log(`top=${top}\n`);
if(max_of_top < top){
max_of_top = top;
}
// designate the site which topples.(origin)
x = walking[top].x;
y = walking[top].y;
z_lat[x][y] = z_lat[x][y] - 4;
if (z_lat[x][y] < 4){
top--;
to_be_moved[x][y] = false;
}
//designate sites to topple
//designate sites onto which a grain falls.
//topple.
for (let k = 0; k < 4; ++k){
//designating the neighborhood cells onto which the toppled grains fall.
// 'k' denotes a direction out of 4.(k = 0,3 : right,up,left,down) (refering to "kDx","kDy" on "abel" on "Abel.h")
lx = x + kDx[k];
ly = y + kDy[k];
console.log(`k=${k}:(lx,ly) = (${lx},${ly})`);
if(lx > v_sites.length - 1){
v_sites.push(Array(v_sites.length).fill().map(i => false));
z_lat.push(Array(z_lat.length).fill().map(i => ih));
to_be_moved.push(Array(to_be_moved.length).fill().map(i => false));
}
if(lx < 0){
lx = 0;
v_sites.unshift(Array(v_sites.length).fill().map(i => false));
z_lat.unshift(Array(z_lat.length).fill().map(i => ih));
to_be_moved.unshift(Array(to_be_moved.length).fill().map(i => false));
}
if(ly > v_sites[0].length - 1){
for(let elem of v_sites){elem.push(false);}
for(let elem of z_lat){elem.push(ih);}
for(let elem of to_be_moved){elem.push(false);}
}
if(ly < 0){
ly = 0;
for(let elem of v_sites){elem.unshift(false);}
for(let elem of z_lat){elem.unshift(ih);}
for(let elem of to_be_moved){elem.unshift(false);}
}
//if(lx<0 && ly<0){}
v_sites[lx][ly] = true;//The falling grain lands on the "true" cell which we designated right above.
z_lat[lx][ly]++;//The grain has been piled.
if (to_be_moved[lx][ly] == false && z_lat[lx][ly] >= 4){//fires when a toppling successively occurs.(when "avalanche" continues)
//(lx,ly) cell is going to be the next one to topple.
//Here in this iteration,the integer "top" can take 0,3 (other than 0)
walking[++top].x = lx;
walking[top].y = ly;
to_be_moved[lx][ly] = true;
}
}
}
}
return z_lat;
}
我放了一些 console.log() 来确定哪里出错了,我发现代码中的每个“for 循环”都以某种方式没有完成示例 2(发生问题的地方)。 但我无法找到更多关于此的信息。我不明白为什么这些“for 循环”停止了。 怎么了?
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。