(** This is the test file to check that qtest works as expected...
  ... because the tester needs to be tested as well. *)

let rec foo x0 f = function
  [] -> x0 | x::xs -> f x (foo x0 f xs)

(*$T foo
  foo  0 ( + ) [1;2;3] = 6  (* hehe *)
  foo  0 ( * ) [1;2;3] = 0  (* haha (*hoho *) *)
  foo  1 ( * ) [4;5]   = 20
  foo 12 ( + ) []      = 12
*)

(*$T foo
  foo 1 ( * ) [4;5] = foo 2 ( * ) [1;5;2]
*)

(*$= foo & ~printer:string_of_int
  (foo 1 ( * ) [4;5]) (foo 2 ( * ) [1;5;2])
*)

(*$Q foo
  Q.small_int (fun i-> foo i (+) [1;2;3] = List.fold_left (+) i [1;2;3])
  (Q.pair Q.small_int (Q.list Q.small_int)) (fun (i,l)-> foo i (+) l = List.fold_left (+) i l)
*)
 
(*$R foo 
  let thing = foo  1 ( * ) 
  and li = [4;5] in
  assert_bool "something_witty" (thing li = 20);
   (* pertinent comment *)
  assert_bool "something_wittier" (1=1)


*)

let rec pretentious_drivel x0 f = function [] -> x0
  | x::xs -> pretentious_drivel (f x x0) f xs

(*$T pretentious_drivel
  pretentious_drivel 1 (+) [4;5] = foo 1 (+) [4;5]
*)

(*$T pretentious_drivel as x
  x 1 (+) [4;5] = foo 1 (+) [4;5]
*)

let rec even = function 0 -> true
  | n -> odd (pred n)
and odd = function 0 -> false
  | n -> even (pred n)

(*$Q even; odd
  Q.small_int (fun n-> odd (abs n+3) = even (abs n))
  *)


(*$Q even as x ; odd as y
  Q.small_int (fun n-> y (abs n+3) = x (abs n))
*)


(*$Q forall x in [foo; pretentious_drivel]
  (Q.pair Q.small_int (Q.list Q.small_int)) (fun (i,l)-> x i (+) l = List.fold_left (+) i l)
*)

(*$Q forall foo in [foo; pretentious_drivel] & ~count:500
  (Q.pair Q.small_int (Q.list Q.small_int)) (fun (i,l)-> foo i (+) l = List.fold_left (+) i l)
*)

(*$= pretentious_drivel as x  & ~printer:string_of_int
  (x 1 (+) [4;5])   (foo 1 (+) [4;5])
*)

(* first argument to an equality passed in parameter *)
(*$=  & ~printer:string_of_int   10
  (foo 1 (+) [5;4])
 
  (foo 1 (+) [4;5])
*)

module Foomod : sig
  val bar : string
(*   val baz : string *)
end = struct
(*$< Foomod *)
  let bar = "bar"
  (*$T bar
    bar.[0] = 'b'
  *)

  (* TODO injection numbering is not right... yet it seems to be ?!? *)
  
  (*${*)
  let baz = "baz"
  (*$}*)
  
  (*$begin:inject*)
  let baz = "boz"
  (*$end:inject*)
  
  (*$T baz
    baz.[2] = 'z'
  *)

  (*$inject let brom = baz *)
  (*$T brom
    brom.[2] = 'z'
  *)

  (* global open *)
  (*$open List, Array *)

  (*${*)
    open Set;;
    open Sys;;
  (*$}*)
  
(*$>*)
end
  (* $T bar
    bar.[0] = 'b'
  *)

module Tree = struct
  type t = Leaf of int | Node of t * t

  let leaf x = Leaf x
  let node x y = Node(x,y)

  let rec size = function
    | Leaf _ -> 1
    | Node (x,y) -> 1 + size x + size y

  (*$< Tree *)

  (*$inject
  let rec print = function
    | Leaf x -> string_of_int x
    | Node(x,y) -> Printf.sprintf "Node(%s, %s)" (print x)(print y)

  let shrink = function
    | Leaf _ -> Q.Iter.empty
    | Node (x,y) -> Q.Iter.of_list [x;y]

  let gen = Q.Gen.(sized @@ fix (fun self n st -> match n with
    | 0 -> map leaf nat st
    | n ->
        frequency [1, map leaf nat ;
                   3, map2 node (self (n/2)) (self (n/2))] st
  ))

  let arb_tree = Q.make ~small:size ~shrink ~print gen
  *)

  let rec rev = function
    | Leaf x -> leaf x
    | Node (x,y) -> node (rev y) (rev x)

  (*$Q
    arb_tree (fun t -> rev (rev t) = t)
    arb_tree (fun t -> size t = size (rev t))
    arb_tree (fun t -> (size t > 1) ==> (t = rev t))
  *)

  (*$>*)
end


module Zooo = struct 
(*$begin:open Zooo *)
  let myplus = (+)
  (*$T myplus
    myplus 4 9 = 13
  *)
(*$end:open*)
end

  (*$T &
    Foomod.bar.[0] = 'b'
  *)

(*$T & 6 =
  2*3
  4+2
*)

(*$= pretentious_drivel as x  
  (x 1 (+) [4;5])   (foo 1 (+) [4;5])
*)
  
(* empty headers: space, nothing, explicit empty param *)
(*$T &
  2+2 = 4 (* some comment *)
*)
(*$T
  2+1 = 3
*)
(*$T &
             1    = 2-1
            2+3 \
              = \
              \
              5
  
  1+1=2
*)

let fuz x = x
let rec flu = function
  | [] -> []
  | x :: l -> if List.mem x l then flu l else x :: flu l
  
(*
(*$Q fuz; flu &  ~small:List.length\
  & ~count:100 \
  & (* test *)
  (Q.list Q.small_int) (fun x -> fuz x = flu x)
*)
*)

let strange_string = " \"
(*$Q fuz; flu &  ~small:List.length\
  & ~count:100 \
  & (* test *)
  (Q.list Q.small_int) (fun x -> fuz x = flu x)
*)
"

(*$T & 6 \
  & =
  2*3
*)


(*$Q & ~count:10
  (Q.small_int_corners ()) (fun n-> n+3 -2 -1 = abs n)
*)

(*$Q & ~max_gen:1000000 ~count:1000000
    (Q.make (fun _ -> ())) (fun () -> true)
*)

(* issue #38 *)
(*$Q & ~count:1_000_000 ~max_fail:3_000
    (Q.make ~print:string_of_int ~small:(fun i -> i) \
      (fun s -> Random.State.int s 1000)) \
      (fun i -> i = i + 1)
*)