module Xfile = Diffast_misc.Xfilemodule Xhash = Diffast_misc.Xhashmodule Xset = Diffast_misc.Xsetmodule Xlist = Diffast_misc.Xlistmodule Xchannel = Diffast_misc.Xchannelmodule UID = Diffast_misc.UIDmodule GI = Diffast_misc.GIndexmodule Comp = Diffast_misc.Compressionmodule Loc = Diffast_misc.Locmodule Nodetbl = Node.Tblval fprintf : out_channel -> ('a, out_channel, unit) format -> 'aval sprintf : ('a, unit, string) format -> 'atype node_t = Spec.node_tval nps :
unit ->
< data :
< get_category : string
; get_name : string
; get_value : string
; src_loc : Diffast_core.Misc.Loc.t.. >
; uid : Diffast_core.Misc.UID.t.. > ->
stringval nups : unit -> < uid : Diffast_core.Misc.UID.t.. > -> stringval add :
Nodetbl.key Nodetbl.t ->
Nodetbl.key Nodetbl.t ->
Nodetbl.key Nodetbl.t ->
Nodetbl.key Nodetbl.t ->
Nodetbl.key ->
Nodetbl.key ->
Nodetbl.key option * Nodetbl.key optionval tbl_remove : 'a Nodetbl.t -> Nodetbl.key -> unitmodule Json : sig ... endclass +'a c : < _get_adjacency_score :
?anchor:(Node.node_t * Node.node_t) option ->
Node.t ->
Node.t ->
float * (Node.t * Node.t) list
; get_adjacency_score :
?anchor:(Node.node_t * Node.node_t) option ->
Node.t ->
Node.t ->
float
; is_incompatible : 'a -> 'a -> 'a -> 'a -> bool
; tree1 :
< fast_scan_whole_initial : ('a -> unit) -> unit
; fast_scan_whole_initial_subtree : 'a -> ('a -> unit) -> 'b
; get_digest : node_t -> Xhash.t
; initial_leftmost : node_t -> node_t
; iter_initial_ancestor_nodes : 'a -> ('a -> unit) -> 'c
; search_node_by_gindex : int -> 'a.. >
; tree2 :
< fast_scan_whole_initial_subtree : 'a -> ('a -> unit) -> 'd
; get_digest : node_t -> Xhash.t
; initial_leftmost : node_t -> node_t
; initial_subtree_mem : 'a -> 'a -> bool
; iter_initial_ancestor_nodes : 'a -> ('a -> unit) -> unit
; search_node_by_gindex : int -> 'a.. >.. >
Node.cenv_t -> object ... end