Bigfoot/Tests/Utils/Containers/SlotMap.cpp

@@ -411,8 +411,6 @@ TYPED_TEST(SlotMapFixture, Clear_ShouldClearTheMapAndOldKeysAreInvalid)
 
 TYPED_TEST(SlotMapFixture, Iterator_ShouldTraverseInInsertionOrder)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     EXPECT_EQ(this->m_slotMap.begin(), this->m_slotMap.end());
 
     std::ignore = this->m_slotMap.Insert(1);
@@ -490,8 +488,6 @@ TYPED_TEST(SlotMapFixture, Iterator_ShouldSkipRemovedSlotsDuringTraversal)
 TYPED_TEST(SlotMapFixture, Iterator_ShouldTraverseAcrossMultiplePages)
 {
     // StableSlotMap's PAGE_SIZE is 64, so 100 elements force it to span pages
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -511,8 +507,6 @@ TYPED_TEST(SlotMapFixture, Iterator_ShouldTraverseAcrossMultiplePages)
 
 TYPED_TEST(SlotMapFixture, Iterator_ShouldCrossThePageBoundaryForwardAndBackward)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -535,8 +529,6 @@ TYPED_TEST(SlotMapFixture, Iterator_ShouldCrossThePageBoundaryForwardAndBackward
 
 TYPED_TEST(SlotMapFixture, Iterator_ShouldSupportPreAndPostIncrementDecrementAcrossTheBoundary)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -654,8 +646,6 @@ TYPED_TEST(SlotMapFixture, Iterator_ShouldSkipAFullyEmptyTrailingPage)
 
 TYPED_TEST(SlotMapFixture, ConstIterator_ShouldTraverseInInsertionOrder)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     const TypeParam& constMap = this->m_slotMap;
 
     // const_iterator is reachable two ways: cbegin()/cend(), or begin()/end() on a const object
@@ -757,8 +747,6 @@ TYPED_TEST(SlotMapFixture, ConstIterator_ShouldSkipRemovedSlotsDuringTraversal)
 TYPED_TEST(SlotMapFixture, ConstIterator_ShouldTraverseAcrossMultiplePages)
 {
     // StableSlotMap's PAGE_SIZE is 64, so 100 elements force it to span pages
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -778,8 +766,6 @@ TYPED_TEST(SlotMapFixture, ConstIterator_ShouldTraverseAcrossMultiplePages)
 
 TYPED_TEST(SlotMapFixture, ConstIterator_ShouldCrossThePageBoundaryForwardAndBackward)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -802,8 +788,6 @@ TYPED_TEST(SlotMapFixture, ConstIterator_ShouldCrossThePageBoundaryForwardAndBac
 
 TYPED_TEST(SlotMapFixture, ConstIterator_ShouldSupportPreAndPostIncrementDecrementAcrossTheBoundary)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -921,8 +905,6 @@ TYPED_TEST(SlotMapFixture, ConstIterator_ShouldSkipAFullyEmptyTrailingPage)
 
 TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldTraverseInReverseInsertionOrder)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     EXPECT_EQ(this->m_slotMap.rbegin(), this->m_slotMap.rend());
 
     std::ignore = this->m_slotMap.Insert(1);
@@ -1000,8 +982,6 @@ TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldSkipRemovedSlotsDuringTraversal
 TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldTraverseAcrossMultiplePages)
 {
     // StableSlotMap's PAGE_SIZE is 64, so 100 elements force it to span pages
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -1020,8 +1000,6 @@ TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldTraverseAcrossMultiplePages)
 
 TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldCrossThePageBoundaryForwardAndBackward)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -1044,8 +1022,6 @@ TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldCrossThePageBoundaryForwardAndB
 
 TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldSupportPreAndPostIncrementDecrementAcrossTheBoundary)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -1163,8 +1139,6 @@ TYPED_TEST(SlotMapFixture, ReverseIterator_ShouldSkipAFullyEmptyTrailingPage)
 
 TYPED_TEST(SlotMapFixture, ConstReverseIterator_ShouldTraverseInReverseInsertionOrder)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     const TypeParam& constMap = this->m_slotMap;
 
     // const_reverse_iterator is reachable two ways: crbegin()/crend(), or rbegin()/rend() on a
@@ -1267,8 +1241,6 @@ TYPED_TEST(SlotMapFixture, ConstReverseIterator_ShouldSkipRemovedSlotsDuringTrav
 TYPED_TEST(SlotMapFixture, ConstReverseIterator_ShouldTraverseAcrossMultiplePages)
 {
     // StableSlotMap's PAGE_SIZE is 64, so 100 elements force it to span pages
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -1287,8 +1259,6 @@ TYPED_TEST(SlotMapFixture, ConstReverseIterator_ShouldTraverseAcrossMultiplePage
 
 TYPED_TEST(SlotMapFixture, ConstReverseIterator_ShouldCrossThePageBoundaryForwardAndBackward)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {
@@ -1310,8 +1280,6 @@ TYPED_TEST(SlotMapFixture, ConstReverseIterator_ShouldCrossThePageBoundaryForwar
 
 TYPED_TEST(SlotMapFixture, ConstReverseIterator_ShouldSupportPreAndPostIncrementDecrementAcrossTheBoundary)
 {
-    using SlotMapKey = TestFixture::SlotMapKey;
-
     constexpr std::uint32_t elementCount = 100;
     for (std::uint32_t value = 0; value < elementCount; ++value)
     {