HomeSort by relevance Sort by last modified time
    Searched defs:i_ (Results 1 - 9 of 9) sorted by null

  /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
  /dalvik/vm/
IndirectRefTable.h 205 : table_(table), i_(i), capacity_(capacity)
211 ++i_;
217 return &table_[i_];
221 return (i_ == rhs.i_ && table_ == rhs.table_);
224 size_t to_i() const { return i_; }
229 while (i_ < capacity_ && (table_[i_] == NULL || table_[i_] == kClearedJniWeakGlobal)) {
230 ++i_;
235 size_t i_; member in class:iref_iterator
    [all...]
  /external/clang/test/Analysis/
misc-ps-region-store.cpp 288 PR9645_SideEffect(int *pi); // caches pi in i_
289 void Read(int *pi); // copies *pi into *i_
291 int *i_; member in class:PR9645_SideEffect
304 PR9645_SideEffect::PR9645_SideEffect(int *pi) : i_(pi) {}
305 void PR9645_SideEffect::Read(int *pi) { *i_ = *pi; }
  /external/clang/test/SemaCXX/
constructor-initializer.cpp 218 struct { int i_; }; member in struct:PR7402::S::__anon4968::__anon4969
  /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
fst.h 327 ArcIterator(const F &fst, StateId s) : i_(0) {
339 return data_.base ? data_.base->Done() : i_ >= data_.narcs;
343 return data_.base ? data_.base->Value() : data_.arcs[i_];
350 ++i_;
357 i_ = 0;
364 i_ = a;
369 size_t i_; member in class:fst::ArcIterator
vector-fst.h 698 : arcs_(fst.impl_->GetState(s)->arcs), i_(0) {}
700 bool Done() const { return i_ >= arcs_.size(); }
702 const A& Value() const { return arcs_[i_]; }
704 void Next() { ++i_; }
706 void Reset() { i_ = 0; }
708 void Seek(size_t a) { i_ = a; }
712 size_t i_; member in class:fst::ArcIterator
727 MutableArcIterator(VectorFst<A> *fst, StateId s) : i_(0) {
733 virtual bool Done() const { return i_ >= state_->arcs.size(); }
735 virtual const A& Value() const { return state_->arcs[i_]; }
781 size_t i_; member in class:fst::MutableArcIterator
    [all...]
  /system/media/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));

Completed in 587 milliseconds