Lines Matching refs:words
79 virtual bool HasMatchIn(const std::vector<QueryWord>& words,
83 virtual void AppendWords(std::vector<string16>* words) const;
90 bool QueryNodeWord::HasMatchIn(const std::vector<QueryWord>& words,
92 for (size_t i = 0; i < words.size(); ++i) {
93 if (Matches(words[i].word, false)) {
94 size_t match_start = words[i].position;
111 void QueryNodeWord::AppendWords(std::vector<string16>* words) const {
112 words->push_back(word_);
148 virtual bool HasMatchIn(const std::vector<QueryWord>& words,
153 virtual void AppendWords(std::vector<string16>* words) const;
182 void QueryNodeList::AppendWords(std::vector<string16>* words) const {
184 children_[i]->AppendWords(words);
209 virtual bool HasMatchIn(const std::vector<QueryWord>& words,
219 const std::vector<QueryWord>& words,
221 if (words.size() < children_.size())
224 for (size_t i = 0, max = words.size() - children_.size() + 1; i < max; ++i) {
227 if (!children_[j]->Matches(words[i + j].word, true)) {
233 const QueryWord& last_word = words[i + children_.size() - 1];
235 Snippet::MatchPosition(words[i].position,
285 std::vector<string16>* words) {
289 root.AppendWords(words);
367 std::vector<QueryWord>* words) {
380 words->push_back(QueryWord());
381 words->back().word = word;
382 words->back().position = iter.prev();