projects
/
SXSI
/
xpathcomp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Remove trailing white spaces
[SXSI/xpathcomp.git]
/
ata.mli
diff --git
a/ata.mli
b/ata.mli
index
159bd78
..
3af6907
100644
(file)
--- a/
ata.mli
+++ b/
ata.mli
@@
-4,7
+4,7
@@
sig
include Sigs.T with type t = int
val make : unit -> t
end
include Sigs.T with type t = int
val make : unit -> t
end
-
+type merge_conf = NO | ONLY1 | ONLY2 | ONLY12 | MARK | MARK1 | MARK2 | MARK12
module StateSet :
sig
include Ptset.S with type elt = int
module StateSet :
sig
include Ptset.S with type elt = int
@@
-22,7
+22,7
@@
module Formula :
type t
val hash : t -> int
type t
val hash : t -> int
- val uid : t ->
in
t
+ val uid : t ->
Uid.
t
val equal : t -> t -> bool
val expr : t -> t expr
val st :
val equal : t -> t -> bool
val expr : t -> t expr
val st :
@@
-58,7
+58,7
@@
module Transition :
val make : data -> t
val node : t -> data
val hash : t -> int
val make : data -> t
val node : t -> data
val hash : t -> int
- val uid : t ->
in
t
+ val uid : t ->
Uid.
t
val equal : t -> t -> bool
module Infix : sig
val ( ?< ) : State.t -> State.t
val equal : t -> t -> bool
module Infix : sig
val ( ?< ) : State.t -> State.t
@@
-92,7
+92,7
@@
module type ResultSet =
val fold : (elt -> 'a -> 'a) -> t -> 'a -> 'a
val map : (elt -> elt) -> t -> t
val length : t -> int
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 :
merge_conf
-> 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
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
@@
-101,12
+101,18
@@
module IdSet : ResultSet
module GResult (Doc : sig val doc : Tree.t end) : ResultSet
val top_down_count : 'a t -> Tree.t -> int
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_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_count :
'a t -> Tree.t -> [> `CONTAINS of 'b | `TAG of Tag.t ] -> int
+val bottom_up :
+ 'a t -> Tree.t -> [> `CONTAINS of 'b | `TAG of Tag.t ] -> IdSet.t
module Test (Doc : sig val doc : Tree.t end ) :
sig
module Results : ResultSet
val top_down : 'a t -> Tree.t -> Results.t
module Test (Doc : sig val doc : Tree.t end ) :
sig
module Results : ResultSet
val top_down : 'a t -> Tree.t -> Results.t
+ val top_down1 : 'a t -> Tree.t -> Results.t
end
end