DEV: update deque functionality
This commit is contained in:
@@ -29,12 +29,44 @@
|
||||
*
|
||||
*/
|
||||
#include <cont/deque.h>
|
||||
#include <cont/span.h>
|
||||
#include <gtest/gtest.h>
|
||||
|
||||
#include <array>
|
||||
#include <type_traits>
|
||||
|
||||
namespace Tdeque {
|
||||
using namespace tbx;
|
||||
|
||||
template <typename>
|
||||
struct is_span : std::false_type {};
|
||||
|
||||
template <typename T, std::size_t S>
|
||||
struct is_span<tbx::span<T, S>> : std::true_type {};
|
||||
|
||||
template <typename>
|
||||
struct is_std_array : std::false_type {};
|
||||
|
||||
template <typename T, std::size_t N>
|
||||
struct is_std_array<std::array<T, N>> : std::true_type {};
|
||||
|
||||
template <typename, typename = void>
|
||||
struct has_size_and_data : std::false_type {};
|
||||
|
||||
template <typename T>
|
||||
struct has_size_and_data<T, std::void_t<decltype(std::declval<T>().size()),
|
||||
decltype(std::declval<T>().data())>>
|
||||
: std::true_type {};
|
||||
|
||||
// Concept
|
||||
TEST(Tdeque, concept) {
|
||||
using deque_t = deque<int, 8>;
|
||||
|
||||
EXPECT_EQ (true, !is_span<deque_t>::value);
|
||||
EXPECT_EQ (true, !is_std_array<deque_t>::value);
|
||||
EXPECT_EQ (true, !std::is_array<deque_t>::value);
|
||||
EXPECT_EQ (true, has_size_and_data<deque_t>::value);
|
||||
}
|
||||
// Test construction
|
||||
TEST(Tdeque, contruct) {
|
||||
deque<int, 8> q1;
|
||||
@@ -192,5 +224,190 @@ namespace Tdeque {
|
||||
EXPECT_EQ(6, check_it); // run through all
|
||||
|
||||
}
|
||||
TEST (Tdeque, range) {
|
||||
deque<int, 8> q1{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
int check_it=1;
|
||||
|
||||
for (auto& it : q1.contents())
|
||||
EXPECT_EQ(it, check_it++);
|
||||
|
||||
EXPECT_EQ(9, check_it); // run through all
|
||||
}
|
||||
|
||||
|
||||
// Concept
|
||||
TEST(Tdeque, concept_atomic) {
|
||||
using deque_t = deque<int, 8, true>;
|
||||
|
||||
EXPECT_EQ (true, !is_span<deque_t>::value);
|
||||
EXPECT_EQ (true, !is_std_array<deque_t>::value);
|
||||
EXPECT_EQ (true, !std::is_array<deque_t>::value);
|
||||
EXPECT_EQ (true, has_size_and_data<deque_t>::value);
|
||||
}
|
||||
// Test construction
|
||||
TEST(Tdeque, contruct_atomic) {
|
||||
deque<int, 8, true> q1;
|
||||
deque<int, 8, true> q2{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
deque<int, 8, true> q3{1, 2, 3, 4, 5};
|
||||
|
||||
EXPECT_EQ (8UL, q1.capacity());
|
||||
EXPECT_EQ (0UL, q1.size());
|
||||
EXPECT_EQ (8UL, q2.capacity());
|
||||
EXPECT_EQ (8UL, q2.size());
|
||||
EXPECT_EQ (8UL, q3.capacity());
|
||||
EXPECT_EQ (5UL, q3.size());
|
||||
}
|
||||
|
||||
// simple push-pop functionality
|
||||
TEST(Tdeque, push_pop_atomic) {
|
||||
deque<int, 8, true> q1;
|
||||
deque<int, 8, true> q2{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
|
||||
q1.push_front(1);
|
||||
q1.push_front(2);
|
||||
EXPECT_EQ (1, q1.pop_back());
|
||||
EXPECT_EQ (2, q1.pop_back());
|
||||
|
||||
q1.push_back(1);
|
||||
q1.push_back(2);
|
||||
EXPECT_EQ (1, q1.pop_front());
|
||||
EXPECT_EQ (2, q1.pop_front());
|
||||
|
||||
q1.push_front(2);
|
||||
q1.push_back(3);
|
||||
q1.push_front(1);
|
||||
q1.push_back(4);
|
||||
|
||||
for (int i=1 ; i<= 4 ; ++i)
|
||||
EXPECT_EQ ((int)i, q1.pop_front());
|
||||
}
|
||||
|
||||
// front-back
|
||||
TEST(Tdeque, front_back_atomic) {
|
||||
deque<int, 8, true> q1;
|
||||
deque<int, 8, true> q2{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
|
||||
q1.push_front(2);
|
||||
q1.push_front(1);
|
||||
q1.push_back(3);
|
||||
q1.push_back(4);
|
||||
|
||||
EXPECT_EQ (1, q1.front());
|
||||
EXPECT_EQ (4, q1.back());
|
||||
EXPECT_EQ (1, q2.front());
|
||||
EXPECT_EQ (8, q2.back());
|
||||
}
|
||||
|
||||
// capacity
|
||||
TEST(Tdeque, capacity_atomic) {
|
||||
deque<int, 8, true> q1;
|
||||
deque<int, 8, true> q2{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
|
||||
q1.push_back(1);
|
||||
q1.clear();
|
||||
EXPECT_EQ (true, q1.empty());
|
||||
EXPECT_EQ (true, q2.full());
|
||||
|
||||
EXPECT_EQ (8UL, q1.capacity());
|
||||
EXPECT_EQ (8UL, q2.capacity());
|
||||
|
||||
EXPECT_EQ (0UL, q1.size());
|
||||
EXPECT_EQ (8UL, q2.size());
|
||||
|
||||
q1.push_back(2);
|
||||
EXPECT_EQ (1UL, q1.size());
|
||||
q1.push_front(1);
|
||||
EXPECT_EQ (2UL, q1.size());
|
||||
|
||||
q1.pop_back();
|
||||
EXPECT_EQ (1UL, q1.size());
|
||||
q1.pop_front();
|
||||
EXPECT_EQ (0UL, q1.size());
|
||||
}
|
||||
|
||||
// push-pop limits
|
||||
TEST (Tdeque, push_pop_limits_atomic) {
|
||||
deque<int, 8, true> q1;
|
||||
deque<int, 8, true> q2{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
|
||||
EXPECT_EQ (int{}, q1.pop_back());
|
||||
EXPECT_EQ (0UL, q1.size());
|
||||
EXPECT_EQ (true, q1.empty());
|
||||
EXPECT_EQ (false, q1.full());
|
||||
|
||||
EXPECT_EQ (int{}, q1.pop_front());
|
||||
EXPECT_EQ (0UL, q1.size());
|
||||
EXPECT_EQ (true, q1.empty());
|
||||
EXPECT_EQ (false, q1.full());
|
||||
|
||||
q2.push_front(0);
|
||||
EXPECT_EQ (1, q2.front());
|
||||
EXPECT_EQ (8, q2.back());
|
||||
EXPECT_EQ (8UL, q2.size());
|
||||
EXPECT_EQ (false, q2.empty());
|
||||
EXPECT_EQ (true, q2.full());
|
||||
|
||||
q2.push_back(9);
|
||||
EXPECT_EQ (1, q2.front());
|
||||
EXPECT_EQ (8, q2.back());
|
||||
EXPECT_EQ (8UL, q2.size());
|
||||
EXPECT_EQ (false, q2.empty());
|
||||
EXPECT_EQ (true, q2.full());
|
||||
}
|
||||
|
||||
// iterators
|
||||
TEST (Tdeque, iterators_atomic) {
|
||||
deque<int, 8, true> q1{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
int check_it=1;
|
||||
|
||||
EXPECT_EQ (q1.begin().base(), q1.end().base());
|
||||
EXPECT_NE (q1.begin().iter(), q1.end().iter());
|
||||
EXPECT_EQ (1, *q1.begin());
|
||||
EXPECT_EQ (true, (q1.begin() == ++q1.end())); // loop edge iterators
|
||||
|
||||
for (auto it = q1.begin() ; it != q1.end() ; ++it)
|
||||
EXPECT_EQ(*it, check_it++);
|
||||
EXPECT_EQ(9, check_it); // run through all
|
||||
|
||||
EXPECT_EQ (1, q1.front()); // queue stays intact
|
||||
EXPECT_EQ (8, q1.back());
|
||||
EXPECT_EQ (8UL, q1.size());
|
||||
EXPECT_EQ (false, q1.empty());
|
||||
EXPECT_EQ (true, q1.full());
|
||||
|
||||
q1.pop_front();
|
||||
q1.pop_back();
|
||||
|
||||
check_it=2;
|
||||
for (auto& it : q1)
|
||||
EXPECT_EQ(it, check_it++);
|
||||
EXPECT_EQ(8, check_it); // run through all
|
||||
|
||||
EXPECT_EQ (2, q1.front()); // queue stays intact
|
||||
EXPECT_EQ (7, q1.back());
|
||||
EXPECT_EQ (6UL, q1.size());
|
||||
EXPECT_EQ (false, q1.empty());
|
||||
EXPECT_EQ (false, q1.full());
|
||||
|
||||
deque<int, 8, true> q2;
|
||||
q2.push_front(2);
|
||||
q2.push_front(1);
|
||||
q2.push_back(3);
|
||||
q2.push_back(4);
|
||||
q2.push_back(5);
|
||||
check_it =1;
|
||||
for (auto& it : q2)
|
||||
EXPECT_EQ(it, check_it++);
|
||||
EXPECT_EQ(6, check_it); // run through all
|
||||
|
||||
}
|
||||
TEST (Tdeque, range_atomic) {
|
||||
deque<int, 8, true> q1{1, 2, 3, 4, 5, 6, 7, 8};
|
||||
int check_it=1;
|
||||
|
||||
for (auto& it : q1.contents())
|
||||
EXPECT_EQ(it, check_it++);
|
||||
|
||||
EXPECT_EQ(9, check_it); // run through all
|
||||
}
|
||||
}
|
||||
|
||||
@@ -228,4 +228,197 @@ namespace Tring_iterator {
|
||||
EXPECT_EQ (1, (i2 - i1)); // loop
|
||||
|
||||
}
|
||||
|
||||
// Test construction atomic
|
||||
TEST(Tring_iterator, construct_atomic) {
|
||||
int A[10];
|
||||
|
||||
//default constructor
|
||||
ring_iterator<int*, 10, true> i1;
|
||||
EXPECT_EQ(nullptr, i1.base());
|
||||
EXPECT_EQ(nullptr, i1.iter());
|
||||
EXPECT_EQ(10UL, i1.size());
|
||||
|
||||
// implementation specific (you can remove it freely)
|
||||
EXPECT_EQ(2*sizeof(int*), sizeof(i1));
|
||||
|
||||
// basic
|
||||
ring_iterator<int*, 10, true> i2(A);
|
||||
EXPECT_EQ(A, i2.base());
|
||||
EXPECT_EQ(A, i2.iter());
|
||||
EXPECT_EQ(10UL, i2.size());
|
||||
|
||||
// basic from assignment
|
||||
ring_iterator<int*, 10, true> i3 = A;
|
||||
EXPECT_EQ(A, i3.base());
|
||||
EXPECT_EQ(A, i3.iter());
|
||||
EXPECT_EQ(10UL, i3.size());
|
||||
|
||||
// basic with offset
|
||||
ring_iterator<int*, 10, true> i4(A, 5);
|
||||
EXPECT_EQ(A, i4.base());
|
||||
EXPECT_EQ(&A[5], i4.iter());
|
||||
EXPECT_EQ(10UL, i4.size());
|
||||
|
||||
// copy (Legacy iterator)
|
||||
auto i5 = i2;
|
||||
EXPECT_EQ(A, i5.base());
|
||||
EXPECT_EQ(A, i5.iter());
|
||||
EXPECT_EQ(10UL, i5.size());
|
||||
|
||||
// arbitrary type
|
||||
struct TT { int a,b,c; };
|
||||
std::array<TT, 10> t;
|
||||
ring_iterator<TT*, 10, true> it(t.data(), 2);
|
||||
EXPECT_EQ(t.begin(), it.base());
|
||||
EXPECT_EQ(&t[2], it.iter());
|
||||
EXPECT_EQ(10UL, it.size());
|
||||
}
|
||||
|
||||
// Legacy iterator atomic
|
||||
TEST(Tring_iterator, LegacyIterator_atomic) {
|
||||
|
||||
EXPECT_EQ(true, (std::is_same<int, typename ring_iterator<int*, 10, true>::value_type>::value));
|
||||
EXPECT_EQ(true, (std::is_same<std::ptrdiff_t, typename ring_iterator<int*, 10, true>::difference_type>::value));
|
||||
EXPECT_EQ(true, (std::is_same<int&, typename ring_iterator<int*, 10, true>::reference>::value));
|
||||
EXPECT_EQ(true, (std::is_same<int*, typename ring_iterator<int*, 10, true>::pointer>::value));
|
||||
EXPECT_EQ(true, (std::is_same<std::random_access_iterator_tag, typename ring_iterator<int*, 10, true>::iterator_category>::value));
|
||||
|
||||
int A[10] {0, 1, 2, 3, 4, 5, 6, 7, 8 , 9};
|
||||
ring_iterator<int*, 10, true> i1(A);
|
||||
|
||||
// copy constructible/assignable
|
||||
auto i2 = i1;
|
||||
EXPECT_EQ(A, i2.base());
|
||||
EXPECT_EQ(A, i2.iter());
|
||||
EXPECT_EQ(10UL, i2.size());
|
||||
|
||||
// dereferenceable - incrementable
|
||||
ring_iterator<int*, 10, true> i3(A);
|
||||
EXPECT_EQ(true, (std::is_reference<decltype(*i3)>::value));
|
||||
EXPECT_EQ(true, (std::is_same<ring_iterator<int*, 10, true>&, decltype(++i3)>::value));
|
||||
EXPECT_EQ(true, (std::is_reference<decltype((*i3++))>::value));
|
||||
|
||||
// more practical
|
||||
ring_iterator<int*, 10, true> i4(A);
|
||||
ring_iterator<int*, 10, true> i5(A, 9);
|
||||
EXPECT_EQ(A[0], *i4);
|
||||
EXPECT_EQ(&A[1], (++i4).iter());
|
||||
// check loop
|
||||
EXPECT_EQ(A[9], *i5);
|
||||
EXPECT_EQ(&A[0], (++i5).iter());
|
||||
}
|
||||
|
||||
// Legacy input iterator atomic
|
||||
TEST(Tring_iterator, LegacyInputIterator_atomic) {
|
||||
int A[10] {0, 1, 2, 3, 4, 5, 6, 7, 8 , 9};
|
||||
ring_iterator<int*, 10, true> i1(A), i2(A), i3(A, 1);
|
||||
|
||||
struct T { int m; };
|
||||
T B[5] { {0}, {1}, {2}, {3}, {4}};
|
||||
ring_iterator<T*, 5, true> it(B);
|
||||
|
||||
EXPECT_EQ (true, (std::is_same<bool, decltype(i1 == i2)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<bool, decltype(i1 != i2)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<int&, decltype(*i1)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<int, decltype(it->m)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>&, decltype(++i1)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<int&, decltype(*i1++)>::value));
|
||||
|
||||
// more practical
|
||||
EXPECT_EQ (true, i1 == i2);
|
||||
EXPECT_EQ (true, i1 != i3);
|
||||
EXPECT_EQ (0, *i1);
|
||||
EXPECT_EQ (0, it->m);
|
||||
EXPECT_EQ (true, (++i1 == i3));
|
||||
EXPECT_EQ (1, *i1++);
|
||||
EXPECT_EQ (2, *i1);
|
||||
}
|
||||
|
||||
// Legacy input iterator atomic
|
||||
TEST(Tring_iterator, LegacyOutputIterator_atomic) {
|
||||
int A[10] {0, 1, 2, 3, 4, 5, 6, 7, 8 , 9};
|
||||
ring_iterator<int*, 10, true> it(A);
|
||||
|
||||
EXPECT_EQ (true, (std::is_assignable<decltype(*it), int>::value));
|
||||
EXPECT_EQ (true, (std::is_assignable<decltype(*it++), int>::value));
|
||||
|
||||
// more practical
|
||||
*it = 42;
|
||||
EXPECT_EQ (42, A[0]);
|
||||
*it++ = 7;
|
||||
EXPECT_EQ (7, A[0]);
|
||||
EXPECT_EQ (&A[1], it.iter());
|
||||
}
|
||||
|
||||
// Legacy forward iterator atomic
|
||||
TEST(Tring_iterator, LegacyForwardIterator_atomic)
|
||||
{
|
||||
int A[10] {0, 1, 2, 3, 4, 5, 6, 7, 8 , 9};
|
||||
ring_iterator<int*, 10, true> it(A);
|
||||
|
||||
EXPECT_EQ (0, *it++);
|
||||
EXPECT_EQ (1, *it);
|
||||
}
|
||||
|
||||
// Legacy bidirectional iterator atomic
|
||||
TEST(Tring_iterator, LegacyBidirectionalIterator_atomic) {
|
||||
int A[10] {0, 1, 2, 3, 4, 5, 6, 7, 8 , 9};
|
||||
ring_iterator<int*, 10, true> it(A);
|
||||
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>&, decltype(--it)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>, decltype(it--)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<int&, decltype(*it--)>::value));
|
||||
|
||||
// more practical
|
||||
ring_iterator<int*, 10, true> i1(A), i2(A, 9);
|
||||
EXPECT_EQ (9, *i2--); // check loop also
|
||||
EXPECT_EQ (8, *i2);
|
||||
EXPECT_EQ (0, *i1--); // check loop also
|
||||
EXPECT_EQ (9, *i1);
|
||||
}
|
||||
|
||||
// Legacy random access iterator atomic
|
||||
TEST(Tring_iterator, LegacyRandomAccessIterator_atomic) {
|
||||
int A[10] {0, 1, 2, 3, 4, 5, 6, 7, 8 , 9};
|
||||
ring_iterator<int*, 10, true> it1(A), it2(A, 7);
|
||||
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>&, decltype(it1 += 7)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>, decltype(it1 + 7)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>, decltype(7 + it1)>::value));
|
||||
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>&, decltype(it1 -= 7)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<ring_iterator<int*, 10, true>, decltype(it1 - 7)>::value));
|
||||
|
||||
EXPECT_EQ (true, (std::is_same<std::ptrdiff_t, decltype(it1 - it2)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<int&, decltype(it1[7])>::value));
|
||||
|
||||
EXPECT_EQ (true, (std::is_same<bool, decltype(it1 < it2)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<bool, decltype(it1 > it2)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<bool, decltype(it1 <= it2)>::value));
|
||||
EXPECT_EQ (true, (std::is_same<bool, decltype(it1 >= it2)>::value));
|
||||
|
||||
// more practical
|
||||
ring_iterator<int*, 10, true> i1(A), i2(A);
|
||||
i1 += 7;
|
||||
EXPECT_EQ (7, *i1);
|
||||
i1 -= 7;
|
||||
EXPECT_EQ (0, *i1);
|
||||
i1 += 11;
|
||||
EXPECT_EQ (1, *i1);
|
||||
i1 -= 2;
|
||||
EXPECT_EQ (9, *i1);
|
||||
|
||||
EXPECT_EQ (7, *(i2+7));
|
||||
EXPECT_EQ (7, *(7+i2));
|
||||
EXPECT_EQ (1, *(i2+11));
|
||||
EXPECT_EQ (1, *(11+i2));
|
||||
EXPECT_EQ (7, *(i1-2));
|
||||
EXPECT_EQ (8, *(i2-2));
|
||||
|
||||
EXPECT_EQ (9, (i1 - i2));
|
||||
EXPECT_EQ (1, (i2 - i1)); // loop
|
||||
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
@@ -0,0 +1,274 @@
|
||||
/*!
|
||||
* \file span.cpp
|
||||
* \brief
|
||||
* Unit tests for span
|
||||
*
|
||||
* \copyright Copyright (C) 2020 Christos Choutouridis <christos@choutouridis.net>
|
||||
*
|
||||
* <dl class=\"section copyright\"><dt>License</dt><dd>
|
||||
* The MIT License (MIT)
|
||||
*
|
||||
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||
* of this software and associated documentation files (the "Software"), to deal
|
||||
* in the Software without restriction, including without limitation the rights
|
||||
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||
* copies of the Software, and to permit persons to whom the Software is
|
||||
* furnished to do so, subject to the following conditions:
|
||||
*
|
||||
* The above copyright notice and this permission notice shall be included in all
|
||||
* copies or substantial portions of the Software.
|
||||
*
|
||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||
* SOFTWARE.
|
||||
* </dd></dl>
|
||||
*
|
||||
*/
|
||||
#include <cont/span.h>
|
||||
#include <gtest/gtest.h>
|
||||
|
||||
#include <cont/deque.h>
|
||||
#include <vector>
|
||||
#include <type_traits>
|
||||
|
||||
// tests from https://github.com/tcbrindle/span/blob/master/test/test_span.cpp
|
||||
|
||||
namespace test_span {
|
||||
using namespace tbx;
|
||||
|
||||
TEST (Tspan, default_constructors) {
|
||||
EXPECT_EQ (true, ( std::is_nothrow_default_constructible<span<int>>::value));
|
||||
EXPECT_EQ (true, ( std::is_nothrow_default_constructible<span<int, 0>>::value));
|
||||
EXPECT_EQ (true, (!std::is_nothrow_default_constructible<span<int, 42>>::value));
|
||||
|
||||
constexpr span<int> s1{};
|
||||
|
||||
EXPECT_EQ (0UL, s1.size());
|
||||
EXPECT_EQ (nullptr, s1.data());
|
||||
EXPECT_EQ (s1.begin(), s1.end());
|
||||
|
||||
constexpr span<int, 0> s2{};
|
||||
|
||||
EXPECT_EQ (0UL, s2.size());
|
||||
EXPECT_EQ (nullptr, s2.data());
|
||||
EXPECT_EQ (s2.begin(), s2.end());
|
||||
}
|
||||
|
||||
TEST (Tspan, pointer_constructors) {
|
||||
// pointer length
|
||||
EXPECT_EQ (true, (std::is_constructible<span<int>, int*, int>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<const int>, int*, int>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<const int>, const int*, int>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<int, 42>, int*, int>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<const int, 42>, int*, int>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<const int, 42>, const int*, int>::value));
|
||||
|
||||
int arr[] = {1, 2, 3};
|
||||
|
||||
// dynamic size
|
||||
span<int> s1(arr, 3);
|
||||
EXPECT_EQ (3UL, s1.size());
|
||||
EXPECT_EQ (arr, s1.data());
|
||||
EXPECT_EQ (std::begin(arr), s1.begin());
|
||||
EXPECT_EQ (std::end(arr), s1.end());
|
||||
|
||||
// fixed size
|
||||
span<int, 3> s2(arr, 3);
|
||||
EXPECT_EQ (3UL, s2.size());
|
||||
EXPECT_EQ (arr, s2.data());
|
||||
EXPECT_EQ (std::begin(arr), s2.begin());
|
||||
EXPECT_EQ (std::end(arr), s2.end());
|
||||
|
||||
// pointer pointer
|
||||
EXPECT_EQ (true, (std::is_constructible<span<int>, int*, int*>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<float>, float*, float*>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<int, 42>, int*, int*>::value));
|
||||
EXPECT_EQ (true, (std::is_constructible<span<float, 42>, float*, float*>::value));
|
||||
|
||||
// dynamic size
|
||||
span<int> s3(arr, arr + 3);
|
||||
EXPECT_EQ (3UL, s3.size());
|
||||
EXPECT_EQ (arr, s3.data());
|
||||
EXPECT_EQ (std::begin(arr), s3.begin());
|
||||
EXPECT_EQ (std::end(arr), s3.end());
|
||||
|
||||
// fixed size
|
||||
span<int, 3> s4(arr, arr + 3);
|
||||
EXPECT_EQ (3UL, s4.size());
|
||||
EXPECT_EQ (arr, s4.data());
|
||||
EXPECT_EQ (std::begin(arr), s4.begin());
|
||||
EXPECT_EQ (std::end(arr), s4.end());
|
||||
}
|
||||
|
||||
TEST (Tspan, C_array_constructors) {
|
||||
using int_array_t = int[3];
|
||||
using float_array_t = float[3];
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<int>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int>, float_array_t>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int>, float_array_t>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<int, 3>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 3>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 3>, float_array_t&>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int, 3>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int, 3>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 3>, float_array_t>::value));
|
||||
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 42>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 42>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 42>, float_array_t&>::value));
|
||||
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 42>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 42>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 42>, float_array_t&>::value));
|
||||
|
||||
int arr[] = {1, 2, 3};
|
||||
|
||||
// non-const dynamic size
|
||||
span<int> s1{arr};
|
||||
EXPECT_EQ (s1.size(), 3UL);
|
||||
EXPECT_EQ (s1.data(), arr);
|
||||
EXPECT_EQ (s1.begin(), std::begin(arr));
|
||||
EXPECT_EQ (s1.end(), std::end(arr));
|
||||
|
||||
// non-const dynamic size
|
||||
span<const int> s2{arr};
|
||||
EXPECT_EQ (s2.size(), 3UL);
|
||||
EXPECT_EQ (s2.data(), arr);
|
||||
EXPECT_EQ (s2.begin(), std::begin(arr));
|
||||
EXPECT_EQ (s2.end(), std::end(arr));
|
||||
|
||||
// non-const fixed size
|
||||
span<int, 3> s3{arr};
|
||||
EXPECT_EQ (s3.size(), 3UL);
|
||||
EXPECT_EQ (s3.data(), arr);
|
||||
EXPECT_EQ (s3.begin(), std::begin(arr));
|
||||
EXPECT_EQ (s3.end(), std::end(arr));
|
||||
|
||||
// non-const fixed size
|
||||
span<const int, 3> s4{arr};
|
||||
EXPECT_EQ (s4.size(), 3UL);
|
||||
EXPECT_EQ (s4.data(), arr);
|
||||
EXPECT_EQ (s4.begin(), std::begin(arr));
|
||||
EXPECT_EQ (s4.end(), std::end(arr));
|
||||
}
|
||||
|
||||
TEST (Tspan, array_constructors) {
|
||||
using int_array_t = std::array<int, 3>;
|
||||
using float_array_t = std::array<float, 3>;
|
||||
using zero_array_t = std::array<int, 0>;
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<int>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int>, float_array_t>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int>, float_array_t const&>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<int, 3>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 3>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 3>, float_array_t>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int, 3>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_nothrow_constructible<span<const int, 3>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 3>, float_array_t const&>::value));
|
||||
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 42>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 42>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 42>, float_array_t const&>::value));
|
||||
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 42>, int_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 42>, int_array_t const&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<const int, 42>, float_array_t&>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_constructible<span<int>, zero_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int>, const zero_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_constructible<span<const int>, zero_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_constructible<span<const int>, const zero_array_t&>::value));
|
||||
|
||||
EXPECT_EQ (true, ( std::is_constructible<span<int, 0>, zero_array_t&>::value));
|
||||
EXPECT_EQ (true, (!std::is_constructible<span<int, 0>, const zero_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_constructible<span<const int, 0>, zero_array_t&>::value));
|
||||
EXPECT_EQ (true, ( std::is_constructible<span<const int, 0>, const zero_array_t&>::value));
|
||||
|
||||
|
||||
int_array_t arr = {1, 2, 3};
|
||||
|
||||
// non-const, dynamic size
|
||||
span<int> s1{arr};
|
||||
EXPECT_EQ(s1.size(), 3UL);
|
||||
EXPECT_EQ(s1.data(), arr.data());
|
||||
EXPECT_EQ(s1.begin(), arr.data());
|
||||
EXPECT_EQ(s1.end(), arr.data() + 3);
|
||||
|
||||
|
||||
//const, dynamic size
|
||||
span<int const> s2{arr};
|
||||
EXPECT_EQ(s2.size(), 3UL);
|
||||
EXPECT_EQ(s2.data(), arr.data());
|
||||
EXPECT_EQ(s2.begin(), arr.data());
|
||||
EXPECT_EQ(s2.end(), arr.data() + 3);
|
||||
|
||||
|
||||
// non-const, static size
|
||||
span<int, 3> s3{arr};
|
||||
EXPECT_EQ(s3.size(), 3UL);
|
||||
EXPECT_EQ(s3.data(), arr.data());
|
||||
EXPECT_EQ(s3.begin(), arr.data());
|
||||
EXPECT_EQ(s3.end(), arr.data() + 3);
|
||||
|
||||
// const, dynamic size
|
||||
span<int const, 3> s4{arr};
|
||||
EXPECT_EQ(s4.size(), 3UL);
|
||||
EXPECT_EQ(s4.data(), arr.data());
|
||||
EXPECT_EQ(s4.begin(), arr.data());
|
||||
EXPECT_EQ(s4.end(), arr.data() + 3);
|
||||
}
|
||||
|
||||
// TEST (Tspan, containter_constructors) {
|
||||
// using container_t = tbx::deque<int, 3>;
|
||||
//
|
||||
// EXPECT_EQ (true, ( std::is_constructible<span<int>, container_t&>::value));
|
||||
// EXPECT_EQ (true, (!std::is_constructible<span<int>, const container_t&>::value));
|
||||
//
|
||||
// EXPECT_EQ (true, ( std::is_constructible<span<const int>, container_t&>::value));
|
||||
// EXPECT_EQ (true, ( std::is_constructible<span<const int>, const container_t&>::value));
|
||||
//
|
||||
// EXPECT_EQ (true, (!std::is_constructible<span<int, 3>, container_t&>::value));
|
||||
// EXPECT_EQ (true, (!std::is_constructible<span<int, 3>, const container_t&>::value));
|
||||
//
|
||||
// EXPECT_EQ (true, (!std::is_constructible<span<const int, 3>, container_t&>::value));
|
||||
// EXPECT_EQ (true, (!std::is_constructible<span<const int, 3>, const container_t&>::value));
|
||||
//
|
||||
// container_t cont = {1, 2, 3};
|
||||
// const container_t ccont = {1, 2, 3};
|
||||
//
|
||||
// // non-const, dynamic size
|
||||
// span<int> s1(cont);
|
||||
// EXPECT_EQ(s1.size(), 3UL);
|
||||
// EXPECT_EQ(s1.data(), cont.data());
|
||||
// EXPECT_EQ(s1.begin(), cont.data());
|
||||
// EXPECT_EQ(s1.end(), cont.data() + 3);
|
||||
//
|
||||
//
|
||||
// //const, dynamic size
|
||||
// span<int const> s2(cont);
|
||||
// EXPECT_EQ(s2.size(), 3UL);
|
||||
// EXPECT_EQ(s2.data(), cont.data());
|
||||
// EXPECT_EQ(s2.begin(), cont.data());
|
||||
// EXPECT_EQ(s2.end(), cont.data() + 3);
|
||||
//
|
||||
// }
|
||||
|
||||
}
|
||||
Reference in New Issue
Block a user