wi                 67 ConcordanceKWIC.cpp     for (std::vector<std::string>::iterator wi = wds.begin();
wi                 68 ConcordanceKWIC.cpp             wi != wds.end(); wi++) {
wi                 70 ConcordanceKWIC.cpp         int r = checkquery(*wi, genrev, qrv);
wi                 73 ConcordanceKWIC.cpp             escapetag(*wi);
wi                 74 ConcordanceKWIC.cpp             errorsend("Regular expression has no normal charcters: " + *wi);
wi                 78 ConcordanceKWIC.cpp             escapetag(*wi);
wi                 79 ConcordanceKWIC.cpp             errorsend("On genre condition more than 7 genres expression must have more than 1 normal character: " + *wi);
wi                 83 ConcordanceKWIC.cpp             escapetag(*wi);
wi                 84 ConcordanceKWIC.cpp             errorsend("Adjacent kind error. Kind must be W or L: " + *wi);
wi                 88 ConcordanceKWIC.cpp             escapetag(*wi);
wi                 92 ConcordanceKWIC.cpp             msg = "Adjacent operand &gt; MAXDIST " + msg + ": " + *wi;
wi                 97 ConcordanceKWIC.cpp             escapetag(*wi);
wi                 98 ConcordanceKWIC.cpp             errorsend("Adjacent format error: " + *wi);
wi                 85 SharedMemoryTree.hpp                     int gi, int fi, int li, int ii, int pi, int wi);
wi                115 SharedMemoryTree.hpp                     int gi, int fi, int li, int ii, int pi, int wi)
wi                117 SharedMemoryTree.hpp         enter_node(root, new_word, gi, fi, li, ii, pi, wi);
wi                110 WordTree.cpp                         int gi, int fi, int li, int ii, int pi, int wi)
wi                131 WordTree.cpp           wpos(gi, fi, li, ii, pi, wi);
wi                145 WordTree.cpp           wpos(gi, fi, li, ii, pi, wi);
wi                153 WordTree.cpp           enter_node(new_node->right, new_word, gi, fi, li, ii, pi, wi);
wi                155 WordTree.cpp           enter_node(new_node->left,  new_word, gi, fi, li, ii, pi, wi);