Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions src/tools/std23/views.hpp
Original file line number Diff line number Diff line change
@@ -1,3 +1,4 @@
#include "tools/std23/views/chunk.hpp"
#include "tools/std23/views/chunk_by.hpp"
#include "tools/std23/views/stride.hpp"
#include "tools/std23/views/zip.hpp"
1 change: 1 addition & 0 deletions src/tools/std23/views/test/CMakeLists.txt
Original file line number Diff line number Diff line change
@@ -1,3 +1,4 @@
add_cpp_test( std23.views.chunk chunk.test.cpp )
add_cpp_test( std23.views.chunk_by chunk_by.test.cpp )
add_cpp_test( std23.views.stride stride.test.cpp )
add_cpp_test( std23.views.zip zip.test.cpp )
171 changes: 171 additions & 0 deletions src/tools/std23/views/test/zip.test.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,171 @@
// include Catch2
#include <catch2/catch_test_macros.hpp>

// what we are testing
#include "tools/std23/views.hpp"

// other includes
#include <forward_list>
#include <list>
#include <vector>
#include "tools/std20/algorithm.hpp"

// convenience typedefs
using namespace njoy::tools;

SCENARIO( "zip_view" ) {

GIVEN( "a container with forward iterators" ) {

std::vector< std::tuple< int, char, std::string > > equal = {

{ 1, 'a', "ab" },
{ 2, 'b', "cd" },
{ 3, 'c', "ef" },
{ 4, 'd', "gh" },
{ 5, 'e', "ij" },
{ 6, 'f', "kl" },
{ 7, 'g', "mn" }
};

std::forward_list< int > values1 = { 1, 2, 3, 4, 5, 6, 7 };
std::forward_list< char > values2 = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i' };
std::forward_list< std::string > values3 = { "ab", "cd", "ef", "gh", "ij", "kl", "mn", "op" };

WHEN( "when iterators are used" ) {

auto chunk = std23::views::zip( values1, values2, values3 );
using Range = decltype(chunk);
using Iterator = std20::iterator_t< Range >;

THEN( "the stride_view satisfies the required concepts" ) {

CHECK( std20::ranges::range< Range > );
CHECK( std20::ranges::view< Range > );
CHECK( ! std20::ranges::sized_range< Range > );
CHECK( std20::ranges::forward_range< Range > );
CHECK( ! std20::ranges::bidirectional_range< Range > );
CHECK( ! std20::ranges::random_access_range< Range > );
CHECK( ! std20::ranges::contiguous_range< Range > );
CHECK( std20::ranges::common_range< Range > );
}

THEN( "a stride_view can be constructed and members can be tested" ) {

CHECK( false == chunk.empty() );
CHECK( true == bool( chunk ) );

CHECK( std20::ranges::equal( equal, chunk ) );

CHECK( equal[0] == chunk.front() );
} // THEN
} // WHEN
} // GIVEN

GIVEN( "a container with bidirectional iterators" ) {

std::vector< std::tuple< int, char, std::string > > equal = {

{ 1, 'a', "ab" },
{ 2, 'b', "cd" },
{ 3, 'c', "ef" },
{ 4, 'd', "gh" },
{ 5, 'e', "ij" },
{ 6, 'f', "kl" },
{ 7, 'g', "mn" }
};

std::list< int > values1 = { 1, 2, 3, 4, 5, 6, 7 };
std::list< char > values2 = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i' };
std::list< std::string > values3 = { "ab", "cd", "ef", "gh", "ij", "kl", "mn", "op" };

WHEN( "when iterators are used" ) {

auto chunk = std23::views::zip( values1, values2, values3 );
using Range = decltype(chunk);
using Iterator = std20::iterator_t< Range >;

THEN( "the stride_view satisfies the required concepts" ) {

CHECK( std20::ranges::range< Range > );
CHECK( std20::ranges::view< Range > );
CHECK( std20::ranges::sized_range< Range > );
CHECK( std20::ranges::forward_range< Range > );
CHECK( std20::ranges::bidirectional_range< Range > );
CHECK( ! std20::ranges::random_access_range< Range > );
CHECK( ! std20::ranges::contiguous_range< Range > );
CHECK( ! std20::ranges::common_range< Range > );
}

THEN( "a stride_view can be constructed and members can be tested" ) {

CHECK( 7 == chunk.size() );

CHECK( false == chunk.empty() );
CHECK( true == bool( chunk ) );

CHECK( std20::ranges::equal( equal, chunk ) );

CHECK( equal[0] == chunk.front() );
} // THEN
} // WHEN
} // GIVEN

GIVEN( "a container with random access iterators" ) {

std::vector< std::tuple< int, char, std::string > > equal = {

{ 1, 'a', "ab" },
{ 2, 'b', "cd" },
{ 3, 'c', "ef" },
{ 4, 'd', "gh" },
{ 5, 'e', "ij" },
{ 6, 'f', "kl" },
{ 7, 'g', "mn" }
};

std::vector< int > values1 = { 1, 2, 3, 4, 5, 6, 7 };
std::vector< char > values2 = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i' };
std::vector< std::string > values3 = { "ab", "cd", "ef", "gh", "ij", "kl", "mn", "op" };

WHEN( "when iterators are used" ) {

auto chunk = std23::views::zip( values1, values2, values3 );
using Range = decltype(chunk);
using Iterator = std20::iterator_t< Range >;

THEN( "the stride_view satisfies the required concepts" ) {

CHECK( std20::ranges::range< Range > );
CHECK( std20::ranges::view< Range > );
CHECK( std20::ranges::sized_range< Range > );
CHECK( std20::ranges::forward_range< Range > );
CHECK( std20::ranges::bidirectional_range< Range > );
CHECK( std20::ranges::random_access_range< Range > );
CHECK( ! std20::ranges::contiguous_range< Range > );
CHECK( std20::ranges::common_range< Range > );
}

THEN( "a stride_view can be constructed and members can be tested" ) {

CHECK( 7 == chunk.size() );

CHECK( false == chunk.empty() );
CHECK( true == bool( chunk ) );

CHECK( std20::ranges::equal( equal, chunk ) );

CHECK( equal[0] == chunk.front() );
CHECK( equal[6] == chunk.back() );

CHECK( std::tuple< int, char, std::string >{ 1, 'a', "ab" } == chunk[0] );
CHECK( std::tuple< int, char, std::string >{ 2, 'b', "cd" } == chunk[1] );
CHECK( std::tuple< int, char, std::string >{ 3, 'c', "ef" } == chunk[2] );
CHECK( std::tuple< int, char, std::string >{ 4, 'd', "gh" } == chunk[3] );
CHECK( std::tuple< int, char, std::string >{ 5, 'e', "ij" } == chunk[4] );
CHECK( std::tuple< int, char, std::string >{ 6, 'f', "kl" } == chunk[5] );
CHECK( std::tuple< int, char, std::string >{ 7, 'g', "mn" } == chunk[6] );
} // THEN
} // WHEN
} // GIVEN
} // SCENARIO
Loading