| /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);
|
| /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/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/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/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);}
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.modifiers/ |
| 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_;}
|
| 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_;}
|
| /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/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
|
| state-map.h | 449 explicit ArcSumMapper(const Fst<A> &fst) : fst_(fst), i_(0) {}
454 : fst_(fst ? *fst : mapper.fst_), i_(0) {}
460 i_ = 0;
482 bool Done() const { return i_ >= arcs_.size(); }
483 const A &Value() const { return arcs_[i_]; }
484 void Next() { ++i_; }
519 ssize_t i_; // current arc position member in class:fst::ArcSumMapper
533 explicit ArcUniqueMapper(const Fst<A> &fst) : fst_(fst), i_(0) {}
538 : fst_(fst ? *fst : mapper.fst_), i_(0) {}
544 i_ = 0
595 ssize_t i_; \/\/ current arc position member in class:fst::ArcUniqueMapper
[all...] |
| const-fst.h | 464 narcs_(fst.GetImpl()->NumArcs(s)), i_(0) {}
466 bool Done() const { return i_ >= narcs_; }
468 const A& Value() const { return arcs_[i_]; }
470 void Next() { ++i_; }
472 size_t Position() const { return i_; }
474 void Reset() { i_ = 0; }
476 void Seek(size_t a) { i_ = a; }
487 size_t i_; member in class:fst::ArcIterator
|
| /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...] |
| /external/clang/test/SemaCXX/ |
| constructor-initializer.cpp | 221 struct { int i_; }; member in struct:PR7402::S::__anon6836::__anon6837
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| const-fst.h | 369 : arcs_(fst.impl_->Arcs(s)), narcs_(fst.impl_->NumArcs(s)), i_(0) {}
371 bool Done() const { return i_ >= narcs_; }
373 const A& Value() const { return arcs_[i_]; }
375 void Next() { ++i_; }
377 void Reset() { i_ = 0; }
379 void Seek(size_t a) { i_ = a; }
384 size_t i_; member in class:fst::ArcIterator
|
| cache.h | 435 CacheArcIterator(const F &fst, StateId s) : i_(0) {
442 bool Done() const { return i_ >= state_->arcs.size(); }
444 const Arc& Value() const { return state_->arcs[i_]; }
446 void Next() { ++i_; }
448 void Reset() { i_ = 0; }
450 void Seek(size_t a) { i_ = a; }
454 size_t i_; member in class:fst::CacheArcIterator
|
| /frameworks/wilhelm/tests/automated/ |
| BufferQueue_test.cpp | 138 float i_ = (float) i; local
139 float pcm_ = sin((i_ * (1.0f + 0.5f * (i_ / nframes_)) * 0.01 * M_PI * 2.0));
|
