tt::wfree_unordered_map< K, V, MAX_NR_ITEMS > Class Template Reference

#include <TTauri/Foundation/wfree_unordered_map.hpp>

Public Types
using	key_type = K
using	mapped_type = V

Public Member Functions
constexpr	wfree_unordered_map (wfree_unordered_map const &) noexcept=delete
constexpr	wfree_unordered_map (wfree_unordered_map &&) noexcept=delete
constexpr wfree_unordered_map &	operator= (wfree_unordered_map const &) noexcept=delete
constexpr wfree_unordered_map &	operator= (wfree_unordered_map &&) noexcept=delete
void	insert (K key, V value) noexcept
std::vector< K >	keys () const noexcept
V &	operator[] (K const &key) noexcept
std::optional< V >	get (K const &key) const noexcept
V	get (K const &key, V const &default_value) const noexcept
std::optional< V >	erase (K const &key) noexcept

Static Public Member Functions
static size_t	make_hash (K const &key) noexcept

Detailed Description

template<typename K, typename V, size_t MAX_NR_ITEMS>
class tt::wfree_unordered_map< K, V, MAX_NR_ITEMS >

Unordered map with wait-free insert, get and erase.

This class can be instantiated as a global variable without needing initialization.

---

The documentation for this class was generated from the following file:

• hikogui/src/TTauri/Foundation/wfree_unordered_map.hpp