package diffast-core

  1. Overview
  2. Docs
val mutable edits : Diffast_core.Spec.node_data_t t list
val mutable _filter : Diffast_core.Spec.node_data_t t -> bool
val edit_tbl2 : (Diffast_misc.UID.t, 'f t list) Hashtbl.t
val mutable stid_count : Diffast_core.Delta_base.subtree_id
val mutable deferred_checks : (unit -> unit) list
val movins_tbl : (move_id, Diffast_core.Spec.node_data_t Diffast_core.Delta_common.SB.Otree.node2 * Diffast_core.Delta_base.path_c * Diffast_core__Delta_base.boundary * bool * Diffast_core.Delta_base.subtree_key option * int option * int option * int option) Hashtbl.t
method fail : 'a. string -> 'a
method private filter : Diffast_core.Spec.node_data_t t -> bool
method private is_node_to_be_lifted : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private is_quasi_upstream : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private has_parent_path : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private reg_deferred_check : (unit -> unit) -> unit
method private do_deferred_checks : unit -> unit
method private pre_cancel_stable_node : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> unit
method private cancel_stable_node : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> unit
method private is_canceled_stable_node : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private is_pre_canceled_stable_node : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private lock_stable_node : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> unit
method private iter_canceled_stable_nodes : 'c Diffast_core.Delta_common.tree_t -> (Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> unit) -> unit
method private restore_canceled_stable_node : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> unit
method has_parent_staying_move1 : Diffast_core.Delta_base.MID.t -> bool
method has_parent_staying_move2 : Diffast_core.Delta_base.MID.t -> bool
method private reg_parent_key1 : Diffast_core__Delta_base.boundary -> Diffast_core.Delta_base.subtree_key -> unit
method private reg_parent_key2 : Diffast_core__Delta_base.boundary -> Diffast_core.Delta_base.subtree_key -> unit
method private reg_intermediate_ofs1 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int -> unit
method private reg_intermediate_ofs2 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int -> unit
method private find_intermediate_ofs1 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int
method private find_intermediate_ofs2 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int
method private has_intermediate_ofs1 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private has_intermediate_ofs2 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private reg_intermediate_pos1 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int -> unit
method private reg_intermediate_pos2 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int -> unit
method private find_intermediate_pos1 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int
method private find_intermediate_pos2 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int
method private add_mem_pos : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> int -> unit
method private gen_stid : unit -> Diffast_core.Delta_base.subtree_id
method private has_stid : Diffast_misc.UID.t -> bool
method private get_subtree_size : Diffast_core.Delta_base.subtree_id -> int
method private has_mid : Diffast_core.Delta_base.subtree_id -> bool
method private find_key_opt : Diffast_misc.UID.t -> Diffast_core.Delta_base.subtree_key option
method iter : (Diffast_core.Spec.node_data_t t -> unit) -> unit
method dump : unit
method find1 : Diffast_misc.UID.t -> 'f t list
method find2 : Diffast_misc.UID.t -> 'f t list
method mem_mov1 : Diffast_misc.UID.t -> bool
method mem_mov2 : Diffast_misc.UID.t -> bool
method is_staying_move : Diffast_core.Delta_base.MID.t -> bool
method private paths_to_have_frac_ofs : < has_frac_ofs : bool.. > list -> bool
method private get_opposite_path_and_excepted_paths : (Diffast_misc.Path.t * Diffast_core.Delta_base.Path.t, Diffast_core.Delta_base.Path.t * Diffast_core.Delta_base.subtree_key * int) Hashtbl.t -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t Diffast_core.Delta_base.Xset.t -> (Diffast_core.Spec.node_data_t Diffast_core.Delta_common.SB.Otree.node2 -> bool) -> (Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool) -> ((Diffast_core.Delta_base.Path.t -> Diffast_core.Delta_base.Path.t) -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t list -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.SB.Otree.node2 * Diffast_core.Delta_base.Path.t * Diffast_core__Delta_base.boundary * int * bool) -> (Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t) -> (Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t) -> 'c Diffast_core.Delta_common.tree_t -> 'c Diffast_core.Delta_common.tree_t -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t list -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t list -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.SB.Otree.node2 * Diffast_core.Delta_base.path_c * Diffast_core__Delta_base.boundary * bool
method _is_upward_staying_move : 'c Diffast_core.Delta_common.tree_t -> Diffast_core.Delta_base.MID.t -> bool
method private are_contiguous_children : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t list -> bool
method private has_offset_parent_ins1 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.SB.Otree.node2 -> bool
method private has_offset_parent_ins2 : Diffast_core.Spec.node_data_t Diffast_core.Delta_common.SB.Otree.node2 -> bool
method private has_parent_ins1 : ?multi:bool -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method private has_parent_ins2 : ?multi:bool -> Diffast_core.Spec.node_data_t Diffast_core.Delta_common.node_t -> bool
method dump_delta_ch : ?extra_ns_decls:(string * string) list -> ?fact_file_name:string -> ?info_file_name:string -> 'b Diffast_core.Node_mapping.c -> Diffast_core.Delta_base.Xchannel.out_channel -> unit
method dump_delta : ?extra_ns_decls:(string * string) list -> ?comp:Compression.c -> ?info_file_path:string -> 'b Diffast_core.Node_mapping.c -> string -> unit
OCaml

Innovation. Community. Security.