open_hash_index.hpp File Reference

#include "../spinlock.hpp"
#include <cstddef>
#include <cstdint>
#include <cstdlib>
#include <iterator>

Classes
struct	quickcpplib::_xxx::algorithm::open_hash_index::arithmetic_modulus< KeyType >
	Performs k % divisor which is up to 40 CPU cycles depending on architecture. More...
struct	quickcpplib::_xxx::algorithm::open_hash_index::twos_power_modulus< KeyType >
struct	quickcpplib::_xxx::algorithm::open_hash_index::linear_memory_policy< KeyType, T, LinearSearchLimit, KeyModulus, KeyCompare >
	The simplest possible open_hash_index memory policy, with just the key, value and a boolean marking if the item is in use. A linear scan is performed up to LinearSearchLimit either side of any collision. More...
struct	quickcpplib::_xxx::algorithm::open_hash_index::linear_memory_policy< KeyType, T, LinearSearchLimit, KeyModulus, KeyCompare >::value_type
struct	quickcpplib::_xxx::algorithm::open_hash_index::atomic_linear_memory_policy< KeyType, T, LinearSearchLimit, LockType, KeyModulus, KeyCompare >
	Like linear_memory_policy, but threadsafe for key finding, insertion and removal. More...
struct	quickcpplib::_xxx::algorithm::open_hash_index::atomic_linear_memory_policy< KeyType, T, LinearSearchLimit, LockType, KeyModulus, KeyCompare >::value_type
struct	quickcpplib::_xxx::algorithm::open_hash_index::atomic_linear_memory_policy< KeyType, T, LinearSearchLimit, LockType, KeyModulus, KeyCompare >::const_pointer
struct	quickcpplib::_xxx::algorithm::open_hash_index::atomic_linear_memory_policy< KeyType, T, LinearSearchLimit, LockType, KeyModulus, KeyCompare >::pointer
struct	quickcpplib::_xxx::algorithm::open_hash_index::atomic_linear_memory_policy< KeyType, T, LinearSearchLimit, LockType, KeyModulus, KeyCompare >::items_count_type
class	quickcpplib::_xxx::algorithm::open_hash_index::basic_open_hash_index< Policy, ContiguousContainerType, disable_existing_key_check >
class	quickcpplib::_xxx::algorithm::open_hash_index::basic_open_hash_index< Policy, ContiguousContainerType, disable_existing_key_check >::iterator_< is_const, Parent, Pointer, Reference >

Namespaces
namespace	quickcpplib
	The QuickCppLib namespace.
namespace	quickcpplib::_xxx
	Per commit unique namespace to prevent different git submodule versions clashing.
namespace	quickcpplib::_xxx::algorithm
namespace	quickcpplib::_xxx::algorithm::open_hash_index
namespace	quickcpplib::_xxx::algorithm::open_hash_index::detail

Functions
template<size_t limit, class Container , class U >
auto	quickcpplib::_xxx::algorithm::open_hash_index::detail::linear_find (Container &c, size_t hint, U &&pred) -> decltype(&c[0])
template<class T >
auto	quickcpplib::_xxx::algorithm::open_hash_index::detail::look_for_lock_shared (int) -> typename std::enable_if< std::is_same< decltype(std::declval< T >().lock_shared()), decltype(std::declval< T >().lock_shared())>::value, std::true_type >::type
template<class T >
std::false_type	quickcpplib::_xxx::algorithm::open_hash_index::detail::look_for_lock_shared (...)
template<class Policy , template< class > class ContiguousContainerType>
std::ostream &	quickcpplib::_xxx::algorithm::open_hash_index::operator<< (std::ostream &s, const basic_open_hash_index< Policy, ContiguousContainerType > &l)
	std::ostream writer for an index