| /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()
|
| D | static_range_map-inl.h | 48 MapConstIterator iterator = map_.lower_bound(address); in RetrieveRange()
49 if (iterator == map_.end()) in RetrieveRange()
89 MapConstIterator iterator = map_.upper_bound(address); in RetrieveNearestRange()
90 if (iterator == map_.begin()) in RetrieveNearestRange()
114 MapConstIterator iterator = map_.IteratorAtIndex(index); in RetrieveRangeAtIndex()
|
| D | static_range_map.h | 52 StaticRangeMap(): map_() { } in StaticRangeMap()
53 explicit StaticRangeMap(const char *memory): map_(memory) { } in StaticRangeMap()
82 inline int GetCount() const { return map_.size(); } in GetCount()
101 AddressToRangeMap map_; variable
|
| D | static_address_map.h | 54 StaticAddressMap(): map_() { } in StaticAddressMap()
55 explicit StaticAddressMap(const char *map_data): map_(map_data) { } in StaticAddressMap()
72 AddressToEntryMap map_; variable
|
| /external/libchrome/base/ |
| D | id_map.h | 164 : map_(map), in Iterator()
165 iter_(map_->data_.begin()) { in Iterator()
170 : map_(iter.map_), in Iterator()
176 map_ = iter.map;
183 DCHECK(map_->sequence_checker_.CalledOnValidSequencedThread()); in ~Iterator()
187 DCHECK_LT(0, map_->iteration_depth_); in ~Iterator()
189 if (--map_->iteration_depth_ == 0) in ~Iterator()
190 map_->Compact(); in ~Iterator()
194 DCHECK(map_->sequence_checker_.CalledOnValidSequencedThread()); in IsAtEnd()
195 return iter_ == map_->data_.end(); in IsAtEnd()
[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 | hashmap.h | 88 Entry* map_; variable
92 Entry* map_end() const { return map_ + capacity_; } in map_end()
110 AllocationPolicy::Delete(map_); in ~TemplateHashMapImpl()
181 q = map_; in Remove()
192 Entry* r = map_ + (q->hash & (capacity_ - 1)); in Remove()
215 for (Entry* p = map_; p < end; p++) { in Clear()
225 return Next(map_ - 1); in Start()
233 DCHECK(map_ - 1 <= p && p < end); in Next()
249 Entry* p = map_ + (hash & (capacity_ - 1)); in Probe()
251 DCHECK(map_ <= p && p < end); in Probe()
[all …]
|
| D | address-map.cc | 14 map_ = isolate->root_index_map(); in RootIndexMap()
15 if (map_ != NULL) return; in RootIndexMap()
16 map_ = new HashMap(HashMap::PointersMatch); in RootIndexMap()
25 HashMap::Entry* entry = LookupEntry(map_, heap_object, false); in RootIndexMap()
30 SetValue(LookupEntry(map_, heap_object, true), i); in RootIndexMap()
34 isolate->set_root_index_map(map_); in RootIndexMap()
|
| D | address-map.h | 51 HashMap::Entry* entry = LookupEntry(map_, obj, false); in Lookup()
57 HashMap* map_;
151 : no_allocation_(), map_(new HashMap(HashMap::PointersMatch)) {} in BackReferenceMap()
153 ~BackReferenceMap() { delete map_; } in ~BackReferenceMap() local
156 HashMap::Entry* entry = LookupEntry(map_, obj, false); in Lookup()
162 DCHECK_NULL(LookupEntry(map_, obj, false)); in Add()
163 HashMap::Entry* entry = LookupEntry(map_, obj, true); in Add()
177 HashMap* map_; variable
|
| /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/libweave/src/commands/ |
| D | command_queue.cc | 28 for (const auto& command : map_) in AddCommandAddedCallback()
44 for (const auto& command : map_) { in AddCommandHandler()
59 for (const auto& command : map_) { in AddCommandHandler()
77 auto pair = map_.insert(std::make_pair(id, std::move(instance))); in Add()
94 auto p = map_.find(id); in RemoveLater()
95 if (p == map_.end()) in RemoveLater()
107 auto p = map_.find(id); in Remove()
108 if (p == map_.end()) in Remove()
112 map_.erase(p); in Remove()
141 auto p = map_.find(id); in Find()
[all …]
|
| /external/libchrome/base/containers/ |
| D | small_map.h | 429 return (*map_)[key];
435 return (*map_)[key];
451 std::pair<typename NormalMap::iterator, bool> ret = map_->insert(x);
458 std::pair<typename NormalMap::iterator, bool> ret = map_->insert(x);
476 return iterator(map_->begin());
483 return const_iterator(map_->begin());
491 return iterator(map_->end());
498 return const_iterator(map_->end());
508 map_.Destroy();
524 map_->erase(position.hash_iter_);
[all …]
|
| /external/v8/test/cctest/ |
| D | test-hashmap.cc | 47 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {} in IntSet()
52 map_.LookupOrInsert(reinterpret_cast<void*>(x), hash_(x)); in Insert()
60 map_.Remove(reinterpret_cast<void*>(x), hash_(x)); in Remove()
64 HashMap::Entry* p = map_.Lookup(reinterpret_cast<void*>(x), hash_(x)); in Present()
72 map_.Clear(); in Clear()
77 for (HashMap::Entry* p = map_.Start(); p != NULL; p = map_.Next(p)) { in occupancy()
80 CHECK_EQ(map_.occupancy(), static_cast<double>(count)); in occupancy()
86 HashMap map_; member in IntSet
|
| /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()
|
| /external/compiler-rt/lib/tsan/rtl/ |
| D | tsan_dense_alloc.h | 49 internal_memset(map_, 0, sizeof(map_)); in DenseSlabAlloc()
56 if (map_[i] != 0) in ~DenseSlabAlloc()
57 UnmapOrDie(map_[i], kL2Size * sizeof(T)); in ~DenseSlabAlloc()
77 return &map_[idx / kL2Size][idx % kL2Size]; in Map()
95 T *map_[kL1Size];
116 map_[fillpos_++] = batch; in Refill()
|
| /external/opencv3/modules/cudaimgproc/src/ |
| D | canny.cpp | 123 GpuMat map_; member in __anon64a457c40111::CannyImpl
212 ensureSizeIsEnough(image_size, CV_32SC1, map_); in createBuf()
220 map_.setTo(Scalar::all(0)); in CannyCaller()
221 …canny::calcMap(dx_, dy_, mag_, map_, static_cast<float>(low_thresh_), static_cast<float>(high_thre… in CannyCaller()
223 canny::edgesHysteresisLocal(map_, st1_.ptr<short2>(), StreamAccessor::getStream(stream)); in CannyCaller()
225 …canny::edgesHysteresisGlobal(map_, st1_.ptr<short2>(), st2_.ptr<short2>(), StreamAccessor::getStre… in CannyCaller()
227 canny::getEdges(map_, edges, StreamAccessor::getStream(stream)); in CannyCaller()
|
| /external/regex-re2/re2/ |
| D | regexp.cc | 532 NamedCapturesWalker() : map_(NULL) {} in NamedCapturesWalker()
533 ~NamedCapturesWalker() { delete map_; } in ~NamedCapturesWalker()
536 map<string, int>* m = map_; in TakeMap()
537 map_ = NULL; in TakeMap()
544 if (map_ == NULL) in PreVisit()
545 map_ = new map<string, int>; in PreVisit()
550 if (map_->find(*re->name()) == map_->end()) in PreVisit()
551 (*map_)[*re->name()] = re->cap(); in PreVisit()
563 map<string, int>* map_; member in re2::NamedCapturesWalker
576 CaptureNamesWalker() : map_(NULL) {} in CaptureNamesWalker()
[all …]
|