-
Notifications
You must be signed in to change notification settings - Fork 32
Expand file tree
/
Copy pathArrayViewTest.cpp
More file actions
104 lines (92 loc) · 2.76 KB
/
ArrayViewTest.cpp
File metadata and controls
104 lines (92 loc) · 2.76 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
/**
* Copyright (c) 2018 HERE Europe B.V.
* See the LICENSE file in the root of this project for license details.
*/
#include "ranges.hpp"
#include "test_structures.hpp"
#include <flatdata/flatdata.h>
#include "catch_amalgamated.hpp"
using namespace flatdata;
using namespace test_structures;
TEST_CASE( "Reading from ArrayView", "[ArrayView]" )
{
Vector< AStruct > data( 10 );
for ( size_t i = 0; i < 10; i++ )
{
data[ i ].value = i;
}
ArrayView< AStruct > view = data;
for ( size_t i = 0; i < 10; i++ )
{
REQUIRE( view[ i ].value == i );
}
}
TEST_CASE( "Initializing overlapping ArrayView", "[ArrayView]" )
{
ArrayView< TestIndexType48 > view;
REQUIRE( view.size( ) == 0 );
}
TEST_CASE( "Slicing ArrayView", "[ArrayView]" )
{
Vector< AStruct > data( 10 );
for ( size_t i = 0; i < 10; i++ )
{
data[ i ].value = i;
}
ArrayView< AStruct > view = data;
REQUIRE( view.size( ) == 10 );
REQUIRE( view.slice_after( 2 ).size( ) == 8 );
REQUIRE( view.slice_after( 2 ).front( ).value == 2 );
REQUIRE( view.skip( 2 ).size( ) == 8 );
REQUIRE( view.skip( 2 ).front( ).value == 2 );
REQUIRE( view.skip_last( 2 ).size( ) == 8 );
REQUIRE( view.skip_last( 2 ).front( ).value == 0 );
REQUIRE( view.slice_before( 8 ).size( ) == 8 );
REQUIRE( view.slice_before( 8 ).front( ).value == 0 );
REQUIRE( view.slice( 2, 6 ).size( ) == 6 );
REQUIRE( view.slice( 2, 6 ).front( ).value == 2 );
}
TEST_CASE( "Slicing ArrayView with Ranges", "[ArrayView]" )
{
Vector< n::S > data( 11 );
for ( size_t i = 0; i < 11; i++ )
{
data[ i ].x = i;
}
ArrayView< n::S > view = data;
REQUIRE( view.size( ) == 10 );
REQUIRE( view.slice_after( 2 ).size( ) == 8 );
REQUIRE( view.slice_after( 2 ).front( ).x == 2 );
REQUIRE( view.skip( 2 ).size( ) == 8 );
REQUIRE( view.skip( 2 ).front( ).x == 2 );
REQUIRE( view.skip_last( 2 ).size( ) == 8 );
REQUIRE( view.skip_last( 2 ).front( ).x == 0 );
REQUIRE( view.slice_before( 8 ).size( ) == 8 );
REQUIRE( view.slice_before( 8 ).front( ).x == 0 );
REQUIRE( view.slice( 2, 6 ).size( ) == 6 );
REQUIRE( view.slice( 2, 6 ).front( ).x == 2 );
}
TEST_CASE( "Iterators", "[ArrayView]" )
{
Vector< n::S > data( 11 );
for ( size_t i = 0; i < 11; i++ )
{
data[ i ].x = i;
}
ArrayView< n::S > view = data;
auto iter = view.begin( );
REQUIRE( iter->x == 0 );
iter++;
REQUIRE( iter->x == 1 );
++iter;
REQUIRE( iter->x == 2 );
iter += 2;
REQUIRE( iter->x == 4 );
iter -= 1;
REQUIRE( iter->x == 3 );
auto iter2 = iter++;
REQUIRE( iter2->x == 3 );
REQUIRE( iter->x == 4 );
REQUIRE( iter > view.begin( ) );
REQUIRE( iter < view.end( ) );
}