| /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
|
| /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 | 447 explicit ArcSumMapper(const Fst<A> &fst) : fst_(fst), i_(0) {}
452 : fst_(fst ? *fst : mapper.fst_), i_(0) {}
458 i_ = 0;
480 bool Done() const { return i_ >= arcs_.size(); }
481 const A &Value() const { return arcs_[i_]; }
482 void Next() { ++i_; }
517 ssize_t i_; // current arc position member in class:fst::ArcSumMapper
531 explicit ArcUniqueMapper(const Fst<A> &fst) : fst_(fst), i_(0) {}
536 : fst_(fst ? *fst : mapper.fst_), i_(0) {}
542 i_ = 0
593 ssize_t i_; \/\/ current arc position member in class:fst::ArcUniqueMapper
[all...] |
| const-fst.h | 450 narcs_(fst.GetImpl()->NumArcs(s)), i_(0) {}
452 bool Done() const { return i_ >= narcs_; }
454 const A& Value() const { return arcs_[i_]; }
456 void Next() { ++i_; }
458 size_t Position() const { return i_; }
460 void Reset() { i_ = 0; }
462 void Seek(size_t a) { i_ = a; }
473 size_t i_; member in class:fst::ArcIterator
|
| cache.h | 597 CacheArcIterator(Impl *impl, StateId s) : i_(0) {
604 bool Done() const { return i_ >= state_->arcs.size(); }
606 const Arc& Value() const { return state_->arcs[i_]; }
608 void Next() { ++i_; }
610 size_t Position() const { return i_; }
612 void Reset() { i_ = 0; }
614 void Seek(size_t a) { i_ = a; }
624 size_t i_; member in class:fst::CacheArcIterator
643 CacheMutableArcIterator(Impl *impl, StateId s) : i_(0), s_(s), impl_(impl) {
652 bool Done() const { return i_ >= state_->arcs.size();
728 size_t i_; member in class:fst::CacheMutableArcIterator
[all...] |
| vector-fst.h | 588 : arcs_(fst.GetImpl()->GetState(s)->arcs), i_(0) {}
590 bool Done() const { return i_ >= arcs_.size(); }
592 const A& Value() const { return arcs_[i_]; }
594 void Next() { ++i_; }
596 void Reset() { i_ = 0; }
598 void Seek(size_t a) { i_ = a; }
600 size_t Position() const { return i_; }
610 size_t i_; member in class:fst::ArcIterator
625 MutableArcIterator(VectorFst<A> *fst, StateId s) : i_(0) {
631 bool Done() const { return i_ >= state_->arcs.size();
710 size_t i_; member in class:fst::MutableArcIterator
[all...] |
| fst.h | 451 ArcIterator(const F &fst, StateId s) : i_(0) {
455 explicit ArcIterator(const ArcIteratorData<Arc> &data) : data_(data), i_(0) {
468 return data_.base ? data_.base->Done() : i_ >= data_.narcs;
472 return data_.base ? data_.base->Value() : data_.arcs[i_];
479 ++i_;
486 i_ = 0;
493 i_ = a;
497 return data_.base ? data_.base->Position() : i_;
514 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 | 218 struct { int i_; }; member in struct:PR7402::S::__anon5714::__anon5715
|
| /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...] |
| /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));
|
| /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; }
|
