val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val map : (elt -> elt) -> t -> t
val length : t -> int
- val merge : bool -> bool -> bool -> bool -> elt -> t -> t -> t
+ val merge : (bool*bool*bool*bool)-> elt -> t -> t -> t
end
module IdSet : ResultSet
+module GResult : ResultSet
val top_down_count : 'a t -> Tree.t -> int
-val top_down : 'a t -> Tree.t -> IdSet.t
+val top_down : 'a t -> Tree.t -> GResult.t
val bottom_up_count :
'a t -> Tree.t -> [> `CONTAINS of 'b | `TAG of Tag.t ] -> int