package diffast-core

  1. Overview
  2. Docs
package diffast-core
Legend:
Page
Library
Module
Module type
Parameter
Class
Class type
Source

Module Diffast_core.Misc

module Xlist = Diffast_misc.Xlist
module Xset = Diffast_misc.Xset
module Xfile = Diffast_misc.Xfile
module UID = Diffast_misc.UID
module Otree = Diffast_misc.Otree
module Loc = Diffast_misc.Loc
val is_use : < data : < binding : B.t.. >.. > -> bool
val is_def : < data : < binding : B.t.. >.. > -> bool
val is_local_def : < data : < binding : B.t.. >.. > -> bool
val is_non_local_def : < data : < binding : B.t.. >.. > -> bool
val get_def_node : < search_node_by_uid : Diffast_misc.UID.t -> 'a.. > -> < data : < binding : B.t.. >.. > -> 'a
val set_tree_size_limit : < set_tree_size_limit1 : int -> 'a ; set_tree_size_limit2 : int -> 'b ; tree_size_limit_percent : int ; tree_size_threshold : int.. > -> int -> int -> 'b
val check_tree_size_limit : < tree_size_limit1 : 'a ; tree_size_limit2 : 'b.. > -> 'a -> 'b -> bool
val check_hard_tree_size_limit : < hard_tree_size_limit : 'a.. > -> 'a -> 'a -> bool
class counter : object ... end
class stopwatch : object ... end
val pause : unit -> unit
val sep_pat : Str.regexp
val get_uqn : string -> string * bool
val uqn_matches : string -> string -> bool
val get_collapsed_children : < initial_children : (< pos : int.. > as 'a) array.. > -> 'a list
val _moderate_nchildren : ?threshold:??? -> 'a list -> 'b -> bool
val moderate_nchildren : ?threshold:??? -> < initial_children : < pos : int.. > array.. > -> bool
val _to_be_flat : < is_leaf : bool.. > list -> 'a -> bool
val to_be_flat : < initial_children : < is_leaf : bool ; pos : int.. > array.. > -> bool
val conv_subtree_node_pairs : < search_node_by_gindex : GI.t -> 'a.. > -> < search_node_by_gindex : GI.t -> 'b.. > -> (< gindex : GI.t.. > * < gindex : GI.t.. >) list -> ('a * 'b) list
val get_home_dir : unit -> string
exception File_found of string
val find_file_name_with_exts : string -> string list -> string option
val node_to_ug_string : < gindex : GI.t ; uid : UID.t.. > -> string
val node_to_u_string : < uid : UID.t.. > -> string
val node_to_g_string : < gindex : GI.t.. > -> string
val nodes_to_us_string : < uid : UID.t.. > list -> string
val nodea_to_us_string : < uid : UID.t.. > array -> string
val nodes_to_gs_string : < gindex : GI.t.. > list -> string
val us_to_string : UID.t list -> string
val gs_to_string : int list -> string
val nodes_to_ugs_string : < gindex : GI.t ; uid : UID.t.. > list -> string
val node_to_loc_string : < data : < src_loc : Loc.t.. >.. > -> string
val node_to_lab_string : < data : < get_category : string ; get_name : string ; get_value : string.. >.. > -> string
val node_to_data_string : < data : < get_category : string ; get_name : string ; get_value : string ; src_loc : Loc.t.. >.. > -> string
val node_to_string : < data : < get_category : string ; get_name : string ; get_value : string ; src_loc : Loc.t.. > ; uid : UID.t.. > -> string
val nups : unit -> < uid : UID.t.. > -> string
val ngps : unit -> < gindex : GI.t.. > -> string
val nugps : unit -> < gindex : GI.t ; uid : UID.t.. > -> string
val nsps : unit -> < uid : UID.t.. > list -> string
val naps : unit -> < uid : UID.t.. > array -> string
val ngsps : unit -> < gindex : GI.t.. > list -> string
val nugsps : unit -> < gindex : GI.t ; uid : UID.t.. > list -> string
val usps : unit -> UID.t list -> string
val gsps : unit -> int list -> string
val locps : unit -> < data : < src_loc : Loc.t.. >.. > -> string
val labps : unit -> < data : < get_category : string ; get_name : string ; get_value : string.. >.. > -> string
val ndps : unit -> < data : < get_category : string ; get_name : string ; get_value : string ; src_loc : Loc.t.. >.. > -> string
val nps : unit -> < data : < get_category : string ; get_name : string ; get_value : string ; src_loc : Loc.t.. > ; uid : UID.t.. > -> string
val ups : unit -> UID.t -> string
val gps : unit -> GI.t -> string
val contract : < contract : 'a list -> (< index : 'c.. > as 'b) list -> 'd ; contraction_candidates : 'e list -> 'f list -> 'a list * 'b list * bool ; fast_subtree_members : 'c -> 'e list ; frontier_of_cluster : 'e list -> 'f list ; get : 'e -> < data : < get_orig_name : 'h ; is_boundary : bool ; is_named_orig : bool.. > ; initial_parent : < initial_children : 'g array.. >.. > as 'g ; is_initial_ancestor : 'g -> 'g -> bool ; prune_nodes : 'b list -> 'i.. > -> < contract : 'j list -> (< index : 'l.. > as 'k) list -> 'm ; contraction_candidates : 'n list -> 'o list -> 'j list * 'k list * bool ; fast_subtree_members : 'l -> 'n list ; frontier_of_cluster : 'n list -> 'o list ; get : 'n -> < data : < get_orig_name : 'q ; is_boundary : bool ; is_named_orig : bool.. > ; initial_parent : < initial_children : 'p array.. >.. > as 'p ; is_initial_ancestor : 'p -> 'p -> bool ; prune_nodes : 'k list -> unit.. > -> ('e * 'n) list list -> ('g * 'p) list option * ('g * 'p) list list
val next_to_each_other : < initial_parent : 'a ; initial_pos : int.. > -> < initial_parent : 'a ; initial_pos : int.. > -> bool
val anc_each_other1 : < is_initial_ancestor : 'a -> 'a -> bool.. > -> 'a -> 'a -> bool
val anc_each_other2 : < is_initial_ancestor : 'a -> 'a -> bool.. > -> 'a -> 'a -> bool
val get_p_ancestor : ?moveon:??? -> ('a -> bool) -> < initial_parent : 'a.. > -> 'a
val get_stmt : < initial_parent : < data : < is_statement : bool.. > ; initial_parent : 'a.. > as 'a.. > -> 'a
val get_block : < initial_parent : < data : < is_block : bool ; is_boundary : bool.. > ; initial_parent : 'a.. > as 'a.. > -> 'a
val has_p_ancestor : ?moveon:??? -> ('a -> bool) -> < initial_parent : 'a.. > -> bool
val get_p_descendants : ?moveon:??? -> ('a -> bool) -> 'a -> 'a list
val has_p_descendant : ?count:??? -> ?moveon:??? -> ('a -> bool) -> 'a -> bool
val count_p_descendant : ?limit:??? -> ?moveon:??? -> ('a -> bool) -> 'a -> int
val is_cross_boundary : ?filt:??? -> < find : 'a -> 'b.. > -> < initial_parent : 'a.. > -> < initial_parent : 'b.. > -> bool
val is_cross_stmt : ?filt:??? -> < find : 'a -> 'b.. > -> < initial_parent : 'a.. > -> < initial_parent : 'b.. > -> bool
val is_ancestor : (< initial_parent : 'a.. > as 'a) -> 'a -> bool
val get_siblings : (< initial_parent : < initial_children : 'a array.. >.. > as 'a) -> 'a list
val get_scope_node : < initial_parent : < data : < is_scope_creating : bool.. > ; initial_parent : 'a.. > as 'a.. > -> 'a
val is_scope_compatible : < find : (< data : < is_scope_creating : bool.. > ; initial_parent : 'a.. > as 'a) -> < data : < is_scope_creating : bool.. > ; initial_parent : 'b.. > as 'b ; inv_find : 'b -> 'a.. > -> < initial_parent : 'a.. > -> < initial_parent : 'b.. > -> bool
val is_cross_scope : < find : (< data : < is_scope_creating : bool.. > ; initial_parent : 'a.. > as 'a) -> < data : < is_scope_creating : bool.. > ; initial_parent : 'b.. > as 'b.. > -> < initial_parent : 'a.. > -> < initial_parent : 'b.. > -> bool
val subtree_rep_eq : < data : < _digest : 'a option.. >.. > -> < data : < _digest : 'a option.. >.. > -> bool
val inv_assq : 'a -> ('b * 'a) list -> 'b
module Tbl1 : sig ... end
module Tbl2 : sig ... end
module Tbl3 : sig ... end
module Tbl4 : sig ... end