package diffast-core

  1. Overview
  2. Docs
package diffast-core
Legend:
Library
Module
Module type
Parameter
Class
Class type
module Binding = Diffast_misc.Binding
module Loc = Diffast_misc.Loc
module Xfile = Diffast_misc.Xfile
module Xarray = Diffast_misc.Xarray
module Xlist = Diffast_misc.Xlist
module Xset = Diffast_misc.Xset
module Xhash = Diffast_misc.Xhash
module Xstring = Diffast_misc.Xstring
module Xprint = Diffast_misc.Xprint
module Xchannel = Diffast_misc.Xchannel
module XML = Diffast_misc.XML
module Storage = Diffast_misc.Storage
module Otree = Diffast_misc.Otree
module UID = Diffast_misc.UID
module MID = Moveid
module SB = Spec_base
module BID = Binding.ID
val sprintf : ('a, unit, string) format -> 'a
type name = string
val n_lines_for_file_check : int
val bison_pat : Str.regexp
val flex_pat : Str.regexp
val search_pat : Str.regexp list -> < get_channel : < close_in : unit -> 'a ; input_line : unit -> string.. >.. > -> bool
val is_generated : < get_channel : < close_in : unit -> 'a ; input_line : unit -> string.. >.. > -> bool
val unknown_origin : string
val earliest_origin : string
val dump_gmap_ch : (int * int) list -> out_channel -> unit
val mkgmapfilepath : ?gmap_ext:string -> string -> < hash : string.. > -> string
val dump_gmap : (int * int) list -> string -> unit
val load_gmap_ch : in_channel -> (int * int) list
val load_gmap : string -> (int * int) list
val digest_of_file : < hash_algo : Xhash.algo.. > -> string -> Xhash.t
val encode_digest : < fact_algo : Xhash.algo.. > -> Xhash.t -> string
val encoded_digest_of_file : < fact_algo : Xhash.algo ; hash_algo : Xhash.algo.. > -> string -> string
val merge_locs : < data : < src_loc : Loc.t.. >.. > list -> Loc.t
val is_ghost_node : < data : < src_loc : Loc.t.. >.. > -> bool
val dec_attrs : (string * string) list -> (string * string) list
val has_logical_pos : < initial_parent : < data : < has_ordinal : bool.. >.. >.. > -> bool
val get_logical_pos : ?strict:bool -> < initial_parent : < data : < get_ordinal : 'a -> 'a ; has_ordinal : bool.. >.. > ; initial_pos : 'a.. > -> 'a
val _get_logical_nth_child : < children : 'a array ; data : < get_ordinal : int -> 'b.. >.. > -> 'b -> 'a array
val get_logical_nth_child : < data : < get_ordinal : int -> 'a.. > ; initial_children : 'b array.. > -> 'a -> 'b array
module Tree (L : Spec.LABEL_T) : sig ... end
val scan_ancestors : ?moveon:(< initial_parent : 'a.. > as 'a -> bool) -> 'a -> ('a -> 'b) -> unit
val find_nearest_p_ancestor_node : ?moveon_:(< initial_parent : 'a.. > as 'a -> bool) -> ('a -> bool) -> 'a -> 'a
val find_nearest_mapped_ancestor_node : ?moveon_:(< initial_parent : 'a.. > as 'a -> bool) -> ('a -> bool) -> 'a -> 'a
val scan_descendants : ?moveon:(< initial_children : 'a array.. > as 'a -> bool) -> 'a -> ('a -> 'b) -> unit
val find_nearest_mapped_descendant_nodes : (< initial_children : 'a array.. > as 'a -> bool) -> 'a -> 'a list
type frame = {
  1. f_scope_node : Spec.node_t;
  2. f_table : (name, Spec.node_t) Hashtbl.t;
}
exception Found of Spec.node_t
class stack : object ... end
class visitor : < root : Spec.node_t.. > -> object ... end
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