8#ifndef META_OCEAN_BASE_HASH_SET_H
9#define META_OCEAN_BASE_HASH_SET_H
31 using Element =
typename std::pair<std::pair<size_t, size_t>, T>;
71 bool insert(
const T& element,
const bool oneOnly =
true,
const bool extendCapacity =
true);
80 bool insert(T&& element,
const bool oneOnly =
true,
const bool extendCapacity =
true);
87 bool remove(
const T& element);
94 bool find(
const T& element)
const;
105 inline size_t size()
const;
179 size_(hashSet.size_),
200 ocean_assert(
capacity >= hashSet.size());
202 for (
Element& hashSetElement : hashSet.elements_)
204 if (hashSetElement.first.first != 0)
206 T& element = hashSetElement.second;
209 insert(std::move(element),
false ,
false );
213 ocean_assert(
size() == hashSet.size());
240 for (
size_t n = 0; n <
elements_.size(); ++n)
254 else if (
elements_[value].second == element)
257 const size_t startIndex =
function_(element);
259 for (
size_t i = 0; i < n; ++i)
275 for (
size_t n = 0; n <
elements_.size(); ++n)
296 ocean_assert(
false &&
"This must never happen!");
321 for (
size_t n = 0; n <
elements_.size(); ++n)
330 elements_[value].second = std::move(element);
335 else if (
elements_[value].second == element)
338 const size_t startIndex =
function_(element);
340 for (
size_t i = 0; i < n; ++i)
356 for (
size_t n = 0; n <
elements_.size(); ++n)
365 elements_[value].second = std::move(element);
377 ocean_assert(
false &&
"This must never happen!");
388 for (
size_t n = 0; n <
elements_.size(); ++n)
404 const size_t startIndex =
function_(element);
406 for (
size_t i = 0; i < n; ++i)
424 ocean_assert(
elements_[value].first.first > 1);
426 size_t elementOffset = 0u;
432 size_t localValue = value;
437 size_t lastOffset = 0;
440 for (
size_t i = 1; i < endLocation; ++i)
442 const size_t testValue = (localValue + i) %
elements_.size();
444 if (
elements_[testValue].first.first >= 1)
446 if (
elements_[testValue].first.second >= i)
452 if (
elements_[testValue].first.first <= 1)
463 ocean_assert(endLocation >= lastOffset);
464 endLocation -= lastOffset;
466 elementOffset += lastOffset;
468 const size_t lastValue = (localValue + lastOffset) %
elements_.size();
476 localValue = lastValue;
478 if (
elements_[lastValue].first.first == 1)
485 const size_t startIndex =
function_(element);
487 for (
size_t i = 0u; i < elementOffset + n; ++i)
500 ocean_assert(
false &&
"This must never happen!");
511 for (
size_t n = 0; n <
elements_.size(); ++n)
544 element.first.first = 0;
573 if (
this != &hashSet)
586 if (
this != &hashSet)
588 elements_ = std::move(hashSet.elements_);
589 size_ = hashSet.size_;
610 size_t slotCounters = 0;
611 size_t probeSequenceLengths = 0;
615 slotCounters += element.first.first;
617 if (element.first.first != 0)
620 probeSequenceLengths += element.first.second + 1;
624 return count ==
size_ && slotCounters == probeSequenceLengths;
Elements elements_
Hash set elements.
Definition HashSet.h:158
bool remove(const T &element)
Removes an element from this hash set.
Definition HashSet.h:382
size_t capacity() const
Returns the capacity of this hash set.
Definition HashSet.h:559
std::vector< Element > Elements
Definition of a vector holding the set objects.
Definition HashSet.h:36
static size_t defaultHashFunction(const T &element)
Default hash function for elements supporting an cast size_t cast.
Definition HashSet.h:599
void clear()
Removes all elements from this has set.
Definition HashSet.h:538
HashSet(const HashSet< T > &hashSet)
Copy constructor.
Definition HashSet.h:168
size_t size_
Number of elements this has set holds.
Definition HashSet.h:161
ValueFunction function_
Value function.
Definition HashSet.h:164
HashSet< T > & operator=(const HashSet< T > &hashSet)
Assign operator.
Definition HashSet.h:571
size_t size() const
Returns the number of elements this hash set currently holds.
Definition HashSet.h:553
bool isEmpty() const
Returns whether this hash set is empty.
Definition HashSet.h:565
bool insert(const T &element, const bool oneOnly=true, const bool extendCapacity=true)
Adds a new element to this hash set.
Definition HashSet.h:220
typename std::pair< std::pair< size_t, size_t >, T > Element
Definition of a pair combining a counter states and an object.
Definition HashSet.h:31
size_t(*)(const T &element) ValueFunction
Definition of a function pointer returning a hash set value.
Definition HashSet.h:41
bool find(const T &element) const
Returns whether this hash set holds a given element.
Definition HashSet.h:505
bool isConsistent() const
Returns whether this hash set is still consistent.
Definition HashSet.h:605
The namespace covering the entire Ocean framework.
Definition Accessor.h:15