package diffast-misc

  1. Overview
  2. Docs
Miscellaneous functions for Diff/AST

Install 

dune-project
 Dependency

github.com Readme Edit opam file Versions (5)

Authors

  1. C
    Codinuum <codinuum@me.com>
  2. M
    Masatomo Hashimoto <m.hashimoto@stair.center>

Maintainers

  1. C
    Codinuum <codinuum@me.com>
  2. M
    Masatomo Hashimoto <m.hashimoto@stair.center>

Sources

v0.1.tar.gz
sha256=160f704cc31d3cb2131fc6bab9a0fed46c05427eec5713882843b0104b69c324
md5=e8eef8a5b7e58b622dc948a15c87ad7f

doc/diffast-misc/Diffast_misc/LACS/index.html

Module Diffast_misc.LACS

val array3_create : int -> int -> int -> 'a -> 'a array array array
val array3_set : 'a array array array -> (int * int * int) -> 'a -> unit
val array3_get : 'a array array array -> (int * int * int) -> 'a
val conv : (int * int * int * int) -> int * int * int * int
module Cut : sig ... end
module Effect : sig ... end
val find_largest_1 : (int * Effect.t list) array array array -> (int * Effect.t list) array array array -> < get : Otree.index -> < data : < equals : 'a -> bool.. >.. > ; get_roots_of_forest : Otree.index -> Otree.index -> Cut.t ; leftmost : Otree.index -> Otree.index.. > -> < get : Otree.index -> < data : 'a.. > ; get_roots_of_forest : Otree.index -> Otree.index -> Cut.t ; leftmost : Otree.index -> Otree.index.. > -> (Otree.index * Otree.index) -> unit
val find_largest_2 : (int * Effect.t list) array array array -> (int * Effect.t list) array array array -> < get : Otree.index -> < data : < equals : 'a -> bool.. >.. > ; leftmost : Otree.index -> Otree.index.. > -> < get : Otree.index -> < data : 'a.. > ; leftmost : Otree.index -> Otree.index.. > -> (Otree.index * Otree.index) -> int -> unit
val compute_gamma : (int * 'a list) array array array -> < get : int -> < children_indexes : int list.. > ; size : int.. > -> < get : int -> < children_indexes : int list.. > ; size : int.. > -> int -> int * 'a list
exception Subtree
val find_isomorphic_subtrees : (int * 'a) array array array -> < leftmost : int -> int ; size_of_subtree : int -> int.. > -> < size_of_subtree : int -> int.. > -> (int * int) list -> int list
val find_largest : (int * Effect.t list) array array array -> (int * Effect.t list) array array array -> < get : Otree.index -> < children_indexes : int list ; data : < equals : 'a -> bool.. >.. > ; get_roots_of_forest : Otree.index -> Otree.index -> Cut.t ; keynodes : Otree.index list ; leftmost : Otree.index -> Otree.index ; size : int.. > -> < get : Otree.index -> < children_indexes : int list ; data : 'a.. > ; get_roots_of_forest : Otree.index -> Otree.index -> Cut.t ; keynodes : Otree.index list ; leftmost : Otree.index -> Otree.index ; size : int.. > -> int -> int * Edit.seq * Mapping.elem list * Otree.index list * Otree.index list
exception Reached of Edit.seq * Mapping.t * (int * Effect.t list) array array array
val find : < get : Otree.index -> < children_indexes : int list ; data : < equals : 'a -> bool.. >.. > ; get_roots_of_forest : Otree.index -> Otree.index -> Cut.t ; keynodes : Otree.index list ; leftmost : Otree.index -> Otree.index ; size : int ; size_of_subtree : Otree.index -> int.. > -> < get : Otree.index -> < children_indexes : int list ; data : 'a.. > ; get_roots_of_forest : Otree.index -> Otree.index -> Cut.t ; keynodes : Otree.index list ; leftmost : Otree.index -> Otree.index ; size : int ; size_of_subtree : Otree.index -> int.. > -> Edit.seq * Mapping.elem list * Otree.index list