package diffast-core

You can search for identifiers within the package.

in-package search v0.2.0

diffast-core
- Diffast_core
  - Adiff
  - Analyzing
    
    F
    
    Label
    
    Postprocessing
    
    mid_data
    
    tree_comparator
  - Astml
    
    Attr
  - Cache
  - Change_base
    
    F
    
    L
    
    c
    
    change_set
  - Charpool
  - Comparison
    
    c
    
    multiple_node_matches
    
    multiple_subtree_matches
    
    pairs
  - Const
  - Delta
    
    Edit
    
    seq
  - Delta_base
    
    Fmt
    
    Irr
    
    Rev
    
    edit_tbl
    
    node_tbl
    
    boundary_path
    
    path_c
  - Delta_common
  - Delta_format
    
    Format
    
    IrreversibleFormat
    
    ReversibleFormat
  - Delta_interpret
    
    interpreter
  - Delta_options
    
    c
  - Dirtree
    
    c
    
    diff_result
    
    node_data
    
    node_map
  - Dirtree_base
    
    c
    
    node_data
  - Edit
    
    formatters_base
    
    seq
    
    seq_base
  - Edit_base
    
    formatters_base
    
    seq_base
  - Editop
  - Engine_options
    
    c
  - Entity
  - Fact_base
    
    F
    
    L
    
    extractor_base
    
    fact_buffer_tbl
    
    fact_store
    
    separate_fact_buffer_tbl
    
    unified_fact_buffer_tbl
  - Fact_options
    
    c
  - Flattreediff
  - GIDfragment
    
    c
  - Info
  - Key
  - Lang
    
    c
    
    lang_t
    
    make_null_tree_patcher
    
    tree_comparator
    
    tree_patcher
  - Lang_base
    
    c
    
    lang_t
    
    tree_builder
    
    tree_factory
  - Misc
    
    Tbl1
    
    Tbl2
    
    Tbl3
    
    Tbl4
    
    counter
    
    stopwatch
  - Moveid
    
    generator
  - Node
    
    M
    
    Tbl
  - Node_mapping
    
    Json
    
    c
  - Options
    
    c
  - Parser_options
    
    c
  - Postprocessing
    
    F
    
    Label
    
    mid_data
  - Proximity
    
    node_proximity
  - Pruned
    
    nodes
  - Sites
    
    Plugins
    
    Lang_specs
    
    Langs
    
    Sites
  - Sourcecode
    
    Tree
    
    L
    
    c
    
    node_data
    
    node_maker
    
    ordinal_tbl
    
    stack
    
    visitor
  - Spec
    
    LABEL_T
    
    nmapping_t
    
    node_data_t
    
    npairs_t
    
    tree_t
  - Spec_base
    
    OutChannel
    
    node_data_t_shared
    
    tree_factory_t
    
    tree_t_shared
  - Stat
    
    Dir
    
    File
  - Treediff
  - Triple
    
    buffer
    
    buffer_base
    
    buffer_directory
    
    buffer_odbc
    
    buffer_virtuoso
    
    dumper
    
    dumper_gen

Legend:
Library
Module
Module type
Parameter
Class
Class type

module Xlist = Diffast_misc.Xlist

module UID = Diffast_misc.UID

module Otree = Diffast_misc.Otree

module Edit = Diffast_misc.Edit

module Mapping = Diffast_misc.Mapping

module ZS = Diffast_misc.ZS

module SMP = Diffast_misc.SMP

module Nodetbl = Node.Tbl

val nups : unit -> < uid : Diffast_core.Misc.UID.t.. > -> string

val sprintf : ('a, unit, string) format -> 'a

val cost : 
  ?nmap_opt:
    < find : 
      < collapse_locked : bool
        ; data : 
          < digest : 'b
          ; eq : < digest : 'b ; weight : int.. > as 'c -> bool
          ; weight : int.. >
        ; is_collapsed : bool
        ; path : < equals : 'd -> bool.. >.. > as 'a ->
      < collapse_locked : bool
      ; data : 'c
      ; is_collapsed : bool
      ; path : 'd.. > as 'e.. >
      option ->
  < get : int -> 'a.. > ->
  < get : int -> 'e.. > ->
  int ->
  int ->
  int

val semi_semantic_cost : 
  ?nmap_opt:
    < find : 
      < collapse_locked : bool
        ; data : 
          < _anonymized_label : 'b
          ; _stripped_label : 'c
          ; digest : 'd
          ; eq : 
            < _anonymized_label : 'b
              ; _stripped_label : 'c
              ; digest : 'd
              ; get_name : 'f
              ; weight : int.. > as 'e ->
            bool
          ; get_name : 'f
          ; weight : int.. >
        ; is_collapsed : bool
        ; path : < equals : 'g -> bool.. >.. > as 'a ->
      < collapse_locked : bool
      ; data : 'e
      ; is_collapsed : bool
      ; path : 'g.. > as 'h.. >
      option ->
  < get : int -> 'a.. > ->
  < get : int -> 'h.. > ->
  int ->
  int ->
  int

val get_anc_labs_cache : string Nodetbl.t

val get_anc_labs : Nodetbl.key -> string

val semantic_cost : 
  ?nmap_opt:< find : Nodetbl.key -> Nodetbl.key.. > option ->
  ?rely_on_context:bool ->
  < get : int -> Nodetbl.key.. > ->
  < get : int -> Nodetbl.key.. > ->
  int ->
  int ->
  int

val _find : 
  (< get : Diffast_misc.Otree.index -> < data : < equals : 'b -> bool.. >.. >
     ; keynodes : Diffast_misc.Otree.index list
     ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
     ; size : int.. > as 'a ->
    < get : Diffast_misc.Otree.index -> < data : 'b.. >
      ; keynodes : Diffast_misc.Otree.index list
      ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
      ; size : int.. > as 'c ->
    int ->
    int ->
    Diffast_misc.Weight.Int.t) ->
  'a ->
  'c ->
  Diffast_misc.Edit.seq
  * Diffast_misc.Mapping.elem list
  * Diffast_misc.Otree.index list

val find : 
  ?nmap_opt:
    < find : 
      < collapse_locked : bool
        ; data : 
          < _anonymized_label : 'b
          ; _stripped_label : 'c
          ; digest : 'd
          ; eq : 
            < _anonymized_label : 'b
              ; _stripped_label : 'c
              ; digest : 'd
              ; get_name : 'f
              ; weight : int.. > as 'e ->
            bool
          ; equals : 'e -> bool
          ; get_name : 'f
          ; weight : int.. >
        ; is_collapsed : bool
        ; path : < equals : 'g -> bool.. >.. > as 'a ->
      < collapse_locked : bool
      ; data : 'e
      ; is_collapsed : bool
      ; path : 'g.. > as 'h.. >
      option ->
  ?check_relabels:bool ->
  < get : Diffast_misc.Otree.index -> 'a
    ; keynodes : Diffast_misc.Otree.index list
    ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
    ; size : int.. > ->
  < get : Diffast_misc.Otree.index -> 'h
    ; keynodes : Diffast_misc.Otree.index list
    ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
    ; size : int.. > ->
  Diffast_misc.Edit.seq
  * Diffast_misc.Mapping.elem list
  * Diffast_misc.Otree.index list

val sfind : 
  ?nmap_opt:< find : Nodetbl.key -> Nodetbl.key.. > option ->
  ?rely_on_context:bool ->
  < get : Diffast_misc.Otree.index -> Nodetbl.key
    ; keynodes : Diffast_misc.Otree.index list
    ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
    ; size : int.. > ->
  < get : Diffast_misc.Otree.index -> Nodetbl.key
    ; keynodes : Diffast_misc.Otree.index list
    ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
    ; size : int.. > ->
  Diffast_misc.Edit.seq
  * Diffast_misc.Mapping.elem list
  * Diffast_misc.Otree.index list

val find_glue_cands : 
  ?simple:bool ->
  'a ->
  'b ->
  Nodetbl.key list ->
  Nodetbl.key list ->
  'c ->
  (Nodetbl.key * Nodetbl.key) list

val fast_match_trees : 
  < root : Nodetbl.key ; scan_all : (Nodetbl.key -> unit) -> 'a.. > ->
  < root : Nodetbl.key ; scan_all : (Nodetbl.key -> unit) -> 'b.. > ->
  < iter : (Nodetbl.key -> Nodetbl.key -> unit) -> 'c.. > ->
  (Nodetbl.key * Nodetbl.key) list
  * (Nodetbl.key * Nodetbl.key) list
  * (Nodetbl.key * Nodetbl.key) list

val match_trees : 
  < _get_adjacency_score : 
    ?anchor:(Node.node_t * Node.node_t) option ->
    Node.t ->
    Node.t ->
    float * (Node.t * Node.t) list
    ; get_adjacency_score : 
      ?anchor:(Node.node_t * Node.node_t) option ->
      Node.t ->
      Node.t ->
      float.. >
    Node.cenv_t ->
  < fast_scan_whole_initial_subtree : Node.t -> ('a -> unit) -> 'b
    ; get : Diffast_misc.Otree.index -> Nodetbl.key
    ; keynodes : Diffast_misc.Otree.index list
    ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
    ; root : Nodetbl.key
    ; scan_all : (Nodetbl.key -> unit) -> 'c
    ; size : int
    ; whole_initial_subtree_size : Node.t -> int.. > ->
  < get : Diffast_misc.Otree.index -> Nodetbl.key
    ; initial_subtree_mem : Node.t -> 'd -> bool
    ; keynodes : Diffast_misc.Otree.index list
    ; leftmost : Diffast_misc.Otree.index -> Diffast_misc.Otree.index
    ; root : Nodetbl.key
    ; scan_all : (Nodetbl.key -> unit) -> 'e
    ; size : int
    ; whole_initial_subtree_size : Node.t -> int.. > ->
  ?partially_mapped:bool ->
  ?root_check:bool ->
  ?semantic:bool ->
  ?check_relabels:bool ->
  < find : Nodetbl.key -> Nodetbl.key ; find_settled : 'a -> 'd.. > ->
  < iter : (Nodetbl.key -> Nodetbl.key -> unit) -> 'f.. > ->
  (Node.t * Node.t) list * (Node.t * Node.t) list * (Node.t * Node.t) list