val minn_do : (Weight.Float.t * (unit -> unit)) list -> Weight.Float.tval treedist :
(< get : Otree.index -> < data : < equals : 'b -> bool.. >.. >
; leftmost : Otree.index -> Otree.index.. > as 'a ->
< get : Otree.index -> < data : 'b.. >
; leftmost : Otree.index -> Otree.index.. > as 'c ->
Otree.index ->
Otree.index ->
Weight.Float.t) ->
(Weight.Float.t * Effect.t list) array array ->
'a ->
'c ->
Otree.index ->
Otree.index ->
Weight.Float.t * Effect.t listval find_isomorphic_subtrees :
(Weight.Float.t * 'a) array array ->
< leftmost : int -> int.. > ->
'b ->
(int * int) list ->
int listval find :
(< get : Otree.index -> < data : < equals : 'b -> bool.. >.. >
; keynodes : Otree.index list
; leftmost : Otree.index -> Otree.index
; size : int.. > as 'a ->
< get : Otree.index -> < data : 'b.. >
; keynodes : Otree.index list
; leftmost : Otree.index -> Otree.index
; size : int.. > as 'c ->
int ->
int ->
Weight.Float.t) ->
'a ->
'c ->
Edit.seq * Mapping.elem list * Otree.index list