Class Tree.c

val mutable vkind : Diffast_core.Entity.vkind
val mutable version : string
val mutable true_parent_tbl : (Diffast_misc.UID.t, node_t) Hashtbl.t
val mutable total_LOC : int
val mutable token_array : string array
val mutable source_path : string
val mutable source_kind : Diffast_misc.Storage.kind
val mutable source_fullpath : string
val mutable source_digest : Diffast_misc.Xhash.t
val mutable size : int
val mutable proj_root : string
val mutable parser_name : string
val mutable node_table : node_t array
val mutable node_array_pat : node_t array
val mutable node_array : node_t array
val mutable misparsed_regions : (int * int) list
val mutable misparsed_LOC : int
val mutable leftmost_table : int array
val mutable is_empty : bool
val mutable initial_size : int
val mutable initial_leftmost_table : node_t array
val mutable ignored_regions : (int * int) list
val mutable gindex_table : node_t array
val mutable gindex_offset : int
val bid_tbl : (Diffast_misc.Binding.ID.t, string) Hashtbl.t
val mutable _initial_size : int
method _gindex_table : node_t array
method _initial_leftmost : node_t -> node_t
method _initial_leftmost_table : node_t array
method _initial_size : int
method _register_gindexes : unit
method _set_gindex_table : node_t array -> unit
method _set_initial_leftmost_table : node_t array -> unit
method acc : ?from:node_t -> Diffast_misc.Path.t -> node_t
method acc_parent : ?ignore_ofs:bool -> ?from:node_t -> Diffast_misc.Path.t -> node_t Diffast_misc.Otree.acc_result
method add_to_bid_map : Diffast_misc.Binding.ID.t -> Diffast_misc.Binding.ID.t -> unit
method add_to_bid_tbl : Diffast_misc.Binding.ID.t -> string -> unit
method add_to_def_bid_tbl : Diffast_misc.Binding.ID.t -> node_t -> unit
method align_fragments : (int * int) list -> 'b -> unit
method ancestor_nodes : node_t -> node_t list
method collapse : unit
method collapse_node : node_t -> unit
method collapse_nodei : Diffast_misc.Otree.index -> unit
method collapse_nodes : (node_t -> bool) -> unit
method collapse_root : unit
method contract : (Diffast_misc.Otree.index * Diffast_misc.Otree.index list) list -> node_t list -> unit
method contraction_candidates : Diffast_misc.Otree.index list -> Diffast_misc.Otree.index list -> (Diffast_misc.Otree.index * Diffast_misc.Otree.index list) list * node_t list * bool
method delete_node_by_gindex : Diffast_misc.Otree.GI.t -> unit
method digest : Diffast_misc.Xhash.t
method distance : node_t -> node_t -> int
method dump_astml : ?comp:Diffast_misc.Compression.c -> string -> unit
method dump_line_ranges : string -> unit
method dump_subtree_for_delta_ch : node_t -> node_t list -> Diffast_misc.Xchannel.out_channel -> unit
method dump_xml_ch : ?initial:bool -> ?pre_tags:string -> ?post_tags:string -> Diffast_misc.Xchannel.out_channel -> unit
method encoded_source_digest : string
method equals : 'b -> bool
method expand : Diffast_misc.Otree.index list -> unit
method expand_all : node_t -> bool
method expand_nodei : Diffast_misc.Otree.index -> unit
method expand_nodes : node_t list -> unit
method expand_root : unit
method expand_uids : Diffast_misc.UID.t list -> unit
method extra_namespaces : (string * string) list
method fast_rev_scan_whole_initial : (node_t -> unit) -> unit
method fast_rev_scan_whole_initial_subtree : node_t -> (node_t -> unit) -> unit
method fast_scan_all : (node_t -> unit) -> unit
method fast_scan_initial_cluster : (node_t * node_t list) -> (node_t -> unit) -> unit
method fast_scan_whole_initial : (node_t -> unit) -> unit
method fast_scan_whole_initial_subtree : node_t -> (node_t -> unit) -> unit
method fast_size_of_initial_cluster : (node_t * node_t list) -> int
method fast_subtree_members : int -> int list
method fast_whole_initial_subtree_size : node_t -> int
method find_def_for_bid : Diffast_misc.Binding.ID.t -> node_t
method find_label : node_t -> node_t -> node_t list
method find_mapped_bids : Diffast_misc.Binding.ID.t -> Diffast_misc.Binding.ID.t list
method find_name_for_bid : Diffast_misc.Binding.ID.t -> string
method find_nodes_by_line_col_range : ((int * int) * (int * int)) -> node_t list
method find_nodes_by_line_range : (int * int) -> node_t list
method find_token_node : int -> node_t
method find_token_node_pat : int -> node_t
method find_true_parent : Diffast_misc.UID.t -> node_t
method flat_rate : float
method frontier_of_cluster : Diffast_misc.Otree.index list -> Diffast_misc.Otree.index list
method get_all_leaves : node_t list
method get_all_leavesi : Diffast_misc.Otree.index list
method get_digest : node_data Diffast_misc.Otree.node2 -> Diffast_misc.Xhash.t
method get_ident_use_list : Diffast_misc.Otree.GI.t -> string list
method get_leaves : node_t -> node_t list
method get_nearest_boundary : node_t -> node_t
method get_nearest_containing_unit : node_t -> node_t
method get_token_array_pat : Diffast_core.GIDfragment.c -> string array
method get_units_to_be_notified : node_t list
method get_whole_initial_leaves : node_t list
method has_true_children : node_t -> bool
method height : int
method ignored_regions : (int * int) list
method in_subtree_mutually : node_t -> node_t -> bool
method init : unit
method initial_acc : ?from:node_t -> Diffast_misc.Path.t -> node_t
method initial_acc_parent : ?ignore_ofs:bool -> ?from:node_t -> Diffast_misc.Path.t -> node_t Diffast_misc.Otree.acc_result
method initial_ancestor_nodeposs : node_t -> (node_t * int) list
method initial_ancestor_nodes : node_t -> node_t list
method initial_ancestors : Diffast_misc.UID.t -> Diffast_misc.UID.t list
method initial_leftmost : node_t -> node_t
method initial_size : int
method initial_subtree_digest : node_t -> Diffast_misc.Xhash.t
method initial_subtree_mem : node_t -> node_t -> bool
method initial_subtree_to_rep : node_t -> string
method initial_to_rep : string
method initial_to_string : string
method insert_cluster : Diffast_misc.UID.t -> int -> (node_t * (node_t * int) list) -> unit
method is_flat : bool
method is_initial_ancestor : node_t -> node_t -> bool
method is_leaf : Diffast_misc.Otree.index -> bool
method is_member : node_t -> bool
method is_whole : bool
method iter_initial_ancestor_nodeposs : node_t -> (node_t -> int -> unit) -> unit
method iter_initial_ancestor_nodes : node_t -> (node_t -> unit) -> unit
method iter_initial_ancestors : Diffast_misc.UID.t -> (Diffast_misc.UID.t -> unit) -> unit
method iter_whole_initial_leaves : (node_t -> unit) -> unit
method keynodes : int list
method label_match : string -> bool
method leaves : Diffast_misc.Otree.index list
method left_siblings : Diffast_misc.Otree.index -> Diffast_misc.Otree.index list
method leftmost : int -> int
method make_anonymized2_subtree_copy : ?nds_left_named:node_t list -> node_t -> c
method make_anonymized3_subtree_copy : ?nds_left_named:node_t list -> node_t -> c
method make_anonymized_subtree_copy : ?nds_left_named:node_t list -> node_t -> c
method make_subtree_copy : ?find_hook: (node_t -> node_data Diffast_misc.Otree.node2 -> unit) -> node_t -> c
method make_subtree_from_node : node_data Diffast_misc.Otree.node2 -> c
method make_subtree_from_path : Diffast_misc.Path.t -> c
method make_subtree_from_uid : Diffast_misc.UID.t -> c
method match_pat_ch : string -> 'b -> string array -> Diffast_core.GIDfragment.c -> out_channel -> unit
method match_pats : string -> string -> 'b -> Diffast_core.GIDfragment.c list -> unit
method match_token_array_pat_ch : string -> string -> string -> string array -> out_channel -> unit
method mem_gindex : Diffast_misc.Otree.GI.t -> bool
method mem_uid : Diffast_misc.UID.t -> bool
method merge_locs_adjusting_to_boundary : Diffast_misc.Otree.GI.t list -> Diffast_misc.Loc.t
method misparsed_LOC : int
method misparsed_regions : (int * int) list
method nearest_common_ancestor : ?closed:bool -> node_t list -> node_t * int
method nleaves : int
method node_table : node_t array
method nth_gen : Diffast_misc.Otree.index -> int -> node_t list
method parser_name : string
method preorder_reindex : unit
method preorder_scan_all : (node_t -> unit) -> unit
method preorder_scan_alli : (Diffast_misc.Otree.index -> node_t -> unit) -> unit
method preorder_scan_subtree : node_t -> (node_t -> unit) -> unit
method preorder_scan_subtreei : node_t -> (Diffast_misc.Otree.index -> node_t -> unit) -> unit
method preorder_scan_whole_initial : (node_t -> unit) -> unit
method preorder_scan_whole_initial_subtree : node_t -> (node_t -> unit) -> unit
method print : unit
method proj_root : string
method prune : Diffast_misc.Otree.index list -> unit
method prune_cluster : node_t -> node_t list -> unit
method prune_cluster_by_gindex : Diffast_misc.Otree.GI.t -> Diffast_misc.Otree.GI.t list -> unit
method prune_cluster_by_uid : Diffast_misc.UID.t -> Diffast_misc.UID.t list -> unit
method prune_initial_nodes : node_t list -> unit
method prune_nodes : node_t list -> unit
method prune_uids : Diffast_misc.UID.t list -> unit
method recover_all : unit
method recover_and_expand : node_t -> bool
method recover_filtered : (node_t -> bool) -> unit
method recover_true_children : initial_only:bool -> unit -> Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 list
method register_uid : Diffast_misc.UID.t -> node_t -> unit
method reindex : unit
method rev_scan_whole_initial_subtree : node_t -> (node_t -> unit) -> unit
method right_siblings : Diffast_misc.Otree.index -> Diffast_misc.Otree.index list
method root : node_t
method save_dot : string -> int list -> string -> unit
method save_in_xml : ?initial:bool -> ?comp:Diffast_misc.Otree.Comp.c -> ?add_ext:bool -> ?pre_tags:string -> ?post_tags:string -> string -> unit
method save_in_xml_gz : ?initial:bool -> ?add_ext:bool -> ?pre_tags:string -> ?post_tags:string -> string -> unit
method scan : Diffast_misc.Otree.index -> Diffast_misc.Otree.index -> (node_t -> unit) -> unit
method scan_all : (node_t -> unit) -> unit
method scan_alli : (Diffast_misc.Otree.index -> node_t -> unit) -> unit
method scan_cluster : (node_t * node_t list) -> (node_t -> unit) -> unit
method scan_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> (node_t -> unit) -> unit
method scan_initial_cluster : (node_t * node_t list) -> (node_t -> unit) -> unit
method scan_initial_cluster_g : (Diffast_misc.Otree.GI.t * Diffast_misc.Otree.GI.t list) -> (node_t -> unit) -> unit
method scan_initial_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> (node_t -> unit) -> unit
method scan_subtree : node_t -> (node_t -> unit) -> unit
method scan_subtreei : node_t -> (Diffast_misc.Otree.index -> node_t -> unit) -> unit
method scan_whole_initial : (node_t -> unit) -> unit
method scan_whole_initial_subtree : node_t -> (node_t -> unit) -> unit
method scan_whole_subtree : node_t -> (node_t -> unit) -> unit
method search_node_by_gindex : Diffast_misc.Otree.GI.t -> node_t
method search_node_by_uid : Diffast_misc.UID.t -> node_t
method set_digest_of_root : unit
method set_digests : (node_t -> bool) -> unit
method set_ignored_regions : (int * int) list -> unit
method set_misparsed_LOC : int -> unit
method set_misparsed_regions : (int * int) list -> unit
method set_parser_name : string -> unit
method set_proj_root : string -> unit
method set_source_digest : Diffast_misc.Xhash.t -> unit
method set_source_fullpath : string -> unit
method set_source_info : Diffast_misc.Storage.file -> unit
method set_source_kind : Diffast_misc.Storage.kind -> unit
method set_source_path : string -> unit
method set_total_LOC : int -> unit
method set_true_children_tbl : (node_t, Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 array) Hashtbl.t -> unit
method set_true_parent_tbl : (Diffast_misc.UID.t, node_t) Hashtbl.t -> unit
method set_version : string -> unit
method set_vkind : Diffast_core.Entity.vkind -> unit
method setup_apath : unit
method setup_gindex_table : unit
method setup_initial_children : unit
method setup_initial_leftmost_table : unit
method setup_initial_parent : unit
method setup_initial_size : unit
method setup_uid_table : unit
method show_node_array_pat : unit
method size : int
method size_of_cluster : (node_t * node_t list) -> int
method size_of_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> int
method size_of_initial_cluster : (node_t * node_t list) -> int
method size_of_initial_cluster_u : (Diffast_misc.UID.t * Diffast_misc.UID.t list) -> int
method size_of_subtree : Diffast_misc.Otree.index -> int
method size_of_subtree_uid : Diffast_misc.UID.t -> int
method source_digest : Diffast_misc.Xhash.t
method source_fullpath : string
method source_kind : Diffast_misc.Storage.kind
method source_path : string
method subtree_members : Diffast_misc.Otree.index -> Diffast_misc.Otree.index list
method subtree_to_simple_string : Diffast_misc.Otree.GI.t -> string
method to_dot : ?mklab: (Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> string) -> int list -> Buffer.t
method to_rep : string
method to_rep_fast : string
method to_string : string
method to_string_fast : string
method to_token_array : string array
method total_LOC : int
method unparse_ch : ?no_boxing:bool -> ?no_header:bool -> ?fail_on_error:bool -> Diffast_core.Spec_base.OutChannel.t -> unit
method unparse_subtree_ch : ?no_boxing:bool -> ?no_header:bool -> ?fail_on_error:bool -> node_t -> Diffast_core.Spec_base.OutChannel.t -> unit
method unregister_uid : Diffast_misc.UID.t -> unit
method update_leftmost_table : unit
method update_node_table : unit
method update_pos : unit
method update_size : unit
method version : string
method whole_initial_subtree_size : node_t -> int