atermpp::unordered_map

Include file:

#include "mcrl2/atermpp/standard_containers/unordered_map.h

class atermpp::unordered_map

A unordered_map class in which aterms can be stored.

Protected types

type atermpp::unordered_map::container_wrapper

typedef for detail::generic_aterm_container< std::unordered_map< detail::reference_aterm< Key >, detail::reference_aterm< T >, Hash, Pred, Alloc > >

type atermpp::unordered_map::super

typedef for std::unordered_map< detail::reference_aterm< Key >, detail::reference_aterm< T >, Hash, Pred, Alloc >

Public types

type atermpp::unordered_map::allocator_type

typedef for super::allocator_type

Standard typedefs.

type atermpp::unordered_map::const_iterator

typedef for super::const_iterator

type atermpp::unordered_map::insert_return_type

typedef for super::insert_return_type

type atermpp::unordered_map::iterator

typedef for super::iterator

type atermpp::unordered_map::node_type

typedef for super::node_type

type atermpp::unordered_map::reference

typedef for super::reference

type atermpp::unordered_map::size_type

typedef for super::size_type

type atermpp::unordered_map::value_type

typedef for super::value_type

Public member functions

void clear() noexcept

std::pair<iterator, bool> emplace(Args&&... args)

iterator emplace_hint(const_iterator hint, Args&&... args)

iterator erase(iterator pos)

iterator erase(const_iterator pos)

iterator erase(const_iterator first, const_iterator last)

size_type erase(const Key &key)

node_type extract(const_iterator position)

node_type extract(const Key &k)

std::pair<iterator, bool> insert(const value_type &value)

Inserts an element referring to a default value in the map.

std::pair<iterator, bool> insert(P &&value)

iterator insert(const_iterator hint, const value_type &value)

iterator insert(const_iterator hint, P &&value)

void insert(InputIt first, InputIt last)

void insert(std::initializer_list<value_type> ilist)

insert_return_type insert(node_type &&nh)

iterator insert(const_iterator hint, node_type &&nh)

std::pair<iterator, bool> insert_or_assign(const Key &k, M &&obj)

std::pair<iterator, bool> insert_or_assign(Key &&k, M &&obj)

iterator insert_or_assign(const_iterator hint, const Key &k, M &&obj)

iterator insert_or_assign(const_iterator hint, Key &&k, M &&obj)

void merge(std::unordered_map<Key, T, H2, P2, allocator_type> &source)

void merge(std::unordered_map<Key, T, H2, P2, allocator_type> &&source)

void merge(std::unordered_multimap<Key, T, H2, P2, allocator_type> &source)

void merge(std::unordered_multimap<Key, T, H2, P2, allocator_type> &&source)

unordered_map &operator=(const unordered_map &other) = default

Standard assignment.

unordered_map &operator=(unordered_map &&other) = default

Standard move assignment.

std::size_t size() const override

void swap(unordered_map &other)

std::pair<iterator, bool> try_emplace(const Key &k, Args&&... args)

std::pair<iterator, bool> try_emplace(Key &&k, Args&&... args)

iterator try_emplace(const_iterator hint, const Key &k, Args&&... args)

iterator try_emplace(const_iterator hint, Key &&k, Args&&... args)

unordered_map()

Default constructor.

unordered_map(const allocator_type &alloc)

Constructor.

unordered_map(size_type n, const allocator_type &alloc = allocator_type())

Constructor.

unordered_map(size_type n, const value_type &val, const allocator_type &alloc = allocator_type())

unordered_map(InputIterator first, InputIterator last, const allocator_type &alloc = allocator_type())

Constructor.

unordered_map(const unordered_map &x)

Constructor.

unordered_map(const unordered_map &x, const allocator_type &alloc)

Constructor.

unordered_map(unordered_map &&x)

Constructor.

unordered_map(unordered_map &&x, const allocator_type &alloc)

Constructor.

unordered_map(std::initializer_list<value_type> il, const allocator_type &alloc = allocator_type())

Constructor. To be done later….

~unordered_map() = default

Standard destructor.