package diffast-langs-java

  1. Overview
  2. Docs
module Java_lib_base = Java_base.Java_lib_base
include module type of struct include Java_lib_base end
module Xprint = Java_lib_base.Xprint
module Sourcecode = Java_lib_base.Sourcecode
module Lang_base = Java_lib_base.Lang_base
module Lib = Java_lib_base.Lib
module Common = Java_lib_base.Common
module Label = Java_lib_base.Label
module Fact = Java_lib_base.Fact
module Tree = Java_lib_base.Tree
module Comparison = Diffast_core.Comparison
module Edit = Diffast_core.Edit
module Lang = Diffast_core.Lang
module Analyzing : sig ... end
module Change : sig ... end
module PP : sig ... end
val sprintf : ('a, unit, string) format -> 'a
val elaborate_edits : < conflicting_pairs_threshold : int ; lock_matches_flag : bool ; mapped_neighbours_difference_threshold : float ; multi_node_match_flag : bool ; prematch_cands_threshold : int ; prematch_subtree_cands_threshold : int ; rename_rectification_level : int ; subtree_match_ratio_threshold : float ; use_adjacency_matches_flag : bool ; verbose_flag : bool.. > -> (Tree.node_t, Tree.c) Comparison.c -> < add_starting_pair_for_glueing : (Diffast_core.Spec.node_t * Diffast_core.Spec.node_t) -> unit ; add_unsettled : Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t option * Diffast_core.Spec.node_t option ; finalize_mapping : Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> unit ; find : Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t ; has_mapping : Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t -> bool ; inv_find : Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 ; iter : (Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> unit) -> 'a ; lock_node : ?key:Diffast_core.Key.t -> Diffast_core.Spec.node_t -> unit ; mem_cod : Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> bool ; mem_dom : Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> bool ; remove : Diffast_core.Node_mapping.Nodetbl.key -> Diffast_core.Node_mapping.Nodetbl.key -> 'b.. > -> < add_edit : Diffast_core.Spec.node_t Diffast_core.Editop.t -> unit ; find1 : Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t Edit.t list ; find12 : Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t Edit.t list ; find2 : Diffast_core.Spec.node_t -> Diffast_core.Spec.node_t Edit.t list ; iter_deletes : (Edit.node_t Edit.t -> unit) -> 'c ; iter_inserts : (Edit.node_t Edit.t -> unit) -> 'd ; iter_relabels : (Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 Edit.t -> unit) -> 'e ; mem_mov12 : Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> Diffast_core.Spec.node_data_t Diffast_core.Spec.SB.Otree.node2 -> bool ; remove_edit : Diffast_core.Spec.node_t Edit.t -> unit.. > -> unit
class tree_patcher : < clear_recover_orig_ast_flag : 'a ; clear_sort_unordered_flag : 'b ; set_recover_orig_ast_flag : 'a ; set_sort_unordered_flag : 'c ; verbose_flag : bool.. > -> Diffast_core.Delta_common.SB.node_data_t_shared Diffast_core.Delta_common.node_t Diffast_core.Delta_common.SB.tree_t_shared Diffast_core.Delta_common.tree_t Diffast_core.Delta_common.tree_t Diffast_core.Delta_common.tree_t Diffast_core.Delta_common.SB.tree_factory_t -> object ... end
OCaml

Innovation. Community. Security.