gv                 20 DeclareFunctions.hpp int  calckind(std::string& s, std::vector<int>& gv, int& kind);
gv                 21 DeclareFunctions.hpp int  checkquery(std::string& s, std::vector<int>& gv, std::vector<query>& qv);
gv                211 Functions.cpp  int calckind(std::string& s, std::vector<int>& gv, int& kind)
gv                227 Functions.cpp      if ((gv.size() == 0) || (gv.size() > 7)) {
gv                249 Functions.cpp  int checkquery(std::string& s, std::vector<int>& gv, std::vector<query>& qv)
gv                273 Functions.cpp              rt = calckind(wm[0], gv, q.kind1);
gv                277 Functions.cpp              rt = calckind(wm[3], gv, q.kind2);
gv                297 Functions.cpp          rt = calckind(s, gv, q.kind1);
gv                 43 SharedMemoryTree.hpp                  std::vector<int>& gv);    //位置情報p vectorセット
gv                 92 SharedMemoryTree.hpp                        std::vector<int>& gv,
gv                 96 SharedMemoryTree.hpp                              std::vector<int>& gv,
gv                102 SharedMemoryTree.hpp                                 std::vector<int>& gv,
gv                105 SharedMemoryTree.hpp     void setwordinfo(wordinfo& winfo, std::vector<int>& gv,
gv                133 SharedMemoryTree.hpp                        std::vector<int>& gv)
gv                135 SharedMemoryTree.hpp         find_node_set(word, nv, gv, root);
gv                140 SharedMemoryTree.hpp                              std::vector<int>& gv)
gv                142 SharedMemoryTree.hpp         find_regex_node_set(reg, nv, gv, root);
gv                149 SharedMemoryTree.hpp                                 std::vector<int>& gv)
gv                151 SharedMemoryTree.hpp         find_adjacent_node_set(adj1, adj2, kind, dist, nv, gv, root);
gv                 96 WordTree.cpp                      std::vector<int>& gv)
gv                 99 WordTree.cpp       if (gv.size() == 0)
gv                102 WordTree.cpp           for (std::vector<int>::iterator vi = gv.begin();
gv                103 WordTree.cpp                   vi != gv.end(); vi++)
gv                159 WordTree.cpp   void tree::setwordinfo(wordinfo& winfo, std::vector<int>& gv,
gv                169 WordTree.cpp           wptr->setwpos(winfo.wposv, gv);
gv                218 WordTree.cpp                            std::vector<int>& gv, offset_ptr<node>& tnode)
gv                230 WordTree.cpp           setwordinfo(wn, gv, tnode);
gv                239 WordTree.cpp           find_node_set(tword, nv, gv, tnode->right);
gv                241 WordTree.cpp           find_node_set(tword, nv, gv, tnode->left);
gv                246 WordTree.cpp                                  std::vector<int>& gv, offset_ptr<node>& tnode)
gv                252 WordTree.cpp       find_regex_node_set(reg, nv, gv, tnode->left);
gv                260 WordTree.cpp           setwordinfo(wn, gv, tnode);
gv                267 WordTree.cpp       find_regex_node_set(reg, nv, gv, tnode->right);
gv                276 WordTree.cpp                                     std::vector<int>& gv,
gv                290 WordTree.cpp           find_regex_node_set(rk, adjv1, gv, tnode);
gv                292 WordTree.cpp           find_node_set(adj1, adjv1, gv, tnode);
gv                298 WordTree.cpp           find_regex_node_set(ra, adjv2, gv, tnode);
gv                300 WordTree.cpp           find_node_set(adj2, adjv2, gv, tnode);