/external/chromium/chrome/browser/sync/util/ |
dbgq.h | 12 // puts the elements into the array in reverse, so you can just look at the i_ 18 DebugQueue() : i_(array_) { } 20 i_ = (array_ == i_ ? array_ + size - 1 : i_ - 1); 21 *i_ = t; 24 T* i_; // Points to the newest element in the queue. member in class:DebugQueue
|
/ndk/sources/cxx-stl/llvm-libc++/test/utilities/memory/unique.ptr/unique.ptr.runtime/unique.ptr.runtime.observers/ |
op_arrow.fail.cpp | 21 int i_; member in struct:A 23 A() : i_(7) {} 29 assert(p->i_ == 7);
|
/ndk/sources/cxx-stl/llvm-libc++/test/utilities/memory/unique.ptr/unique.ptr.single/unique.ptr.single.observers/ |
op_arrow.pass.cpp | 21 int i_; member in struct:A 23 A() : i_(7) {} 29 assert(p->i_ == 7);
|
/ndk/sources/cxx-stl/llvm-libc++/test/iterators/stream.iterators/istream.iterator/istream.iterator.ops/ |
arrow.pass.cpp | 23 int i_; member in struct:A 28 return is >> a.d_ >> a.i_; 36 assert(i->i_ == 23);
|
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.modifiers/ |
emplace_back.pass.cpp | 22 int i_; member in class:A 29 : i_(i), d_(d) {} 32 : i_(a.i_), 35 a.i_ = 0; 41 i_ = a.i_; 43 a.i_ = 0; 48 int geti() const {return i_;}
|
emplace.pass.cpp | 22 int i_; member in class:A 29 : i_(i), d_(d) {} 32 : i_(a.i_), 35 a.i_ = 0; 41 i_ = a.i_; 43 a.i_ = 0; 48 int geti() const {return i_;}
|
/ndk/sources/cxx-stl/llvm-libc++/test/utilities/meta/meta.unary/meta.unary.prop/ |
is_trivialially_copyable.pass.cpp | 19 int i_; member in struct:A 24 int i_; member in struct:B 25 ~B() {assert(i_ == 0);}
|
/dalvik/vm/ |
IndirectRefTable.h | 205 table_(table), i_(i), capacity_(capacity) { 210 ++i_; 216 return &table_[i_].obj; 220 return (i_ == rhs.i_ && table_ == rhs.table_); 226 while (i_ < capacity_ && (table_[i_].obj == NULL 227 || table_[i_].obj == kClearedJniWeakGlobal)) { 228 ++i_; 233 size_t i_; member in class:iref_iterator [all...] |
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.modifiers/ |
emplace.pass.cpp | 19 int i_; member in class:A 26 : i_(i), d_(d) {} 28 int geti() const {return i_;}
|
emplace_back.pass.cpp | 19 int i_; member in class:A 26 : i_(i), d_(d) {} 28 int geti() const {return i_;}
|
emplace_front.pass.cpp | 19 int i_; member in class:A 26 : i_(i), d_(d) {} 28 int geti() const {return i_;}
|
/ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.condition/thread.condition.condvar/ |
wait_pred.pass.cpp | 31 int& i_; member in class:Pred 33 explicit Pred(int& i) : i_(i) {} 35 bool operator()() {return i_ != 0;}
|
wait_for_pred.pass.cpp | 28 int& i_; member in class:Pred 30 explicit Pred(int& i) : i_(i) {} 32 bool operator()() {return i_ != 0;}
|
wait_until_pred.pass.cpp | 45 int& i_; member in class:Pred 47 explicit Pred(int& i) : i_(i) {} 49 bool operator()() {return i_ != 0;}
|
/ndk/sources/cxx-stl/llvm-libc++/test/thread/thread.condition/thread.condition.condvarany/ |
wait_pred.pass.cpp | 35 int& i_; member in class:Pred 37 explicit Pred(int& i) : i_(i) {} 39 bool operator()() {return i_ != 0;}
|
wait_for_pred.pass.cpp | 27 int& i_; member in class:Pred 29 explicit Pred(int& i) : i_(i) {} 31 bool operator()() {return i_ != 0;}
|
wait_until_pred.pass.cpp | 45 int& i_; member in class:Pred 47 explicit Pred(int& i) : i_(i) {} 49 bool operator()() {return i_ != 0;}
|
/ndk/sources/cxx-stl/llvm-libc++/test/utilities/utility/pairs/pair.piecewise/ |
piecewise_construct.pass.cpp | 23 int i_; member in class:A 26 A(int i, char c) : i_(i), c_(c) {} 27 int get_i() const {return i_;}
|
/external/stlport/test/unit/ |
rawriter_test.cpp | 14 X(int i_ = 0) : i(i_) {}
|
func_test.cpp | 26 static bool bigger(int i_); 35 bool FuncTest::bigger(int i_) 37 return i_ > 3;
|
/ndk/tests/device/test-gnustl-full/unit/ |
rawriter_test.cpp | 14 X(int i_ = 0) : i(i_) {}
|
func_test.cpp | 26 static bool bigger(int i_); 35 bool FuncTest::bigger(int i_) 37 return i_ > 3;
|
/ndk/tests/device/test-stlport/unit/ |
rawriter_test.cpp | 14 X(int i_ = 0) : i(i_) {}
|
func_test.cpp | 26 static bool bigger(int i_); 35 bool FuncTest::bigger(int i_) 37 return i_ > 3;
|
/external/openfst/src/include/fst/ |
arcsort.h | 46 : fst_(fst), comp_(comp), i_(0) {} 51 : fst_(fst ? *fst : mapper.fst_), comp_(mapper.comp_), i_(0) {} 57 i_ = 0; 65 bool Done() const { return i_ >= arcs_.size(); } 66 const Arc &Value() const { return arcs_[i_]; } 67 void Next() { ++i_; } 77 ssize_t i_; // current arc position member in class:fst::ArcSortMapper
|