Lines Matching defs:std
55 static std::true_type test(typename C::key_type*);
57 static std::false_type test(...);
71 typename std::enable_if<!internal::HasKeyType<Collection>::value,
74 return std::find(std::begin(collection), std::end(collection), value) !=
75 std::end(collection);
83 return std::adjacent_find(cont.rbegin(), cont.rend(),
84 std::less<typename Container::value_type>()) ==
94 std::set_difference(a1.begin(), a1.end(), a2.begin(), a2.end(),
95 std::inserter(difference, difference.end()));
105 std::set_union(a1.begin(), a1.end(), a2.begin(), a2.end(),
106 std::inserter(result, result.end()));
117 std::set_intersection(a1.begin(), a1.end(), a2.begin(), a2.end(),
118 std::inserter(result, result.end()));
128 return std::includes(a1.begin(), a1.end(), a2.begin(), a2.end());
138 // Note: there is no std::erase for standard associative containers so we don't
142 void Erase(std::basic_string<CharT, Traits, Allocator>& container,
144 container.erase(std::remove(container.begin(), container.end(), value),
149 void EraseIf(std::basic_string<CharT, Traits, Allocator>& container,
151 container.erase(std::remove_if(container.begin(), container.end(), pred),
156 void Erase(std::deque<T, Allocator>& container, const Value& value) {
157 container.erase(std::remove(container.begin(), container.end(), value),
162 void EraseIf(std::deque<T, Allocator>& container, Predicate pred) {
163 container.erase(std::remove_if(container.begin(), container.end(), pred),
168 void Erase(std::vector<T, Allocator>& container, const Value& value) {
169 container.erase(std::remove(container.begin(), container.end(), value),
174 void EraseIf(std::vector<T, Allocator>& container, Predicate pred) {
175 container.erase(std::remove_if(container.begin(), container.end(), pred),
180 void Erase(std::forward_list<T, Allocator>& container, const Value& value) {
181 // Unlike std::forward_list::remove, this function template accepts
188 void EraseIf(std::forward_list<T, Allocator>& container, Predicate pred) {
193 void Erase(std::list<T, Allocator>& container, const Value& value) {
194 // Unlike std::list::remove, this function template accepts heterogeneous
201 void EraseIf(std::list<T, Allocator>& container, Predicate pred) {
206 void EraseIf(std::map<Key, T, Compare, Allocator>& container, Predicate pred) {
211 void EraseIf(std::multimap<Key, T, Compare, Allocator>& container,
217 void EraseIf(std::set<Key, Compare, Allocator>& container, Predicate pred) {
222 void EraseIf(std::multiset<Key, Compare, Allocator>& container,
233 void EraseIf(std::unordered_map<Key, T, Hash, KeyEqual, Allocator>& container,
245 std::unordered_multimap<Key, T, Hash, KeyEqual, Allocator>& container,
255 void EraseIf(std::unordered_set<Key, Hash, KeyEqual, Allocator>& container,
265 void EraseIf(std::unordered_multiset<Key, Hash, KeyEqual, Allocator>& container,