}
-void iterjump(XMLTree* tree, treeNode node, TagType tag){
+int iterjump(XMLTree* tree, treeNode node, TagType tag, treeNode anc){
if (node == NULLT)
- return;
+ return 0;
else {
- iterjump(tree,tree->TaggedDescendant(node,tag),tag);
- iterjump(tree,tree->TaggedFollowing(node,tag),tag);
- return;
+ return /*1+iterjump(tree,tree->TaggedDescendant(node,tag),tag,node)
+ +*/ iterjump(tree,tree->TaggedFollowingBelow(node,tag,anc),tag,anc);
};
}
extern "C" value caml_benchmark_jump(value tree,value tag){
- iterjump(XMLTREE(tree),0, Int_val(tag));
+ int count;
+ treeNode root = XMLTREE(tree)->FirstChild(0);
+ root = XMLTREE(tree)->FirstChild(root);
+ count = iterjump(XMLTREE(tree), root , Int_val(tag),0);
return Val_unit;
}
-int iterfsns(XMLTree* tree, treeNode node){
+int iterfcns(XMLTree* tree, treeNode node){
+ if (node == NULLT)
+ return 0;
+ else {
+ return 1+ iterfcns(tree,tree->NextSibling(node)) + iterfcns(tree,tree->FirstChild(node));
+ };
+}
+
+extern "C" value caml_benchmark_fcns(value tree){
+ int i = iterfcns(XMLTREE(tree),0);
+ return Val_unit;
+
+}
+
+int iterlcps(XMLTree* tree, treeNode node){
if (node == NULLT)
return 0;
else {
int x = tree->Tag(node);
- x += iterfsns(tree,tree->FirstChild(node));
- x += iterfsns(tree,tree->NextSibling(node));
+ x += iterlcps(tree,tree->LastChild(node));
+ x += iterlcps(tree,tree->PrevSibling(node));
return x;
};
}
-extern "C" value caml_benchmark_fsns(value tree){
- iterfsns(XMLTREE(tree),0);
+extern "C" value caml_benchmark_lcps(value tree){
+ iterlcps(XMLTREE(tree),0);
return Val_unit;
}
+
+extern "C" {
+
+ typedef struct dummy_node_ {
+ struct dummy_node_* first;
+ struct dummy_node_* next;
+ } dummy_node;
+
+
+ dummy_node * new_dummy_node () {
+
+ dummy_node * node = (dummy_node*) malloc(sizeof(dummy_node));
+ if (!node)
+ printf("%s","Cannot allocate memory\n");
+
+ return node;
+ }
+
+ void free_tree(dummy_node * node){
+ if (node){
+ free_tree(node->first);
+ free_tree(node->next);
+ free(node);
+ };
+ return;
+ }
+
+ dummy_node * create_tree(XMLTree* tree, treeNode i){
+ if (i == NULLT)
+ return NULL;
+ else {
+ dummy_node * f, *n, *r;
+ f = create_tree(tree,tree->FirstChild(i));
+ n = create_tree(tree,tree->NextSibling(i));
+ r = new_dummy_node();
+ r->first = f;
+ r->next = n;
+ return r;
+ };
+ }
+
+ int iter_tree(dummy_node * n){
+ if (n == NULL)
+ return 0;
+ else {
+ return (1+ iter_tree(n->next)+ iter_tree(n->first) );
+ };
+ }
+
+}
+extern "C" value caml_build_pointers(value tree){
+ return ((value) create_tree(XMLTREE(Field(tree,0)),0));
+}
+
+extern "C" value caml_iter_pointers (value node){
+ return Val_int(iter_tree((dummy_node*) node));
+
+}
+
+extern "C" value caml_free_pointers(value node){
+ free_tree((dummy_node*) node);
+ return Val_unit;
+}