| /external/webrtc/webrtc/modules/audio_processing/vad/ |
| vad_circular_buffer.cc | 21 index_(0),
31 index_ = 0;
45 return buffer_[index_];
53 if (index_ > 0)
54 m = sum_ / index_;
63 sum_ -= buffer_[index_];
66 buffer_[index_] = value;
67 index_++;
68 if (index_ >= buffer_size_) {
70 index_ = 0
[all...] |
| standalone_vad.cc | 24 : vad_(vad), buffer_(), index_(0), mode_(kDefaultStandaloneVadMode) {
49 if (index_ + length > kLength10Ms * kMaxNum10msFrames)
53 index_ = 0;
55 memcpy(&buffer_[index_], data, sizeof(int16_t) * length);
56 index_ += length;
61 if (index_ == 0)
64 const size_t num_frames = index_ / kLength10Ms;
67 assert(WebRtcVad_ValidRateAndFrameLength(kSampleRateHz, index_) == 0);
69 int activity = WebRtcVad_Process(vad_, kSampleRateHz, buffer_, index_);
79 index_ = 0
[all...] |
| standalone_vad.h | 64 size_t index_; member in class:webrtc::StandaloneVad
|
| vad_circular_buffer.h | 63 int index_; member in class:webrtc::VadCircularBuffer
|
| /external/google-breakpad/src/processor/ |
| static_map_iterator-inl.h | 47 index_(index), base_(base) {
64 if (++index_ > num_nodes_) index_ = num_nodes_;
76 if (++index_ > num_nodes_) index_ = num_nodes_;
88 if (--index_ < 0) index_ = 0;
101 if (--index_ < 0) index_ = 0;
111 return &(keys_[index_]);
[all...] |
| static_map_iterator.h | 55 StaticMapIterator(): index_(-1), base_(NULL) { }
93 int32_t index_; member in class:google_breakpad::StaticMapIterator
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/vector/aux_/ |
| item.hpp | 36 typedef typename Base::upper_bound_ index_; typedef in struct:boost::mpl::v_item
37 typedef typename next<index_>::type upper_bound_;
44 static aux::type_wrapper<T> item_(index_);
55 typedef typename prior<typename Base::lower_bound_>::type index_; typedef in struct:boost::mpl::v_item
56 typedef index_ lower_bound_;
61 static aux::type_wrapper<T> item_(index_);
73 typedef typename prior<typename Base::upper_bound_>::type index_; typedef in struct:boost::mpl::v_mask
74 typedef index_ upper_bound_;
79 static aux::type_wrapper<void_> item_(index_);
89 typedef typename Base::lower_bound_ index_; typedef in struct:boost::mpl::v_mask
[all...] |
| /external/ceres-solver/internal/ceres/ |
| residual_block.h | 127 int index() const { return index_; }
128 void set_index(int index) { index_ = index; }
131 return StringPrintf("{residual block; index=%d}", index_);
142 int32 index_; member in class:ceres::internal::ResidualBlock
|
| /external/v8/src/ast/ |
| modules.h | 43 DCHECK(IsFrozen() && index_ == -1);
44 index_ = index;
62 return index_;
110 index_(-1) {}
115 int index_; member in class:v8::internal::ModuleDescriptor
|
| /external/webrtc/webrtc/base/ |
| window.h | 92 DesktopId() : id_(0), index_(-1) {}
94 : id_(id), index_(index) {
97 int index() const { return index_; }
98 bool IsValid() const { return index_ != -1; }
100 return id_ == other.id() && index_ == other.index();
108 int index_; member in class:rtc::DesktopId
|
| /system/update_engine/payload_generator/ |
| tarjan.h | 35 TarjanAlgorithm() : index_(0), required_vertex_(0) {}
44 Vertex::Index index_; member in class:chromeos_update_engine::TarjanAlgorithm
|
| tarjan.cc | 39 index_ = 0;
51 (*graph)[vertex].index = index_;
52 (*graph)[vertex].lowlink = index_;
53 index_++;
|
| /external/v8/src/ |
| dateparser.h | 53 : index_(0),
59 int position() { return index_; }
63 ch_ = (index_ < buffer_.length()) ? buffer_[index_] : 0;
64 index_++;
116 int index_; member in class:v8::internal::DateParser::BASE_EMBEDDED
296 TimeComposer() : index_(0), hour_offset_(kNone) {}
297 bool IsEmpty() const { return index_ == 0; }
299 return (index_ == 1 && IsMinute(n)) ||
300 (index_ == 2 && IsSecond(n)) |
[all...] |
| dateparser.cc | 14 if (index_ < 1) return false;
16 while (index_ < kSize) {
17 comp_[index_++] = 1;
25 if (is_iso_date_ || (index_ == 3 && !IsDay(comp_[0]))) {
34 if (index_ == 3) year = comp_[2];
38 if (index_ == 1) {
68 while (index_ < kSize) {
69 comp_[index_++] = 0;
|
| /external/libchrome/base/containers/ |
| mru_cache.h | 95 typename KeyIndex::iterator index_iter = index_.find(key);
96 if (index_iter != index_.end()) {
107 index_.insert(std::make_pair(key, ordering_.begin()));
117 typename KeyIndex::iterator index_iter = index_.find(key);
118 if (index_iter == index_.end())
130 typename KeyIndex::const_iterator index_iter = index_.find(key);
131 if (index_iter == index_.end())
137 typename KeyIndex::const_iterator index_iter = index_.find(key);
138 if (index_iter == index_.end())
146 index_.swap(other.index_)
212 KeyIndex index_; member in class:base::MRUCacheBase
[all...] |
| /external/parameter-framework/asio-1.10.6/include/asio/ip/ |
| basic_resolver_iterator.hpp | 65 : index_(0)
182 if (++index_ == values_->size())
186 index_ = 0;
196 return index_ == other.index_;
201 return (*values_)[index_];
206 std::size_t index_; member in class:asio::ip::basic_resolver_iterator
|
| /art/compiler/optimizing/ |
| bytecode_utils.h | 138 index_(0u) {}
140 bool Done() const { return index_ >= num_entries_; }
141 bool IsLast() const { return index_ == num_entries_ - 1; }
145 index_++;
149 return table_.IsSparse() ? table_.GetEntryAt(index_) : table_.GetEntryAt(0) + index_;
153 return table_.GetEntryAt(index_ + first_target_offset_);
156 uint32_t GetDexPcForCurrentIndex() const { return table_.GetDexPcForIndex(index_); }
163 size_t index_; member in class:art::DexSwitchTableIterator
|
| /external/v8/src/heap/ |
| gc-tracer.h | 21 const_iterator() : index_(0), elements_(NULL) {}
24 : index_(index), elements_(elements) {}
27 return elements_ == rhs.elements_ && index_ == rhs.index_;
31 return elements_ != rhs.elements_ || index_ != rhs.index_;
34 operator const T*() const { return elements_ + index_; }
36 const T* operator->() const { return elements_ + index_; }
38 const T& operator*() const { return elements_[index_]; }
41 index_ = (index_ + 1) % (MAX_SIZE + 1)
51 size_t index_; member in class:v8::internal::RingBuffer::const_iterator
[all...] |
| /system/tools/aidl/ |
| generate_java.cpp | 40 index_(0) {
45 type, StringPrintf("%s%d", base_.c_str(), index_));
47 index_++;
|
| /external/libchrome/base/metrics/ |
| sample_vector.cc | 137 index_(0) {
149 index_(0) {
157 return index_ >= counts_size_;
162 index_++;
171 *min = bucket_ranges_->range(index_);
173 *max = bucket_ranges_->range(index_ + 1);
175 *count = subtle::NoBarrier_Load(&counts_[index_]);
181 *index = index_;
189 while (index_ < counts_size_) {
190 if (subtle::NoBarrier_Load(&counts_[index_]) != 0
[all...] |
| /external/google-breakpad/src/tools/mac/dump_syms/ |
| macho_dump.cc | 75 DumpSection() : index_(0) { }
82 index_++, section.section_name.c_str(), section.segment_name.c_str(),
90 int index_; member in class:__anon12464::DumpSection
95 DumpCommand(mach_o::Reader *reader) : reader_(reader), index_(0) { }
98 printf(" load command %d: %d", index_++, type);
109 index_++, (segment.bits_64 ? "64" : "32"), segment.name.c_str(),
119 int index_; member in class:__anon12464::DumpCommand
|
| /external/libchrome/base/ |
| observer_list.h | 93 size_t index_; member in class:base::ObserverListBase::Iterator
136 index_(0),
155 while (index_ < max_index && !observers[index_])
156 ++index_;
157 return index_ < max_index ? observers[index_++] : nullptr;
|
| /external/libweave/third_party/chromium/base/ |
| observer_list.h | 89 size_t index_; member in class:base::ObserverListBase::Iterator
130 index_(0),
149 while (index_ < max_index && !observers[index_])
150 ++index_;
151 return index_ < max_index ? observers[index_++] : nullptr;
|
| /system/core/libmemunreachable/ |
| Tarjan.h | 65 TarjanAlgorithm(Allocator<void> allocator) : index_(0),
73 size_t index_; member in class:TarjanAlgorithm
82 index_ = 0;
99 vertex->index = index_;
100 vertex->lowlink = index_;
101 index_++;
|
| /external/regex-re2/util/ |
| sparse_array.h | 66 // For indices present in the array, dense_[sparse_to_dense_[i]].index_ == i.
74 // dense_[sparse_to_dense_[i]].index_ == i.
245 IndexValue(int index, const Value& value) : second(value), index_(index) {}
247 int index() const { return index_; }
255 int index_; member in class:re2::SparseArray::IndexValue
302 dense_[sparse_to_dense_[i]].index_ == i;
325 if (has_index(new_value.index_)) {
326 p = make_pair(dense_.begin() + sparse_to_dense_[new_value.index_], false);
328 p = make_pair(set_new(new_value.index_, new_value.second), true);
403 sparse_to_dense_[dense_[di].index_] = di
[all...] |
