Searched refs:hasNext (Results 1 – 13 of 13) sorted by relevance
42 virtual bool hasNext() const = 0;72 bool hasNext() const override { in hasNext() function75 bool isEnd() const override { return !hasNext(); } in isEnd()78 assert(hasNext() && "Already at end of sequence!"); in peekNext()
66 bool hasNext() const override { return !Staging.empty(); } in hasNext() function70 assert(hasNext()); in peekNext()
91 bool hasNext() const { return !bv_.empty(); } in hasNext() function281 bool hasNext() const { in hasNext() function282 if (it1_.hasNext()) return true; in hasNext()291 if (!it1_.hasNext() && !it2_.hasNext()) { in next()300 if (!it2_.hasNext()) { in next()301 CHECK(it1_.hasNext()); in next()307 CHECK(it2_.hasNext()); in next()312 if (!it1_.hasNext() && !it2_.hasNext()) in next()
135 for (typename BV::Iterator it(v[from]); it.hasNext(); ) { in findPath()
33 if (!SM.hasNext()) { in getNextInstruction()
708 bool hasNext() const { in hasNext() function
248 while (itr.hasNext()) { in consumeProbeData()
2864 while (F.hasNext()) { in DiagnoseAmbiguousLookup()3706 while (F.hasNext()) { in LookupLiteralOperator()
206 while (F.hasNext()) { in getDestructorName()2852 while (Filter.hasNext()) { in LookupGlobalDeallocationFunctions()3067 while (Filter.hasNext()) { in FindAllocationFunctions()
151 while (filter.hasNext()) { in FilterAcceptableTemplateNames()8952 while (F.hasNext()) { in RemoveLookupResult()9248 while (F.hasNext()) { in CheckDependentFunctionTemplateSpecialization()
1598 while (F.hasNext()) { in FilterLookupForScope()1799 while (F.hasNext()) in RemoveUsingDecls()2424 while (Filter.hasNext()) { in filterNonConflictingPreviousTypedefDecls()17765 while (F.hasNext()) { in ActOnTag()17791 while (F.hasNext()) { in ActOnTag()
13020 while (F.hasNext()) { in FilterUsingLookup()14853 while (F.hasNext()) { in buildSingleCopyAssignRecursively()
22245 while (Filter.hasNext()) { in ActOnOpenMPDeclareReductionDirectiveStart()22499 while (Filter.hasNext()) { in ActOnOpenMPDeclareMapperDirective()