ocaml-containers/qCheck.ml

(*
copyright (c) 2013, simon cruanes
all rights reserved.

redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:

redistributions of source code must retain the above copyright notice, this
list of conditions and the following disclaimer.  redistributions in binary
form must reproduce the above copyright notice, this list of conditions and the
following disclaimer in the documentation and/or other materials provided with
the distribution.

THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*)

(** {6 Quickcheck inspired property-based testing} *)

module Arbitrary = struct
  type 'a t = Random.State.t -> 'a

  let int st = Random.State.int st max_int

  let int_range ?(start=0) ~stop st =
    let n = stop - start in
    if n <= 0
      then 0
      else start + Random.State.int st n

  let bool = Random.State.bool

  let float f st = Random.State.float st f

  let char st = Char.chr (Random.State.int st 128)

  let alpha st =
    Char.chr (Char.code 'a' + Random.State.int st (Char.code 'z' - Char.code 'a'))

  let string ~len st =
    let n = len st in
    assert (n>=0);
    let s = String.create n in
    for i = 0 to n-1 do
      s.[i] <- alpha st
    done;
    s

  let map ar f st = f (ar st)

  let rec _make_list ar st acc n =
    if n = 0 then acc else
      let x = ar st in
      _make_list ar st (x::acc) (n-1)

  let list ~len ar st =
    let n = len st in
    _make_list ar st [] n

  let opt ar st =
    if Random.State.bool st
      then Some (ar st)
      else None

  let list_repeat len ar st =
    _make_list ar st [] len

  let array ~len ar st =
    let n = len st in
    Array.init n (fun _ -> ar st)

  let array_repeat n ar st =
    Array.init n (fun _ -> ar st)

  let among_array a st =
    let i = Random.State.int st (Array.length a) in
    a.(i)

  let among l = among_array (Array.of_list l)

  let among_tbl k =
    failwith "among_tbl: not implemented yet"

  let choose l =
    assert (l <> []);
    let a = Array.of_list l in
    fun st ->
      let i = Random.State.int st (Array.length a) in
      a.(i) st

  let _fix ~max ~depth recursive f =
    let rec ar = lazy (fun st -> (Lazy.force ar_rec) st)
    and ar_rec = lazy (f ar) in
    Lazy.force ar

  let fix ?(max=max_int) ~base f =
    let rec ar = lazy
      (fun depth st ->
        if depth >= max || Random.State.bool st
          then base st (* base case *)
        else  (* recurse *)
          let x = (Lazy.force ar) (depth+1) st in
          f x st)
    in
    Lazy.force ar 0

  let fix_depth ~depth ~base f st =
    let max = depth st in
    fix ~max ~base f st
end

(** {2 Testing} *)

module Prop = struct
  type 'a t = {
    name : string;
    precond : 'a -> bool;
    test: 'a -> bool;
  } (** A simple property on elements of type 'a *)
  
  let __true _ = true

  let make_prop ?(precond=__true) name test = {
    precond;
    name;
    test;
  }

  let (>::) name test = make_prop name test

  let (==>) a b =
    { b with precond = (fun x -> a x && b.precond x); }

  let (&&&) a b =
    { precond = (fun x -> a.precond x && b.precond x);
      name = Printf.sprintf "%s and %s" a.name b.name;
      test = (fun x -> a.test x && b.test x);
    }

  let (|||) a b =
    { precond = (fun x -> a.precond x && b.precond x);
      name = Printf.sprintf "%s or %s" a.name b.name;
      test = (fun x -> a.test x || b.test x);
    }

  let (!!!) a = { a with name = "not " ^ a.name; test = (fun x -> not (a.test x)); }
end

type 'a result =
  | Ok of int * int  (* total number / precond failed *)
  | Failed of 'a list
  | Error of exn

let check ?(rand=Random.State.make_self_init ()) ?(n=100) ~gen ~prop =
  let precond_failed = ref 0 in
  let failures = ref [] in
  try
    for i = 0 to n - 1 do
      let x = gen rand in
      if not (prop.Prop.precond x)
        then incr precond_failed
      else if not (prop.Prop.test x)
        then failures := x :: !failures
    done;
    match !failures with
    | [] -> Ok (n, !precond_failed)
    | _ -> Failed (!failures)
  with e ->
    Error e

(** {2 Main} *)

let run ?pp ?n ~rand ~gen ~prop =
  Printf.printf "testing property %s...\n" prop.Prop.name;
  match check ~rand ?n ~gen ~prop with
  | Ok (n, prefail) ->
    Printf.printf "passed %d tests (%d preconditions failed)\n" n prefail;
    true
  | Failed l ->
    begin match pp with
    | None -> Printf.printf "%d failures\n" (List.length l)
    | Some pp ->
      Printf.printf "%d failures:\n" (List.length l);
      List.iter
        (fun x -> Printf.printf "  %s\n" (pp x))
        l
    end;
    false
  | Error e ->
    Printf.printf "error: %s\n" (Printexc.to_string e);
    false

let run_tests l =
  let rand = Random.State.make_self_init () in
  let res = ref true in
  List.iter (fun test -> if not (test ~rand) then res := false) l;
  if !res
    then Printf.printf "Success!\n"
    else Printf.printf "Failure.\n";
  !res