| /frameworks/base/libs/androidfw/include/androidfw/ |
| ByteBucketArray.h | 34 ByteBucketArray() : default_() { memset(buckets_, 0, sizeof(buckets_)); }
38 if (buckets_[i] != NULL) {
39 delete[] buckets_[i];
42 memset(buckets_, 0, sizeof(buckets_));
55 T* bucket = buckets_[bucket_index];
67 T* bucket = buckets_[bucket_index];
69 bucket = buckets_[bucket_index] = new T[kBucketSize]();
86 T* buckets_[kNumBuckets]
[all...] |
| /external/parameter-framework/asio-1.10.6/include/asio/detail/ |
| hash_map.hpp | 57 buckets_(0),
65 delete[] buckets_;
104 iterator it = buckets_[bucket].first;
107 iterator end_it = buckets_[bucket].last;
125 const_iterator it = buckets_[bucket].first;
128 const_iterator end_it = buckets_[bucket].last;
146 iterator it = buckets_[bucket].first;
149 buckets_[bucket].first = buckets_[bucket].last =
152 return std::pair<iterator, bool>(buckets_[bucket].last, true)
308 bucket_type* buckets_; member in class:asio::detail::hash_map
[all...] |
| /external/webrtc/webrtc/modules/remote_bitrate_estimator/ |
| rate_statistics.cc | 19 buckets_(new size_t[num_buckets_]()),
34 buckets_[i] = 0;
52 buckets_[index] += count;
68 size_t count_in_oldest_bucket = buckets_[oldest_index_];
71 buckets_[oldest_index_] = 0;
|
| rate_statistics.h | 37 rtc::scoped_ptr<size_t[]> buckets_; member in class:webrtc::RateStatistics
|
| /tools/dexter/slicer/export/slicer/ |
| hash_table.h | 73 std::vector<Bucket> buckets_; member in class:slicer::HashTable::Partition
111 buckets_.reserve(hash_buckets_ * kAvgChainLength);
112 buckets_.resize(hash_buckets_);
118 // extra buckets for the collision chains [hash_buckets_, buckets_.size())
129 if (buckets_.size() + 1 > buckets_.capacity()) {
134 if (buckets_[bucket_index].value == nullptr) {
135 buckets_[bucket_index].value = value;
139 new_bucket.next = buckets_[bucket_index].next;
140 buckets_[bucket_index].next = buckets_.size()
[all...] |
| /external/tensorflow/tensorflow/core/lib/histogram/ |
| histogram.cc | 86 buckets_.clear();
87 buckets_.insert(buckets_.end(), proto.bucket().begin(), proto.bucket().end());
97 buckets_.resize(bucket_limits_.size());
99 buckets_[i] = 0;
108 buckets_[b] += 1.0;
131 for (size_t i = 0; i < buckets_.size(); i++) {
132 double cumsum = cumsum_prev + buckets_[i];
182 for (size_t b = 0; b < buckets_.size(); b++) {
183 if (buckets_[b] <= 0.0) continue
[all...] |
| histogram.h | 96 std::vector<double> buckets_; member in class:tensorflow::histogram::Histogram
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| utils.h | 68 TensorSizeHistogram() : buckets_(kMaxBuckets, 0) {}
87 const std::vector<uint64>& GetBuckets() const { return buckets_; }
99 std::vector<uint64> buckets_; member in class:tensorflow::grappler::TensorSizeHistogram
|
| utils.cc | 301 buckets_[Index(value)]++;
309 std::transform(buckets_.begin(), buckets_.end(), src.buckets_.begin(),
310 buckets_.begin(), std::plus<uint64>());
328 for (int i = 0; i < buckets_.size(); i++) {
329 if (buckets_[i] == 0) continue;
330 cumul_sum += buckets_[i];
347 buckets_[i], // count
348 mult * buckets_[i], // percentag
[all...] |
| /art/compiler/optimizing/ |
| gvn.cc | 43 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)),
48 std::fill_n(buckets_, num_buckets_, nullptr);
57 buckets_(allocator->AllocArray<Node*>(num_buckets_, kArenaAllocGvn)),
60 // ArenaAllocator returns zeroed memory, so entries of buckets_ and
95 buckets_[index] = new (allocator_) Node(instruction, hash_code, buckets_[index]);
105 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
121 for (Node* node = buckets_[index]; node != nullptr; node = node->GetNext()) {
139 buckets_[i] = nullptr;
172 memcpy(buckets_, other.buckets_, num_buckets_ * sizeof(Node*))
324 Node** const buckets_; member in class:art::ValueSet
[all...] |
| /external/brotli/c/enc/ |
| hash_longest_match_quickly_inc.h | 38 uint32_t buckets_[BUCKET_SIZE + BUCKET_SWEEP]; member in struct:HashLongestMatchQuickly
60 memset(&self->buckets_[key], 0, BUCKET_SWEEP * sizeof(self->buckets_[0]));
67 memset(&self->buckets_[0], 0, sizeof(self->buckets_));
88 FN(Self)(handle)->buckets_[key + off] = (uint32_t)ix;
160 self->buckets_[key] = (uint32_t)cur_ix;
171 prev_ix = self->buckets_[key];
172 self->buckets_[key] = (uint32_t)cur_ix;
194 uint32_t *bucket = self->buckets_ + key
[all...] |
| hash_to_binary_tree_inc.h | 41 uint32_t buckets_[BUCKET_SIZE]; member in struct:HashToBinaryTree
51 corresponding to a hash is a sequence starting at buckets_[hash] and
81 self->buckets_[i] = invalid_pos;
127 size_t prev_ix = self->buckets_[key];
142 self->buckets_[key] = (uint32_t)cur_ix;
|
| /external/tensorflow/tensorflow/core/util/ |
| presized_cuckoo_map.h | 93 buckets_.clear();
94 buckets_.resize(num_buckets_, empty_bucket);
109 Bucket* bptr = &buckets_[bucket];
248 Bucket* bptr = &buckets_[b];
256 const Bucket& bref = buckets_[b];
269 const Bucket& bref = buckets_[bucket];
280 Bucket& src_ref = buckets_[src_bucket];
281 Bucket& dst_ref = buckets_[dst_bucket];
315 const Bucket& bref = buckets_[e.bucket];
344 std::vector<Bucket> buckets_; member in class:tensorflow::PresizedCuckooMap
[all...] |
| /external/tensorflow/tensorflow/core/lib/monitoring/ |
| mobile_sampler.h | 90 Sampler(std::unique_ptr<Buckets> buckets) : buckets_(std::move(buckets)) {}
93 std::unique_ptr<Buckets> buckets_; member in class:tensorflow::monitoring::Sampler
|
| sampler.h | 138 buckets_(std::move(buckets)),
157 std::unique_ptr<Buckets> buckets_; member in class:tensorflow::monitoring::Sampler
210 std::forward_as_tuple(buckets_->explicit_bounds()))
|
| /system/libhwbinder/vts/performance/ |
| PerfTest.cpp | 85 ret.buckets_[i] = a.buckets_[i] + b.buckets_[i];
103 buckets_[min(nano, kMaxTimeBucket - 1) / kTimePerBucket] += 1;
167 float accumulation = cur_total + buckets_[i];
180 cur_total += buckets_[i];
|
| PerfTest.h | 115 uint32_t buckets_[kNumBuckets] = {0}; // statistics for the distribution member in class:Results
|
| /external/icu/icu4c/source/i18n/ |
| alphaindex.cpp | 181 delete buckets_;
187 return buckets_->getBucketCount();
193 return buckets_->getBucketIndex(name, *collatorPrimaryOnly_, errorCode);
198 if (0 <= index && index < buckets_->getBucketCount()) {
199 return icu::getBucket(*buckets_->immutableVisibleList_, index);
211 buckets_(NULL) {
222 buckets_(NULL) {
232 delete buckets_;
259 // We could clone the buckets_ if they are not NULL,
285 return buckets_->getBucketCount()
[all...] |
| /external/icu/icu4c/source/i18n/unicode/ |
| alphaindex.h | 287 : buckets_(bucketList), collatorPrimaryOnly_(collatorPrimaryOnly) {}
289 BucketList *buckets_; member in class:AlphabeticIndex::ImmutableIndex
742 BucketList *buckets_; member in class:AlphabeticIndex
|
| /external/libchrome/base/trace_event/ |
| heap_profiler_allocation_register.h | 60 buckets_(static_cast<Bucket*>(
67 FreeGuardedVirtualMemory(buckets_, NumBuckets * sizeof(Bucket));
174 // for |key|. The pointer may point at an element of |buckets_| or at the
177 // The list head is in |buckets_| at the hash offset.
178 Cell** p_cell = &buckets_[Hash(key)];
231 // The array of buckets (pointers into |cells_|). |buckets_[Hash(key)]| will
234 mutable Bucket* buckets_; variable
|
| /external/jsoncpp/include/json/ |
| value.h | 737 ValueInternalLink* buckets_; member in class:Json::ValueInternalMap
|
