Go to the documentation of this file.
32 template<
class T,
class Key,
class Hash>
39 template<
class T,
class Key,
class Hash>
48 template<
class T,
class Key,
class Hash>
65 template<
class T,
class Key,
class Hash>
82 template<
class T,
class Key,
class Hash>
89 return this->parent_type::set(key, ptr);
93 template<
class T,
class Key,
class Hash>
100 return this->set(key, aptr.
release());
104 template<
class T,
class Key,
class Hash>
111 return this->set(key, aptr.
release());
srcOptions insert("case", fileName(rootDirSource/caseDirSource))
bool set(const Key &key, T *ptr)
Assign a new entry, overwriting existing entries.
T * release() noexcept
Return pointer to the managed object and release ownership.
T * get() noexcept
Return pointer to managed object without nullptr checking.
bool insert(const Key &, T *)=delete
HashPtrTable()
Construct null with default table capacity.
A HashTable similar to std::unordered_map.
Pointer management similar to std::unique_ptr, with some additional methods and type checking.