package diffast-core

  1. Overview
  2. Docs
package diffast-core
Legend:
Library
Module
Module type
Parameter
Class
Class type
module UID = Diffast_misc.UID
module Otree = Diffast_misc.Otree
module MID = Moveid
module SB = Spec_base
module CB = Change_base
val del_bg : string
val del_fg : string
val ins_bg : string
val ins_fg : string
exception Found
val verbose_msg : < verbose_flag : bool.. > -> ('a, unit, string, unit) format4 -> 'a
val mids_to_string : Diffast_core.Delta_base.MID.t list -> string
val array_range_exists : ('a -> bool) -> 'a array -> int -> int -> bool
val array_range_forall : ('a -> bool) -> 'a array -> int -> int -> bool
val get_range : 'a list -> 'a * 'a
type 'data node_t = 'data SB.node_t
type 'tree tree_t = 'data node_t SB.tree_t_shared as 'tree
val str_opt_to_string : string option -> string
val bool_opt_to_string : bool option -> string
val int_opt_to_string : int option -> string
val mid_opt_to_string : Diffast_core.Delta_base.MID.t option -> string
val attrs_to_string : (string * string) list -> string
val nodes_to_string : SB.node_data_t_shared node_t list -> string
val node_to_uid_string : < gindex : GI.t ; uid : UID.t.. > -> string
val nodes_to_uids_string : < gindex : GI.t ; uid : UID.t.. > list -> string
val nps : unit -> < gindex : GI.t ; uid : UID.t.. > -> string
val nsps : unit -> < gindex : GI.t ; uid : UID.t.. > list -> string
val get_frontier_nodes : < initial_parent : 'a.. > list -> 'a list
val mknmap : < search_node_by_uid : 'a -> 'b.. > -> ('c -> 'a) -> < uid : 'c.. > -> 'b
val scan_initial_cluster : SB.node_data_t_shared as 'a node_t -> 'a node_t list -> ('a node_t -> unit) -> unit
val scan_whole_initial_subtree : ?moveon:(< initial_children : 'a array.. > as 'a -> bool) -> 'a -> ('a -> unit) -> unit
val preorder_scan_whole_initial_subtree : ?moveon:(< initial_children : 'a array.. > as 'a -> bool) -> 'a -> ('a -> unit) -> unit
val rev_scan_whole_initial_subtree : ?moveon: (< initial_children : 'a array ; initial_nchildren : int.. > as 'a -> bool) -> 'a -> ('a -> unit) -> unit
val get_p_descendants : ?keep_going:bool -> ?moveon:(< initial_children : 'a array.. > as 'a -> bool) -> ('a -> bool) -> 'a -> 'a list
val has_p_descendant : ?moveon:(< initial_children : 'a array.. > as 'a -> bool) -> ('a -> bool) -> 'a -> bool
val has_p_sibling : (< initial_parent : < initial_children : 'a array.. >.. > as 'a -> bool) -> 'a -> bool
val has_p_ancestor : ?limit_opt:< initial_parent : 'a.. > as 'a option -> ('a -> bool) -> < initial_parent : 'a.. > -> bool
val get_p_ancestor : ?moveon:(< initial_parent : 'a.. > as 'a -> bool) -> ('a -> bool) -> < initial_parent : 'a.. > -> 'a
val get_p_left_nodes : ?moveon:(< initial_children : 'a array.. > as 'a -> bool) -> ?reset: (< initial_children : 'a array ; initial_parent : 'b ; initial_pos : int.. > as 'b -> bool) -> ('a -> bool) -> 'b -> 'b -> 'a list
val get_p_right_nodes : ?moveon:(< initial_children : 'a array.. > as 'a -> bool) -> ?reset: (< initial_children : 'a array ; initial_parent : 'b ; initial_pos : int.. > as 'b -> bool) -> ('a -> bool) -> 'b -> 'b -> 'a list
val scan_ancestors : ?moveon: (< gindex : GI.t ; initial_parent : 'a ; uid : UID.t.. > as 'a -> bool) -> 'a -> ('a -> 'b) -> unit
val get_ancestors : ?limit:< initial_parent : 'a ; initial_pos : 'b.. > as 'a option -> 'a -> ('a * 'b) list
val is_ancestor : < gindex : GI.t ; initial_parent : 'a ; uid : UID.t.. > as 'a -> 'a -> bool
val get_ancestor_below : < initial_parent : 'a.. > as 'a -> 'a -> 'a
val get_left_sibling_opt : < initial_parent : < initial_children : 'a array.. > ; initial_pos : int.. > -> 'a option
val get_right_sibling_opt : < initial_parent : < initial_children : 'a array.. > ; initial_pos : int.. > -> 'a option
val sort_nodes_by_gindex : ?descending:bool -> < gindex : 'b.. > as 'a list -> 'a list
val postorder_node_sort : < initial_children : 'a array.. > as 'a -> 'a list -> 'a list
val get_adjusted_path : ?get_group:(SB.node_data_t_shared as 'a node_t -> 'a node_t) -> ?group_heads:'a node_t list -> ?get_iparent_opt:('b node_t -> 'b node_t) option -> ('a node_t -> int) -> ('a node_t -> int) -> ('a node_t -> int) -> ('a node_t, int) Hashtbl.t -> ('a node_t -> bool option) -> ('a node_t -> bool) -> (int -> 'a node_t -> bool) -> ('a node_t -> bool) -> 'a node_t -> Diffast_core.Delta_base.Path.t -> Diffast_core.Delta_base.Path.t
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