Searched refs:has_next (Results 1 - 25 of 34) sorted by relevance

12

/external/chromium_org/ui/base/models/
H A Dtree_node_iterator_unittest.cc36 ASSERT_TRUE(iterator.has_next());
39 ASSERT_TRUE(iterator.has_next());
42 ASSERT_TRUE(iterator.has_next());
45 ASSERT_TRUE(iterator.has_next());
48 ASSERT_TRUE(iterator.has_next());
51 ASSERT_FALSE(iterator.has_next());
71 ASSERT_TRUE(odd_iterator.has_next());
73 ASSERT_FALSE(odd_iterator.has_next());
76 ASSERT_TRUE(even_iterator.has_next());
78 ASSERT_TRUE(even_iterator.has_next());
[all...]
H A Dtree_node_iterator.h19 // while (iterator.has_next()) {
54 bool has_next() const { return !positions_.empty(); } function in class:ui::TreeNodeIterator
58 if (!has_next()) {
75 // - the _position list is empty, the iterator has_next() will return false.
/external/chromium_org/chrome/browser/ui/bookmarks/
H A Dbookmark_utils.cc57 // while (iterator.has_next()) {
71 bool has_next() { return next_ != NULL;} function in class:chrome::__anon5031::OpenURLIterator
74 if (!has_next()) {
119 while (iterator.has_next()) {
213 while (iterator.has_next()) {
275 return iterator.has_next();
282 while (iterator.has_next()) {
/external/chromium_org/v8/src/heap/
H A Dspaces-inl.h38 bool PageIterator::has_next() { return next_page_ != &space_->anchor_; } function in class:v8::internal::PageIterator
42 DCHECK(has_next());
71 bool NewSpacePageIterator::has_next() { return prev_page_ != last_page_; } function in class:v8::internal::NewSpacePageIterator
75 DCHECK(has_next());
H A Dincremental-marking.cc355 while (it.has_next()) {
365 while (it.has_next()) {
391 while (it.has_next()) {
400 while (it.has_next()) {
596 while (it.has_next()) {
H A Dmark-compact.cc116 while (it.has_next()) {
118 Address limit = it.has_next() ? page->area_end() : end;
128 while (it.has_next()) {
187 while (it.has_next()) {
190 Address limit = it.has_next() ? page->area_end() : space->top();
208 while (it.has_next()) {
439 while (it.has_next()) {
450 while (it.has_next()) {
501 while (it.has_next()) {
510 while (it.has_next()) {
[all...]
H A Dspaces.cc911 while (iterator.has_next()) {
925 while (it.has_next()) {
1031 while (it.has_next()) {
1049 while (page_iterator.has_next()) {
1129 while (page_iterator.has_next()) {
1317 while (it.has_next()) {
1530 while (it.has_next()) {
1669 while (it.has_next()) {
H A Dspaces.h1233 inline bool has_next();
2292 inline bool has_next();
2823 if (old_pointer_iterator_.has_next()) {
2830 if (map_iterator_.has_next()) {
H A Dheap.cc4530 while (it.has_next()) {
4662 while (pages.has_next()) {
4685 while (pages.has_next()) {
5479 bool SpaceIterator::has_next() { function in class:v8::SpaceIterator
5674 while (space_iterator_->has_next()) {
/external/chromium_org/third_party/mesa/src/src/glsl/
H A Dlist.h238 bool has_next() const function in class:iterator
267 bool has_next() const function in class:exec_list_iterator
278 for (iter_type iter = (container) . iterator(); iter.has_next(); iter.next())
H A Dir_reader.cpp205 for (/* nothing */; it.has_next(); it.next()) {
241 for (it.next() /* skip "parameters" */; it.has_next(); it.next()) {
H A Dast_function.cpp203 while (actual_iter.has_next()) {
/external/mesa3d/src/glsl/
H A Dlist.h238 bool has_next() const function in class:iterator
267 bool has_next() const function in class:exec_list_iterator
278 for (iter_type iter = (container) . iterator(); iter.has_next(); iter.next())
H A Dir_reader.cpp205 for (/* nothing */; it.has_next(); it.next()) {
241 for (it.next() /* skip "parameters" */; it.has_next(); it.next()) {
/external/chromium_org/components/enhanced_bookmarks/
H A Denhanced_bookmark_utils.cc24 while (iterator.has_next()) {
H A Denhanced_bookmark_model.cc336 while (iterator.has_next()) {
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Dstroker.c68 VGboolean (*has_next)(struct stroke_iterator *); member in struct:stroke_iterator
216 itr->has_next = stroke_fw_has_next;
234 itr->has_next = stroke_bw_has_next;
340 itr->has_next = stroke_flat_has_next;
898 if (!it->has_next(it)) {
904 while (it->has_next(it)) {
1071 while (it->has_next(it)) {
1167 while (it.has_next(&it)) {
/external/mesa3d/src/gallium/state_trackers/vega/
H A Dstroker.c68 VGboolean (*has_next)(struct stroke_iterator *); member in struct:stroke_iterator
216 itr->has_next = stroke_fw_has_next;
234 itr->has_next = stroke_bw_has_next;
340 itr->has_next = stroke_flat_has_next;
898 if (!it->has_next(it)) {
904 while (it->has_next(it)) {
1071 while (it->has_next(it)) {
1167 while (it.has_next(&it)) {
/external/chromium_org/chrome/browser/sync/test/integration/
H A Dbookmarks_helper.cc149 while (iterator.has_next()) {
360 while (iterator_a.has_next()) {
362 if (!iterator_b.has_next()) {
372 ret_val = ret_val && (!iterator_b.has_next());
744 while (iterator.has_next()) {
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_utils.cc239 while (iterator.has_next()) {
283 while (iterator.has_next()) {
317 while (iterator.has_next()) {
H A Dbookmark_model_unittest.cc944 while (it.has_next())
/external/e2fsprogs/lib/ext2fs/
H A Dextent.c1156 int has_prev, has_next; local
1241 has_next = 0;
1247 has_next = 1;
1297 } else if (has_next &&
1343 if (has_next &&
/external/antlr/antlr-3.4/runtime/Python/antlr3/
H A Dtree.py2485 def has_next(self): member in class:TreeIterator
2503 if not self.has_next():
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Dtree.rb1289 def has_next?
/external/chromium_org/v8/src/
H A Dparser.h317 bool has_next() { return next_pos_ < in()->length(); } function in class:v8::internal::BASE_EMBEDDED

Completed in 450 milliseconds

12