Module Cgr.Dbtree


module Dbtree: Cgr_dbtree

module D: Cgr_dbbase
module T: Cgr_dbbase.Tree_stats
module Q: Cgr_dbbase.Queries
module M: Dbf_mysql.MysqlDriver

type tree_stats_abstract = {
   tsa_length : int;
   tsa_probs : [ `IID of Cgr_types.probs | `Markov of Cgr_types.markov_probs ];
   tsa_number : int;
}
val get_tree_stats_abstracts : unit -> tree_stats_abstract list
val create_tree_stats : ?progress:(unit -> unit) ->
length:int ->
nb:int ->
[< `IID of Cgr_types.probs | `Markov of Cgr_types.markov_probs ] -> unit
val iter_tree_stats : (T.t -> 'a) -> tree_stats_abstract -> unit
val iter_tree_stats_insertion_levels : (int -> unit) -> tree_stats_abstract -> unit
val max_last_insertion_level : tree_stats_abstract -> int * int
val iter_tree_stats_short_long_branches : (int * int -> unit) -> tree_stats_abstract -> unit
val max_shortest_longest_branches : tree_stats_abstract -> int * int * int * int
val _create_interval : (Dbf_mysql.MysqlDriver.db ->
iid_probs:Cgr_types.probs ->
nodes:int -> (int * M.sql_value option) list) ->
tree_stats_abstract -> float * float * (float * int) array
val last_insertion_level_intervals : tree_stats_abstract -> float * float * (float * int) array
val shortest_branches_intervals : tree_stats_abstract -> float * float * (float * int) array
val longest_branches_intervals : tree_stats_abstract -> float * float * (float * int) array