// Copyright 2017 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_DAWN_COMMON_BITSETITERATOR_H_ #define SRC_DAWN_COMMON_BITSETITERATOR_H_ #include <bitset> #include <limits> #include "dawn/common/Assert.h" #include "dawn/common/Math.h" #include "dawn/common/UnderlyingType.h" namespace dawn { // This is ANGLE's BitSetIterator class with a customizable return type. // Types have been updated to be more specific. // TODO(crbug.com/dawn/306): it could be optimized, in particular when N <= 64 template <typename T> T roundUp(const T value, const T alignment) { … } template <size_t N, typename T> class BitSetIterator final { … }; template <size_t N, typename T> BitSetIterator<N, T>::BitSetIterator(const std::bitset<N>& bitset) : … { … } template <size_t N, typename T> BitSetIterator<N, T>::BitSetIterator(const BitSetIterator& other) : … { … } template <size_t N, typename T> BitSetIterator<N, T>& BitSetIterator<N, T>::operator=(const BitSetIterator& other) { … } template <size_t N, typename T> BitSetIterator<N, T>::Iterator::Iterator(const std::bitset<N>& bits) : … { … } template <size_t N, typename T> typename BitSetIterator<N, T>::Iterator& BitSetIterator<N, T>::Iterator::operator++() { … } template <size_t N, typename T> bool BitSetIterator<N, T>::Iterator::operator==(const Iterator& other) const { … } template <size_t N, typename T> bool BitSetIterator<N, T>::Iterator::operator!=(const Iterator& other) const { … } template <size_t N, typename T> uint32_t BitSetIterator<N, T>::Iterator::getNextBit() { … } // Helper to avoid needing to specify the template parameter size template <size_t N> BitSetIterator<N, uint32_t> IterateBitSet(const std::bitset<N>& bitset) { … } } // namespace dawn #endif // SRC_DAWN_COMMON_BITSETITERATOR_H_