1 (***********************************************************************)
5 (* Kim Nguyen, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2013 Université Paris-Sud and Centre National de la *)
9 (* Recherche Scientifique. All rights reserved. This file is *)
10 (* distributed under the terms of the GNU Lesser General Public *)
11 (* License, with the special exception on linking described in file *)
14 (***********************************************************************)
17 type stats = private { mutable pass : int;
19 mutable fetch_trans_cache_access : int;
20 mutable fetch_trans_cache_miss : int;
21 mutable eval_trans_cache_access : int;
22 mutable eval_trans_cache_miss : int;
23 mutable nodes_per_run : int list;
26 module Make (T : Tree.S) :
28 module Tree : Tree.S with type node = T.node
29 module ResultSet : Deque.S with type elem = Tree.node
31 val eval : Ata.t -> Tree.t -> ResultSet.t -> ResultSet.t
32 val full_eval : Ata.t -> Tree.t -> ResultSet.t -> (State.t * ResultSet.t) list
33 val stats : unit -> stats