This repository has been archived on 2023-10-09. You can view files and clone it. You cannot open issues or pull requests or push a commit.
Files
blender-archive/source/blender/blenlib/tests/BLI_index_range_test.cc
Jacques Lucke 98721c8543 BLI: improve support for generic algorithms with c++ containers
Some generic algorithms from the standard library like `std::any_of`
did not work with all container and iterator types. To improve the
situation, this patch adds various type members to containers
and iterators.

Custom iterators for Set, Map and IndexRange now have an iterator
category, which soe algorithms require. IndexRange could become
a random access iterator, but adding all the missing methods can
be done when it is necessary.
2021-03-20 15:42:35 +01:00

160 lines
3.3 KiB
C++

/* Apache License, Version 2.0 */
#include "BLI_index_range.hh"
#include "BLI_strict_flags.h"
#include "BLI_vector.hh"
#include "testing/testing.h"
namespace blender::tests {
TEST(index_range, DefaultConstructor)
{
IndexRange range;
EXPECT_EQ(range.size(), 0);
Vector<int64_t> vector;
for (int64_t value : range) {
vector.append(value);
}
EXPECT_EQ(vector.size(), 0);
}
TEST(index_range, SingleElementRange)
{
IndexRange range(4, 1);
EXPECT_EQ(range.size(), 1);
EXPECT_EQ(*range.begin(), 4);
Vector<int64_t> vector;
for (int64_t value : range) {
vector.append(value);
}
EXPECT_EQ(vector.size(), 1);
EXPECT_EQ(vector[0], 4);
}
TEST(index_range, MultipleElementRange)
{
IndexRange range(6, 4);
EXPECT_EQ(range.size(), 4);
Vector<int64_t> vector;
for (int64_t value : range) {
vector.append(value);
}
EXPECT_EQ(vector.size(), 4);
for (int i = 0; i < 4; i++) {
EXPECT_EQ(vector[i], i + 6);
}
}
TEST(index_range, SubscriptOperator)
{
IndexRange range(5, 5);
EXPECT_EQ(range[0], 5);
EXPECT_EQ(range[1], 6);
EXPECT_EQ(range[2], 7);
}
TEST(index_range, Before)
{
IndexRange range = IndexRange(5, 5).before(3);
EXPECT_EQ(range[0], 2);
EXPECT_EQ(range[1], 3);
EXPECT_EQ(range[2], 4);
EXPECT_EQ(range.size(), 3);
}
TEST(index_range, After)
{
IndexRange range = IndexRange(5, 5).after(4);
EXPECT_EQ(range[0], 10);
EXPECT_EQ(range[1], 11);
EXPECT_EQ(range[2], 12);
EXPECT_EQ(range[3], 13);
EXPECT_EQ(range.size(), 4);
}
TEST(index_range, Contains)
{
IndexRange range = IndexRange(5, 3);
EXPECT_TRUE(range.contains(5));
EXPECT_TRUE(range.contains(6));
EXPECT_TRUE(range.contains(7));
EXPECT_FALSE(range.contains(4));
EXPECT_FALSE(range.contains(8));
}
TEST(index_range, First)
{
IndexRange range = IndexRange(5, 3);
EXPECT_EQ(range.first(), 5);
}
TEST(index_range, Last)
{
IndexRange range = IndexRange(5, 3);
EXPECT_EQ(range.last(), 7);
}
TEST(index_range, OneAfterEnd)
{
IndexRange range = IndexRange(5, 3);
EXPECT_EQ(range.one_after_last(), 8);
}
TEST(index_range, Start)
{
IndexRange range = IndexRange(6, 2);
EXPECT_EQ(range.start(), 6);
}
TEST(index_range, Slice)
{
IndexRange range = IndexRange(5, 15);
IndexRange slice = range.slice(2, 6);
EXPECT_EQ(slice.size(), 6);
EXPECT_EQ(slice.first(), 7);
EXPECT_EQ(slice.last(), 12);
}
TEST(index_range, SliceRange)
{
IndexRange range = IndexRange(5, 15);
IndexRange slice = range.slice(IndexRange(3, 5));
EXPECT_EQ(slice.size(), 5);
EXPECT_EQ(slice.first(), 8);
EXPECT_EQ(slice.last(), 12);
}
TEST(index_range, AsSpan)
{
IndexRange range = IndexRange(4, 6);
Span<int64_t> span = range.as_span();
EXPECT_EQ(span.size(), 6);
EXPECT_EQ(span[0], 4);
EXPECT_EQ(span[1], 5);
EXPECT_EQ(span[2], 6);
EXPECT_EQ(span[3], 7);
}
TEST(index_range, constexpr_)
{
constexpr IndexRange range = IndexRange(1, 1);
std::array<int, range[0]> compiles = {1};
BLI_STATIC_ASSERT(range.size() == 1, "");
EXPECT_EQ(compiles[0], 1);
}
TEST(index_range, GenericAlgorithms)
{
IndexRange range{4, 10};
EXPECT_TRUE(std::any_of(range.begin(), range.end(), [](int v) { return v == 6; }));
EXPECT_FALSE(std::any_of(range.begin(), range.end(), [](int v) { return v == 20; }));
EXPECT_EQ(std::count_if(range.begin(), range.end(), [](int v) { return v < 7; }), 3);
}
} // namespace blender::tests