end
module Transition :
sig
- type node = State.t * bool * Formula.t * bool
+ type node = State.t * TagSet.t * bool * Formula.t * bool
type data = node
type t
val make : data -> t
val map : (elt -> elt) -> t -> t
val length : t -> int
val merge : (bool*bool*bool*bool)-> elt -> t -> t -> t
+ val mk_quick_tag_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> Tag.t -> (elt -> elt -> 'a*t array)
+ val mk_quick_star_loop : (elt -> elt -> 'a*t array) -> 'a -> int -> Tree.t -> (elt -> elt -> 'a*t array)
end
module IdSet : ResultSet
-module GResult : ResultSet
+module GResult (Doc : sig val doc : Tree.t end) : ResultSet
val top_down_count : 'a t -> Tree.t -> int
-val top_down : 'a t -> Tree.t -> GResult.t
+val top_down : 'a t -> Tree.t -> IdSet.t
val bottom_up_count :
'a t -> Tree.t -> [> `CONTAINS of 'b | `TAG of Tag.t ] -> int
+
+module Test (Doc : sig val doc : Tree.t end ) :
+sig
+ module Results : ResultSet
+ val top_down : 'a t -> Tree.t -> Results.t
+end