package qcheck-lin
A multicore testing library for OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
0.8.tar.gz
md5=8e7634814a61bf765ac6989f7fdc49cb
sha512=dfa53117ecbf2e466f6ecddfa91d8eb63a3156fe9e1c5a68fd0da26a4c810312581d9ace4c00c4ab1947614f7fb1d6b686003a09da418d2940ac79a7b744a8eb
doc/src/qcheck-lin.lin/lin.ml.html
Source file lin.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516
module Internal = struct open QCheck include Util module type CmdSpec = sig type t (** The type of the system under test *) type cmd (** The type of commands *) val show_cmd : cmd -> string (** [show_cmd c] returns a string representing the command [c]. *) val gen_cmd : cmd Gen.t (** A command generator. *) val shrink_cmd : cmd Shrink.t (** A command shrinker. To a first approximation you can use [Shrink.nil]. *) type res (** The command result type *) val show_res : res -> string (** [show_res r] returns a string representing the result [r]. *) val equal_res : res -> res -> bool val init : unit -> t (** Initialize the system under test. *) val cleanup : t -> unit (** Utility function to clean up [t] after each test instance, e.g., for closing sockets, files, or resetting global parameters *) val run : cmd -> t -> res (** [run c t] should interpret the command [c] over the system under test [t] (typically side-effecting). *) end (** A functor to create test setups, for all backends (Domain, Thread and Effect). We use it below, but it can also be used independently *) module Make(Spec : CmdSpec) = struct (* plain interpreter of a cmd list *) let interp_plain sut cs = List.map (fun c -> (c, Spec.run c sut)) cs (* plain interpreter ignoring the output and allocating less *) let interp_plain_ignore sut cs = List.iter (fun c -> ignore (Spec.run c sut)) cs let rec gen_cmds fuel = Gen.(if fuel = 0 then return [] else Spec.gen_cmd >>= fun c -> gen_cmds (fuel-1) >>= fun cs -> return (c::cs)) (** A fueled command list generator. *) let gen_cmds_size size_gen = Gen.sized_size size_gen gen_cmds let shrink_triple (seq,p1,p2) = let open Iter in (* Shrinking heuristic: First reduce the cmd list sizes as much as possible, since the interleaving is most costly over long cmd lists. *) (map (fun seq' -> (seq',p1,p2)) (Shrink.list_spine seq)) <+> (match p1 with [] -> Iter.empty | c1::c1s -> Iter.return (seq@[c1],c1s,p2)) <+> (match p2 with [] -> Iter.empty | c2::c2s -> Iter.return (seq@[c2],p1,c2s)) <+> (map (fun p1' -> (seq,p1',p2)) (Shrink.list_spine p1)) <+> (map (fun p2' -> (seq,p1,p2')) (Shrink.list_spine p2)) <+> (* Secondly reduce the cmd data of individual list elements *) (map (fun seq' -> (seq',p1,p2)) (Shrink.list_elems Spec.shrink_cmd seq)) <+> (map (fun p1' -> (seq,p1',p2)) (Shrink.list_elems Spec.shrink_cmd p1)) <+> (map (fun p2' -> (seq,p1,p2')) (Shrink.list_elems Spec.shrink_cmd p2)) let arb_cmds_triple seq_len par_len = let gen_triple = Gen.(int_range 2 (2*par_len) >>= fun dbl_plen -> let seq_pref_gen = gen_cmds_size (int_bound seq_len) in let par_len1 = dbl_plen/2 in let par_gen1 = gen_cmds_size (return par_len1) in let par_gen2 = gen_cmds_size (return (dbl_plen - par_len1)) in triple seq_pref_gen par_gen1 par_gen2) in make ~print:(print_triple_vertical Spec.show_cmd) ~shrink:shrink_triple gen_triple let rec check_seq_cons pref cs1 cs2 seq_sut seq_trace = match pref with | (c,res)::pref' -> if Spec.equal_res res (Spec.run c seq_sut) then check_seq_cons pref' cs1 cs2 seq_sut (c::seq_trace) else (Spec.cleanup seq_sut; false) (* Invariant: call Spec.cleanup immediately after mismatch *) | [] -> match cs1,cs2 with | [],[] -> Spec.cleanup seq_sut; true | [],(c2,res2)::cs2' -> if Spec.equal_res res2 (Spec.run c2 seq_sut) then check_seq_cons pref cs1 cs2' seq_sut (c2::seq_trace) else (Spec.cleanup seq_sut; false) | (c1,res1)::cs1',[] -> if Spec.equal_res res1 (Spec.run c1 seq_sut) then check_seq_cons pref cs1' cs2 seq_sut (c1::seq_trace) else (Spec.cleanup seq_sut; false) | (c1,res1)::cs1',(c2,res2)::cs2' -> (if Spec.equal_res res1 (Spec.run c1 seq_sut) then check_seq_cons pref cs1' cs2 seq_sut (c1::seq_trace) else (Spec.cleanup seq_sut; false)) || (* rerun to get seq_sut to same cmd branching point *) (let seq_sut' = Spec.init () in interp_plain_ignore seq_sut' (List.rev seq_trace); if Spec.equal_res res2 (Spec.run c2 seq_sut') then check_seq_cons pref cs1 cs2' seq_sut' (c2::seq_trace) else (Spec.cleanup seq_sut'; false)) (* Common magic constants *) let seq_len = 20 (* max length of the sequential prefix *) let par_len = 12 (* max length of the parallel cmd lists *) (* Linearization test *) let lin_test ~rep_count ~retries ~count ~name ~lin_prop = let arb_cmd_triple = arb_cmds_triple seq_len par_len in Test.make ~count ~retries ~name arb_cmd_triple (repeat rep_count lin_prop) (* Negative linearization test *) let neg_lin_test ~rep_count ~retries ~count ~name ~lin_prop = let arb_cmd_triple = arb_cmds_triple seq_len par_len in Test.make_neg ~count ~retries ~name arb_cmd_triple (repeat rep_count lin_prop) end end (* Type-representing values *) type constructible = | type deconstructible = | type combinable type noncombinable type (_,_,_,_) ty = | Gen : 'a QCheck.arbitrary * ('a -> string) -> ('a, constructible, 's, combinable) ty | Deconstr : ('a -> string) * ('a -> 'a -> bool) -> ('a, deconstructible, 's, combinable) ty | GenDeconstr : 'a QCheck.arbitrary * ('a -> string) * ('a -> 'a -> bool) -> ('a, 'c, 's, combinable) ty | State : ('s, constructible, 's, noncombinable) ty let gen gen print = Gen (gen,print) let deconstructible print eq = Deconstr (print,eq) let gen_deconstructible gen print eq = GenDeconstr (gen,print,eq) let qcheck_nat64_small = QCheck.(map Int64.of_int small_nat) (* QCheck's string shrinker reduces each char repeatedly which is too excessive for Lin *) let shrink_char c = QCheck.(if c = 'a' then Iter.empty else Iter.return 'a') let shrink_string = QCheck.Shrink.string ~shrink:shrink_char let shrink_bytes = QCheck.Shrink.bytes ~shrink:shrink_char let string = QCheck.(set_shrink shrink_string string) let string_small = QCheck.(set_shrink shrink_string small_string) let string_small_printable = QCheck.(set_shrink shrink_string small_printable_string) let bytes = QCheck.(set_shrink shrink_bytes bytes) let bytes_small = QCheck.(set_shrink shrink_bytes bytes_small) let bytes_small_printable = QCheck.(set_shrink shrink_bytes (bytes_small_of Gen.printable)) let unit = GenDeconstr (QCheck.unit, QCheck.Print.unit, (=)) let bool = GenDeconstr (QCheck.bool, QCheck.Print.bool, (=)) let char = GenDeconstr (QCheck.char, QCheck.Print.char, (=)) let char_printable = GenDeconstr (QCheck.printable_char, QCheck.Print.char, (=)) let nat_small = GenDeconstr (QCheck.small_nat, QCheck.Print.int, (=)) let int = GenDeconstr (QCheck.int, QCheck.Print.int, (=)) let int_small = GenDeconstr (QCheck.small_int, QCheck.Print.int, (=)) let int_pos = GenDeconstr (QCheck.pos_int, QCheck.Print.int, (=)) let int_bound b = GenDeconstr (QCheck.int_bound b, QCheck.Print.int, (=)) let int32 = GenDeconstr (QCheck.int32, Int32.to_string, Int32.equal) let int64 = GenDeconstr (QCheck.int64, Int64.to_string, Int64.equal) let nat64_small = GenDeconstr (qcheck_nat64_small, Int64.to_string, Int64.equal) let float = GenDeconstr (QCheck.float, QCheck.Print.float, Float.equal) let string = GenDeconstr (string, QCheck.Print.string, String.equal) let string_small = GenDeconstr (string_small, QCheck.Print.string, String.equal) let string_small_printable = GenDeconstr (string_small_printable, QCheck.Print.string, String.equal) let bytes = GenDeconstr (bytes, QCheck.Print.bytes, Bytes.equal) let bytes_small = GenDeconstr (bytes_small, QCheck.Print.bytes, Bytes.equal) let bytes_small_printable = GenDeconstr (bytes_small_printable, QCheck.Print.bytes, Bytes.equal) let option : type a c s. ?ratio:float -> (a, c, s, combinable) ty -> (a option, c, s, combinable) ty = fun ?ratio ty -> match ty with | Gen (arb, print) -> Gen (QCheck.option ?ratio arb, QCheck.Print.option print) | GenDeconstr (arb, print, eq) -> GenDeconstr (QCheck.option ?ratio arb, QCheck.Print.option print, Option.equal eq) | Deconstr (print, eq) -> Deconstr (QCheck.Print.option print, Option.equal eq) let opt = option let list : type a c s. (a, c, s, combinable) ty -> (a list, c, s, combinable) ty = fun ty -> match ty with | Gen (arb, print) -> Gen (QCheck.list arb, QCheck.Print.list print) | GenDeconstr (arb, print, eq) -> GenDeconstr (QCheck.list arb, QCheck.Print.list print, List.equal eq) | Deconstr (print, eq) -> Deconstr (QCheck.Print.list print, List.equal eq) let list_small : type a c s. (a, c, s, combinable) ty -> (a list, c, s, combinable) ty = fun ty -> match ty with | Gen (arb, print) -> Gen (QCheck.small_list arb, QCheck.Print.list print) | GenDeconstr (arb, print, eq) -> GenDeconstr (QCheck.small_list arb, QCheck.Print.list print, List.equal eq) | Deconstr (print, eq) -> Deconstr (QCheck.Print.list print, List.equal eq) let array : type a c s. (a, c, s, combinable) ty -> (a array, c, s, combinable) ty = fun ty -> match ty with | Gen (arb, print) -> Gen (QCheck.array arb, QCheck.Print.array print) | GenDeconstr (arb, print, eq) -> GenDeconstr (QCheck.array arb, QCheck.Print.array print, Array.for_all2 eq) | Deconstr (print, eq) -> Deconstr (QCheck.Print.array print, Array.for_all2 eq) let array_small : type a c s. (a, c, s, combinable) ty -> (a array, c, s, combinable) ty = fun ty -> match ty with | Gen (arb, print) -> Gen (QCheck.array_of_size QCheck.Gen.small_nat arb, QCheck.Print.array print) | GenDeconstr (arb, print, eq) -> GenDeconstr (QCheck.array_of_size QCheck.Gen.small_nat arb, QCheck.Print.array print, Array.for_all2 eq) | Deconstr (print, eq) -> Deconstr (QCheck.Print.array print, Array.for_all2 eq) let seq_iteri f s = let (_:int) = Seq.fold_left (fun i x -> f i x; i + 1) 0 s in () let print_seq pp s = let b = Buffer.create 25 in Buffer.add_char b '<'; seq_iteri (fun i x -> if i > 0 then Buffer.add_string b "; "; Buffer.add_string b (pp x)) s; Buffer.add_char b '>'; Buffer.contents b let arb_seq size_gen a = let open QCheck in let print = match a.print with None -> None | Some ap -> Some (print_seq ap) in let shrink s = Iter.map List.to_seq (Shrink.list ?shrink:a.shrink (List.of_seq s)) in let gen = Gen.map List.to_seq (Gen.list_size size_gen a.gen) in QCheck.make ?print ~shrink gen let rec seq_equal eq s1 s2 = let open Seq in match s1 (), s2 () with | Nil, Nil -> true | Cons (a, an), Cons (b, bn) when eq a b -> seq_equal eq an bn | _ -> false let seq : type a c s. (a, c, s, combinable) ty -> (a Seq.t, c, s, combinable) ty = fun ty -> match ty with | Gen (arb, print) -> Gen (arb_seq QCheck.Gen.nat arb, print_seq print) | GenDeconstr (arb, print, eq) -> GenDeconstr (arb_seq QCheck.Gen.nat arb, print_seq print, seq_equal eq) | Deconstr (print, eq) -> Deconstr (print_seq print, seq_equal eq) let seq_small : type a c s. (a, c, s, combinable) ty -> (a Seq.t, c, s, combinable) ty = fun ty -> match ty with | Gen (arb, print) -> Gen (arb_seq QCheck.Gen.small_nat arb, print_seq print) | GenDeconstr (arb, print, eq) -> GenDeconstr (arb_seq QCheck.Gen.small_nat arb, print_seq print, seq_equal eq) | Deconstr (print, eq) -> Deconstr (print_seq print, seq_equal eq) let state = State let t = state let print_result print_ok print_err = function | Ok x -> Printf.sprintf "Ok (%s)" (print_ok x) | Error y -> Printf.sprintf "Error (%s)" (print_err y) let or_exn ty = match ty with | GenDeconstr (_, print, eq) -> Deconstr (print_result print Printexc.to_string, Result.equal ~ok:eq ~error:(=)) | Deconstr (print, eq) -> Deconstr (print_result print Printexc.to_string, Result.equal ~ok:eq ~error:(=)) let print : type a c s comb. (a, c, s, comb) ty -> a -> string = fun ty value -> match ty with | Gen (_,print) -> print value | Deconstr (print,_) -> print value | GenDeconstr (_,print,_) -> print value | State -> "t" let equal : type a s c. (a, deconstructible, s, c) ty -> a -> a -> bool = fun ty -> match ty with | Deconstr (_,equal) -> equal | GenDeconstr (_,_,equal) -> equal module Fun = struct (* Function type, number of arguments (unary encoding), state type *) type (_,_,_) fn = | Ret : ('a, deconstructible, 's, combinable) ty -> ('a, 'a, 's) fn | Ret_or_exc : ('a, deconstructible, 's, combinable) ty -> ('a, ('a,exn) result, 's) fn | Ret_ignore : ('a, _, 's, _) ty -> ('a, unit, 's) fn | Ret_ignore_or_exc : ('a, _, 's, _) ty -> ('a, (unit,exn) result, 's) fn | Fn : ('a, constructible, 's, _) ty * ('b, 'r, 's) fn -> ('a -> 'b, 'r, 's) fn end let returning a = Fun.Ret a let returning_or_exc a = Fun.Ret_or_exc a let returning_ a = Fun.Ret_ignore a let returning_or_exc_ a = Fun.Ret_ignore_or_exc a let (@->) a b = Fun.Fn (a,b) type _ elem = | Elem : { name : string ; fntyp : ('ftyp, 'r, 's) Fun.fn ; value : 'ftyp } -> 's elem type 's api = (int * 's elem) list let val_ name value fntyp = (1, Elem { name ; fntyp ; value }) let val_freq freq name value fntyp = (freq, Elem { name ; fntyp ; value }) module type Spec = sig type t val init : unit -> t val cleanup : t -> unit val api : (int * t elem) list end module MakeCmd (ApiSpec : Spec) : Internal.CmdSpec = struct type t = ApiSpec.t let init = ApiSpec.init let cleanup = ApiSpec.cleanup (* Typed argument list and return type descriptor *) module Args = struct type (_,_) args = | Ret : ('a, deconstructible, t, _) ty -> ('a,'a) args | Ret_or_exc : ('a, deconstructible, t, _) ty -> ('a, ('a,exn) result) args | Ret_ignore : ('a, _, t, _) ty -> ('a, unit) args | Ret_ignore_or_exc : ('a, _, t, _) ty -> ('a, (unit,exn) result) args | Fn : 'a * ('b,'r) args -> ('a -> 'b, 'r) args | FnState : ('b,'r) args -> (t -> 'b, 'r) args end (* Operation name, typed argument list, return type descriptor, printer, shrinker, function *) type cmd = Cmd : { name : string ; args : ('ftyp, 'r) Args.args ; rty : ('r, deconstructible, t, _) ty ; print : (('ftyp, 'r) Args.args -> string) ; shrink : (('ftyp, 'r) Args.args QCheck.Shrink.t) ; f : 'ftyp } -> cmd type res = Res : ('a, deconstructible, t, _) ty * 'a -> res (* Function to generate typed list of arguments from a function description. The printer can be generated independently. *) let rec gen_args_of_desc : type a r. (a, r, t) Fun.fn -> ((a, r) Args.args) QCheck.Gen.t = fun fdesc -> let open QCheck.Gen in match fdesc with | Fun.Ret ty -> return @@ Args.Ret ty | Fun.Ret_or_exc ty -> return @@ Args.Ret_or_exc ty | Fun.Ret_ignore_or_exc ty -> return @@ Args.Ret_ignore_or_exc ty | Fun.Ret_ignore ty -> return @@ Args.Ret_ignore ty | Fun.(Fn (State, fdesc_rem)) -> let* args_rem = gen_args_of_desc fdesc_rem in return @@ Args.FnState args_rem | Fun.(Fn ((Gen (arg_arb,_) | GenDeconstr (arg_arb, _, _)), fdesc_rem)) -> let* arg = arg_arb.gen in let* args_rem = gen_args_of_desc fdesc_rem in return @@ Args.Fn (arg, args_rem) let rec ret_type : type a r. (a,r,t) Fun.fn -> (r, deconstructible, t, _) ty = fun fdesc -> match fdesc with | Fun.Ret ty -> ty | Fun.Ret_or_exc ty -> or_exn ty | Fun.Ret_ignore _ -> unit | Fun.Ret_ignore_or_exc _ -> or_exn unit | Fun.Fn (_, fdesc_rem) -> ret_type fdesc_rem let rec show_args : type a r. (a,r,t) Fun.fn -> (a,r) Args.args -> string list = fun fdesc args -> match fdesc,args with | _, Args.(Ret _ | Ret_or_exc _ | Ret_ignore _ | Ret_ignore_or_exc _) -> [] | Fun.(Fn (State, fdesc_rem)), Args.(FnState args_rem) -> "t"::show_args fdesc_rem args_rem | Fun.(Fn ((GenDeconstr _ | Gen _ as ty), fdesc_rem)), Args.(Fn (value, args_rem)) -> (print ty value)::show_args fdesc_rem args_rem | Fun.(Fn (State, _)), Args.(Fn _) | Fun.(Fn ((Gen _ | GenDeconstr _), _)), Args.(FnState _) -> assert false | Fun.(Ret _ | Ret_or_exc _ | Ret_ignore _ | Ret_ignore_or_exc _), Args.(Fn _ | FnState _) -> assert false let gen_printer : type a r. string -> (a,r,t) Fun.fn -> (a,r) Args.args -> string = fun name fdesc args -> name ^ " " ^ (String.concat " " (show_args fdesc args)) (* Extracts a QCheck shrinker for argument lists *) let rec gen_shrinker_of_desc : type a r. (a, r, t) Fun.fn -> ((a, r) Args.args) QCheck.Shrink.t = fun fdesc -> let open QCheck in match fdesc with | Fun.Ret _ty -> Shrink.nil | Fun.Ret_or_exc _ty -> Shrink.nil | Fun.Ret_ignore_or_exc _ty -> Shrink.nil | Fun.Ret_ignore _ty -> Shrink.nil | Fun.(Fn (State, fdesc_rem)) -> (function (Args.FnState args) -> Iter.map (fun args -> Args.FnState args) (gen_shrinker_of_desc fdesc_rem args) | _ -> failwith "FnState: should not happen") | Fun.(Fn ((Gen (arg_arb,_) | GenDeconstr (arg_arb, _, _)), fdesc_rem)) -> (match arg_arb.shrink with | None -> (function (Args.Fn (a,args)) -> Iter.map (fun args -> Args.Fn (a,args)) (gen_shrinker_of_desc fdesc_rem args) | _ -> failwith "Fn/None: should not happen") | Some shrk -> Iter.(function (Args.Fn (a,args)) -> (map (fun a -> Args.Fn (a,args)) (shrk a)) <+> (map (fun args -> Args.Fn (a,args)) (gen_shrinker_of_desc fdesc_rem args)) | _ -> failwith "Fn/Some: should not happen")) let api = List.map (fun (wgt, Elem { name ; fntyp = fdesc ; value = f }) -> let rty = ret_type fdesc in let open QCheck.Gen in (wgt, gen_args_of_desc fdesc >>= fun args -> let print = gen_printer name fdesc in let shrink = gen_shrinker_of_desc fdesc in return (Cmd { name ; args ; rty ; print ; shrink ; f }))) ApiSpec.api let gen_cmd : cmd QCheck.Gen.t = QCheck.Gen.frequency api let show_cmd (Cmd { args ; print ; _ }) = print args let shrink_cmd (Cmd cmd) = QCheck.Iter.map (fun args -> Cmd { cmd with args }) (cmd.shrink cmd.args) (* Unsafe if called on two [res] whose internal values are of different types. *) let equal_res (Res (deconstr, v1)) (Res (_, v2)) = match deconstr with | Deconstr (_, eq) -> eq v1 (Obj.magic v2) | GenDeconstr (_, _, eq) -> eq v1 (Obj.magic v2) let show_res (Res (deconstr, value)) = match deconstr with | Deconstr (print, _) -> print value | GenDeconstr (_, print, _) -> print value let rec apply_f : type a r. a -> (a, r) Args.args -> t -> r = fun f args state -> match args with | Ret _ -> f | Ret_or_exc _ -> (* A constant value in the API cannot raise an exception *) raise (Invalid_argument "apply_f") | Ret_ignore _ -> () | Ret_ignore_or_exc _ -> (* A constant value in the API cannot raise an exception *) raise (Invalid_argument "apply_f") | FnState (Ret _) -> f state | FnState (Ret_or_exc _) -> begin try Ok (f state) with e -> Error e end | FnState (Ret_ignore _) -> ignore (f state) | FnState (Ret_ignore_or_exc _) -> begin try Ok (ignore @@ f state) with e -> Error e end | FnState (Fn _ as rem) -> apply_f (f state) rem state | FnState (FnState _ as rem) -> apply_f (f state) rem state | Fn (arg, Ret _) -> f arg | Fn (arg, Ret_or_exc _) -> begin try Ok (f arg) with e -> Error e end | Fn (arg, Ret_ignore _) -> ignore @@ f arg | Fn (arg, Ret_ignore_or_exc _) -> begin try Ok (ignore @@ f arg) with e -> Error e end | Fn (arg, (Fn _ as rem)) -> apply_f (f arg) rem state | Fn (arg, (FnState _ as rem)) -> apply_f (f arg) rem state let run cmd state = let Cmd { args ; rty ; f ; _ } = cmd in Res (rty, apply_f f args state) end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>