model-based-testing

问题 As a personal easter project I'm trying to implement some model-based testing at work. I've got a graph implemented in python and I need to traverse all edges / do all transitions of the graph, at least once. Traversing an edge twice or more does not matter, but I need to start and end in the same node and get a sequence of edges/transitions back. Simpler algorithm > shortest sequence. I've looked around and found a lot of algorithms, but I couldn't find one / a combination that works for me.

问题 As an exercise I wanted to implement a 2-3 finger tree. That should be the perfect opportunity to try out FsCheck's model-based testing. I decided to try the newer experimental version. So far I only coded one command for the test machine because I already fail at making that work—one the other hand it keeps the post short. The full code is available on GitHub. open CmdQ open Fuchu open FsCheck open FsCheck.Experimental type TestType = uint16 type ModelType = ResizeArray<TestType> type