OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:has_next
(Results
1 - 25
of
39
) sorted by null
1
2
/external/chromium_org/ui/base/models/
tree_node_iterator_unittest.cc
36
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
...]
tree_node_iterator.h
19
// 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/
bookmark_utils.cc
57
// while (iterator.
has_next
()) {
71
bool
has_next
() { return next_ != NULL;}
function in class:chrome::__anon9656::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/
spaces-inl.h
38
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
());
incremental-marking.cc
355
while (it.
has_next
()) {
365
while (it.
has_next
()) {
391
while (it.
has_next
()) {
400
while (it.
has_next
()) {
596
while (it.
has_next
()) {
[
all
...]
mark-compact.cc
116
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
...]
spaces.h
[
all
...]
spaces.cc
911
while (iterator.
has_next
()) {
925
while (it.
has_next
()) {
[
all
...]
/external/chromium_org/third_party/mesa/src/src/glsl/
list.h
238
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())
ir_reader.cpp
205
for (/* nothing */; it.
has_next
(); it.next()) {
241
for (it.next() /* skip "parameters" */; it.
has_next
(); it.next()) {
/external/mesa3d/src/glsl/
list.h
238
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())
ir_reader.cpp
205
for (/* nothing */; it.
has_next
(); it.next()) {
241
for (it.next() /* skip "parameters" */; it.
has_next
(); it.next()) {
/external/chromium_org/components/enhanced_bookmarks/
enhanced_bookmark_utils.cc
24
while (iterator.
has_next
()) {
enhanced_bookmark_model.cc
336
while (iterator.
has_next
()) {
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
stroker.c
68
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)) {
[
all
...]
/external/mesa3d/src/gallium/state_trackers/vega/
stroker.c
68
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)) {
[
all
...]
/external/chromium_org/chrome/browser/sync/test/integration/
bookmarks_helper.cc
149
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/
bookmark_utils.cc
239
while (iterator.
has_next
()) {
283
while (iterator.
has_next
()) {
317
while (iterator.
has_next
()) {
/art/runtime/
quick_exception_handler.cc
61
bool
has_next
= GetNextMethodAndDexPc(&next_art_method, &next_dex_pc);
local
65
if (!
has_next
) {
/hardware/broadcom/wlan/bcmdhd/wifi_hal/
cpp_bindings.h
99
bool
has_next
() {
function in class:nl_iterator
gscan.cpp
207
for (nl_iterator it(vendor_data); it.
has_next
(); it.next()) {
242
for (nl_iterator it(attr); it.
has_next
() && i < num; it.next(), i++) {
249
for (nl_iterator it2(sc_data); it2.
has_next
(); it2.next()) {
872
for (nl_iterator it(vendor_data); it.
has_next
(); it.next()) {
877
for (nl_iterator it2(it.get()); it2.
has_next
(); it2.next()) {
[
all
...]
wifi_hal.cpp
591
for (nl_iterator it(vendor_data); it.
has_next
(); it.next()) {
/external/e2fsprogs/lib/ext2fs/
extent.c
1156
int has_prev,
has_next
;
local
1241
has_next
= 0;
1247
has_next
= 1;
[
all
...]
/hardware/qcom/wlan/qcwcn/wifi_hal/
cpp_bindings.h
116
bool
has_next
() {
function in class:nl_iterator
/external/antlr/antlr-3.4/runtime/Python/antlr3/
tree.py
2485
def
has_next
(self):
member in class:TreeIterator
[
all
...]
Completed in 526 milliseconds
1
2