You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
The following algorithm contains the obvious error that the recursive function call has too few arguments, yet the compiler does not report this error, provoking the generation of incorrect code in the backend that does not compile for no apparent reason.
fntransact(maze:Maze,to_map:Vec<(Point,Point)>,frequency:usize,stats:(u32,u32)) -> (Maze,(u32,u32)){/* ... */if(is_not_empty(to_remap)){transact(new_maze, to_remap, ct)}else{
ret
}}
To improve this I suggest a check of arguments for recursive function calls.
The text was updated successfully, but these errors were encountered:
The following algorithm contains the obvious error that the recursive function call has too few arguments, yet the compiler does not report this error, provoking the generation of incorrect code in the backend that does not compile for no apparent reason.
To improve this I suggest a check of arguments for recursive function calls.
The text was updated successfully, but these errors were encountered: