- preorderTraverse(0, tree->first_child(tree->ROOT));
- sort(myvector.begin(), myvector.end(), myfunction);
- sort(myvector2.begin(), myvector2.end(), myfunction);
- printIndex(tree->get_tag_name_by_ref(tag), myvector);
- printIndex(tree->get_tag_name_by_ref(tag2), myvector2);
- printIndex("Result" , mergeJoin(myvector, myvector2));
+ //initialize iterators for the two vectors
+ mylindex->tagVectorIt=mylindex->tagVector.begin();
+ mylindex->tag2VectorIt=mylindex->tag2Vector.begin();
+
+ preorderTraverse(tree, 0, tree->first_child(tree->ROOT), mylindex);
+ sort(mylindex->tagVector.begin(), mylindex->tagVector.end(), myobject);
+ sort(mylindex->tag2Vector.begin(), mylindex->tag2Vector.end(), myobject);
+ printVector(tree->get_tag_name_by_ref(mylindex->tag), mylindex->tagVector);
+ printVector(tree->get_tag_name_by_ref(mylindex->tag2), mylindex->tag2Vector);
+ printVector("Result" , mergeJoin(tree, mylindex->tagVector, mylindex->tag2Vector));
+
+ //Uncomment the following and comment the failwith line
+ //LEXINDEX(vindex) = ... return a lex_index* ....
+ LEXINDEX(vindex)=mylindex;