The claim surface intended for open Verdict.Claims. Keeping the open-oriented names in one module means a new combinator is exposed to every migrated test by changing this file alone; the top-level bindings above remain for compatibility with qualified call sites. State and scanner-control helpers deliberately stay outside this module.
val fail : Base.String.t ->Base.unit
val claim : Base.string ->bool ->Base.unit
val p : Base.String.t ->bool ->Base.unit
val pf : ('a, unit, string, bool ->Base.unit)Stdlib.format4->'a
val claimf : ('a, unit, string, bool ->Base.unit)Stdlib.format4->'a
val p_all :
?min:???->Base.String.t ->'aBase.List.t->f:('a->Base.bool)->Base.unit
val p_all2 :
?min:???->Base.String.t ->'aBase.Array.t->'bBase.Array.t->f:('a->'b->Base.bool)->Base.unit
val pf_all2 :
?min:???->('a,
unit,
string,
'bBase.Array.t->'cBase.Array.t->f:('b->'c->Base.bool)->Base.unit)Stdlib.format4->'a
val p_close :
?min:???->?what_ran:???->Base.String.t ->Base__Float.t Base.Array.t->Base__Float.t Base.Array.t->tol:(Base__Float.t ->Base.Float.t)->Base.unit
val pf_close :
?min:???->?what_ran:???->('a,
unit,
string,
Base__Float.t Base.Array.t->Base__Float.t Base.Array.t->tol:(Base__Float.t ->Base.Float.t)->Base.unit)Stdlib.format4->'a
val p_none :
?min:???->Base.String.t ->'aBase.List.t->f:('a->Base.bool)->Base.unit
val p_alli :
?min:???->Base.String.t ->'aBase.List.t->f:(int ->'a->Base.bool)->Base.unit
val p_empty :
?min:???->Base.String.t ->over:'aBase.List.t->'bBase.List.t->Base.unit
val p_exists :
?min:???->Base.String.t ->'aBase.List.t->f:('a-> bool)->Base.unit
val p_pairwise_distinct :
Base.String.t ->'aBase.List.t->equal:('a->'a-> bool)->to_string:('a-> string)->Base.unit
val skipped :
?aggregation:???->backend:Base.String.t ->Base.String.t ->Base.unit
val gated :
?aggregation:???->?detail:???->when_:bool ->on:Base.String.t ->Base.String.t ->Base.bool ->Base.unit
val gated_all :
?aggregation:???->?min:???->when_:bool ->on:Base.String.t ->Base.String.t ->'aBase.List.t->f:('a->Base.bool)->Base.unit
val gated_alli :
?aggregation:???->?min:???->when_:bool ->on:Base.String.t ->Base.String.t ->'aBase.List.t->f:(int ->'a->Base.bool)->Base.unit
val gated_exists :
?aggregation:???->?min:???->when_:bool ->on:Base.String.t ->Base.String.t ->'aBase.List.t->f:('a-> bool)->Base.unit
val pass_fail : ?detail:???->Base.string ->bool ->Base.unit
val pass_fail_all2 :
?min:???->?detail:???->Base.String.t ->'aBase.Array.t->'bBase.Array.t->f:('a->'b->Base.bool)->Base.unit
val pass_fail_close :
?min:???->?what_ran:???->Base.String.t ->Base__Float.t Base.Array.t->Base__Float.t Base.Array.t->tol:(Base__Float.t ->Base.Float.t)->Base.unit
val in_leg :
leg:leg_stateBase.Lazy.t->Base.String.t ->(Base.String.t -> unit)->Base.unit
val in_legf :
leg:leg_stateBase.Lazy.t->('a, unit, string, (Base.String.t -> unit)->Base.unit)Stdlib.format4->'a