Home
last modified time | relevance | path

Searched refs:buckets_ (Results 1 - 16 of 16) sorted by relevance

/third_party/spirv-tools/source/
H A Denum_set.h98 if (bucketIndex_ >= set_->buckets_.size()) { in operator ++()
99 bucketIndex_ = set_->buckets_.size(); in operator ++()
111 } while (bucketIndex_ < set_->buckets_.size() && in operator ++()
125 return GetValueFromBucket(set_->buckets_[bucketIndex_], bucketOffset_); in operator *()
166 if (buckets_.size() == 0) {
182 return iterator(this, buckets_.size(), /* bucketOffset= */ 0);
188 EnumSet() : buckets_(0), size_(0) {} in EnumSet()
217 : buckets_(other.buckets_), size_(other.size_) {} in EnumSet()
221 : buckets_(st in EnumSet()
[all...]
/third_party/gn/src/gn/
H A Dhash_table_base.h37 // The |buckets_| field holds a pointer to an array of NODE_TYPE
199 // Destructor. This only deals with the |buckets_| array itself.
201 if (buckets_ != buckets0_) in ~HashTableBase()
202 free(buckets_); in ~HashTableBase()
205 // Copy and move operations. These only operate on the |buckets_| array
210 if (other.buckets_ != other.buckets0_) { in HashTableBase()
213 buckets_ = reinterpret_cast<Node*>(malloc(other.size_ * sizeof(Node))); in HashTableBase()
215 memcpy(buckets_, other.buckets_, other.size_ * sizeof(Node)); in HashTableBase()
227 : count_(other.count_), size_(other.size_), buckets_(othe function in HashTableBase
537 Node* buckets_ = buckets0_; global() member in HashTableBase
[all...]
/third_party/icu/icu4c/source/i18n/
H A 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()
259 // We could clone the buckets_ if they are not NULL, in buildImmutableIndex()
284 return buckets_ in getBucketCount()
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A 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_(nullptr) { in AlphabeticIndex()
222 buckets_(nullptr) { in AlphabeticIndex()
232 delete buckets_; in ~AlphabeticIndex()
259 // We could clone the buckets_ if they are not nullptr, in buildImmutableIndex()
284 return buckets_ in getBucketCount()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A 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()
259 // We could clone the buckets_ if they are not NULL, in buildImmutableIndex()
284 return buckets_ in getBucketCount()
[all...]
/third_party/node/deps/brotli/c/enc/
H A Dhash_longest_match_quickly_inc.h43 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */ member
52 self->buckets_ = (uint32_t*)common->extra; in Initialize()
58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Prepare()
100 self->buckets_[key] = (uint32_t)ix; in Store()
104 self->buckets_[(key + off) & BUCKET_MASK] = (uint32_t)ix; in Store()
155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch()
H A Dhash_to_binary_tree_inc.h41 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */ member
51 corresponding to a hash is a sequence starting at buckets_[hash] and
60 self->buckets_ = (uint32_t*)common->extra; in Initialize()
61 self->forest_ = &self->buckets_[BUCKET_SIZE]; in Initialize()
72 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Prepare()
124 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in StoreAndFindMatches()
H A 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 Initialize()
113 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Store()
171 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch()
H A 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 Initialize()
114 self->buckets_[offset] = (uint32_t)ix; in Store()
167 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dhash_longest_match_quickly_inc.h43 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */ member
52 self->buckets_ = (uint32_t*)common->extra; in Initialize()
58 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Prepare()
100 self->buckets_[key] = (uint32_t)ix; in Store()
104 self->buckets_[(key + off) & BUCKET_MASK] = (uint32_t)ix; in Store()
155 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch()
H A Dhash_to_binary_tree_inc.h41 uint32_t* buckets_; /* uint32_t[BUCKET_SIZE]; */ member
51 corresponding to a hash is a sequence starting at buckets_[hash] and
60 self->buckets_ = (uint32_t*)common->extra; in Initialize()
61 self->forest_ = &self->buckets_[BUCKET_SIZE]; in Initialize()
72 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Prepare()
124 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in StoreAndFindMatches()
H A 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 Initialize()
114 self->buckets_[offset] = (uint32_t)ix; in Store()
167 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch()
H A 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 Initialize()
113 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in Store()
171 uint32_t* BROTLI_RESTRICT buckets = self->buckets_; in FindLongestMatch()
/third_party/node/deps/icu-small/source/i18n/unicode/
H A Dalphaindex.h292 : buckets_(bucketList), collatorPrimaryOnly_(collatorPrimaryOnly) {} in ImmutableIndex()
294 BucketList *buckets_; member in AlphabeticIndex::ImmutableIndex
750 BucketList *buckets_; member in AlphabeticIndex
/third_party/icu/icu4c/source/i18n/unicode/
H A Dalphaindex.h292 : buckets_(bucketList), collatorPrimaryOnly_(collatorPrimaryOnly) {} in ImmutableIndex()
294 BucketList *buckets_; member in AlphabeticIndex::ImmutableIndex
750 BucketList *buckets_; member in AlphabeticIndex
/third_party/skia/third_party/externals/icu/source/i18n/unicode/
H A Dalphaindex.h292 : buckets_(bucketList), collatorPrimaryOnly_(collatorPrimaryOnly) {} in ImmutableIndex()
294 BucketList *buckets_; member in AlphabeticIndex::ImmutableIndex
750 BucketList *buckets_; member in AlphabeticIndex

Completed in 13 milliseconds