| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| D | rtp_header_extension_unittest.cc | 29 RtpHeaderExtensionMap map_; member in webrtc::RtpHeaderExtensionTest
36 EXPECT_EQ(0, map_.Size()); in TEST_F()
37 EXPECT_EQ(0, map_.Register(kRtpExtensionTransmissionTimeOffset, kId)); in TEST_F()
38 EXPECT_TRUE(map_.IsRegistered(kRtpExtensionTransmissionTimeOffset)); in TEST_F()
39 EXPECT_EQ(1, map_.Size()); in TEST_F()
40 EXPECT_EQ(0, map_.Deregister(kRtpExtensionTransmissionTimeOffset)); in TEST_F()
41 EXPECT_EQ(0, map_.Size()); in TEST_F()
43 EXPECT_EQ(0, map_.RegisterInactive(kRtpExtensionTransmissionTimeOffset, kId)); in TEST_F()
44 EXPECT_EQ(0, map_.Size()); in TEST_F()
45 EXPECT_TRUE(map_.IsRegistered(kRtpExtensionTransmissionTimeOffset)); in TEST_F()
[all …]
|
| /external/google-breakpad/src/processor/ |
| D | module_comparer.cc | 112 iter1 = basic_module->functions_.map_.begin(); in CompareModule()
113 iter2 = fast_module->functions_.map_.begin(); in CompareModule()
114 while (iter1 != basic_module->functions_.map_.end() in CompareModule()
115 && iter2 != fast_module->functions_.map_.end()) { in CompareModule()
123 ASSERT_TRUE(iter1 == basic_module->functions_.map_.end()); in CompareModule()
124 ASSERT_TRUE(iter2 == fast_module->functions_.map_.end()); in CompareModule()
131 iter1 = basic_module->public_symbols_.map_.begin(); in CompareModule()
132 iter2 = fast_module->public_symbols_.map_.begin(); in CompareModule()
133 while (iter1 != basic_module->public_symbols_.map_.end() in CompareModule()
134 && iter2 != fast_module->public_symbols_.map_.end()) { in CompareModule()
[all …]
|
| D | contained_range_map-inl.h | 72 if (!map_) in StoreRange()
73 map_ = new AddressToRangeMap(); in StoreRange()
75 MapIterator iterator_base = map_->lower_bound(base); in StoreRange()
76 MapIterator iterator_high = map_->lower_bound(high); in StoreRange()
77 MapIterator iterator_end = map_->end(); in StoreRange()
137 map_->erase(iterator_base, iterator_high); in StoreRange()
144 map_->insert(MapValue(high, in StoreRange()
158 if (!map_) in RetrieveRange()
167 MapConstIterator iterator = map_->lower_bound(address); in RetrieveRange()
168 if (iterator == map_->end() || address < iterator->second->base_) in RetrieveRange()
[all …]
|
| D | map_serializers-inl.h | 122 size_t header_size = (1 + m.map_.size()) * sizeof(uint32_t); in SizeOf()
126 for (iter = m.map_.begin(); iter != m.map_.end(); ++iter) { in SizeOf()
148 dest = SimpleSerializer<uint32_t>::Write(m.map_.size(), dest); in Write()
151 dest += sizeof(uint32_t) * m.map_.size(); in Write()
154 dest += sizeof(Address) * m.map_.size(); in Write()
159 for (iter = m.map_.begin(); iter != m.map_.end(); ++iter, ++index) { in Write()
199 if (m->map_) { in SizeOf()
200 size += m->map_->size() * sizeof(uint32_t); in SizeOf()
202 for (iter = m->map_->begin(); iter != m->map_->end(); ++iter) { in SizeOf()
225 if (m->map_ == NULL) { in Write()
[all …]
|
| D | range_map-inl.h | 68 MapConstIterator iterator_base = map_.lower_bound(base); in StoreRange()
69 MapConstIterator iterator_high = map_.lower_bound(high); in StoreRange()
90 if (iterator_high != map_.end()) { in StoreRange()
112 map_.insert(MapValue(high, Range(base, entry))); in StoreRange()
124 MapConstIterator iterator = map_.lower_bound(address); in RetrieveRange()
125 if (iterator == map_.end()) in RetrieveRange()
162 MapConstIterator iterator = map_.upper_bound(address); in RetrieveNearestRange()
163 if (iterator == map_.begin()) in RetrieveNearestRange()
191 MapConstIterator iterator = map_.begin(); in RetrieveRangeAtIndex()
207 return map_.size(); in GetCount()
[all …]
|
| D | basic_code_modules.cc | 50 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) { in BasicCodeModules()
69 if (!map_->StoreRange(module->base_address(), module->size(), module)) { in BasicCodeModules()
78 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) { in BasicCodeModules()
82 delete map_; in ~BasicCodeModules()
86 return map_->GetCount(); in module_count()
92 if (!map_->RetrieveRange(address, &module, NULL, NULL)) { in GetModuleForAddress()
107 if (!map_->RetrieveRangeAtIndex(sequence, &module, NULL, NULL)) { in GetModuleAtSequence()
|
| D | address_map-inl.h | 52 if (map_.find(address) != map_.end()) { in Store()
58 map_.insert(MapValue(address, entry)); in Store()
74 MapConstIterator iterator = map_.upper_bound(address); in Retrieve()
75 if (iterator == map_.begin()) in Retrieve()
88 map_.clear(); in Clear()
|
| /external/v8/src/compiler/ |
| D | register-allocator-verifier.h | 137 : map_(zone), map_for_moves_(zone), zone_(zone) {} in BlockAssessments()
138 void Drop(InstructionOperand operand) { map_.erase(operand); } in Drop()
141 auto existent = map_.find(operand); in AddDefinition()
142 if (existent != map_.end()) { in AddDefinition()
144 map_.erase(existent); in AddDefinition()
146 map_.insert( in AddDefinition()
153 CHECK(map_.empty()); in CopyFrom()
155 map_.insert(other->map_.begin(), other->map_.end()); in CopyFrom()
158 OperandMap& map() { return map_; } in map()
159 const OperandMap& map() const { return map_; } in map()
[all …]
|
| /external/jsoncpp/src/lib_json/ |
| D | json_value.cpp | 247 value_.map_ = new ObjectValues(); in Value()
254 value_.map_ = mapAllocator()->newMap(); in Value()
352 value_.map_ = new ObjectValues(*other.value_.map_); in Value()
359 value_.map_ = mapAllocator()->newMapCopy(*other.value_.map_); in Value()
390 delete value_.map_; in ~Value()
397 mapAllocator()->destructMap(value_.map_); in ~Value()
457 int delta = int(value_.map_->size() - other.value_.map_->size()); in operator <()
460 return (*value_.map_) < (*other.value_.map_); in operator <()
466 return value_.map_->compare(*(other.value_.map_)) < 0; in operator <()
506 return value_.map_->size() == other.value_.map_->size() && in operator ==()
[all …]
|
| D | json_valueiterator.inl | 42 iterator_.map_ = state;
52 return ValueInternalMap::value(iterator_.map_);
62 ValueInternalMap::increment(iterator_.map_);
72 ValueInternalMap::decrement(iterator_.map_);
107 return ValueInternalMap::distance(iterator_.map_, other.iterator_.map_);
120 return ValueInternalMap::equals(iterator_.map_, other.iterator_.map_);
131 iterator_.map_ = other.iterator_.map_;
148 const char* memberName = ValueInternalMap::key(iterator_.map_, isStatic);
174 return ValueInternalMap::key(iterator_.map_);
|
| /external/v8/src/ |
| D | identity-map.h | 136 index_ = map_->NextIndex(index_);
140 Object* key() const { return map_->KeyAtIndex(index_); } in key()
142 return reinterpret_cast<V*>(map_->EntryAtIndex(index_)); in entry()
150 Iterator(IdentityMap* map, int index) : map_(map), index_(index) {} in Iterator()
152 IdentityMap* map_; variable
160 explicit IteratableScope(IdentityMap* map) : map_(map) { in IteratableScope()
161 CHECK(!map_->is_iterable()); in IteratableScope()
162 map_->EnableIteration(); in IteratableScope()
165 CHECK(map_->is_iterable()); in ~IteratableScope()
166 map_->DisableIteration(); in ~IteratableScope()
[all …]
|
| D | address-map.cc | 14 map_ = isolate->root_index_map(); in RootIndexMap()
15 if (map_ != nullptr) return; in RootIndexMap()
16 map_ = new HeapObjectToIndexHashMap(); in RootIndexMap()
27 Maybe<uint32_t> maybe_index = map_->Get(heap_object); in RootIndexMap()
32 map_->Set(heap_object, i); in RootIndexMap()
41 isolate->set_root_index_map(map_); in RootIndexMap()
|
| /external/protobuf/src/google/protobuf/ |
| D | map_test.cc | 100 map_(*map_ptr_), in MapImplTest()
102 EXPECT_TRUE(map_.empty()); in MapImplTest()
103 EXPECT_EQ(0, map_.size()); in MapImplTest()
108 EXPECT_FALSE(map_.empty()); in ExpectSingleElement()
109 EXPECT_EQ(1, map_.size()); in ExpectSingleElement()
114 EXPECT_FALSE(map_.empty()); in ExpectElements()
115 EXPECT_EQ(map.size(), map_.size()); in ExpectElements()
124 EXPECT_EQ(value, map_[key]); in ExpectElement()
125 EXPECT_EQ(1, map_.count(key)); in ExpectElement()
128 EXPECT_EQ(value, map_.at(key)); in ExpectElement()
[all …]
|
| D | map_field_lite.h | 89 Map<Key, T>* map_; variable
101 map_ = new Map<Key, T>; in MapFieldLite()
112 map_ = Arena::CreateMessage<Map<Key, T> >(arena); in MapFieldLite()
122 delete map_; in ~MapFieldLite() local
132 return *map_; in GetMap()
142 return map_; in MutableMap()
152 return map_->size(); in size()
162 map_->clear(); in Clear()
173 for (typename Map<Key, T>::const_iterator it = other.map_->begin(); in MergeFrom()
174 it != other.map_->end(); ++it) { in MergeFrom()
[all …]
|
| D | map_field.h | 315 Map<MapKey, MapValueRef> map_;
331 map_ = reflection->MapData(message, field); in MapIterator()
334 map_->InitializeIterator(this); in MapIterator()
337 map_ = other.map_; in MapIterator()
338 map_->InitializeIterator(this); in MapIterator()
339 map_->CopyIterator(this, other); in MapIterator()
342 map_->DeleteIterator(this); in ~MapIterator()
345 return a.map_->EqualIterator(a, b);
348 return !a.map_->EqualIterator(a, b);
351 map_->IncreaseIterator(this);
[all …]
|
| /external/v8/src/snapshot/ |
| D | serializer-common.cc | 20 map_ = isolate->external_reference_map(); in ExternalReferenceEncoder()
21 if (map_ != nullptr) return; in ExternalReferenceEncoder()
22 map_ = new AddressToIndexHashMap(); in ExternalReferenceEncoder()
23 isolate->set_external_reference_map(map_); in ExternalReferenceEncoder()
30 if (map_->Get(addr).IsNothing()) map_->Set(addr, Value::Encode(i, false)); in ExternalReferenceEncoder()
31 DCHECK(map_->Get(addr).IsJust()); in ExternalReferenceEncoder()
40 if (map_->Get(addr).IsNothing()) map_->Set(addr, Value::Encode(i, true)); in ExternalReferenceEncoder()
41 DCHECK(map_->Get(addr).IsJust()); in ExternalReferenceEncoder()
51 DCHECK(map_->Get(addr).IsJust()); in ~ExternalReferenceEncoder()
61 Maybe<uint32_t> maybe_index = map_->Get(address); in TryEncode()
[all …]
|
| /external/v8/src/builtins/ |
| D | constants-table-builder.cc | 13 : isolate_(isolate), map_(isolate->heap()) { in BuiltinsConstantsTableBuilder()
43 uint32_t* maybe_key = map_.Find(object); in AddObject()
46 uint32_t index = map_.size(); in AddObject()
47 map_.Set(object, index); in AddObject()
79 if (map_.Delete(self_reference, &key)) { in PatchSelfReference()
81 map_.Set(code_object, key); in PatchSelfReference()
93 if (map_.size() == 0) return; in Finalize()
96 isolate_->factory()->NewFixedArray(map_.size(), TENURED); in Finalize()
99 ConstantsMap::IteratableScope it_scope(&map_); in Finalize()
115 for (int i = 0; i < map_.size(); i++) { in Finalize()
|
| /external/libchrome/base/containers/ |
| D | small_map.h | 407 return map_[key];
413 return map_[key];
429 std::pair<typename NormalMap::iterator, bool> ret = map_.insert(x);
436 std::pair<typename NormalMap::iterator, bool> ret = map_.insert(x);
465 map_.emplace(std::move(x));
473 map_.emplace(std::forward<Args>(args)...);
482 return iterator(map_.begin());
489 return const_iterator(map_.begin());
497 return iterator(map_.end());
504 return const_iterator(map_.end());
[all …]
|
| /external/perfetto/src/traced/probes/filesystem/ |
| D | lru_inode_cache.cc | 22 const auto& map_it = map_.find(k); in Get()
23 if (map_it == map_.end()) { in Get()
35 auto it = map_.find(k); in Insert()
43 if (map_it != map_.end()) { in Insert()
48 map_.emplace(std::move(k), list_.begin()); in Insert()
51 if (map_.size() > capacity_) { in Insert()
54 map_.erase(list_last_it->first); in Insert()
|
| D | range_tree.cc | 24 auto lower = map_.upper_bound(inode); in Get()
25 if (lower != map_.begin()) in Get()
33 auto lower = map_.rbegin(); in Insert()
34 if (!map_.empty()) { in Insert()
38 if (map_.empty() || !lower->second.Add(value)) { in Insert()
39 auto success = map_[inode].Add(value); in Insert()
|
| /external/v8/src/base/ |
| D | hashmap.h | 80 AllocationPolicy::Delete(map_); in Invalidate()
81 map_ = nullptr; in Invalidate()
114 Entry* map_;
121 Entry* map_end() const { return map_ + capacity_; } in map_end()
148 map_ = reinterpret_cast<Entry*>(allocator.New(capacity_ * sizeof(Entry))); in TemplateHashMapImpl()
149 memcpy(map_, original->map_, capacity_ * sizeof(Entry)); in TemplateHashMapImpl()
156 AllocationPolicy::Delete(map_); in ~TemplateHashMapImpl()
235 q = map_; in Remove()
246 Entry* r = map_ + (q->hash & (capacity_ - 1)); in Remove()
268 map_[i].clear(); in Clear()
[all …]
|
| /external/libbrillo/brillo/ |
| D | map_utils_unittest.cc | 16 map_ = { in SetUp()
21 void TearDown() override { map_.clear(); } in TearDown()
23 std::map<std::string, int> map_; member in brillo::MapUtilsTest
27 std::set<std::string> keys = GetMapKeys(map_); in TEST_F()
33 std::vector<std::string> keys = GetMapKeysAsVector(map_); in TEST_F()
39 std::vector<int> values = GetMapValues(map_); in TEST_F()
44 std::vector<std::pair<std::string, int>> elements = MapToVector(map_); in TEST_F()
|
| /external/v8/src/wasm/ |
| D | signature-map.cc | 15 auto pos = map_.find(sig); in FindOrInsert()
16 if (pos != map_.end()) { in FindOrInsert()
20 map_[sig] = index; in FindOrInsert()
26 auto pos = map_.find(sig); in Find()
27 if (pos != map_.end()) { in Find()
|
| /external/compiler-rt/lib/sanitizer_common/ |
| D | sanitizer_stackdepot.cc | 139 : map_(StackDepotGetStats()->n_uniq_ids + 100) { in StackDepotReverseMap()
146 map_.push_back(pair); in StackDepotReverseMap()
149 InternalSort(&map_, map_.size(), IdDescPair::IdComparator); in StackDepotReverseMap()
153 if (!map_.size()) in Get()
156 uptr idx = InternalBinarySearch(map_, 0, map_.size(), pair, in Get()
158 if (idx > map_.size()) in Get()
160 return map_[idx].desc->load(); in Get()
|
| /external/webrtc/webrtc/base/ |
| D | diskcache.cc | 95 map_.clear(); in Purge()
210 map_.erase(id); in DeleteResource()
218 for (EntryMap::iterator it = map_.begin(); it != map_.end(); ++it) { in CheckLimit()
227 EntryMap::iterator oldest = map_.end(); in CheckLimit()
228 for (EntryMap::iterator it = map_.begin(); it != map_.end(); ++it) { in CheckLimit()
234 if (oldest == map_.end()) { in CheckLimit()
238 for (EntryMap::iterator it = oldest++; it != map_.end(); ++it) { in CheckLimit()
301 EntryMap::iterator it = map_.find(id); in GetOrCreateEntry()
302 if (it != map_.end()) in GetOrCreateEntry()
312 it = map_.insert(EntryMap::value_type(id, e)).first; in GetOrCreateEntry()
|