| /external/webrtc/webrtc/modules/rtp_rtcp/source/ |
| rtp_header_extension_unittest.cc | 29 RtpHeaderExtensionMap map_; member in class:webrtc::RtpHeaderExtensionTest
36 EXPECT_EQ(0, map_.Size());
37 EXPECT_EQ(0, map_.Register(kRtpExtensionTransmissionTimeOffset, kId));
38 EXPECT_TRUE(map_.IsRegistered(kRtpExtensionTransmissionTimeOffset));
39 EXPECT_EQ(1, map_.Size());
40 EXPECT_EQ(0, map_.Deregister(kRtpExtensionTransmissionTimeOffset));
41 EXPECT_EQ(0, map_.Size());
43 EXPECT_EQ(0, map_.RegisterInactive(kRtpExtensionTransmissionTimeOffset, kId));
44 EXPECT_EQ(0, map_.Size());
45 EXPECT_TRUE(map_.IsRegistered(kRtpExtensionTransmissionTimeOffset))
[all...] |
| /art/runtime/ |
| safe_map.h | 50 : map_(cmp, allocator) {
54 map_ = rhs.map_;
58 allocator_type get_allocator() const { return map_.get_allocator(); }
59 key_compare key_comp() const { return map_.key_comp(); }
60 value_compare value_comp() const { return map_.value_comp(); }
62 iterator begin() { return map_.begin(); }
63 const_iterator begin() const { return map_.begin(); }
64 iterator end() { return map_.end(); }
65 const_iterator end() const { return map_.end();
145 ::std::map<K, V, Comparator, Allocator> map_; member in class:art::SafeMap
[all...] |
| /external/google-breakpad/src/processor/ |
| address_map-inl.h | 52 if (map_.find(address) != map_.end()) {
58 map_.insert(MapValue(address, entry));
74 MapConstIterator iterator = map_.upper_bound(address);
75 if (iterator == map_.begin())
88 map_.clear();
|
| static_address_map.h | 54 StaticAddressMap(): map_() { }
55 explicit StaticAddressMap(const char *map_data): map_(map_data) { }
72 AddressToEntryMap map_; member in class:google_breakpad::StaticAddressMap
|
| contained_range_map-inl.h | 72 if (!map_)
73 map_ = new AddressToRangeMap();
75 MapIterator iterator_base = map_->lower_bound(base);
76 MapIterator iterator_high = map_->lower_bound(high);
77 MapIterator iterator_end = map_->end();
137 map_->erase(iterator_base, iterator_high);
144 map_->insert(MapValue(high,
158 if (!map_)
167 MapConstIterator iterator = map_->lower_bound(address);
168 if (iterator == map_->end() || address < iterator->second->base_
[all...] |
| basic_code_modules.cc | 50 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) {
69 if (!map_->StoreRange(module->base_address(), module->size(), module)) {
78 map_(new RangeMap<uint64_t, linked_ptr<const CodeModule> >()) {
82 delete map_;
86 return map_->GetCount();
92 if (!map_->RetrieveRange(address, &module, NULL, NULL)) {
107 if (!map_->RetrieveRangeAtIndex(sequence, &module, NULL, NULL)) {
|
| static_range_map.h | 52 StaticRangeMap(): map_() { }
53 explicit StaticRangeMap(const char *memory): map_(memory) { }
82 inline int GetCount() const { return map_.size(); }
101 AddressToRangeMap map_; member in class:google_breakpad::StaticRangeMap
|
| static_address_map-inl.h | 56 MapConstIterator iterator = map_.upper_bound(address);
57 if (iterator == map_.begin())
|
| static_contained_range_map.h | 52 StaticContainedRangeMap(): base_(), entry_size_(), entry_ptr_(), map_() { }
90 AddressToRangeMap map_; member in class:google_breakpad::StaticContainedRangeMap
|
| module_comparer.cc | 112 iter1 = basic_module->functions_.map_.begin();
113 iter2 = fast_module->functions_.map_.begin();
114 while (iter1 != basic_module->functions_.map_.end()
115 && iter2 != fast_module->functions_.map_.end()) {
123 ASSERT_TRUE(iter1 == basic_module->functions_.map_.end());
124 ASSERT_TRUE(iter2 == fast_module->functions_.map_.end());
131 iter1 = basic_module->public_symbols_.map_.begin();
132 iter2 = fast_module->public_symbols_.map_.begin();
133 while (iter1 != basic_module->public_symbols_.map_.end()
134 && iter2 != fast_module->public_symbols_.map_.end())
[all...] |
| contained_range_map.h | 78 ContainedRangeMap() : base_(), entry_(), map_(NULL) {}
123 : base_(base), entry_(entry), map_(map) {}
143 AddressToRangeMap *map_; member in class:google_breakpad::ContainedRangeMap
|
| static_contained_range_map-inl.h | 52 map_(base + sizeof(base_) + sizeof(entry_size_) + entry_size_) {
68 MapConstIterator iterator = map_.lower_bound(address);
70 if (iterator == map_.end())
|
| address_map.h | 51 AddressMap() : map_() {}
80 AddressToEntryMap map_; member in class:google_breakpad::AddressMap
|
| range_map-inl.h | 68 MapConstIterator iterator_base = map_.lower_bound(base);
69 MapConstIterator iterator_high = map_.lower_bound(high);
90 if (iterator_high != map_.end()) {
112 map_.insert(MapValue(high, Range(base, entry)));
124 MapConstIterator iterator = map_.lower_bound(address);
125 if (iterator == map_.end())
162 MapConstIterator iterator = map_.upper_bound(address);
163 if (iterator == map_.begin())
191 MapConstIterator iterator = map_.begin();
207 return map_.size()
[all...] |
| static_range_map-inl.h | 48 MapConstIterator iterator = map_.lower_bound(address);
49 if (iterator == map_.end())
89 MapConstIterator iterator = map_.upper_bound(address);
90 if (iterator == map_.begin())
114 MapConstIterator iterator = map_.IteratorAtIndex(index);
|
| map_serializers-inl.h | 122 size_t header_size = (1 + m.map_.size()) * sizeof(uint32_t);
126 for (iter = m.map_.begin(); iter != m.map_.end(); ++iter) {
148 dest = SimpleSerializer<uint32_t>::Write(m.map_.size(), dest);
151 dest += sizeof(uint32_t) * m.map_.size();
154 dest += sizeof(Address) * m.map_.size();
159 for (iter = m.map_.begin(); iter != m.map_.end(); ++iter, ++index) {
197 // In case m.map_ == NULL, we treat it as an empty map:
199 if (m->map_) {
[all...] |
| /external/v8/src/ |
| address-map.cc | 14 map_ = isolate->root_index_map();
15 if (map_ != NULL) return;
16 map_ = new HashMap(HashMap::PointersMatch);
25 HashMap::Entry* entry = LookupEntry(map_, heap_object, false);
30 SetValue(LookupEntry(map_, heap_object, true), i);
34 isolate->set_root_index_map(map_);
|
| hashmap.h | 88 Entry* map_; member in class:v8::internal::TemplateHashMapImpl
92 Entry* map_end() const { return map_ + capacity_; }
110 AllocationPolicy::Delete(map_);
181 q = map_;
192 Entry* r = map_ + (q->hash & (capacity_ - 1));
215 for (Entry* p = map_; p < end; p++) {
225 return Next(map_ - 1);
233 DCHECK(map_ - 1 <= p && p < end);
249 Entry* p = map_ + (hash & (capacity_ - 1));
251 DCHECK(map_ <= p && p < end)
328 const TemplateHashMapImpl<AllocationPolicy>* map_; member in class:v8::TemplateHashMap::Iterator
[all...] |
| /external/libbrillo/brillo/ |
| map_utils_unittest.cc | 16 map_ = {
21 void TearDown() override { map_.clear(); }
23 std::map<std::string, int> map_; member in class:brillo::MapUtilsTest
27 std::set<std::string> keys = GetMapKeys(map_);
33 std::vector<std::string> keys = GetMapKeysAsVector(map_);
39 std::vector<int> values = GetMapValues(map_);
44 std::vector<std::pair<std::string, int>> elements = MapToVector(map_);
|
| /external/libchrome/base/ |
| id_map.h | 164 : map_(map),
165 iter_(map_->data_.begin()) {
170 : map_(iter.map_),
176 map_ = iter.map;
183 DCHECK(map_->sequence_checker_.CalledOnValidSequencedThread());
187 DCHECK_LT(0, map_->iteration_depth_);
189 if (--map_->iteration_depth_ == 0)
190 map_->Compact();
194 DCHECK(map_->sequence_checker_.CalledOnValidSequencedThread())
229 IDMap<T, OS>* map_; member in class:IDMap::Iterator
[all...] |
| /system/bt/service/ipc/binder/ |
| remote_callback_map.h | 110 CallbackMap map_; member in class:ipc::binder::final
137 if (map_.find(key) != map_.end()) {
150 map_[key] = dr;
161 auto iter = map_.find(key);
162 if (iter == map_.end()) {
174 auto iter = map_.find(key);
175 if (iter == map_.end())
185 auto iter = map_.find(key);
186 if (iter == map_.end()
[all...] |
| /prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/ |
| map_field_lite.h | 89 Map<Key, T>* map_; member in class:google::protobuf::internal::MapFieldLite
101 map_ = new Map<Key, T>;
112 map_ = Arena::CreateMessage<Map<Key, T> >(arena);
122 delete map_;
132 return *map_;
142 return map_;
152 return map_->size();
162 map_->clear();
173 for (typename Map<Key, T>::const_iterator it = other.map_->begin();
174 it != other.map_->end(); ++it)
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_stackdepot.cc | 139 : map_(StackDepotGetStats()->n_uniq_ids + 100) {
146 map_.push_back(pair);
149 InternalSort(&map_, map_.size(), IdDescPair::IdComparator);
153 if (!map_.size())
156 uptr idx = InternalBinarySearch(map_, 0, map_.size(), pair,
158 if (idx > map_.size())
160 return map_[idx].desc->load();
|
| /external/v8/test/cctest/ |
| test-hashmap.cc | 47 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {}
52 map_.LookupOrInsert(reinterpret_cast<void*>(x), hash_(x));
60 map_.Remove(reinterpret_cast<void*>(x), hash_(x));
64 HashMap::Entry* p = map_.Lookup(reinterpret_cast<void*>(x), hash_(x));
72 map_.Clear();
77 for (HashMap::Entry* p = map_.Start(); p != NULL; p = map_.Next(p)) {
80 CHECK_EQ(map_.occupancy(), static_cast<double>(count));
86 HashMap map_; member in class:IntSet
|
| /external/jsoncpp/src/lib_json/ |
| json_value.cpp | 247 value_.map_ = new ObjectValues();
254 value_.map_ = mapAllocator()->newMap();
352 value_.map_ = new ObjectValues(*other.value_.map_);
359 value_.map_ = mapAllocator()->newMapCopy(*other.value_.map_);
390 delete value_.map_;
397 mapAllocator()->destructMap(value_.map_);
457 int delta = int(value_.map_->size() - other.value_.map_->size())
[all...] |
