Primus_wandering_main.Makemodule Random : sig ... endmodule Machine : Bap_primus.Std.Primus.Machine.Smodule Generate : sig ... endtype 'a m = 'a Machine.tval drop : Core_kernel.Int.Map.Key.t -> t -> treschedule n s performs n attempts to choose a live clone, from the contestants. If nothing was chosen, then draws a new party of contestants and starts again.
The algorithm is guaranteed to terminate since it is guaranteed that there is at least one live state, called the global state.
Note, a winner - the clone that was chosen, is removed from the draw.
val step : 'a -> unit Machine.tval init : unit -> unit Machine.t