I have a bunch of functions designed for navigating a 2d grid: up, down, rowStart, columnEnd, etc. They all have the signature GridWalker a -> Maybe (GridWalker a). Some of the functions are fairly complex and could descend into an infinite loop if not implemented correctly. So I’d like to write a t…

You could do this: fuzz (Fuzz.map2 Tuple.pair fuzzWalker (Fuzz.list fuzzWalkFunc)) "no sequence of walking functions produces an infinite loop" (\( walker, walkFuncs ) -> GridWalker.walk walkFuncs walker |> always Expe…

You’re question is actually touching on a very fundamental problem “halting problem”. However in your case it is possible to help ensure the loop exits eventually. Things like timeouts, Max depth counters and checking for loops in the current planned path come to mind. Another thing that comes to …

[image] aiko: You’re question is actually touching on a very fundamental problem “halting problem”. However in your case it is possible to help ensure the loop exits eventually. Things like timeouts, Max depth counters and checking for loops in the current planned path come to mind. Another th…

How to test that a function doesn't infinite loop

Learn

Topic		Replies	Views
How to write a Fuzzer (List a) for a non-empty List Learn	20	1504	April 13, 2020
Understanding weird infinite type loop { b \| fn : ∞ -> a } Learn	5	901	March 19, 2021
Idea: add statistical labeling to elm-test Request Feedback	21	2206	May 22, 2019
Why does this Parser loop never end? Learn	1	536	January 23, 2023
Elm-minithesis: shrinking without compromises Show and Tell	26	2454	July 30, 2020

How to test that a function doesn't infinite loop

Related topics