projects
/
SXSI
/
xpathcomp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Added debugging messages
[SXSI/xpathcomp.git]
/
ata.mli
diff --git
a/ata.mli
b/ata.mli
index
26f5518
..
e8d64b1
100644
(file)
--- a/
ata.mli
+++ b/
ata.mli
@@
-64,16
+64,12
@@
module Transition :
val ( ?< ) : State.t -> State.t
val ( >< ) : State.t -> TagSet.t * bool -> State.t*(TagSet.t*bool*bool)
val ( ><@ ) : State.t -> TagSet.t * bool -> State.t*(TagSet.t*bool*bool)
val ( ?< ) : State.t -> State.t
val ( >< ) : State.t -> TagSet.t * bool -> State.t*(TagSet.t*bool*bool)
val ( ><@ ) : State.t -> TagSet.t * bool -> State.t*(TagSet.t*bool*bool)
- val ( >=> ) : State.t *(TagSet.t*bool*bool) -> Formula.t -> (State.t*TagSet.t*t)
+ val ( >=> ) : State.t *
(TagSet.t*bool*bool) -> Formula.t -> (State.t*TagSet.t*t)
end
val print : Format.formatter -> t -> unit
end
end
val print : Format.formatter -> t -> unit
end
-module SetTagKey : Hashtbl.HashedType with type t = StateSet.t*Tag.t
-
-module CachedTransTable : Hashtbl.S with type key = SetTagKey.t
-
-module Formlist : Ptset.S with type elt = Transition.t
+module Formlist : Hlist.S with type elt = Transition.t
type 'a t = {
id : int;
type 'a t = {
id : int;
@@
-88,18
+84,21
@@
val dump : Format.formatter -> 'a t -> unit
module type ResultSet =
sig
type t
module type ResultSet =
sig
type t
+ type elt = [`Tree] Tree.node
val empty : t
val empty : t
- val cons :
Tree.
t -> t -> t
+ val cons :
el
t -> t -> t
val concat : t -> t -> t
val concat : t -> t -> t
- val iter : (
Tree.
t -> unit) -> t -> unit
- val fold : (
Tree.
t -> 'a -> 'a) -> t -> 'a -> 'a
- val map : (
Tree.t -> Tree.
t) -> t -> t
+ val iter : (
el
t -> unit) -> t -> unit
+ val fold : (
el
t -> 'a -> 'a) -> t -> 'a -> 'a
+ val map : (
elt -> el
t) -> t -> t
val length : t -> int
val length : t -> int
+ val merge : (bool*bool*bool*bool)-> elt -> t -> t -> t
end
module IdSet : ResultSet
end
module IdSet : ResultSet
+module GResult : ResultSet
val top_down_count : 'a t -> Tree.t -> int
val top_down_count : 'a t -> Tree.t -> int
-val top_down : 'a t -> Tree.t ->
IdSe
t.t
+val top_down : 'a t -> Tree.t ->
GResul
t.t
val bottom_up_count :
'a t -> Tree.t -> [> `CONTAINS of 'b | `TAG of Tag.t ] -> int
val bottom_up_count :
'a t -> Tree.t -> [> `CONTAINS of 'b | `TAG of Tag.t ] -> int