| /external/libchrome/mojo/public/cpp/bindings/ |
| map_data_view.h | 25 : keys_(data ? data->keys.Get() : nullptr, context),
29 DCHECK_EQ(keys_.is_null(), values_.is_null());
30 return keys_.is_null();
34 DCHECK_EQ(keys_.size(), values_.size());
35 return keys_.size();
38 ArrayDataView<K>& keys() { return keys_; }
39 const ArrayDataView<K>& keys() const { return keys_; }
43 return internal::Deserialize<ArrayDataView<K>>(keys_.data_, output,
44 keys_.context_);
57 ArrayDataView<K> keys_; member in class:mojo::MapDataView
[all...] |
| /external/v8/src/ |
| lookup-cache.cc | 13 for (int index = 0; index < kLength; index++) keys_[index].source = nullptr;
|
| lookup-cache.h | 34 keys_[i].source = nullptr;
35 keys_[i].name = nullptr;
48 Key keys_[kLength]; member in class:v8::internal::DescriptorLookupCache
|
| identity-map.cc | 19 DCHECK_NULL(keys_);
23 if (keys_) {
25 heap_->UnregisterStrongRoots(keys_);
26 DeleteArray(keys_);
28 keys_ = nullptr;
50 if (keys_[index] == address) return index; // Found.
51 if (keys_[index] == not_mapped) return -1; // Not found.
54 if (keys_[index] == address) return index; // Found.
55 if (keys_[index] == not_mapped) return -1; // Not found.
67 if (keys_[index] == address) return index; // Found
[all...] |
| lookup-cache-inl.h | 28 Key& key = keys_[index];
36 Key& key = keys_[index];
|
| identity-map.h | 28 // within the {keys_} array in order to simulate a moving GC.
39 keys_(nullptr),
77 Object** keys_; member in class:v8::internal::IdentityMapBase
|
| keys.cc | 50 if (keys_.is_null()) {
54 keys_->map() == ReadOnlyRoots(isolate_).fixed_array_map()) {
55 return Handle<FixedArray>::cast(keys_);
65 return Handle<OrderedHashSet>::cast(keys_);
80 if (keys_.is_null()) {
81 keys_ = OrderedHashSet::Allocate(isolate_, 16);
89 if (*new_set != *keys_) {
90 // The keys_ Set is converted directly to a FixedArray in GetKeys which can
93 keys_->set(OrderedHashTableBase::kNextTableIndex, Smi::kZero);
94 keys_ = new_set
[all...] |
| keys.h | 109 // keys_ is either an Handle<OrderedHashSet> or in the case of own JSProxy
112 Handle<FixedArray> keys_; member in class:v8::internal::BASE_EMBEDDED
|
| /external/compiler-rt/test/tsan/ |
| pthread_key.cc | 11 pthread_key_t keys_[N]; local
13 int err = pthread_key_create(&keys_[i], 0);
20 pthread_setspecific(keys_[i], (void*)(long)i);
22 pthread_key_delete(keys_[i]);
|
| /external/tensorflow/tensorflow/compiler/tf2tensorrt/utils/ |
| trt_lru_cache.h | 73 keys_.push_front(key);
82 std::list<key_type> keys_; member in class:tensorflow::tensorrt::LRUCache
95 auto rank = std::find(keys_.begin(), keys_.end(), key);
96 if (rank != keys_.begin()) {
97 keys_.erase(rank);
98 keys_.push_front(key);
109 key_type discard_key = keys_.back();
110 keys_.pop_back();
|
| /external/tensorflow/tensorflow/core/kernels/ |
| initializable_lookup_table.h | 170 : keys_(keys), values_(values), valid_(true), status_(Status::OK()) {
171 TensorShape key_shape = keys_->shape();
192 const Tensor& keys() const override { return *keys_; }
199 return keys_ == nullptr ? -1 : keys_->NumElements();
205 const Tensor* keys_; // Doesn't own it. member in class:tensorflow::lookup::KeyValueTensorIterator
|
| /external/tensorflow/tensorflow/contrib/bigtable/kernels/ |
| bigtable_sample_key_pairs_dataset_op.cc | 118 // Computes split points (`keys_`) to use when scanning the table.
122 // over them, and copy them to `keys_` if they fall within the requested
139 if (keys_.empty() && dataset()->key_range_.begin_key() != row_key) {
140 keys_.push_back(dataset()->key_range_.begin_key());
142 keys_.push_back(std::move(row_key));
143 } else if (!keys_.empty()) {
144 // If !keys_.empty(), then we have found at least one element of
155 if (keys_.empty()) {
156 keys_.push_back(dataset()->key_range_.begin_key());
160 if (keys_.back() != dataset()->key_range_.end_key())
197 std::vector<string> keys_; member in class:tensorflow::data::__anon44700::BigtableSampleKeyPairsDatasetOp::Dataset::Iterator
[all...] |
| /external/v8/src/ast/ |
| context-slot-cache.cc | 28 Key& key = keys_[index];
47 Key& key = keys_[index];
59 for (int index = 0; index < kLength; index++) keys_[index].data = nullptr;
71 Key& key = keys_[index];
|
| context-slot-cache.h | 39 keys_[i].data = nullptr;
40 keys_[i].name = nullptr;
102 Key keys_[kLength]; member in class:v8::internal::ContextSlotCache
|
| /art/compiler/utils/ |
| dedupe_set-inl.h | 61 keys_() {
65 for (const HashedKey<StoreKey>& key : keys_) {
74 auto it = keys_.find(hashed_in_key);
75 if (it != keys_.end()) {
80 keys_.insert(HashedKey<StoreKey> { hash, store_key });
92 global_stats->total_probe_distance += keys_.TotalProbeDistance();
93 global_stats->total_size += keys_.size();
94 for (const HashedKey<StoreKey>& key : keys_) {
180 HashSet<HashedKey<StoreKey>, ShardEmptyFn, ShardHashFn, ShardPred> keys_ GUARDED_BY(lock_);
|
| /external/google-breakpad/src/processor/ |
| static_map_iterator.h | 106 // keys_[i] = key of i_th node.
107 const Key* keys_; member in class:google_breakpad::StaticMapIterator
|
| static_map_iterator-inl.h | 52 keys_ = reinterpret_cast<const Key*>(
111 return &(keys_[index_]);
|
| static_map.h | 136 // keys_[i] = key of i_th node
137 const Key* keys_; member in class:google_breakpad::StaticMap
|
| static_map-inl.h | 55 keys_ = reinterpret_cast<const Key*>(
171 return keys_[index];
|
| /external/tensorflow/tensorflow/core/kernels/data/experimental/ |
| group_by_reducer_dataset_op.cc | 252 keys_.resize(states_.size());
255 keys_[idx] = it->first;
260 if (keys_index_ == keys_.size()) {
265 ctx, states_[keys_[keys_index_++]], out_tensors));
308 // Saving keys_index_ and keys_.
312 if (!keys_.empty()) {
314 writer->WriteScalar(full_name("keys_size"), keys_.size()));
315 for (int idx = 0; idx < keys_.size(); ++idx) {
317 full_name(strings::StrCat("keys[", idx, "]")), keys_[idx]));
360 // Restoring keys_index_ and keys_
[all...] |
| /external/perf_data_converter/src/ |
| intervalmap_test.cc | 80 : keys_(std::move(keys)) {}
84 for (auto key : keys_) {
90 std::vector<uint64> keys_; member in class:perftools::__anon35740::FailLookupCommand
|
| /external/tensorflow/tensorflow/core/kernels/data/ |
| dataset_utils.cc | 212 for (size_t i = 0; i < keys_.size(); ++i) {
213 strings::StrAppend(&metadata, kDelimiter, keys_[i]);
230 keys_.push_back(string(key));
|
| dataset_utils.h | 98 std::vector<string> keys_; member in class:tensorflow::data::VariantTensorDataWriter
|
| /external/tensorflow/tensorflow/python/util/ |
| util.cc | 353 : dict_(dict), keys_(PyDict_Keys(dict)) {
354 if (PyList_Sort(keys_.get()) == -1) {
357 iter_.reset(PyObject_GetIter(keys_.get()));
380 Safe_PyObjectPtr keys_; member in class:tensorflow::swig::__anon46384::DictValueIterator
388 : mapping_(mapping), keys_(MappingKeys(mapping)) {
389 if (!keys_ || PyList_Sort(keys_.get()) == -1) {
392 iter_.reset(PyObject_GetIter(keys_.get()));
414 Safe_PyObjectPtr keys_; member in class:tensorflow::swig::__anon46384::MappingValueIterator
[all...] |
| /external/perfetto/src/trace_processor/ |
| trace_storage.h | 177 const std::deque<StringId>& keys() const { return keys_; }
204 keys_.emplace_back(arg.key);
215 std::deque<StringId> keys_; member in class:perfetto::trace_processor::TraceStorage::Args
[all...] |
