atermpp::utilities::unordered_map¶

Include file:

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

class atermpp::utilities::unordered_map¶: A unordered_map class in which aterms can be stored.

Protected types¶

type atermpp::utilities::unordered_map::container_wrapper¶: typedef for detail::generic_aterm_container< mcrl2::utilities::unordered_map< detail::reference_aterm< Key >, detail::reference_aterm< T >, Hash, Pred, Alloc, ThreadSafe, false > >

type atermpp::utilities::unordered_map::super¶: typedef for mcrl2::utilities::unordered_map< detail::reference_aterm< Key >, detail::reference_aterm< T >, Hash, Pred, Alloc, ThreadSafe, false >

Public types¶

type atermpp::utilities::unordered_map::allocator_type¶

typedef for super::allocator_type

Standard typedefs.

type atermpp::utilities::unordered_map::const_iterator¶: typedef for super::const_iterator

type atermpp::utilities::unordered_map::iterator¶: typedef for super::iterator

type atermpp::utilities::unordered_map::reference¶: typedef for super::reference

type atermpp::utilities::unordered_map::size_type¶: typedef for super::size_type

type atermpp::utilities::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)

size_type erase(const Key &key)

iterator erase(const_iterator first, const_iterator last)

iterator erase(const_iterator pos)

iterator erase(iterator pos)

iterator find(const Args&... args)¶

Standard find function in a map.

Returns: Element with the specified key.

const_iterator find(const Args&... args) const¶

Standard find function in a map.

Returns: Element with the specified key.

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

iterator insert(const_iterator hint, P &&value)

iterator insert(const_iterator hint, value_type &&value)¶

void insert(InputIt first, InputIt last)

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

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

std::pair<iterator, bool> insert_or_assign(const 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)

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

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)

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

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

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

unordered_map(): Default constructor.

unordered_map(const allocator_type &alloc): Constructor.

unordered_map(const unordered_map &x): Constructor.

unordered_map(const unordered_map &x, const allocator_type &alloc): Constructor.

unordered_map(InputIterator first, InputIterator last, const allocator_type &alloc = allocator_type()): 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(std::initializer_list<value_type> il, const allocator_type &alloc = allocator_type()): Constructor. To be done later….

unordered_map(unordered_map &&x): Constructor.

unordered_map(unordered_map &&x, const allocator_type &alloc): Constructor.

~unordered_map() = default: Standard destructor.

Protected member functions¶

void rehash(std::size_t)¶: Function below is implemented in a .cpp file.

void rehash_if_needed()¶