set.hpp

Go to the documentation of this file.

 
#pragma once
 
#include <cstddef>
#include <initializer_list>
#include <unordered_set>
// #include <utility>
 
// template <typename T> using Value_type = typename T::value_type;
 
namespace py {
 
    template <typename Key> class set : public std::unordered_set<Key> {
        using Self = set<Key>;
        using Base = std::unordered_set<Key>;
 
      public:
        set() : Base{} {}
 
        template <typename FwdIter> set(const FwdIter& start, const FwdIter& stop)
            : Base(start, stop) {}
 
        set(std::initializer_list<Key> init) : Base{init} {}
 
        auto contains(const Key& key) const -> bool { return this->find(key) != this->end(); }
 
        auto copy() const -> set { return *this; }
 
        auto operator=(const set&) -> set& = delete;
 
        auto operator=(set&&) noexcept -> set& = default;
 
        set(set<Key>&&) noexcept = default;
 
        ~set() noexcept = default;
 
        // private:
        set(const set<Key>&) = default;
    };
 
    template <typename Key> inline auto operator<(const Key& key, const set<Key>& m) -> bool {
        return m.contains(key);
    }
 
    template <typename Key> inline auto len(const set<Key>& m) noexcept -> size_t {
        return m.size();
    }
 
    // template <typename Key>
    // set(std::initializer_list<Key>) -> set<Key>;
 
    // template <typename Key>
    // set(std::initializer_list<const char*> ) -> set<std::string>;
}  // namespace py