| // Copyright 2020 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. | |
| #include <array> | |
| #include "gtest/gtest.h" | |
| #include "dawn/common/TypedInteger.h" | |
| #include "dawn/common/ityp_span.h" | |
| namespace dawn { | |
| namespace { | |
| class ITypSpanTest : public testing::Test { | |
| protected: | |
| using Key = TypedInteger<struct KeyT, size_t>; | |
| using Val = TypedInteger<struct ValT, uint32_t>; | |
| using Span = ityp::span<Key, Val>; | |
| }; | |
| // Test that values can be set at an index and retrieved from the same index. | |
| TEST_F(ITypSpanTest, Indexing) { | |
| std::array<Val, 10> arr; | |
| Span span(arr.data(), Key(arr.size())); | |
| { | |
| span[Key(2)] = Val(5); | |
| span[Key(1)] = Val(9); | |
| span[Key(9)] = Val(2); | |
| ASSERT_EQ(span[Key(2)], Val(5)); | |
| ASSERT_EQ(span[Key(1)], Val(9)); | |
| ASSERT_EQ(span[Key(9)], Val(2)); | |
| } | |
| } | |
| // Test that the span can be is iterated in order with a range-based for loop | |
| TEST_F(ITypSpanTest, RangeBasedIteration) { | |
| std::array<Val, 10> arr; | |
| Span span(arr.data(), Key(arr.size())); | |
| // Assign in a non-const range-based for loop | |
| uint32_t i = 0; | |
| for (Val& val : span) { | |
| val = Val(i); | |
| } | |
| // Check values in a const range-based for loop | |
| i = 0; | |
| for (Val val : static_cast<const Span&>(span)) { | |
| ASSERT_EQ(val, span[Key(i++)]); | |
| } | |
| } | |
| // Test that begin/end/front/back/data return pointers/references to the correct elements. | |
| TEST_F(ITypSpanTest, BeginEndFrontBackData) { | |
| std::array<Val, 10> arr; | |
| Span span(arr.data(), Key(arr.size())); | |
| // non-const versions | |
| ASSERT_EQ(span.begin(), &span[Key(0)]); | |
| ASSERT_EQ(span.end(), &span[Key(0)] + static_cast<size_t>(span.size())); | |
| ASSERT_EQ(&span.front(), &span[Key(0)]); | |
| ASSERT_EQ(&span.back(), &span[Key(9)]); | |
| ASSERT_EQ(span.data(), &span[Key(0)]); | |
| // const versions | |
| const Span& constSpan = span; | |
| ASSERT_EQ(constSpan.begin(), &constSpan[Key(0)]); | |
| ASSERT_EQ(constSpan.end(), &constSpan[Key(0)] + static_cast<size_t>(constSpan.size())); | |
| ASSERT_EQ(&constSpan.front(), &constSpan[Key(0)]); | |
| ASSERT_EQ(&constSpan.back(), &constSpan[Key(9)]); | |
| ASSERT_EQ(constSpan.data(), &constSpan[Key(0)]); | |
| } | |
| } // anonymous namespace | |
| } // namespace dawn |