include Sigs.T with type t = int
val make : unit -> t
end
-type merge_conf = NO | MARK | ONLY1 | ONLY2 | ONLY12 | MARK1 | MARK2 | MARK12
+type merge_conf = NO | ONLY1 | ONLY2 | ONLY12 | MARK | MARK1 | MARK2 | MARK12
module StateSet :
sig
include Ptset.S with type elt = int
type t
val hash : t -> int
- val uid : t -> int
+ val uid : t -> Uid.t
val equal : t -> t -> bool
val expr : t -> t expr
val st :
val make : data -> t
val node : t -> data
val hash : t -> int
- val uid : t -> int
+ val uid : t -> Uid.t
val equal : t -> t -> bool
module Infix : sig
val ( ?< ) : State.t -> State.t
module GResult (Doc : sig val doc : Tree.t end) : ResultSet
val top_down_count : 'a t -> Tree.t -> int
+val top_down_count1 : 'a t -> Tree.t -> int
val top_down : 'a t -> Tree.t -> IdSet.t
+val top_down1 : 'a t -> Tree.t -> IdSet.t
+
val bottom_up_count :
'a t -> Tree.t -> [> `CONTAINS of 'b | `TAG of Tag.t ] -> int
val bottom_up :
sig
module Results : ResultSet
val top_down : 'a t -> Tree.t -> Results.t
+ val top_down1 : 'a t -> Tree.t -> Results.t
end