Home
last modified time | relevance | path

Searched refs:buckets_ (Results 1 – 25 of 30) sorted by relevance

12

/external/parameter-framework/asio-1.10.6/include/asio/detail/
Dhash_map.hpp57 buckets_(0), in hash_map()
65 delete[] buckets_; in ~hash_map()
104 iterator it = buckets_[bucket].first; in find()
107 iterator end_it = buckets_[bucket].last; in find()
125 const_iterator it = buckets_[bucket].first; in find()
128 const_iterator end_it = buckets_[bucket].last; in find()
146 iterator it = buckets_[bucket].first; in insert()
149 buckets_[bucket].first = buckets_[bucket].last = in insert()
152 return std::pair<iterator, bool>(buckets_[bucket].last, true); in insert()
154 iterator end_it = buckets_[bucket].last; in insert()
[all …]
/external/webrtc/rtc_base/
Drate_statistics.cc35 : buckets_(other.buckets_), in RateStatistics()
54 buckets_.clear(); in Reset()
65 if (buckets_.empty() || now_ms != buckets_.back().timestamp) { in Update()
66 if (!buckets_.empty() && now_ms < buckets_.back().timestamp) { in Update()
70 << buckets_.back().timestamp << ", aligning to that."; in Update()
71 now_ms = buckets_.back().timestamp; in Update()
73 buckets_.emplace_back(now_ms); in Update()
75 Bucket& last_bucket = buckets_.back(); in Update()
130 while (!buckets_.empty() && buckets_.front().timestamp < new_oldest_time) { in EraseOld()
131 const Bucket& oldest_bucket = buckets_.front(); in EraseOld()
[all …]
/external/webrtc/modules/audio_coding/neteq/
Dhistogram.cc26 : buckets_(num_buckets, 0), in Histogram()
51 RTC_DCHECK(value < static_cast<int>(buckets_.size())); in Add()
54 for (int& bucket : buckets_) { in Add()
62 buckets_[value] += (32768 - forget_factor_) << 15; in Add()
71 for (int& bucket : buckets_) { in Add()
119 sum -= buckets_[index]; in Quantile()
121 while ((sum > inverse_probability) && (index < buckets_.size() - 1)) { in Quantile()
125 sum -= buckets_[index]; in Quantile()
137 for (int& bucket : buckets_) { in Reset()
146 return buckets_.size(); in NumBuckets()
Dhistogram.h45 std::vector<int> buckets() const { return buckets_; } in buckets()
55 std::vector<int> buckets_;
/external/tensorflow/tensorflow/core/lib/histogram/
Dhistogram.cc86 buckets_.clear(); in DecodeFromProto()
87 buckets_.insert(buckets_.end(), proto.bucket().begin(), proto.bucket().end()); in DecodeFromProto()
97 buckets_.resize(bucket_limits_.size()); in Clear()
99 buckets_[i] = 0; in Clear()
108 buckets_[b] += 1.0; in Add()
131 for (size_t i = 0; i < buckets_.size(); i++) { in Percentile()
132 double cumsum = cumsum_prev + buckets_[i]; in Percentile()
182 for (size_t b = 0; b < buckets_.size(); b++) { in ToString()
183 if (buckets_[b] <= 0.0) continue; in ToString()
184 sum += buckets_[b]; in ToString()
[all …]
/external/webrtc/modules/video_coding/
Dhistogram.cc22 buckets_.resize(num_buckets); in Histogram()
28 value = std::min<size_t>(value, buckets_.size() - 1); in Add()
30 --buckets_[values_[index_]]; in Add()
31 RTC_DCHECK_LT(values_[index_], buckets_.size()); in Add()
37 ++buckets_[value]; in Add()
48 while (accumulated_probability < probability && bucket < buckets_.size()) { in InverseCdf()
50 static_cast<float>(buckets_[bucket]) / values_.size(); in InverseCdf()
Dhistogram.h39 std::vector<size_t> buckets_; variable
/external/tensorflow/tensorflow/core/util/
Dpresized_cuckoo_map.h94 buckets_.clear(); in Clear()
95 buckets_.resize(num_buckets_, empty_bucket); in Clear()
110 Bucket* bptr = &buckets_[bucket]; in InsertUnique()
141 port::prefetch<hint>(&buckets_[fast_map_to_buckets(tk)].keys); in PrefetchKey()
142 port::prefetch<hint>(&buckets_[fast_map_to_buckets(h2(tk))].keys); in PrefetchKey()
258 Bucket* bptr = &buckets_[b]; in InsertInternal()
266 const Bucket& bref = buckets_[b]; in FindInBucket()
279 const Bucket& bref = buckets_[bucket]; in SpaceAvailable()
290 Bucket& src_ref = buckets_[src_bucket]; in CopyItem()
291 Bucket& dst_ref = buckets_[dst_bucket]; in CopyItem()
[all …]
/external/icu/icu4c/source/i18n/
Dalphaindex.cpp181 delete buckets_; in ~ImmutableIndex()
187 return buckets_->getBucketCount(); in getBucketCount()
193 return buckets_->getBucketIndex(name, *collatorPrimaryOnly_, errorCode); in getBucketIndex()
198 if (0 <= index && index < buckets_->getBucketCount()) { in getBucket()
199 return icu::getBucket(*buckets_->immutableVisibleList_, index); in getBucket()
211 buckets_(NULL) { in AlphabeticIndex()
222 buckets_(NULL) { in AlphabeticIndex()
232 delete buckets_; in ~AlphabeticIndex()
284 return buckets_->getBucketCount(); in getBucketCount()
631 if (U_FAILURE(errorCode) || buckets_ != NULL) { in initBuckets()
[all …]
/external/libchrome/base/sampling_heap_profiler/
Dlock_free_address_hash_set.cc14 : buckets_(buckets_count), bucket_mask_(buckets_count - 1) { in LockFreeAddressHashSet()
20 for (subtle::AtomicWord bucket : buckets_) { in ~LockFreeAddressHashSet()
36 subtle::AtomicWord* bucket_ptr = &buckets_[h & bucket_mask_]; in Insert()
62 for (subtle::AtomicWord bucket : other.buckets_) { in Copy()
Dlock_free_address_hash_set.h72 size_t buckets_count() const { return buckets_.size(); } in buckets_count()
78 float load_factor() const { return 1.f * size() / buckets_.size(); } in load_factor()
98 std::vector<subtle::AtomicWord> buckets_; variable
139 subtle::NoBarrier_Load(&buckets_[h & bucket_mask_])); in Bucket()
Dlock_free_address_hash_set_unittest.cc23 for (subtle::AtomicWord bucket : subset.buckets_) { in Subset()
43 reinterpret_cast<LockFreeAddressHashSet::Node*>(set.buckets_[bucket]); in BucketSize()
/external/tensorflow/tensorflow/core/grappler/costs/
Dutils.cc344 buckets_[Index(value)]++; in Add()
352 std::transform(buckets_.begin(), buckets_.end(), src.buckets_.begin(), in Merge()
353 buckets_.begin(), std::plus<uint64>()); in Merge()
366 for (int i = 0; i < buckets_.size(); i++) { in ToString()
367 if (buckets_[i] == 0) continue; in ToString()
368 cumul_sum += buckets_[i]; in ToString()
374 buckets_[i], // count in ToString()
375 mult * buckets_[i], // percentage in ToString()
380 (static_cast<double>(40 * buckets_[i] + (num_elem_ >> 1)) / num_elem_)); in ToString()
Dutils.h80 TensorSizeHistogram() : buckets_(kMaxBuckets, 0) {} in TensorSizeHistogram()
99 const std::vector<uint64>& GetBuckets() const { return buckets_; } in GetBuckets()
111 std::vector<uint64> buckets_; variable
/external/grpc-grpc/src/csharp/Grpc.IntegrationTesting/CoreStats/
DStats.cs228 buckets_ = other.buckets_.Clone(); in Histogram()
241 …private readonly pbc::RepeatedField<global::Grpc.Core.Bucket> buckets_ = new pbc::RepeatedField<gl… field in Grpc.Core.Histogram
244 get { return buckets_; }
260 if(!buckets_.Equals(other.buckets_)) return false; in Equals()
267 hash ^= buckets_.GetHashCode(); in GetHashCode()
281 buckets_.WriteTo(output, _repeated_buckets_codec); in WriteTo()
290 size += buckets_.CalculateSize(_repeated_buckets_codec); in CalculateSize()
302 buckets_.Add(other.buckets_); in MergeFrom()
315 buckets_.AddEntriesFrom(input, _repeated_buckets_codec); in MergeFrom()
/external/llvm-project/flang/runtime/
Dunit-map.h63 static constexpr int buckets_{1031}; // must be prime
64 int Hash(int n) { return std::abs(n) % buckets_; } in Hash()
86 OwningPtr<Chain> bucket_[buckets_]{}; // all owned by *this
Dunit-map.cpp56 for (int j{0}; j < buckets_; ++j) { in CloseAll()
68 for (int j{0}; j < buckets_; ++j) { in FlushAll()
78 for (int j{0}; j < buckets_; ++j) { in Find()
/external/brotli/c/enc/
Dhash_longest_match_quickly_inc.h43 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */ member
52 self->buckets_ = (uint32_t*)common->extra; in FN()
58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN()
100 self->buckets_[key] = (uint32_t)ix; in FN()
104 self->buckets_[(key + off) & BUCKET_MASK] = (uint32_t)ix; in FN()
155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN()
Dhash_to_binary_tree_inc.h41 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */ member
60 self->buckets_ = (uint32_t*)common->extra; in FN()
61 self->forest_ = &self->buckets_[BUCKET_SIZE]; in FN()
72 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN()
124 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN()
Dhash_longest_match64_inc.h57 uint32_t* buckets_; /* uint32_t[bucket_size * block_size]; */ member
75 self->buckets_ = (uint32_t*)&self->num_[self->bucket_size_]; in FN()
113 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN()
171 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN()
Dhash_longest_match_inc.h54 uint32_t* buckets_; /* uint32_t[bucket_size * block_size]; */ member
72 self->buckets_ = (uint32_t*)(&self->num_[self->bucket_size_]); in FN()
114 self->buckets_[offset] = (uint32_t)ix; in FN()
167 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FN()
/external/tensorflow/tensorflow/core/lib/monitoring/
Dsampler.h154 buckets_(std::move(buckets)), in Sampler()
182 std::unique_ptr<Buckets> buckets_; variable
235 std::forward_as_tuple(buckets_->explicit_bounds())) in GetCell()
Dmobile_sampler.h101 Sampler(std::unique_ptr<Buckets> buckets) : buckets_(std::move(buckets)) {} in Sampler()
104 std::unique_ptr<Buckets> buckets_; variable
/external/icu/icu4c/source/i18n/unicode/
Dalphaindex.h292 : buckets_(bucketList), collatorPrimaryOnly_(collatorPrimaryOnly) {} in ImmutableIndex()
294 BucketList *buckets_; variable
750 BucketList *buckets_; variable
/external/icu/libicu/cts_headers/unicode/
Dalphaindex.h292 : buckets_(bucketList), collatorPrimaryOnly_(collatorPrimaryOnly) {} in ImmutableIndex()
294 BucketList *buckets_; variable
750 BucketList *buckets_; variable

12