(***********************************************************************)
(*
- Time-stamp: <Last modified on 2013-02-14 15:39:48 CET by Kim Nguyen>
+ Time-stamp: <Last modified on 2013-04-04 18:41:03 CEST by Kim Nguyen>
*)
type path = single_path list
| PrecedingSibling
| Preceding | Following
-and test = Utils.QNameSet.t
+and test = QNameSet.t * Tree.NodeKind.t
and binop = Eq | Neq | Lt | Gt | Lte | Gte | Or | And | Add | Sub | Mult | Div | Mod
and unop = Neg
and expr =
| Number of [ `Int of int | `Float of float ]
| String of string
- | Fun_call of Utils.QName.t * expr list
+ | Fun_call of QName.t * expr list
| Path of path
| Binop of expr * binop * expr
| Unop of unop * expr
type t = path
-val text : Utils.QNameSet.t
-val node : Utils.QNameSet.t
-val star : Utils.QNameSet.t
+val text : QNameSet.t
+val node : QNameSet.t
+val star : QNameSet.t
val print_binop : Format.formatter -> binop -> unit
val print_unop : Format.formatter -> unop -> unit
val print_path : Format.formatter -> path -> unit
val print_test : Format.formatter -> test -> unit
val print_expr : Format.formatter -> expr -> unit
+val invert_axis : axis -> axis