src/tint/utils/containers/enum_set.h - dawn - Git at Google

 // Copyright 2021 The Dawn & Tint Authors
 //
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are met:
 //
 // 1. Redistributions of source code must retain the above copyright notice, this
 //    list of conditions and the following disclaimer.
 //
 // 2. Redistributions in binary form must reproduce the above copyright notice,
 //    this list of conditions and the following disclaimer in the documentation
 //    and/or other materials provided with the distribution.
 //
 // 3. Neither the name of the copyright holder nor the names of its
 //    contributors may be used to endorse or promote products derived from
 //    this software without specific prior written permission.
 //
 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 // DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
 // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
 // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
 // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 // OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

 #ifndef SRC_TINT_UTILS_CONTAINERS_ENUM_SET_H_
 #define SRC_TINT_UTILS_CONTAINERS_ENUM_SET_H_

 #include <cstdint>
 #include <functional>
 #include <type_traits>
 #include <utility>

 #include "src/tint/utils/math/hash.h"
 #include "src/tint/utils/traits/traits.h"

 namespace tint {

 /// EnumSet is a set of enum values.
 /// @note As the EnumSet is backed by a single uint64_t value, it can only hold
 /// enum values in the range [0 .. 63].
 template <typename ENUM>
 struct EnumSet {
   public:
     /// Enum is the enum type this EnumSet wraps
     using Enum = ENUM;

     /// Constructor. Initializes the EnumSet with zero.
     constexpr EnumSet() = default;

     /// Copy constructor.
     /// @param s the EnumSet to copy
     constexpr EnumSet(const EnumSet& s) = default;

     /// Constructor. Initializes the EnumSet with the given values.
     /// @param values the enumerator values to construct the EnumSet with
     template <typename... VALUES>
     explicit constexpr EnumSet(VALUES... values) : set(Union(values...)) {}

     /// Copy assignment operator.
     /// @param set the EnumSet to assign to this set
     /// @returns this EnumSet so calls can be chained
     inline EnumSet& operator=(const EnumSet& set) = default;

     /// Copy assignment operator.
     /// @param e the enum value
     /// @returns this EnumSet so calls can be chained
     inline EnumSet& operator=(Enum e) { return *this = EnumSet{e}; }

     /// Adds all the given values to this set
     /// @param values the values to add
     /// @returns this EnumSet so calls can be chained
     template <typename... VALUES>
     inline EnumSet& Add(VALUES... values) {
         return Add(EnumSet(std::forward<VALUES>(values)...));
     }

     /// Removes all the given values from this set
     /// @param values the values to remove
     /// @returns this EnumSet so calls can be chained
     template <typename... VALUES>
     inline EnumSet& Remove(VALUES... values) {
         return Remove(EnumSet(std::forward<VALUES>(values)...));
     }

     /// Adds all of @p s to this set
     /// @param s the enum value
     /// @returns this EnumSet so calls can be chained
     inline EnumSet& Add(EnumSet s) { return (*this = *this + s); }

     /// Removes all of @p s from this set
     /// @param s the enum value
     /// @returns this EnumSet so calls can be chained
     inline EnumSet& Remove(EnumSet s) { return (*this = *this - s); }

     /// Adds or removes @p e to the set
     /// @param e the enum value
     /// @param add if true the enum value is added, otherwise removed
     /// @returns this EnumSet so calls can be chained
     inline EnumSet& Set(Enum e, bool add = true) { return add ? Add(e) : Remove(e); }

     /// @param e the enum value
     /// @returns a copy of this EnumSet with @p e added
     inline EnumSet operator+(Enum e) const {
         EnumSet out;
         out.set = set | Bit(e);
         return out;
     }

     /// @param e the enum value
     /// @returns a copy of this EnumSet with @p e removed
     inline EnumSet operator-(Enum e) const {
         EnumSet out;
         out.set = set & ~Bit(e);
         return out;
     }

     /// @param s the other set
     /// @returns the union of this EnumSet with @p s (`this` ∪ @p s)
     inline EnumSet operator+(EnumSet s) const {
         EnumSet out;
         out.set = set | s.set;
         return out;
     }

     /// @param s the other set
     /// @returns the set of entries found in this but not in s (`this` \ @p s)
     inline EnumSet operator-(EnumSet s) const {
         EnumSet out;
         out.set = set & ~s.set;
         return out;
     }

     /// @param s the other set
     /// @returns the intersection of this EnumSet with s (`this` ∩ @p s)
     inline EnumSet operator&(EnumSet s) const {
         EnumSet out;
         out.set = set & s.set;
         return out;
     }

     /// @param e the enum value
     /// @return true if the set contains @p e
     inline bool Contains(Enum e) const { return (set & Bit(e)) != 0; }

     /// @return true if the set is empty
     inline bool Empty() const { return set == 0; }

     /// @returns number of enums currently in the set
     /// This is an O(N) operation, where N can be upto 64
     inline size_t Size() const {
         size_t result = 0;
         uint64_t bits = set;
         while (bits) {
             result += bits & 1;
             bits >>= 1;
         }
         return result;
     }

     /// @return the hash value of this object
     tint::HashCode HashCode() const { return Hash(Value()); }

     /// Equality operator
     /// @param rhs the other EnumSet to compare this to
     /// @return true if this EnumSet is equal to @p rhs
     inline bool operator==(EnumSet rhs) const { return set == rhs.set; }

     /// Inequality operator
     /// @param rhs the other EnumSet to compare this to
     /// @return true if this EnumSet is not equal to @p rhs
     inline bool operator!=(EnumSet rhs) const { return set != rhs.set; }

     /// Equality operator
     /// @param rhs the enum to compare this to
     /// @return true if this EnumSet only contains @p rhs
     inline bool operator==(Enum rhs) const { return set == Bit(rhs); }

     /// Inequality operator
     /// @param rhs the enum to compare this to
     /// @return false if this EnumSet only contains @p rhs
     inline bool operator!=(Enum rhs) const { return set != Bit(rhs); }

     /// @return the underlying value for the EnumSet
     inline uint64_t Value() const { return set; }

     /// Iterator provides read-only, unidirectional iterator over the enums of an
     /// EnumSet.
     class Iterator {
         static constexpr int8_t kEnd = 63;

         Iterator(uint64_t s, int8_t b) : set(s), pos(b) {}

         /// Make the constructor accessible to the EnumSet.
         friend struct EnumSet;

       public:
         /// @return the Enum value at this point in the iterator
         Enum operator*() const { return static_cast<Enum>(pos); }

         /// Increments the iterator
         /// @returns this iterator
         Iterator& operator++() {
             while (pos < kEnd) {
                 pos++;
                 if (set & (static_cast<uint64_t>(1) << static_cast<uint64_t>(pos))) {
                     break;
                 }
             }
             return *this;
         }

         /// Equality operator
         /// @param rhs the Iterator to compare this to
         /// @return true if the two iterators are equal
         bool operator==(const Iterator& rhs) const { return set == rhs.set && pos == rhs.pos; }

         /// Inequality operator
         /// @param rhs the Iterator to compare this to
         /// @return true if the two iterators are different
         bool operator!=(const Iterator& rhs) const { return !(*this == rhs); }

       private:
         const uint64_t set;
         int8_t pos;
     };

     /// @returns an read-only iterator to the beginning of the set
     Iterator begin() const {
         auto it = Iterator{set, -1};
         ++it;  // Move to first set bit
         return it;
     }

     /// @returns an iterator to the beginning of the set
     Iterator end() const { return Iterator{set, Iterator::kEnd}; }

   private:
     static constexpr uint64_t Bit(Enum value) {
         return static_cast<uint64_t>(1) << static_cast<uint64_t>(value);
     }

     static constexpr uint64_t Union() { return 0; }

     template <typename FIRST, typename... VALUES>
     static constexpr uint64_t Union(FIRST first, VALUES... values) {
         return Bit(first) | Union(values...);
     }

     uint64_t set = 0;
 };

 /// Writes the EnumSet to the stream.
 /// @param out the stream to write to
 /// @param set the EnumSet to write
 /// @returns out so calls can be chained
 template <typename STREAM, typename ENUM, typename = traits::EnableIfIsOStream<STREAM>>
 auto& operator<<(STREAM& out, EnumSet<ENUM> set) {
     out << "{";
     bool first = true;
     for (auto e : set) {
         if (!first) {
             out << ", ";
         }
         first = false;
         out << e;
     }
     return out << "}";
 }

 }  // namespace tint

 #endif  // SRC_TINT_UTILS_CONTAINERS_ENUM_SET_H_
	// Copyright 2021 The Dawn & Tint Authors
	//
	// Redistribution and use in source and binary forms, with or without
	// modification, are permitted provided that the following conditions are met:
	//
	// 1. Redistributions of source code must retain the above copyright notice, this
	// list of conditions and the following disclaimer.
	//
	// 2. Redistributions in binary form must reproduce the above copyright notice,
	// this list of conditions and the following disclaimer in the documentation
	// and/or other materials provided with the distribution.
	//
	// 3. Neither the name of the copyright holder nor the names of its
	// contributors may be used to endorse or promote products derived from
	// this software without specific prior written permission.
	//
	// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
	// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
	// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
	// DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
	// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
	// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
	// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
	// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
	// OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
	// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

	#ifndef SRC_TINT_UTILS_CONTAINERS_ENUM_SET_H_
	#define SRC_TINT_UTILS_CONTAINERS_ENUM_SET_H_

	#include <cstdint>
	#include <functional>
	#include <type_traits>
	#include <utility>

	#include "src/tint/utils/math/hash.h"
	#include "src/tint/utils/traits/traits.h"

	namespace tint {

	/// EnumSet is a set of enum values.
	/// @note As the EnumSet is backed by a single uint64_t value, it can only hold
	/// enum values in the range [0 .. 63].
	template <typename ENUM>
	struct EnumSet {
	public:
	/// Enum is the enum type this EnumSet wraps
	using Enum = ENUM;

	/// Constructor. Initializes the EnumSet with zero.
	constexpr EnumSet() = default;

	/// Copy constructor.
	/// @param s the EnumSet to copy
	constexpr EnumSet(const EnumSet& s) = default;

	/// Constructor. Initializes the EnumSet with the given values.
	/// @param values the enumerator values to construct the EnumSet with
	template <typename... VALUES>
	explicit constexpr EnumSet(VALUES... values) : set(Union(values...)) {}

	/// Copy assignment operator.
	/// @param set the EnumSet to assign to this set
	/// @returns this EnumSet so calls can be chained
	inline EnumSet& operator=(const EnumSet& set) = default;

	/// Copy assignment operator.
	/// @param e the enum value
	/// @returns this EnumSet so calls can be chained
	inline EnumSet& operator=(Enum e) { return *this = EnumSet{e}; }

	/// Adds all the given values to this set
	/// @param values the values to add
	/// @returns this EnumSet so calls can be chained
	template <typename... VALUES>
	inline EnumSet& Add(VALUES... values) {
	return Add(EnumSet(std::forward<VALUES>(values)...));
	}

	/// Removes all the given values from this set
	/// @param values the values to remove
	/// @returns this EnumSet so calls can be chained
	template <typename... VALUES>
	inline EnumSet& Remove(VALUES... values) {
	return Remove(EnumSet(std::forward<VALUES>(values)...));
	}

	/// Adds all of @p s to this set
	/// @param s the enum value
	/// @returns this EnumSet so calls can be chained
	inline EnumSet& Add(EnumSet s) { return (this = this + s); }

	/// Removes all of @p s from this set
	/// @param s the enum value
	/// @returns this EnumSet so calls can be chained
	inline EnumSet& Remove(EnumSet s) { return (this = this - s); }

	/// Adds or removes @p e to the set
	/// @param e the enum value
	/// @param add if true the enum value is added, otherwise removed
	/// @returns this EnumSet so calls can be chained
	inline EnumSet& Set(Enum e, bool add = true) { return add ? Add(e) : Remove(e); }

	/// @param e the enum value
	/// @returns a copy of this EnumSet with @p e added
	inline EnumSet operator+(Enum e) const {
	EnumSet out;
	out.set = set \| Bit(e);
	return out;
	}

	/// @param e the enum value
	/// @returns a copy of this EnumSet with @p e removed
	inline EnumSet operator-(Enum e) const {
	EnumSet out;
	out.set = set & ~Bit(e);
	return out;
	}

	/// @param s the other set
	/// @returns the union of this EnumSet with @p s (`this` ∪ @p s)
	inline EnumSet operator+(EnumSet s) const {
	EnumSet out;
	out.set = set \| s.set;
	return out;
	}

	/// @param s the other set
	/// @returns the set of entries found in this but not in s (`this` \ @p s)
	inline EnumSet operator-(EnumSet s) const {
	EnumSet out;
	out.set = set & ~s.set;
	return out;
	}

	/// @param s the other set
	/// @returns the intersection of this EnumSet with s (`this` ∩ @p s)
	inline EnumSet operator&(EnumSet s) const {
	EnumSet out;
	out.set = set & s.set;
	return out;
	}

	/// @param e the enum value
	/// @return true if the set contains @p e
	inline bool Contains(Enum e) const { return (set & Bit(e)) != 0; }

	/// @return true if the set is empty
	inline bool Empty() const { return set == 0; }

	/// @returns number of enums currently in the set
	/// This is an O(N) operation, where N can be upto 64
	inline size_t Size() const {
	size_t result = 0;
	uint64_t bits = set;
	while (bits) {
	result += bits & 1;
	bits >>= 1;
	}
	return result;
	}

	/// @return the hash value of this object
	tint::HashCode HashCode() const { return Hash(Value()); }

	/// Equality operator
	/// @param rhs the other EnumSet to compare this to
	/// @return true if this EnumSet is equal to @p rhs
	inline bool operator==(EnumSet rhs) const { return set == rhs.set; }

	/// Inequality operator
	/// @param rhs the other EnumSet to compare this to
	/// @return true if this EnumSet is not equal to @p rhs
	inline bool operator!=(EnumSet rhs) const { return set != rhs.set; }

	/// Equality operator
	/// @param rhs the enum to compare this to
	/// @return true if this EnumSet only contains @p rhs
	inline bool operator==(Enum rhs) const { return set == Bit(rhs); }

	/// Inequality operator
	/// @param rhs the enum to compare this to
	/// @return false if this EnumSet only contains @p rhs
	inline bool operator!=(Enum rhs) const { return set != Bit(rhs); }

	/// @return the underlying value for the EnumSet
	inline uint64_t Value() const { return set; }

	/// Iterator provides read-only, unidirectional iterator over the enums of an
	/// EnumSet.
	class Iterator {
	static constexpr int8_t kEnd = 63;

	Iterator(uint64_t s, int8_t b) : set(s), pos(b) {}

	/// Make the constructor accessible to the EnumSet.
	friend struct EnumSet;

	public:
	/// @return the Enum value at this point in the iterator
	Enum operator*() const { return static_cast<Enum>(pos); }

	/// Increments the iterator
	/// @returns this iterator
	Iterator& operator++() {
	while (pos < kEnd) {
	pos++;
	if (set & (static_cast<uint64_t>(1) << static_cast<uint64_t>(pos))) {
	break;
	}
	}
	return *this;
	}

	/// Equality operator
	/// @param rhs the Iterator to compare this to
	/// @return true if the two iterators are equal
	bool operator==(const Iterator& rhs) const { return set == rhs.set && pos == rhs.pos; }

	/// Inequality operator
	/// @param rhs the Iterator to compare this to
	/// @return true if the two iterators are different
	bool operator!=(const Iterator& rhs) const { return !(*this == rhs); }

	private:
	const uint64_t set;
	int8_t pos;
	};

	/// @returns an read-only iterator to the beginning of the set
	Iterator begin() const {
	auto it = Iterator{set, -1};
	++it; // Move to first set bit
	return it;
	}

	/// @returns an iterator to the beginning of the set
	Iterator end() const { return Iterator{set, Iterator::kEnd}; }

	private:
	static constexpr uint64_t Bit(Enum value) {
	return static_cast<uint64_t>(1) << static_cast<uint64_t>(value);
	}

	static constexpr uint64_t Union() { return 0; }

	template <typename FIRST, typename... VALUES>
	static constexpr uint64_t Union(FIRST first, VALUES... values) {
	return Bit(first) \| Union(values...);
	}

	uint64_t set = 0;
	};

	/// Writes the EnumSet to the stream.
	/// @param out the stream to write to
	/// @param set the EnumSet to write
	/// @returns out so calls can be chained
	template <typename STREAM, typename ENUM, typename = traits::EnableIfIsOStream<STREAM>>
	auto& operator<<(STREAM& out, EnumSet<ENUM> set) {
	out << "{";
	bool first = true;
	for (auto e : set) {
	if (!first) {
	out << ", ";
	}
	first = false;
	out << e;
	}
	return out << "}";
	}

	} // namespace tint

	#endif // SRC_TINT_UTILS_CONTAINERS_ENUM_SET_H_