6 #include "xml-tree.hpp"
7 #include "utils_stub.hpp"
10 // #include <algorithm>
15 bool operator() (int32_t i,int32_t j) {
16 return (strcmp((const char*) tree->get_text(i),
17 (const char*) tree->get_text(j))<0);}
20 //define a type for the lexicographic index
28 vector<int32_t> tagVector;
29 vector<int32_t>::iterator tagVectorIt;
30 vector<int32_t> tag2Vector;
31 vector<int32_t>::iterator tag2VectorIt;
34 // class prefix_treeNode {
36 // std::map<char, prefix_treeNode> Children;
37 // std::array<prefix_treeNode, 256> Children;
43 static xml_tree*& XMLTREE(value v)
45 return Obj_val<xml_tree*>(v);
48 static lex_index*& LEXINDEX(value v)
50 return Obj_val<lex_index*>(v);
53 static xml_tree::node_t TREENODE(value i)
55 return static_cast<xml_tree::node_t>(Int_val(i));
58 static xml_tree::tag_t TAG(value i)
60 return static_cast<xml_tree::tag_t>(Int_val(i));
63 void preorderTraverse(xml_tree * tree, xml_tree::tag_t parent_tag, xml_tree::node_t node, lex_index* lindex){
64 if (tree->tag(node)==tree->PCDATA_OPEN_TAG_ID)
65 if (parent_tag==lindex->tag) lindex->tagVectorIt =
66 lindex->tagVector.insert(lindex->tagVectorIt, tree->text_id(node));
67 else if (parent_tag==lindex->tag2) lindex->tag2VectorIt =
68 lindex->tag2Vector.insert(lindex->tag2VectorIt, tree->text_id(node));
69 if (tree->tag(tree->first_child(node))!=0) preorderTraverse(tree,tree->tag(node),tree->first_child(node),lindex);
70 if (tree->tag(tree->next_sibling(node))!=0) preorderTraverse(tree,parent_tag,tree->next_sibling(node),lindex);
73 vector<int32_t> mergeJoin(xml_tree * tree, vector<int32_t> v1, vector<int32_t> v2){
75 vector<int32_t>::iterator i=v.begin();
76 vector<int32_t>::iterator i1=v1.begin();
77 vector<int32_t>::iterator i2=v2.begin();
80 while((i1!=v1.end()) && (i2!=v2.end())){
81 k = strcmp((const char*) tree->get_text(*i1),
82 (const char*) tree->get_text(*i2));
85 i = v.insert( i, *i1 );
91 else if (k<0) i1++; //advance left
92 else i2++; //advance right
97 void printVector(const char * label, vector<int32_t> v){
98 vector<int32_t>::iterator i=v.begin();
100 printf("%s-vector: [%i", label, *i);
101 for (++i; i!=v.end(); ++i)
107 ML_BINDING value caml_build_lex_index(value vtree, value vtag, value vtag2)
109 CAMLparam2(vtree, vtag);
111 vindex = sxsi_alloc_custom<lex_index*>();
112 xml_tree * tree = XMLTREE(vtree);
113 myobject.tree = tree;
115 //allocate a lex index
116 lex_index* mylindex = new lex_index();
118 //take the tag parameter given by ocaml and convert
119 //it to a C++ tag and store it in the tag field of mylindex
120 if ((TAG(vtag)==-1) || (TAG(vtag2)==-1)) caml_failwith("<INVALID TAG>");
121 mylindex->tag = TAG(vtag);
122 mylindex->tag2 = TAG(vtag2);
124 //initialize iterators for the two vectors
125 mylindex->tagVectorIt=mylindex->tagVector.begin();
126 mylindex->tag2VectorIt=mylindex->tag2Vector.begin();
128 preorderTraverse(tree, 0, tree->first_child(tree->ROOT), mylindex);
129 sort(mylindex->tagVector.begin(), mylindex->tagVector.end(), myobject);
130 sort(mylindex->tag2Vector.begin(), mylindex->tag2Vector.end(), myobject);
131 printVector(tree->get_tag_name_by_ref(mylindex->tag), mylindex->tagVector);
132 printVector(tree->get_tag_name_by_ref(mylindex->tag2), mylindex->tag2Vector);
133 printVector("Result" , mergeJoin(tree, mylindex->tagVector, mylindex->tag2Vector));
135 //Uncomment the following and comment the failwith line
136 //LEXINDEX(vindex) = ... return a lex_index* ....
139 ML_BINDING value caml_print_lex_index(value vindex)
142 lex_index* index = LEXINDEX(vindex);
144 //Print the index to the terminal
145 caml_failwith("print_lex_index not implemented");
146 CAMLreturn (Val_unit);