Lines Matching refs:hasNext
58 *outHasNext = bigramEntry.hasNext();
79 const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
112 const BigramEntry newBigramEntry(false /* hasNext */, NOT_A_PROBABILITY,
120 if (!updateHasNextFlag(true /* hasNext */, tailEntryPos)) {
174 bool hasNext = true;
176 while (hasNext) {
180 hasNext = bigramEntry.hasNext();
223 bool hasNext = true;
225 while (hasNext) {
228 hasNext = bigramEntry.hasNext();
241 bool hasNext = true;
244 while (hasNext) {
248 hasNext = bigramEntry.hasNext();
256 if (!hasNext && mBigramDictContent->isContentTailPos(readingPos)) {
282 bool Ver4BigramListPolicy::updateHasNextFlag(const bool hasNext, const int bigramEntryPos) {
284 const BigramEntry updatedBigramEntry = bigramEntry.updateHasNextAndGetEntry(hasNext);