| /external/chromium/chrome/browser/policy/ |
| policy_map.cc | 21 PolicyMapType::const_iterator entry = map_.find(policy);
22 return entry == map_.end() ? NULL : entry->second;
26 std::swap(map_[policy], value);
31 const const_iterator entry = map_.find(policy);
32 if (entry != map_.end()) {
34 map_.erase(entry->first);
39 map_.swap(other->map_);
43 return other.map_.size() == map_.size() &
[all...] |
| /external/chromium/chrome/common/extensions/ |
| extension_icon_set.cc | 14 map_.clear();
19 map_[size] = path;
26 IconMap::const_iterator result = map_.find(size);
27 return result == map_.end() ? std::string() : result->second;
29 IconMap::const_reverse_iterator result = map_.rend();
30 for (IconMap::const_reverse_iterator iter = map_.rbegin();
31 iter != map_.rend(); ++iter) {
37 return result == map_.rend() ? std::string() : result->second;
40 IconMap::const_iterator result = map_.end();
41 for (IconMap::const_iterator iter = map_.begin(); iter != map_.end()
[all...] |
| extension_icon_set.h | 20 const IconMap& map() const { return map_; }
42 IconMap map_; member in class:ExtensionIconSet
|
| /external/webrtc/src/system_wrappers/source/ |
| map.cc | 44 MapWrapper::MapWrapper() : map_()
50 if (!map_.empty())
65 return (int)map_.size();
70 map_[id] = new MapItem(id,ptr);
76 std::map<int, MapItem*>::const_iterator it = map_.begin();
77 if (it != map_.end())
86 std::map<int, MapItem*>::const_reverse_iterator it = map_.rbegin();
87 if (it != map_.rend())
100 std::map<int, MapItem*>::const_iterator it = map_.find(item->item_id_);
101 if (it != map_.end()
[all...] |
| /external/chromium_org/chrome/common/extensions/ |
| extension_icon_set.cc | 14 map_.clear();
19 map_[size] = path;
26 IconMap::const_iterator result = map_.find(size);
27 return result == map_.end() ? std::string() : result->second;
29 IconMap::const_reverse_iterator result = map_.rend();
30 for (IconMap::const_reverse_iterator iter = map_.rbegin();
31 iter != map_.rend(); ++iter) {
37 return result == map_.rend() ? std::string() : result->second;
40 IconMap::const_iterator result = map_.end();
41 for (IconMap::const_iterator iter = map_.begin(); iter != map_.end()
[all...] |
| extension_icon_set.h | 28 const IconMap& map() const { return map_; }
29 bool empty() const { return map_.empty(); }
49 IconMap map_; member in class:ExtensionIconSet
|
| /art/runtime/ |
| safe_map.h | 42 map_ = rhs.map_;
46 iterator begin() { return map_.begin(); }
47 const_iterator begin() const { return map_.begin(); }
48 iterator end() { return map_.end(); }
49 const_iterator end() const { return map_.end(); }
51 bool empty() const { return map_.empty(); }
52 size_type size() const { return map_.size(); }
54 void clear() { map_.clear(); }
55 void erase(iterator it) { map_.erase(it);
92 ::std::map<K, V, Comparator, Allocator> map_; member in class:art::SafeMap
[all...] |
| /external/chromium_org/net/base/ |
| linked_hash_map.h | 45 linked_hash_map() : map_(), list_() {
84 map_.clear();
96 typename MapType::iterator found = map_.find(key);
97 if (found == map_.end()) return 0;
100 map_.erase(found);
109 typename MapType::iterator found = map_.find(position->first);
114 map_.erase(found);
128 typename MapType::iterator found = map_.find(key);
129 if (found == map_.end()) {
136 typename MapType::const_iterator found = map_.find(key)
204 MapType map_; member in class:linked_hash_map
[all...] |
| /external/chromium_org/chrome/test/webdriver/ |
| webdriver_session_manager.cc | 13 map_[session->id()] = session;
18 return map_.find(id) != map_.end();
24 it = map_.find(id);
25 if (it == map_.end())
27 map_.erase(it);
34 it = map_.find(id);
35 if (it == map_.end())
|
| /external/chromium_org/chrome/browser/extensions/ |
| app_icon_loader_impl.cc | 43 STLDeleteContainerPairFirstPointers(map_.begin(), map_.end());
47 for (ImageToExtensionIDMap::const_iterator i = map_.begin();
48 i != map_.end(); ++i) {
64 // |map_| takes ownership of |image|.
65 map_[image] = id;
74 for (ImageToExtensionIDMap::iterator i = map_.begin();
75 i != map_.end(); ++i) {
78 map_.erase(i);
85 for (ImageToExtensionIDMap::iterator i = map_.begin()
[all...] |
| /external/chromium/net/disk_cache/ |
| bitmap.cc | 47 map_ = new uint32[array_size_];
55 : map_(map),
65 delete [] map_;
69 DCHECK(alloc_ || !map_);
78 memcpy(new_map, map_,
79 sizeof(*map_) * std::min(array_size_, old_array_size));
81 delete[] map_; // No need to check for NULL.
82 map_ = new_map;
98 map_[j] |= (1 << i);
100 map_[j] &= ~(1 << i)
[all...] |
| bitmap.h | 16 Bitmap() : map_(NULL), num_bits_(0), array_size_(0), alloc_(false) {}
44 memset(map_, (value ? 0xFF : 0x00), array_size_ * sizeof(*map_));
68 const uint32* GetMap() const { return map_; }
126 uint32* map_; // The bitmap. member in class:disk_cache::Bitmap
|
| /external/chromium_org/net/disk_cache/ |
| bitmap.cc | 47 map_ = new uint32[array_size_];
55 : map_(map),
65 delete [] map_;
69 DCHECK(alloc_ || !map_);
78 memcpy(new_map, map_,
79 sizeof(*map_) * std::min(array_size_, old_array_size));
81 delete[] map_; // No need to check for NULL.
82 map_ = new_map;
98 map_[j] |= (1 << i);
100 map_[j] &= ~(1 << i)
[all...] |
| bitmap.h | 16 Bitmap() : map_(NULL), num_bits_(0), array_size_(0), alloc_(false) {}
44 memset(map_, (value ? 0xFF : 0x00), array_size_ * sizeof(*map_));
68 const uint32* GetMap() const { return map_; }
126 uint32* map_; // The bitmap. member in class:disk_cache::Bitmap
|
| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
| mount_node_dir.cc | 22 for (MountNodeMap_t::iterator it = map_.begin(); it != map_.end(); ++it) {
61 size_t max = map_.size() * sizeof(struct dirent);
88 MountNodeMap_t::iterator it = map_.find(name);
89 if (it != map_.end())
93 map_[name] = node;
100 MountNodeMap_t::iterator it = map_.find(name);
101 if (it != map_.end()) {
103 map_.erase(it);
115 MountNodeMap_t::iterator it = map_.find(name)
[all...] |
| /external/chromium/base/ |
| id_map.h | 120 : map_(map),
121 iter_(map_->data_.begin()) {
123 ++map_->iteration_depth_;
128 DCHECK(map_->CalledOnValidThread());
129 if (--map_->iteration_depth_ == 0)
130 map_->Compact();
134 DCHECK(map_->CalledOnValidThread());
135 return iter_ == map_->data_.end();
139 DCHECK(map_->CalledOnValidThread());
144 DCHECK(map_->CalledOnValidThread())
163 IDMap<T, OS>* map_; member in class:IDMap::Iterator
[all...] |
| /external/chromium_org/content/renderer/dom_storage/ |
| dom_storage_cached_area.cc | 28 return map_->Length();
34 return map_->Key(index);
41 return map_->GetItem(key);
55 if (!map_->SetItem(key, value, &unused))
72 if (!map_->RemoveItem(key, &unused))
86 map_ = new DOMStorageMap(kPerStorageAreaQuota);
99 if (!map_.get() || ignore_all_mutations_)
104 scoped_refptr<DOMStorageMap> old = map_;
105 map_ = new DOMStorageMap(kPerStorageAreaQuota);
115 map_->SetItem(iter->first, value.string(), &unused)
[all...] |
| /external/chromium_org/base/ |
| id_map.h | 136 : map_(map),
137 iter_(map_->data_.begin()) {
142 : map_(iter.map_),
148 map_ = iter.map;
155 DCHECK(map_->CalledOnValidThread());
159 DCHECK_LT(0, map_->iteration_depth_);
161 if (--map_->iteration_depth_ == 0)
162 map_->Compact();
166 DCHECK(map_->CalledOnValidThread())
201 IDMap<T, OS>* map_; member in class:IDMap::Iterator
[all...] |
| /external/chromium_org/chrome/browser/policy/ |
| policy_map.cc | 38 PolicyMapType::const_iterator entry = map_.find(policy);
39 return entry == map_.end() ? NULL : &entry->second;
43 PolicyMapType::const_iterator entry = map_.find(policy);
44 return entry == map_.end() ? NULL : entry->second.value;
52 Entry& entry = map_[policy];
62 PolicyMapType::iterator it = map_.find(policy);
63 if (it != map_.end()) {
66 map_.erase(it);
71 map_.swap(other->map_);
[all...] |
| /external/chromium_org/content/browser/dom_storage/ |
| dom_storage_area.cc | 64 map_(new DOMStorageMap(kPerStorageAreaQuota +
86 map_(new DOMStorageMap(kPerStorageAreaQuota +
107 map_->ExtractValues(map);
114 return map_->Length();
121 return map_->Key(index);
128 return map_->GetItem(key);
137 if (!map_->HasOneRef())
138 map_ = map_->DeepCopy();
139 bool success = map_->SetItem(key, value, old_value)
[all...] |
| /external/chromium_org/ui/gfx/image/ |
| image_family.cc | 30 map_[MapKey(1.0f, 0)] = image;
34 map_[MapKey(aspect, size.width())] = image;
43 if (map_.empty())
71 map_.lower_bound(MapKey(desired_aspect, 0));
73 if (greater_or_equal != map_.end() &&
81 if (greater_or_equal != map_.begin()) {
88 if (greater_or_equal != map_.end()) {
97 DCHECK(greater_or_equal != map_.end());
112 map_.lower_bound(MapKey(aspect, width));
113 if (greater_or_equal != map_.end() &
[all...] |
| image_family.h | 94 const_iterator begin() const { return const_iterator(map_.begin()); }
96 const_iterator end() const { return const_iterator(map_.end()); }
99 bool empty() const { return map_.empty(); }
102 void clear() { return map_.clear(); }
143 // |map_| must not be empty. |desired_aspect| must be > 0.0.
150 // |map_| of aspect ratio |aspect|.
154 std::map<MapKey, gfx::Image> map_; member in class:gfx::ImageFamily
|
| /external/chromium_org/v8/src/ |
| hashmap.h | 103 Entry* map_; member in class:v8::internal::TemplateHashMapImpl
107 Entry* map_end() const { return map_ + capacity_; }
125 AllocationPolicy::Delete(map_);
193 q = map_;
204 Entry* r = map_ + (q->hash & (capacity_ - 1));
227 for (Entry* p = map_; p < end; p++) {
237 return Next(map_ - 1);
245 ASSERT(map_ - 1 <= p && p < end);
261 Entry* p = map_ + (hash & (capacity_ - 1));
263 ASSERT(map_ <= p && p < end)
340 const TemplateHashMapImpl<AllocationPolicy>* map_; member in class:v8::TemplateHashMap::Iterator
[all...] |
| /external/v8/src/ |
| hashmap.h | 92 Entry* map_; member in class:v8::internal::TemplateHashMapImpl
96 Entry* map_end() const { return map_ + capacity_; }
114 P::Delete(map_);
179 q = map_;
190 Entry* r = map_ + (q->hash & (capacity_ - 1));
212 for (Entry* p = map_; p < end; p++) {
221 return Next(map_ - 1);
229 ASSERT(map_ - 1 <= p && p < end);
245 Entry* p = map_ + (hash & (capacity_ - 1));
247 ASSERT(map_ <= p && p < end)
321 const TemplateHashMapImpl<AllocationPolicy>* map_; member in class:v8::TemplateHashMap::Iterator
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-hashmap.cc | 46 explicit IntSet(IntKeyHash hash) : hash_(hash), map_(DefaultMatchFun) {}
50 HashMap::Entry* p = map_.Lookup(reinterpret_cast<void*>(x), hash_(x), true);
58 map_.Remove(reinterpret_cast<void*>(x), hash_(x));
63 map_.Lookup(reinterpret_cast<void*>(x), hash_(x), false);
71 map_.Clear();
76 for (HashMap::Entry* p = map_.Start(); p != NULL; p = map_.Next(p)) {
79 CHECK_EQ(map_.occupancy(), static_cast<double>(count));
85 HashMap map_; member in class:IntSet
|
