diffast-core 0.1 · OCaml Package


  constraint
    'a =
    < acc : 
      ?from:
        Diffast_core.Delta_common.SB.node_data_t_shared as 'b
          Diffast_core.Delta_common.node_t ->
      Diffast_core.Delta_base.Path.t ->
      'b Diffast_core.Delta_common.node_t
    ; initial_acc : 
      ?from:'b Diffast_core.Delta_common.node_t ->
      Diffast_core.Delta_base.Path.t ->
      'b Diffast_core.Delta_common.node_t
    ; initial_acc_parent : 
      ?ignore_ofs:bool ->
      ?from:'b Diffast_core.Delta_common.node_t ->
      Diffast_core.Delta_base.Path.t ->
      'b Diffast_core.Delta_common.node_t
        Diffast_core.Delta_common.Otree.acc_result
    ; initial_to_string : string
    ; make_subtree_copy : 
      ?find_hook:
        ('b Diffast_core.Delta_common.node_t ->
          'b Diffast_core.Delta_common.node_t ->
          unit) ->
      'b Diffast_core.Delta_common.node_t ->
      'a
    ; mutate : 
      (Diffast_core.Delta_common.UID.t,
        'b Diffast_core.Delta_common.node_t
          Diffast_core.Delta_common.Otree.cluster_mutation
          list)
        Hashtbl.t ->
      'b Diffast_core.Delta_common.node_t Diffast_core.Delta_base.Xset.t
    ; preorder_scan_all : (< data : 'b.. > -> unit) -> 'c
    ; prune_initial_nodes : 'b Diffast_core.Delta_common.node_t list -> 'd
    ; rev_scan_whole_initial_subtree : 
      'b Diffast_core.Delta_common.node_t ->
      ('e -> unit) ->
      'f
    ; root : 'b Diffast_core.Delta_common.node_t
    ; scan_whole_initial : ('b Diffast_core.Delta_common.node_t -> unit) -> 'g
    ; search_node_by_uid : 
      Diffast_core.Delta_common.UID.t ->
      'b Diffast_core.Delta_common.node_t
    ; setup_apath : 'h
    ; size_of_initial_cluster : 
      ('b Diffast_core.Delta_common.node_t * 'i list) ->
      int
    ; to_dot_initial : 
      ?mklab:('b Diffast_core.Delta_common.node_t -> string) ->
      'j list ->
      Buffer.t.. >

val op_tbl : (Diffast_core.Delta_common.UID.t,
               'b Diffast_core.Delta_common.node_t
                 Diffast_core.Delta_common.Otree.cluster_mutation
                 list)
               Hashtbl.t

val mutable dup_list : Diffast_core.Delta_base.subtree_key list

val subtree_tbl : (Diffast_core.Delta_base.subtree_id, 'a) Hashtbl.t

val copied_subtree_tbl : (Diffast_core.Delta_common.MID.t, 'a) Hashtbl.t

val copied_subtree_sz_tbl : (Diffast_core.Delta_common.MID.t, int) Hashtbl.t

val del_tbl : ('b Diffast_core.Delta_common.node_t,
                ('b Diffast_core.Delta_common.node_t
                 * 'b Diffast_core.Delta_common.node_t list)
                  list)
                Hashtbl.t

val marked_keys : Diffast_core.Delta_base.subtree_key
                    Diffast_core.Delta_base.Xset.t

val mask_tbl : (Diffast_core.Delta_base.subtree_key,
                 int * int Diffast_core.Delta_base.Xset.t)
                 Hashtbl.t

val upstream_node_tbl : ('b Diffast_core.Delta_common.node_t, int) Hashtbl.t

val quasi_upstream_node_tbl : ('b Diffast_core.Delta_common.node_t, int)
                                Hashtbl.t

val parent_key_tbl : ('b Diffast_core.Delta_common.node_t,
                       Diffast_core.Delta_base.subtree_key)
                       Hashtbl.t

val parent_tbl : ('b Diffast_core.Delta_common.node_t,
                   'b Diffast_core.Delta_common.node_t * int * float)
                   Hashtbl.t

val parent_resolver_tbl : ('b Diffast_core.Delta_common.node_t,
                            unit ->
                            'b Diffast_core.Delta_common.node_t * int * float)
                            Hashtbl.t

val lift_point_tbl : ('b Diffast_core.Delta_common.node_t,
                       (int, float) Hashtbl.t)
                       Hashtbl.t

val key_tbl : ('b Diffast_core.Delta_common.node_t,
                Diffast_core.Delta_base.subtree_key)
                Hashtbl.t

val del_spec_tbl : (Diffast_core.Delta_base.subtree_key,
                     Diffast_core.Delta_base.path_c
                     * Diffast_core.Delta_base.boundary)
                     Hashtbl.t

val sub_del_spec_tbl : (Diffast_core.Delta_base.MID.t,
                         Diffast_core.Delta_base.path_c
                         * Diffast_core.Delta_base.boundary)
                         Hashtbl.t

val deleted_subtree_tbl : ('b Diffast_core.Delta_common.node_t,
                            Diffast_core.Delta_base.subtree_key option)
                            Hashtbl.t

val deleted_mems_tbl : ('b Diffast_core.Delta_common.node_t,
                         ('b Diffast_core.Delta_common.node_t
                          * 'b Diffast_core.Delta_common.node_t list)
                           list)
                         Hashtbl.t

val canceled_dels : 'b Diffast_core.Delta_common.node_t
                      Diffast_core.Delta_base.Xset.t

val excluded_paths_tbl : (Diffast_core.Delta_base.MID.t,
                           'a
                           * 'b Diffast_core.Delta_common.node_t
                           * Diffast_core.Delta_base.boundary)
                           Hashtbl.t

val frontier_tbl : (Diffast_core.Delta_base.MID.t,
                     ('b Diffast_core.Delta_common.SB.Otree.node2 * int) list)
                     Hashtbl.t

val key_link_tbl : (Diffast_core.Delta_base.subtree_key,
                     Diffast_core.Delta_base.subtree_key list)
                     Hashtbl.t

val boundary_tbl : (Diffast_core.Delta_base.subtree_key,
                     Diffast_core.Delta_base.boundary)
                     Hashtbl.t

val roots_of_upstream_staying_move : 'b Diffast_core.Delta_common.node_t
                                       Diffast_core.Delta_base.Xset.t

val extra_upstream_roots : 'b Diffast_core.Delta_common.node_t
                             Diffast_core.Delta_base.Xset.t

val immediately_pruned_nodes : 'k Diffast_core.Delta_base.Xset.t

val forced_upstream_nodes : 'b Diffast_core.Delta_common.node_t
                              Diffast_core.Delta_base.Xset.t

val upstream_dest_tbl : ('b Diffast_core.Delta_common.node_t,
                          Diffast_core.Delta_base.subtree_key)
                          Hashtbl.t

val junc_nodes : 'b Diffast_core.Delta_common.node_t
                   Diffast_core.Delta_base.Xset.t

val staying_moves : Diffast_core.Delta_base.MID.t
                      Diffast_core.Delta_base.Xset.t

val move_relabel_tbl : ('b Diffast_core.Delta_common.node_t,
                         'b Diffast_core.Delta_common.node_t ->
                         unit)
                         Hashtbl.t

val mutable deferred_relabel_list : (unit -> unit) list

val pos_trans_tbl : ('b Diffast_core.Delta_common.node_t,
                      (int,
                        (float, 'b Diffast_core.Delta_common.node_t) Hashtbl.t)
                        Hashtbl.t)
                      Hashtbl.t

val extra_pos_trans_tbl : ('b Diffast_core.Delta_common.node_t,
                            (int,
                              (float, 'b Diffast_core.Delta_common.node_t)
                                Hashtbl.t)
                              Hashtbl.t)
                            Hashtbl.t

val nodes_to_be_shifted : 'b Diffast_core.Delta_common.node_t
                            Diffast_core.Delta_base.Xset.t

val pos_shift_tbl : ('b Diffast_core.Delta_common.node_t, int) Hashtbl.t

val recovered_nodes : 'b Diffast_core.Delta_common.node_t
                        Diffast_core.Delta_base.Xset.t

val path_tbl : ('b Diffast_core.Delta_common.node_t,
                 Diffast_core.Delta_base.path_c)
                 Hashtbl.t

val path_depth_tbl : ('b Diffast_core.Delta_common.node_t, int) Hashtbl.t

val path_key_tbl : ('b Diffast_core.Delta_common.node_t,
                     Diffast_core.Delta_base.subtree_key)
                     Hashtbl.t

val composition_tbl : (Diffast_core.Delta_base.subtree_key,
                        Diffast_core.Delta_base.subtree_key)
                        Hashtbl.t

val renamed_nodes : 'b Diffast_core.Delta_common.node_t
                      Diffast_core.Delta_base.Xset.t

method add_deferred_relabel : (unit -> unit) -> unit

method add_move_relabel : 'b Diffast_core.Delta_common.node_t ->
  ('b Diffast_core.Delta_common.node_t -> unit) ->
  unit

method do_deferred_relabels : unit -> unit

method private get_path : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.Path.t

method private add_composition : Diffast_core.Delta_base.subtree_key ->
  Diffast_core.Delta_base.subtree_key ->
  unit

method private is_ancestor_key : Diffast_core.Delta_base.subtree_key ->
  Diffast_core.Delta_base.subtree_key ->
  bool

method private reg_pos_shift : 'b Diffast_core.Delta_common.node_t ->
  int ->
  unit

method private is_staying_move : Diffast_core.Delta_base.MID.t -> bool

method private is_junc_node : 'b Diffast_core.Delta_common.node_t -> bool

method private force_upstream : ?key_opt:
                                  Diffast_core.Delta_base.subtree_key option ->
  'b Diffast_core.Delta_common.node_t ->
  unit

method private unforce_upstream : 'b Diffast_core.Delta_common.node_t -> unit

method private set_upstream_dest : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key ->
  unit

method private get_upstream_dest : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key

method private is_forced_upstream : 'b Diffast_core.Delta_common.node_t -> bool

method private get_deleted_mems : 'b Diffast_core.Delta_common.node_t ->
  ('b Diffast_core.Delta_common.node_t
   * 'b Diffast_core.Delta_common.node_t list)
    list

method private has_deleted_mems : 'b Diffast_core.Delta_common.node_t -> bool

method private reg_boundary : Diffast_core.Delta_base.subtree_key ->
  Diffast_core.Delta_base.boundary ->
  unit

method private get_boundary : Diffast_core.Delta_base.subtree_key ->
  Diffast_core.Delta_base.boundary

method private link_keys : Diffast_core.Delta_base.subtree_key ->
  Diffast_core.Delta_base.subtree_key ->
  unit

method private get_child_keys : Diffast_core.Delta_base.subtree_key ->
  Diffast_core.Delta_base.subtree_key list

method private is_deleted : 'b Diffast_core.Delta_common.node_t -> bool

method private _find_key_of_deleted : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key

method private _find_key_opt_of_deleted : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key option

method find_key_opt_of_deleted : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key option

method private find_key_of_deleted : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key

method private is_stable : 'b Diffast_core.Delta_common.node_t -> bool

method private find_key : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key

method private remove_key : 'b Diffast_core.Delta_common.node_t -> unit

method private find_key_opt : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key option

method private is_insert : 'b Diffast_core.Delta_common.node_t -> bool

method private find_parent_key : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key

method private find_parent_key_opt : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.subtree_key option

method private has_parent_key_stable : 'b Diffast_core.Delta_common.node_t ->
  bool

method private has_parent_key : 'b Diffast_core.Delta_common.node_t -> bool

method private find_parent : 'b Diffast_core.Delta_common.node_t ->
  'b Diffast_core.Delta_common.node_t * int * float

method private has_parent : 'b Diffast_core.Delta_common.node_t -> bool

method private add_to_parent_tbl : 'b Diffast_core.Delta_common.node_t ->
  ('b Diffast_core.Delta_common.node_t * int * float) ->
  unit

method private register_parent_resolver : 'b Diffast_core.Delta_common.node_t ->
  (unit -> 'b Diffast_core.Delta_common.node_t * int * float) ->
  unit

method private remove_from_parent_tbl : 'b Diffast_core.Delta_common.node_t ->
  unit

method private remove_from_parent_key_tbl : 'b Diffast_core.Delta_common.node_t ->
  unit

method private reg_extra_upstream_root : 'b Diffast_core.Delta_common.node_t ->
  unit

method private is_extra_upstream_root : 'b Diffast_core.Delta_common.node_t ->
  bool

method private reg_root_of_upstream_staying_move : 'b
                                                     Diffast_core.Delta_common.node_t ->
  unit

method private unreg_root_of_upstream_staying_move : 'b
                                                       Diffast_core.Delta_common.node_t ->
  unit

method private is_root_of_upstream_staying_move : 'b
                                                    Diffast_core.Delta_common.node_t ->
  bool

method private reg_upstream_node : 'b Diffast_core.Delta_common.node_t ->
  int ->
  unit

method private reg_quasi_upstream_node : 'b Diffast_core.Delta_common.node_t ->
  int ->
  unit

method private get_upstream_count : 'b Diffast_core.Delta_common.node_t -> int

method private get_quasi_upstream_count : 'b Diffast_core.Delta_common.node_t ->
  int

method private has_key_opt : Diffast_core.Delta_base.subtree_key option ->
  'b Diffast_core.Delta_common.node_t ->
  bool

method private is_upstream_node : 'b Diffast_core.Delta_common.node_t -> bool

method private mark_key : Diffast_core.Delta_base.subtree_key -> unit

method private is_marked_key : Diffast_core.Delta_base.subtree_key -> bool

method private set_mask : Diffast_core.Delta_base.subtree_key ->
  int ->
  int Diffast_core.Delta_base.Xset.t ->
  unit

method private get_mask : Diffast_core.Delta_base.subtree_key ->
  int ->
  int Diffast_core.Delta_base.Xset.t

method find_subtree : Diffast_core.Delta_base.subtree_key -> 'a

method find_copied_subtree_size : Diffast_core.Delta_base.subtree_key -> int

method mutate_tree : 'a ->
  'b Diffast_core.Delta_common.node_t Diffast_core.Delta_base.Xset.t

method init_mutation : 'b Diffast_core.Delta_common.node_t
                         Diffast_core.Delta_base.Xset.t ->
  unit

method private compare_nodes : ?get_idx_opt:
                                 ('b Diffast_core.Delta_common.node_t ->
                                   float option * float option)
                                   option ->
  'b Diffast_core.Delta_common.node_t ->
  'b Diffast_core.Delta_common.node_t ->
  int

method private sort_op_tbl : ?get_idx_opt:
                               ('b Diffast_core.Delta_common.node_t ->
                                 float option * float option)
                                 option ->
  unit ->
  unit

method private get_nodes_from_uid : Diffast_core.Delta_common.UID.t ->
  'b Diffast_core.Delta_common.node_t list

method private setup_pos_trans_tbl : unit -> unit

method private check_pos_trans_tbl : unit -> unit

method private translate_positions : unit -> unit

method private _mutate : ?get_idx_opt:
                           ('b Diffast_core.Delta_common.node_t ->
                             float option * float option)
                             option ->
  ?overwrite:bool ->
  'b Diffast_core.Delta_common.node_t Diffast_core.Delta_base.Xset.t ->
  unit

method private detect_loop : unit -> 'f

method dump_dot_ch : out_channel -> unit

method dump_dot : string -> unit

method mutate : unit -> unit

method prune_deferred : 'b Diffast_core.Delta_common.node_t
                          Diffast_core.Delta_base.Xset.t ->
  unit

method reg_deleted : Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  Diffast_core.Delta_base.subtree_key option ->
  unit

method reg_parent : Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  unit

method reg_subtree : ?key_opt:Diffast_core.Delta_base.subtree_key option ->
  ?adj_opt:int option ->
  ?depth_opt:int option ->
  ?shift_opt:int option ->
  ?dup:bool ->
  Diffast_core.Delta_base.subtree_id ->
  'a ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  unit

method reg_moved_subtree : ?key_opt:Diffast_core.Delta_base.subtree_key option ->
  ?adj_opt:int option ->
  ?depth_opt:int option ->
  ?shift_opt:int option ->
  ?dup:bool ->
  Diffast_core.Delta_base.MID.t ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  unit

method has_p_descendant : ?moveon:('b Diffast_core.Delta_common.node_t -> bool) ->
  ('b Diffast_core.Delta_common.node_t -> bool) ->
  'b Diffast_core.Delta_common.node_t ->
  bool

method has_stable_descendant : 'b Diffast_core.Delta_common.node_t -> bool

method private skip_deleted : ?limit:'b Diffast_core.Delta_common.node_t ->
  'b Diffast_core.Delta_common.node_t ->
  'b Diffast_core.Delta_common.node_t * int

method private _check_key : Diffast_core.Delta_base.subtree_key -> bool

method is_true_stable_node : ?weak:bool ->
  'b Diffast_core.Delta_common.node_t ->
  bool

method has_true_stable_descendant : ?weak:bool ->
  'b Diffast_core.Delta_common.node_t ->
  bool

method has_stable_or_inserted_descendant : 'b Diffast_core.Delta_common.node_t ->
  bool

method make_frontier_tbl : unit -> unit

method insert_cluster : ?partial:bool ->
  'b Diffast_core.Delta_common.node_t ->
  int ->
  float ->
  'b Diffast_core.Delta_common.node_t ->
  ('b Diffast_core.Delta_common.node_t * Diffast_misc.Path.Elem.t) list ->
  unit

method _prune_cluster : 'b Diffast_core.Delta_common.node_t ->
  int ->
  'b Diffast_core.Delta_common.node_t list ->
  unit

method prune_cluster : 'b Diffast_core.Delta_common.SB.Otree.node2 ->
  int ->
  'b Diffast_core.Delta_common.node_t list ->
  unit

method acc : Diffast_core.Delta_base.Path.t ->
  'b Diffast_core.Delta_common.node_t

method acc_from : 'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.Path.t ->
  'b Diffast_core.Delta_common.node_t

method acc_parent : ?ignore_ofs:bool ->
  Diffast_core.Delta_base.Path.t ->
  'b Diffast_core.Delta_common.node_t
    Diffast_core.Delta_common.Otree.acc_result

method boundary_to_nds_from : ?junc:bool ->
  'b Diffast_core.Delta_common.node_t ->
  Diffast_core.Delta_base.boundary ->
  'b Diffast_core.Delta_common.node_t list

method boundary_to_nds : ?junc:bool ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  'b Diffast_core.Delta_common.node_t list

method insert_into_subtree : ?adj:int ->
  ?shift:int ->
  Diffast_core.Delta_base.path_c ->
  int ->
  'a ->
  'a ->
  ('b Diffast_core.Delta_common.node_t * Diffast_misc.Path.Elem.t) list ->
  unit

method interpret_delete : Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  unit

method shift_positions : unit -> unit

method interpret_insert : Diffast_core.Delta_base.subtree_key ->
  'a ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  Diffast_core.Delta_base.subtree_key option ->
  int option ->
  int option ->
  int option ->
  unit

method interpret_move : ?mctl:Diffast_core.Delta_base.move_control ->
  Diffast_core.Delta_base.MID.t ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  Diffast_core.Delta_base.subtree_key option ->
  int option ->
  int option ->
  int option ->
  unit

method interpret_change : ?mctl:Diffast_core.Delta_base.move_control ->
  Diffast_core.Delta_base.path_c ->
  Diffast_core.Delta_base.boundary ->
  'a ->
  unit

method interpret_change_attr : ?mctl:Diffast_core.Delta_base.move_control ->
  Diffast_core.Delta_base.path_c ->
  string ->
  string ->
  unit

method interpret_delete_attr : ?mctl:Diffast_core.Delta_base.move_control ->
  Diffast_core.Delta_base.path_c ->
  string ->
  unit

method interpret_insert_attr : ?mctl:Diffast_core.Delta_base.move_control ->
  Diffast_core.Delta_base.path_c ->
  string ->
  string ->
  unit

method private is_edited_node : 'b Diffast_core.Delta_common.node_t -> bool

method check_potential_duplicate : unit -> unit

package diffast-core