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 : string ->Base.unit
val claim : string ->bool ->Base.unit
val p : string ->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:???->string ->'aBase.List.t->f:('a-> bool)->Base.unit
val p_all2 :
?min:???->string ->'aBase.Array.t->'bBase.Array.t->f:('a->'b-> bool)->Base.unit
val pf_all2 :
?min:???->('a,
unit,
string,
'bBase.Array.t->'cBase.Array.t->f:('b->'c-> bool)->Base.unit)Stdlib.format4->'a
val p_none :
?min:???->string ->'aBase.List.t->f:('a-> bool)->Base.unit
val p_empty :
?min:???->string ->over:'aBase.List.t->'bBase.List.t->Base.unit
val p_exists :
?min:???->string ->'aBase.List.t->f:('a-> bool)->Base.unit
val p_pairwise_distinct :
string ->'aBase.List.t->equal:('a->'a-> bool)->to_string:('a-> string)->Base.unit
val skipped : ?aggregation:???->backend:string ->string ->Base.unit
val pass_fail : ?detail:???->string ->bool ->Base.unit
val pass_fail_all2 :
?min:???->?detail:???->string ->'aBase.Array.t->'bBase.Array.t->f:('a->'b-> bool)->Base.unit