RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://en.cppreference.com/w/cpp/algorithm/../../cpp/experimental/lib_extensions/pmr_container.html below:

Convenience aliases for containers using polymorphic allocators (library fundamentals TS)

The following convenience aliases and alias templates for containers using polymorphic allocators are defined in the std::experimental::pmr namespace.

[edit] Strings Alias/alias template Alias for template<class CharT, class Traits=std::char_traits<CharT>> using basic_string = std::basic_string<CharT, Traits, polymorphic_allocator<CharT>>; using string = pmr::basic_string<char>; using wstring = pmr::basic_string<wchar_t>; using u16string = pmr::basic_string<char16_t>; using u32string = pmr::basic_string<char32_t>; [edit] Sequence containers Alias template Alias for template<class T> using vector = std::vector<T, polymorphic_allocator<T>>; template<class T> using deque = std::deque<T, polymorphic_allocator<T>>; template<class T> using forward_list = std::forward_list<T, polymorphic_allocator<T>>; template<class T> using list = std::list<T, polymorphic_allocator<T>>; [edit] Associative containers Alias template Alias for template<class Key, class T, class Compare=std::less<Key>> using map = std::map<Key, T, Compare, polymorphic_allocator<std::pair<const Key, T>>>; template<class Key, class T, class Compare=std::less<Key>> using multimap = std::multimap<Key, T, Compare, polymorphic_allocator<std::pair<const Key, T>>>; template<class Key, class Compare=std::less<Key>> using set = std::set<Key, Compare, polymorphic_allocator<Key>>; template<class Key, class Compare=std::less<Key>> using multiset = std::multiset<Key, Compare, polymorphic_allocator<Key>>; [edit] Unordered associative containers Alias template Alias for template<class Key, class T, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>> using unordered_map = std::unordered_map<Key, T, Hash, Pred, polymorphic_allocator<std::pair<const Key, T>>>; template<class Key, class T, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>> using unordered_multimap = std::unordered_multimap<Key, T, Hash, Pred, polymorphic_allocator<std::pair<const Key, T>>>; template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>> using unordered_set = std::unordered_set<Key, Hash, Pred, polymorphic_allocator<Key>>; template<class Key, class Hash = std::hash<Key>, class Pred = std::equal_to<Key>> using unordered_multiset = std::unordered_multiset<Key, Hash, Pred, polymorphic_allocator<Key>>; [edit] match_results Alias/alias template Alias for template<class BidirIt> using match_results = std::match_results<BidirIt, polymorphic_allocator<std::sub_match<BidirIt>>>; using cmatch = pmr::match_results<const char*>; using wcmatch = pmr::match_results<const wchar_t*>; using smatch = pmr::match_results<pmr::string::const_iterator>; using wsmatch = pmr::match_results<pmr::wstring::const_iterator>;

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4