Searched refs:mapOfSet (Results 1 – 2 of 2) sorted by relevance
| /frameworks/av/media/module/bufferpool/1.0/ |
| D | AccessorImpl.cpp | 93 bool insert(std::map<T, std::set<U>> *mapOfSet, T key, U value) { in insert() argument
94 auto iter = mapOfSet->find(key); in insert()
95 if (iter == mapOfSet->end()) { in insert()
97 mapOfSet->insert(std::make_pair(key, valueSet)); in insert()
107 bool erase(std::map<T, std::set<U>> *mapOfSet, T key, U value) { in erase() argument
109 auto iter = mapOfSet->find(key); in erase()
110 if (iter != mapOfSet->end()) { in erase()
115 mapOfSet->erase(iter); in erase()
122 bool contains(std::map<T, std::set<U>> *mapOfSet, T key, U value) { in contains() argument
123 auto iter = mapOfSet->find(key); in contains()
[all …]
|
| /frameworks/av/media/module/bufferpool/2.0/ |
| D | AccessorImpl.cpp | 107 bool insert(std::map<T, std::set<U>> *mapOfSet, T key, U value) { in insert() argument
108 auto iter = mapOfSet->find(key); in insert()
109 if (iter == mapOfSet->end()) { in insert()
111 mapOfSet->insert(std::make_pair(key, valueSet)); in insert()
121 bool erase(std::map<T, std::set<U>> *mapOfSet, T key, U value) { in erase() argument
123 auto iter = mapOfSet->find(key); in erase()
124 if (iter != mapOfSet->end()) { in erase()
129 mapOfSet->erase(iter); in erase()
136 bool contains(std::map<T, std::set<U>> *mapOfSet, T key, U value) { in contains() argument
137 auto iter = mapOfSet->find(key); in contains()
[all …]
|