}
static value sort_alloc_array(std::vector<DocID> results, value resarray){
- std::sort(results.begin(), results.end(), docId_comp);
+ std::sort(results.begin(), results.end(), docId_comp);
size_t s = results.size();
resarray = caml_alloc_tuple(s);
for (size_t i = 0; i < s ;i++){
caml_initialize(&Field(resarray,i),Val_int(results[i]));
};
- return resarray;
+ return resarray;
+
}
/**
// fetch element name; this will be the full qualified name
ustring name = reader_->get_name();
bool empty = false;
-
- tb->NewOpenTag(name);
+ size_t found = name.find_first_of(':');
+ if (found == ustring::npos)
+ tb->NewOpenTag(name);
+ else
+ tb->NewOpenTag(name.substr(found+1,name.length() - found - 1));
/* We must be really carefull here. calling process attributes moves
the document pointer on the last attribute, hence calling reader_->is_empty
Hashtbl.add f (hash 101) `Foo;
g t' Tree.root
+let test_text doc =
+ let _ = Printf.eprintf "Contains(bree)" in
+ let _ = time (Tree.test_contains doc) "bree" in
+ let _ = Printf.eprintf "Contains(brain)" in
+ let _ = time (Tree.test_contains doc) "brain" in
+ let _ = Printf.eprintf "Contains(brain)" in
+ let i = time (Tree.test_contains doc) "brain" in
+ let _ = Printf.eprintf "%i\nContains(Australia)" i in
+ let i = time (Tree.test_contains doc) "AUSTRALIA" in
+ let _ = Printf.eprintf "%i\n Contains(1930)" i in
+ let i = time (Tree.test_contains doc) "1930" in
+ let _ = Printf.eprintf "%i\n startswith(bar)" i in
+ let i = time (Tree.test_prefix doc) "bar" in
+ let _ = Printf.eprintf "%i\n endswith(LAND)" i in
+ let i = time (Tree.test_suffix doc) "LAND" in
+ let _ = Printf.eprintf "%i\n =(2001)" i in
+ let i = time (Tree.test_equals doc) "2001" in
+ let _ = Printf.eprintf "%i\n =(Nguyen)" i in
+ let i = time (Tree.test_equals doc) "Nguyen" in
+ Printf.eprintf "%i\n" i ;
+ ()
+
type pointers
external build_pointers : Tree.t -> pointers = "caml_build_pointers"
external iter_pointers : pointers -> int = "caml_iter_pointers"
Ulexer.Loc.Exc_located ((x,y),e) -> Printf.eprintf "character %i-%i %s\n" x y (Printexc.to_string e);exit 1
in
let _ = Printf.eprintf "Number of nodes %i\n%!" (Tree.size v) in
+ let _ = test_text v in
(* let _ = Tree.stats v in
let _ = Printf.eprintf "Timing first_child/next_sibling %!" in
let _ = time (Tree.benchmark_fcns) v in
val benchmark_fcns : t -> unit
val benchmark_lcps : t -> unit
val stats : t -> unit
+
+val test_suffix : t -> string -> int
+val test_prefix : t -> string -> int
+val test_equals : t -> string -> int
+val test_contains : t -> string -> int