#include <utility>
#include <algorithm>
#include <vector>
+#include <array>
#include "xml-tree.hpp"
#include "utils_stub.hpp"
+#include <iostream>
+// #include <algorithm>
+using namespace std;
-//define a type for the lexicographic index
+struct myclass {
+ xml_tree * tree;
+ bool operator() (int32_t i,int32_t j) {
+ return (strcmp((const char*) tree->get_text(i),
+ (const char*) tree->get_text(j))<0);}
+} myobject;
+//define a type for the lexicographic index
class lex_index {
public:
- //The tag ID
+ //The tag IDs
xml_tree::tag_t tag;
+ xml_tree::tag_t tag2;
//The text data
- std::vector<std::pair<std::string, xml_tree::node_t> > data;
+ vector<int32_t> tagVector;
+ vector<int32_t>::iterator tagVectorIt;
+ vector<int32_t> tag2Vector;
+ vector<int32_t>::iterator tag2VectorIt;
+ void printVector(xml_tree::tag_t t, vector<int32_t> v);
+ void print();
};
+void lex_index::printVector(xml_tree::tag_t t, vector<int32_t> v){
+ vector<int32_t>::iterator i=v.begin();
+ if (i!=v.end()) {
+ printf("%i-vector: [%i", t, *i);
+ for (++i; i!=v.end(); ++i)
+ printf(",%i", *i);
+ printf("]\n");
+ }
+}
+
+void lex_index::print(){
+ printf("Print called\n");
+ printVector(tag, tagVector);
+}
+// class prefix_treeNode {
+// public:
+ // std::map<char, prefix_treeNode> Children;
+// std::array<prefix_treeNode, 256> Children;
+// uint32 textID;
+//};
using namespace SXSI;
-
static xml_tree*& XMLTREE(value v)
{
return Obj_val<xml_tree*>(v);
return static_cast<xml_tree::tag_t>(Int_val(i));
}
+void preorderTraverse(xml_tree * tree, xml_tree::tag_t parent_tag, xml_tree::node_t node, lex_index* lindex){
+ if (tree->tag(node)==tree->PCDATA_OPEN_TAG_ID)
+ if (parent_tag==lindex->tag) lindex->tagVectorIt =
+ lindex->tagVector.insert(lindex->tagVectorIt, tree->text_id(node));
+ else if (parent_tag==lindex->tag2) lindex->tag2VectorIt =
+ lindex->tag2Vector.insert(lindex->tag2VectorIt, tree->text_id(node));
+ if (tree->tag(tree->first_child(node))!=0) preorderTraverse(tree,tree->tag(node),tree->first_child(node),lindex);
+ if (tree->tag(tree->next_sibling(node))!=0) preorderTraverse(tree,parent_tag,tree->next_sibling(node),lindex);
+}
+vector<int32_t> mergeJoin(xml_tree * tree, vector<int32_t> v1, vector<int32_t> v2){
+ vector<int32_t> v;
+ vector<int32_t>::iterator i=v.begin();
+ vector<int32_t>::iterator i1=v1.begin();
+ vector<int32_t>::iterator i2=v2.begin();
+ int k;
+
+ while((i1!=v1.end()) && (i2!=v2.end())){
+ k = strcmp((const char*) tree->get_text(*i1),
+ (const char*) tree->get_text(*i2));
+ if (k==0)
+ {
+ i = v.insert( i, *i1 );
+ //advance left
+ i1++;
+ //advance right
+ i2++;
+ }
+ else if (k<0) i1++; //advance left
+ else i2++; //advance right
+ }
+ return(v);
+}
+void printVector(const char * label, vector<int32_t> v){
+ vector<int32_t>::iterator i=v.begin();
+ if (i!=v.end()) {
+ printf("%s-vector: [%i", label, *i);
+ for (++i; i!=v.end(); ++i)
+ printf(",%i", *i);
+ printf("]\n");
+ }
+}
-extern "C" value caml_build_lex_index(value vtree, value vtag)
+ML_BINDING value caml_build_lex_index(value vtree, value vtag, value vtag2)
{
CAMLparam2(vtree, vtag);
CAMLlocal1(vindex);
- const char * s;
vindex = sxsi_alloc_custom<lex_index*>();
xml_tree * tree = XMLTREE(vtree);
- xml_tree::tag_t tag = TAG(vtag);
- //Uncomment the following and comment the failwith line
- //LEXINDEX(vindex) = ... return a lex_index* ....
+ myobject.tree = tree;
+ //allocate a lex index
+ lex_index* mylindex = new lex_index();
- caml_failwith("build_lex_index not implemented");
+ //take the tag parameter given by ocaml and convert
+ //it to a C++ tag and store it in the tag field of mylindex
+ if ((TAG(vtag)==-1) || (TAG(vtag2)==-1)) caml_failwith("<INVALID TAG>");
+ mylindex->tag = TAG(vtag);
+ mylindex->tag2 = TAG(vtag2);
+ //initialize iterators for the two vectors
+ mylindex->tagVectorIt=mylindex->tagVector.begin();
+ mylindex->tag2VectorIt=mylindex->tag2Vector.begin();
- CAMLreturn (vindex);
+ 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;
}
-extern "C" value caml_print_lex_index(value vindex)
+ML_BINDING value caml_print_lex_index(value vindex)
{
CAMLparam1(vindex);
lex_index* index = LEXINDEX(vindex);
//Print the index to the terminal
-
- caml_failwith("print_lex_index not implemented");
-
-
+ // caml_failwith("print_lex_index not implemented");
+ index->print();
CAMLreturn (Val_unit);
}