cpp-useful-iterators/test/recursive_iterator_vector_test.cxx

#include "iterator/recursive_iterator.h"

#include <vector>

#include <iterator/forwards.h>

#include "ranges.h"
#include "xcode_gtest_helper.h"

using iterator::bounded;
using iterator::recursive_iterator;

using testing::IsEmpty;

TEST(RecursiveIteratorVecTest, PreIncrementAdvancesIterator) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec);
  EXPECT_THAT(*rit, 1);
  EXPECT_THAT(*++rit, 2);
  EXPECT_THAT(*rit, 2);
}

TEST(RecursiveIteratorVecTest, PostIncrementReturnsCopyOfPrev) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec);
  EXPECT_THAT(*rit, 1);
  EXPECT_THAT(*rit++, 1);
  EXPECT_THAT(*rit, 2);
}

TEST(RecursiveIteratorVecTest, IterDistanceIsSumOfInnerContainerSizes) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec);

  EXPECT_THAT(ranges::distance(rit, iterator::sentinel), 5);
}

TEST(RecursiveIteratorVecTest, FlattensVectorDataLikeJoinIterator) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec);

  std::vector<int> const expected{1, 2, 3, 4, 5};
  EXPECT_THAT(ranges::to<std::vector<int>>(rit, iterator::sentinel), expected);
}

TEST(RecursiveIteratorVecTest, CanMutatePointedToData) {
  std::vector<std::vector<std::vector<int>>> vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec);
  *rit = 6;
  EXPECT_THAT(vec[0][0][0], 6);
}

TEST(BoundedRecursiveIteratorVecTest, PreIncrementAdvancesIterator) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec, bounded<2>{});
  EXPECT_THAT(*rit, vec[0][0]);
  EXPECT_THAT(*++rit, vec[1][0]);
  EXPECT_THAT(*rit, vec[1][0]);
}

TEST(BoundedRecursiveIteratorVecTest, PostIncrementReturnsCopyOfPrev) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec, bounded<2>{});
  EXPECT_THAT(*rit, vec[0][0]);
  EXPECT_THAT(*rit++, vec[0][0]);
  EXPECT_THAT(*rit, vec[1][0]);
}

TEST(BoundedRecursiveIteratorVecTest, IterDistanceSumOnNLayersSize) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec, bounded<2>{});

  EXPECT_THAT(ranges::distance(rit, iterator::sentinel), 3);
}

TEST(BoundedRecursiveIteratorVecTest, ElementsAreUnwrappedAsATuple) {
  std::vector<std::vector<std::vector<int>>> const vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec, bounded<2>{});

  std::vector<std::vector<int>> const expected{{1, 2}, {3}, {4, 5}};
  EXPECT_THAT(
      ranges::to<std::vector<std::vector<int>>>(rit, iterator::sentinel),
      expected);
}

TEST(BoundedRecursiveIteratorVecTest, CanMutatePointedToData) {
  std::vector<std::vector<std::vector<int>>> vec{{{1, 2}}, {{3}, {4, 5}}};
  auto rit = recursive_iterator(vec, bounded<2>{});
  rit->clear();
  EXPECT_THAT(vec[0][0], IsEmpty());
}