package diffast-core

  1. Overview
  2. Docs
package diffast-core
Legend:
Library
Module
Module type
Parameter
Class
Class type
constraint 'a = Nodetbl.key
val mutable use_crossing_or_incompatible_matches_count_cache : bool
method use_crossing_or_incompatible_matches_count_cache : bool
val crossing_or_incompatible_matches_count_cache : ('a * 'a, int) Hashtbl.t
val mutable size_of_crossing_or_incompatible_matches_count_cache : int
method size_of_crossing_or_incompatible_matches_count_cache : int
method clear_crossing_or_incompatible_matches_count_cache : unit
val mutable crossing_or_incompatible_matches_count_cache_hit_count : int
method crossing_or_incompatible_matches_count_cache_hit_count : int
val mutable starting_pairs_for_glueing : ('a * 'a) list
method clear_starting_pairs_for_glueing : unit
method set_starting_pairs_for_glueing : ('a * 'a) list -> unit
method remove_starting_pairs_for_glueing : ('a * 'a) list -> unit
method add_starting_pairs_for_glueing : ('a * 'a) list -> unit
method add_starting_pair_for_glueing : ('a * 'a) -> unit
method starting_pairs_for_glueing : ('a * 'a) list
val mutable locked_nodes : Diffast_core.Key.t Nodetbl.t
method is_locked_node : Nodetbl.key -> bool
method lock_node : ?key:Diffast_core.Key.t -> Nodetbl.key -> unit
method unlock_node : 'a -> unit
method key_of_locked_node : Nodetbl.key -> Diffast_core.Key.t
val mutable locked_mappings : ('a * 'a) Xset.t
method lock_mapping : 'a -> 'a -> unit
method is_locked_mapping : 'a -> 'a -> bool
val mutable final_mappings : ('a * 'a) Xset.t
method finalize_mapping : 'a -> 'a -> unit
method is_final_mapping : 'a -> 'a -> bool
val mutable pre_boundary_mappings : ('a * 'a) Xset.t
method add_to_pre_boundary_mapping : 'a -> 'a -> unit
method is_pre_boundary_mapping : 'a -> 'a -> bool
val mutable stable_pairs : 'a Nodetbl.t
method stable_pairs : 'a Nodetbl.t
method set_stable_pairs : 'a Nodetbl.t -> unit
method is_stable_pair : Nodetbl.key -> 'a -> bool
method add_stable_pair : 'a -> 'a -> unit
method find_stable_pair : 'a -> 'a list
method iter_stable_pairs : (Nodetbl.key -> 'a -> unit) -> unit
val map : 'a Nodetbl.t
val s_map : 'a Nodetbl.t
val mutable settled_roots : ('a * 'a) Xset.t
val rev_map : 'a Nodetbl.t
val rev_s_map : 'a Nodetbl.t
val mutable blacklist1 : 'a Xset.t
val mutable blacklist2 : 'a Xset.t
method set_blacklist1 : 'a Xset.t -> unit
method set_blacklist2 : 'a Xset.t -> unit
method size : int
method iter_unsettled : ('a -> 'a -> unit) -> unit
method iter_settled : ('a -> 'a -> unit) -> unit
method iter : ('a -> 'a -> unit) -> unit
method private _iter_sorted : ('a -> 'a -> int) -> 'a Seq.t -> ('a -> 'a -> unit) -> unit
method iter_sorted : ('a -> 'a -> int) -> ('a -> 'a -> unit) -> unit
method iter_unsettled_sorted : ('a -> 'a -> int) -> ('a -> 'a -> unit) -> unit
method iter_settled_sorted : ('a -> 'a -> int) -> ('a -> 'a -> unit) -> unit
method iter_rev : (Nodetbl.key -> 'a -> unit) -> unit
method find_unsettled : 'a -> 'a
method find_settled : 'a -> 'a
method find : 'a -> 'a
method inv_find : 'a -> 'a
method add_unsettled : 'a -> 'a -> 'a option * 'a option
method add_settled : ?stable:bool -> 'a -> 'a -> 'a option * 'a option
method add_settled_roots : 'a -> 'a -> unit
method is_settled_root_pair : 'a -> 'a -> bool
method iter_settled_roots : ('a -> 'a -> unit) -> unit
method iter_settled_roots_sorted : ('a -> 'a -> int) -> ('a -> 'a -> unit) -> unit
method merge_no_override : 'e -> unit
method merge : 'e -> ('a option * 'a option) list
method check_for_ref : Diffast_core.Spec.npairs_t -> 'e -> unit
method merge_checked : 'e -> unit
method mem : 'a -> bool
method mem_unsettled : 'a -> bool
method mem_settled : 'a -> bool
method has_unsettled_mapping : 'a -> 'a -> bool
method has_settled_mapping : 'a -> 'a -> bool
method has_mapping : 'a -> 'a -> bool
method remove : 'a -> 'a -> bool
method remove_settled : 'a -> 'a -> unit
method filter : ('a -> 'a -> bool) -> unit
method promote : 'a -> 'a -> 'a option * 'a option
method demote : 'a -> 'a -> 'a option * 'a option
method private _to_seq : 'a Nodetbl.t -> (Nodetbl.key * 'a) Seq.t
method private _dom : 'a Nodetbl.t -> 'a Seq.t
method private _cod : 'a Nodetbl.t -> 'a Seq.t
method to_seq_unsettled : (Nodetbl.key * 'a) Seq.t
method to_seq_settled : (Nodetbl.key * 'a) Seq.t
method to_seq : (Nodetbl.key * 'a) Seq.t
method to_array : (Nodetbl.key * 'a) array
method to_array_unsettled : (Nodetbl.key * 'a) array
method to_array_settled : (Nodetbl.key * 'a) array
method cod_unsettled : 'a Seq.t
method dom_unsettled : 'a Seq.t
method cod_settled : 'a Seq.t
method dom_settled : 'a Seq.t
method cod : 'a Seq.t
method dom : 'a Seq.t
method to_string_gid : string
method get_mapping_list : unit -> ('a * 'a) list
method get_reduced_mapping_list : unit -> ('a * 'a) list list
method to_string : string
method dump : string -> unit
method dump_json : ?comp:Comp.c -> string -> unit
method dump_with_info : ?comp:Comp.c -> string -> unit
method dump_gid_json : ?comp:Comp.c -> (Nodetbl.key -> 'a -> bool) -> string -> unit
method print_status : unit
method setup_rev_map : unit
method mem_dom : 'a -> bool
method mem_cod : 'a -> bool
method mem_dom_settled : 'a -> bool
method mem_cod_settled : 'a -> bool
method mem_dom_unsettled : 'a -> bool
method mem_cod_unsettled : 'a -> bool
method cleanup_ghost : unit
method count_p_mapping : ('a -> 'a -> 'a -> 'a -> bool) -> 'a -> 'a -> int
method count_crossing_mapping : 'a -> 'a -> int
method count_crossing_matches : 'a -> 'a -> int
method count_crossing_or_incompatible_matches : 'a -> 'a -> int
method count_compatible_noncrossing_matches : 'a -> 'a -> int
method iter_p_mapping : ('a -> 'a -> 'a -> 'a -> bool) -> 'a -> 'a -> ('a -> 'a -> unit) -> unit
method iter_crossing_mapping : 'a -> 'a -> ('a -> 'a -> unit) -> unit
method iter_incompatible_mapping : 'a -> 'a -> ('a -> 'a -> unit) -> unit
method iter_crossing_or_incompatible_mapping : 'a -> 'a -> ('a -> 'a -> unit) -> unit
val reptbl : 'a Nodetbl.t
val mutable reptbl_is_empty : bool
method private clear_reptbl : unit -> unit
method iter_rep_for_crossing : ('a -> 'a -> bool) -> ('a -> 'a -> unit) -> unit
method private cache_rep_for_crossing : ('a -> 'a -> bool) -> unit -> unit
method add_to_rep : Nodetbl.key -> 'a -> unit
method invalidate_rep : Nodetbl.key -> 'a -> unit
method iter_crossing_mapping_rep : ('a -> 'a -> bool) -> 'a -> 'a -> ('a -> 'a -> unit) -> unit
method iter_incompatible_mapping_rep : 'a -> 'a -> ('a -> 'a -> unit) -> unit
method iter_crossing_or_incompatible_mapping_rep : ('a -> 'a -> bool) -> 'a -> 'a -> ('a -> 'a -> unit) -> unit
val mutable partition_a1 : Diffast_core.Spec.SB.Otree.GI.t array
val mutable partition_a2 : Diffast_core.Spec.SB.Otree.GI.t array
method setup_partitions : unit
method private _partition_nodes : Diffast_core.Spec.SB.Otree.GI.t array -> 'a list -> 'a list array
method partition_nodes1 : 'a list -> 'a list array
method partition_nodes2 : 'a list -> 'a list array
method get_subtree_match_score : 'a -> 'a -> int
OCaml

Innovation. Community. Security.

GitHub Discord Twitter Peertube RSS
About
Changelog Releases Industrial Users Academic Users Why OCaml
Ecosystem
Packages Community Events OCaml Planet Jobs
Resources
Install OCaml Get Started Platform Tools Language Manual Standard Library API Books Exercises Papers OCaml Playground Logo
Policies
Carbon Footprint Governance Privacy Code of Conduct