projects
/
SXSI
/
xpathcomp.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Added benchmarking funtions,
[SXSI/xpathcomp.git]
/
tree.mli
diff --git
a/tree.mli
b/tree.mli
index
ba0fc44
..
59bbcc2
100644
(file)
--- a/
tree.mli
+++ b/
tree.mli
@@
-1,13
+1,13
@@
type t
type t
-val init_
contains :
t -> string -> unit
+val init_
textfun : [ `CONTAINS | `STARTSWITH | `ENDSWITH | `EQUALS ] ->
t -> string -> unit
val init_naive_contains : t -> string -> unit
val parse_xml_uri : string -> t
val parse_xml_string : string -> t
val save : t -> string -> unit
val init_naive_contains : t -> string -> unit
val parse_xml_uri : string -> t
val parse_xml_string : string -> t
val save : t -> string -> unit
-val load : ?sample:int -> string -> t
+val load : ?sample:int ->
?load_text:bool ->
string -> t
val tag_pool : t -> Tag.pool
val tag_pool : t -> Tag.pool
@@
-20,7
+20,7
@@
val dump_node : 'a node -> string
val nil : [ `Tree ] node
val root : [ `Tree ] node
val nil : [ `Tree ] node
val root : [ `Tree ] node
-
+val size : t -> int
val is_root : [ `Tree ] node -> bool
val is_nil : [ `Tree ] node -> bool
val is_root : [ `Tree ] node -> bool
val is_nil : [ `Tree ] node -> bool
@@
-34,28
+34,30
@@
val select_child : t -> Ptset.Int.t -> [ `Tree ] node -> [ `Tree ] node
val next_sibling : t -> [ `Tree ] node -> [ `Tree ] node
val next_element : t -> [ `Tree ] node -> [ `Tree ] node
val next_sibling : t -> [ `Tree ] node -> [ `Tree ] node
val next_element : t -> [ `Tree ] node -> [ `Tree ] node
-val next_sibling_
ctx
: t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
-val next_element_
ctx
: t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
+val next_sibling_
below
: t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
+val next_element_
below
: t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
-val tagged_sibling : t -> Tag.t -> [ `Tree ] node -> [ `Tree ] node
-val tagged_
sibling_ctx
: t -> Tag.t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
+val tagged_
following_
sibling : t -> Tag.t -> [ `Tree ] node -> [ `Tree ] node
+val tagged_
following_sibling_below
: t -> Tag.t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
-val select_sibling : t -> Ptset.Int.t -> [ `Tree ] node -> [ `Tree ] node
-val select_
sibling_ctx
: t -> Ptset.Int.t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
+val select_
following_
sibling : t -> Ptset.Int.t -> [ `Tree ] node -> [ `Tree ] node
+val select_
following_sibling_below
: t -> Ptset.Int.t -> [ `Tree ] node -> [ `Tree ] node -> [ `Tree ] node
val tag : t -> [ `Tree ] node -> Tag.t
val id : t -> [ `Tree ] node -> int
val tag : t -> [ `Tree ] node -> Tag.t
val id : t -> [ `Tree ] node -> int
-val tagged_desc : t -> Tag.t -> [ `Tree ] node -> [`Tree] node
-val select_desc : t -> Ptset.Int.t -> [ `Tree ] node -> [`Tree] node
+val tagged_desc
endant
: t -> Tag.t -> [ `Tree ] node -> [`Tree] node
+val select_desc
endant
: t -> Ptset.Int.t -> [ `Tree ] node -> [`Tree] node
-val tagged_foll
_ctx
: t -> Tag.t -> [ `Tree ] node -> [`Tree] node -> [ `Tree ] node
-val select_foll
_ctx
: t -> Ptset.Int.t -> [ `Tree ] node -> [`Tree] node -> [ `Tree ] node
+val tagged_foll
owing_below
: t -> Tag.t -> [ `Tree ] node -> [`Tree] node -> [ `Tree ] node
+val select_foll
owing_below
: t -> Ptset.Int.t -> [ `Tree ] node -> [`Tree] node -> [ `Tree ] node
val count : t -> string -> int
val print_xml_fast : out_channel -> t -> [ `Tree ] node -> unit
val count : t -> string -> int
val print_xml_fast : out_channel -> t -> [ `Tree ] node -> unit
+val print_xml_fast2 : out_channel -> t -> [ `Tree ] node -> unit
+val print_xml_fast3 : t -> [ `Tree ] node -> Unix.file_descr -> unit
val tags_children : t -> Tag.t -> Ptset.Int.t
val tags_below : t -> Tag.t -> Ptset.Int.t
val tags_children : t -> Tag.t -> Ptset.Int.t
val tags_below : t -> Tag.t -> Ptset.Int.t
@@
-63,18
+65,27
@@
val tags_siblings : t -> Tag.t -> Ptset.Int.t
val tags_after : t -> Tag.t -> Ptset.Int.t
val tags : t -> Tag.t -> Ptset.Int.t*Ptset.Int.t*Ptset.Int.t*Ptset.Int.t
val is_below_right : t -> [`Tree] node -> [`Tree] node -> bool
val tags_after : t -> Tag.t -> Ptset.Int.t
val tags : t -> Tag.t -> Ptset.Int.t*Ptset.Int.t*Ptset.Int.t*Ptset.Int.t
val is_below_right : t -> [`Tree] node -> [`Tree] node -> bool
+val is_binary_ancestor : t -> [`Tree] node -> [`Tree] node -> bool
val is_left : t -> [`Tree] node -> bool
val binary_parent : t -> [`Tree] node -> [`Tree] node
val count_contains : t -> string -> int
val is_left : t -> [`Tree] node -> bool
val binary_parent : t -> [`Tree] node -> [`Tree] node
val count_contains : t -> string -> int
-val unsorted_contains : t -> string -> unit
+(* val unsorted_contains : t -> string -> unit *)
val text_size : t -> int
val doc_ids : t -> [`Tree] node -> [`Text] node * [`Text] node
val subtree_tags : t -> Tag.t -> [`Tree] node -> int
val get_text : t -> [`Tree] node -> string
val text_size : t -> int
val doc_ids : t -> [`Tree] node -> [`Text] node * [`Text] node
val subtree_tags : t -> Tag.t -> [`Tree] node -> int
val get_text : t -> [`Tree] node -> string
+val get_text_id : t -> [`Tree] node -> [`Text ] node
val dump_tree : Format.formatter -> t -> unit
val subtree_size : t -> [`Tree] node -> int
val dump_tree : Format.formatter -> t -> unit
val subtree_size : t -> [`Tree] node -> int
+val subtree_elements : t -> [`Tree] node -> int
val text_below : t -> [`Tree] node -> [`Tree] node
val text_next : t -> [`Tree] node -> [`Tree] node -> [`Tree] node
val text_below : t -> [`Tree] node -> [`Tree] node
val text_next : t -> [`Tree] node -> [`Tree] node -> [`Tree] node
+
+val closing : t -> [`Tree] node -> [`Tree] node
+val is_open : t -> [`Tree] node -> bool
+
+val benchmark_jump : t -> Tag.t -> unit
+val benchmark_fsns : t -> unit