BruteSet.h

Go to the documentation of this file.

 
#ifndef PBAT_COMMON_BRUTESET_H
#define PBAT_COMMON_BRUTESET_H
 
#include <cassert>
#include <utility>
 
namespace pbat::common {

template <class T, auto kCapacity = 32>
class BruteSet
{
  public:
    BruteSet() : size(0) {}
    T* begin() { return set; }
    T* end() { return set + size; }
    T const* begin() const { return set; }
    T const* end() const { return set + size; }
    bool Insert(T const& value)
    {
        assert(size < kCapacity);
        if (not Contains(value))
        {
            set[size++] = value;
            return true;
        }
        return false;
    }

    bool Contains(T const& value) const
    {
        for (int i = 0; i < size; ++i)
            if (set[i] == value)
                return true;
        return false;
    }

    bool Remove(T const& value)
    {
        for (int i = 0; i < size; ++i)
        {
            if (set[i] == value)
            {
                set[i] = set[--size];
                return true;
            }
        }
        return false;
    }

    int Size() const { return size; }
    bool IsFull() const { return size == kCapacity; }
    bool IsEmpty() const { return size == 0; }
    void Clear() { size = 0; }
 
  private:
    T set[kCapacity];
    int size;
};
 
} // namespace pbat::common
 
#endif // PBAT_COMMON_BRUTESET_H