coffee/etl
1
0
Fork 0
mirror of https://github.com/ETLCPP/etl.git synced 2026-11-09 22:59:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

New tests for new classes

Browse Source
This commit is contained in:
jwellbelove 2014-11-19 18:37:38 +00:00
parent e5a9fa3127
commit 878a103e99
3 changed files with 1104 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

553
test/test_forward_list.cpp Normal file
View File

@ -0,0 +1,553 @@
/******************************************************************************
The MIT License(MIT)
Embedded Template Library.
Copyright(c) 2014 jwellbelove
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.
******************************************************************************/
#include <UnitTest++/UnitTest++.h>
#include "ExtraCheckMacros.h"
#include "../forward_list.h"
#include <algorithm>
#include <array>
#include <forward_list>
#include <vector>
namespace
{
SUITE(TestForwardList)
{
const size_t SIZE = 10;
typedef etl::forward_list<int, SIZE> Data;
typedef std::forward_list<int> CompareData;
typedef std::vector<int> InitialData;
InitialData unsorted_data;
InitialData sorted_data;
InitialData non_unique_data;
InitialData small_data;
bool are_equal;
//*************************************************************************
struct SetupFixture
{
SetupFixture()
{
unsorted_data = { 1, 0, 3, 2, 5, 4, 7, 6, 9, 8 };
sorted_data = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
non_unique_data = { 0, 0, 1, 1, 2, 3, 3, 3, 4, 5 };
small_data = { 0, 1, 2, 3, 4, 5 };
}
};
//*************************************************************************
TEST_FIXTURE(SetupFixture, DefaultConstructor)
{
Data data;
CHECK(data.empty());
CHECK_EQUAL(data.max_size(), SIZE);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, ConstructorSize)
{
const size_t INITIAL_SIZE = 4;
Data data(INITIAL_SIZE);
CHECK(!data.empty());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, ConstructorSizeExcess)
{
CHECK_THROW(Data data(SIZE + 1), etl::forward_list_full);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, ConstructorSizeValue)
{
const size_t INITIAL_SIZE = 4;
const int INITIAL_VALUE = 1;
std::array<int, INITIAL_SIZE> compare_data;
compare_data.fill(INITIAL_VALUE);
Data data(INITIAL_SIZE, INITIAL_VALUE);
CHECK(!data.empty());
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, ConstructorRange)
{
Data data(sorted_data.begin(), sorted_data.end());
CHECK(!data.empty());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, CopyConstructor)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
Data other_data(data);
CHECK(std::equal(data.begin(), data.end(), other_data.begin()));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Iterator)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(compare_data.begin(), compare_data.end());
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, ConstIterator)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(compare_data.begin(), compare_data.end());
are_equal = std::equal(data.cbegin(), data.cend(), compare_data.cbegin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, ResizeUpValue)
{
const size_t INITIAL_SIZE = 4;
const size_t NEW_SIZE = 8;
const int VALUE = 1;
Data data(INITIAL_SIZE, VALUE);
data.resize(NEW_SIZE, VALUE);
CompareData compare_data(INITIAL_SIZE, VALUE);
compare_data.resize(NEW_SIZE, VALUE);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, ResizeExcess)
{
const size_t INITIAL_SIZE = 4;
Data data(INITIAL_SIZE);
CHECK_THROW(data.resize(data.max_size() + 1), etl::forward_list_full);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Clear)
{
Data data(sorted_data.begin(), sorted_data.end());
data.clear();
CHECK(data.empty());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, AssignRange)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data;
// Do it twice. We should only get one copy.
data.assign(compare_data.begin(), compare_data.end());
data.assign(compare_data.begin(), compare_data.end());
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, AssignSizeValue)
{
const size_t INITIAL_SIZE = 4;
const int VALUE = 1;
CompareData compare_data(INITIAL_SIZE, VALUE);
Data data;
// Do it twice. We should only get one copy.
data.assign(INITIAL_SIZE, VALUE);
data.assign(INITIAL_SIZE, VALUE);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, AssignSizeValueExcess)
{
const int VALUE = 1;
Data data;
CHECK_THROW(data.assign(data.max_size() + 1, VALUE), etl::forward_list_full);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, InsertAfterPositionValue)
{
const size_t INITIAL_SIZE = 4;
const int VALUE = 1;
const int INSERT_VALUE = 2;
CompareData compare_data(INITIAL_SIZE, VALUE);
Data data(INITIAL_SIZE, VALUE);
size_t offset = 2;
Data::iterator i_data = data.begin();
std::advance(i_data, offset);
CompareData::iterator i_compare_data = compare_data.begin();
std::advance(i_compare_data, offset);
data.insert_after(i_data, INSERT_VALUE);
compare_data.insert_after(i_compare_data, INSERT_VALUE);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
offset = 0;
i_data = data.begin();
std::advance(i_data, offset);
i_compare_data = compare_data.begin();
std::advance(i_compare_data, offset);
data.insert_after(i_data, INSERT_VALUE);
compare_data.insert_after(i_compare_data, INSERT_VALUE);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, InsertAfterRange)
{
std::vector<int> test1 = { 1, 2, 3, 4, 5 };
std::vector<int> test2 = { 6, 7, 8, 9, 10 };
CompareData compare_data(test1.begin(), test1.end());
Data data(test1.begin(), test1.end());
compare_data.insert_after(compare_data.before_begin(), test2.begin(), test2.end());
data.insert_after(data.before_begin(), test2.begin(), test2.end());
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
compare_data.assign(test1.begin(), test1.end());
data.assign(test1.begin(), test1.end());
CompareData::iterator icd = compare_data.begin();
Data::iterator id = data.begin();
std::advance(icd, 3);
std::advance(id, 3);
compare_data.insert_after(icd, test2.begin(), test2.end());
data.insert_after(id, test2.begin(), test2.end());
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, PushFront)
{
CompareData compare_data;
Data data;
compare_data.push_front(1);
compare_data.push_front(2);
compare_data.push_front(3);
compare_data.push_front(4);
compare_data.push_front(5);
compare_data.push_front(6);
CHECK_NO_THROW(data.push_front(1));
CHECK_NO_THROW(data.push_front(2));
CHECK_NO_THROW(data.push_front(3));
CHECK_NO_THROW(data.push_front(4));
CHECK_NO_THROW(data.push_front(5));
CHECK_NO_THROW(data.push_front(6));
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, PushFrontExcess)
{
Data data;
CHECK_NO_THROW(data.push_front(1));
CHECK_NO_THROW(data.push_front(2));
CHECK_NO_THROW(data.push_front(3));
CHECK_NO_THROW(data.push_front(4));
CHECK_NO_THROW(data.push_front(5));
CHECK_NO_THROW(data.push_front(6));
CHECK_NO_THROW(data.push_front(7));
CHECK_NO_THROW(data.push_front(8));
CHECK_NO_THROW(data.push_front(9));
CHECK_NO_THROW(data.push_front(10));
CHECK_THROW(data.push_front(11) , etl::forward_list_full);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, PushFrontPopFront)
{
Data data;
for (size_t i = 0; i < 2 * data.max_size(); ++i)
{
CHECK_NO_THROW(data.push_front(i));
data.pop_front();
}
CHECK(data.empty());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, EraseAfterSingle)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
Data::iterator i_data = data.begin();
std::advance(i_data, 2);
CompareData::iterator i_compare_data = compare_data.begin();
std::advance(i_compare_data, 2);
i_compare_data = compare_data.erase_after(i_compare_data);
i_data = data.erase_after(i_data);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
CHECK(*i_compare_data == *i_data);
i_compare_data = compare_data.erase_after(compare_data.begin());
i_data = data.erase_after(data.begin());
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
are_equal = *i_data == *i_compare_data;
CHECK(are_equal);
// Move to the last value and erase.
i_compare_data = compare_data.begin();
//std::advance(i_compare_data, compare_data.size() - 1);
i_compare_data = compare_data.erase_after(i_compare_data);
i_data = data.begin();
//std::advance(i_data, data.size() - 1);
i_data = data.erase_after(i_data);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
are_equal = *i_data == *i_compare_data;
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, EraseAfterRange)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
Data::iterator i_data_1 = data.begin();
std::advance(i_data_1, 2);
Data::iterator i_data_2 = data.begin();
std::advance(i_data_2, 4);
CompareData::iterator i_compare_data_1 = compare_data.begin();
std::advance(i_compare_data_1, 2);
CompareData::iterator i_compare_data_2 = compare_data.begin();
std::advance(i_compare_data_2, 4);
compare_data.erase_after(i_compare_data_1, i_compare_data_2);
data.erase_after(i_data_1, i_data_2);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, EraseAfterAll)
{
Data data(sorted_data.begin(), sorted_data.end());
data.erase_after(data.before_begin(), data.end());
CHECK(data.empty());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Front)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
CHECK_EQUAL(compare_data.front(), data.front());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Assignment)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
Data other_data;
other_data = data;
CHECK_EQUAL(data.size(), other_data.size());
are_equal = std::equal(data.begin(), data.end(), other_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Unique)
{
CompareData compare_data(non_unique_data.begin(), non_unique_data.end());
Data data(non_unique_data.begin(), non_unique_data.end());
compare_data.unique();
data.unique();
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Remove)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
compare_data.remove(7);
data.remove(7);
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, RemoveIf)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
compare_data.remove_if(std::bind2nd(std::equal_to<int>(), 7));
data.remove_if(std::bind2nd(std::equal_to<int>(), 7));
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Reverse)
{
CompareData compare_data(sorted_data.begin(), sorted_data.end());
Data data(sorted_data.begin(), sorted_data.end());
compare_data.reverse();
data.reverse();
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Sort)
{
CompareData compare_data(unsorted_data.begin(), unsorted_data.end());
Data data(unsorted_data.begin(), unsorted_data.end());
compare_data.sort();
data.sort();
are_equal = std::equal(data.begin(), data.end(), compare_data.begin());
CHECK(are_equal);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, Swap)
{
Data first(unsorted_data.begin(), unsorted_data.end());
Data second(small_data.begin(), small_data.end());
swap(first, second);
are_equal = std::equal(first.begin(), first.end(), small_data.begin());
CHECK(are_equal);
are_equal = std::equal(second.begin(), second.end(), unsorted_data.begin());
CHECK(are_equal);
}
};
}

121
test/test_smallest.cpp Normal file
View File

@ -0,0 +1,121 @@
/******************************************************************************
The MIT License(MIT)
Embedded Template Library.
Copyright(c) 2014 jwellbelove
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.
******************************************************************************/
#include <UnitTest++/UnitTest++.h>
#include "../smallest.h"
#include <type_traits>
namespace
{
SUITE(test_smallst)
{
//*************************************************************************
TEST(test_pod)
{
size_t size;
bool type;
size = etl::smallest_type<char, short, int>::size;
type = std::is_same<char, etl::smallest_type<char, short, int>::type>::value;
CHECK_EQUAL(sizeof(char), size);
CHECK(type);
size = etl::smallest_type<int, char, short>::size;
type = std::is_same<char, etl::smallest_type<char, short, int>::type>::value;
CHECK_EQUAL(sizeof(char), size);
CHECK(type);
}
//*************************************************************************
TEST(test_non_pod)
{
size_t size;
bool type;
struct S1 { char a; char b; char c; };
struct S2 { char a; short b; char c; };
struct S3 { int a; short b; char c; };
size = etl::smallest_type<S1, S2, S3>::size;
type = std::is_same<S1, etl::smallest_type<S1, S2, S3>::type>::value;
CHECK_EQUAL(sizeof(S1), size);
CHECK(type);
size = etl::smallest_type<S2, S3, S1>::size;
type = std::is_same<S1, etl::smallest_type<S2, S3, S1>::type>::value;
CHECK_EQUAL(sizeof(S1), size);
CHECK(type);
}
//*************************************************************************
TEST(test_smallest_size_for_bits)
{
bool type;
type = std::is_same<uint8_t, etl::smallest_uint_for_bits<7>::type>::value;
CHECK(type);
type = std::is_same<uint8_t, etl::smallest_uint_for_bits<8>::type>::value;
CHECK(type);
type = std::is_same<uint16_t, etl::smallest_uint_for_bits<9>::type>::value;
CHECK(type);
type = std::is_same<uint16_t, etl::smallest_uint_for_bits<15>::type>::value;
CHECK(type);
type = std::is_same<uint16_t, etl::smallest_uint_for_bits<16>::type>::value;
CHECK(type);
type = std::is_same<uint32_t, etl::smallest_uint_for_bits<17>::type>::value;
CHECK(type);
type = std::is_same<uint32_t, etl::smallest_uint_for_bits<31>::type>::value;
CHECK(type);
type = std::is_same<uint32_t, etl::smallest_uint_for_bits<32>::type>::value;
CHECK(type);
type = std::is_same<uint64_t, etl::smallest_uint_for_bits<33>::type>::value;
CHECK(type);
type = std::is_same<uint64_t, etl::smallest_uint_for_bits<63>::type>::value;
CHECK(type);
type = std::is_same<uint64_t, etl::smallest_uint_for_bits<64>::type>::value;
CHECK(type);
type = std::is_same<uint64_t, etl::smallest_uint_for_bits<65>::type>::value;
CHECK(type);
}
};
}

430
test/test_variant.cpp Normal file
View File

@ -0,0 +1,430 @@
/******************************************************************************
The MIT License(MIT)
Embedded Template Library.
Copyright(c) 2014 jwellbelove
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.
******************************************************************************/
#include <UnitTest++/UnitTest++.h>
#include "../variant.h"
#include <array>
#include <vector>
#include <algorithm>
// Test classes for polymorphic tests.
struct base
{
base()
: value(0)
{
}
virtual void set() = 0;
int value;
};
struct not_base
{
not_base()
: value(0)
{
}
virtual void set() = 0;
int value;
};
struct derived_1 : public base
{
void set()
{
value = 1;
}
};
struct derived_2 : public base
{
void set()
{
value = 2;
}
};
// Test variant types.
typedef etl::variant<char, int, std::string> test_variant_1;
typedef etl::variant<int, short, double> test_variant_2;
typedef etl::variant<derived_1, derived_2> test_variant_polymorphic;
typedef etl::variant<char, unsigned char, short, unsigned short, int, unsigned int, long, unsigned long> test_variant_max_types;
// This line should compile with no errors.
test_variant_max_types variant_max;
namespace
{
SUITE(test_alignment)
{
TEST(test_lignment)
{
typedef etl::variant<char, unsigned char> test_variant_a;
typedef etl::variant<char, short> test_variant_b;
typedef etl::variant<char, int> test_variant_c;
typedef etl::variant<char, double> test_variant_d;
CHECK_EQUAL(int(etl::alignment_of<char>::value), int(etl::alignment_of<test_variant_a>::value));
CHECK_EQUAL(int(etl::alignment_of<short>::value), int(etl::alignment_of<test_variant_b>::value));
CHECK_EQUAL(int(etl::alignment_of<int>::value), int(etl::alignment_of<test_variant_c>::value));
CHECK_EQUAL(int(etl::alignment_of<double>::value), int(etl::alignment_of<test_variant_d>::value));
}
//*************************************************************************
TEST(test_constructor_default)
{
CHECK_NO_THROW(test_variant_1 variant);
}
//*************************************************************************
TEST(text_constructor_value)
{
// Char.
char c = 'a';
test_variant_1 variant_char(c);
CHECK(variant_char.is_type<char>());
CHECK(variant_char.is_valid());
CHECK_EQUAL(c, variant_char.get<char>());
// Int.
int i = 1;
test_variant_1 variant_int(i);
CHECK(variant_int.is_type<int>());
CHECK(variant_int.is_valid());
CHECK_EQUAL(i, variant_int.get<int>());
// String.
std::string text("Some Text");
test_variant_1 variant_text(text);
CHECK(variant_text.is_type<std::string>());
CHECK(variant_text.is_valid());
CHECK_EQUAL(text, variant_text.get<std::string>());
}
//*************************************************************************
TEST(test_copy_constructor)
{
std::string text("Some Text");
test_variant_1 variant_1(text);
test_variant_1 variant_2(variant_1);
CHECK(variant_1.is_same_type(variant_2));
CHECK(variant_2.is_valid());
CHECK_EQUAL(variant_1.get<std::string>(), variant_2.get<std::string>());
}
//*************************************************************************
TEST(test_assign_from_value)
{
std::string text("Some Text");
test_variant_1 variant;
variant = text;
CHECK_EQUAL(text, variant.get<std::string>());
CHECK(variant.is_valid());
}
//*************************************************************************
TEST(test_assign_from_variant)
{
std::string text("Some Text");
test_variant_1 variant_1;
test_variant_1 variant_2;
variant_1 = text;
variant_2 = variant_1;
CHECK_EQUAL(text, variant_2.get<std::string>());
CHECK(variant_2.is_valid());
}
//*************************************************************************
TEST(test_assignment_incorrect_type_exception)
{
std::string text("Some Text");
test_variant_1 variant;
variant = text;
CHECK_THROW(int i = variant, etl::variant_incorrect_type_exception);
}
//*************************************************************************
TEST(test_is_same_type)
{
std::string text("Some Text");
test_variant_1 variant_1;
test_variant_1 variant_2;
variant_1 = 1;
variant_2 = 2;
CHECK(variant_1.is_same_type(variant_2));
variant_1 = 'a';
variant_2 = text;
CHECK(!variant_1.is_same_type(variant_2));
}
//*************************************************************************
TEST(test_is_same_type_different_variants)
{
test_variant_1 variant_1;
test_variant_2 variant_2;
variant_1 = 1;
variant_2 = 2;
CHECK(variant_1.is_same_type(variant_2));
variant_1 = 'a';
variant_2 = 3.3;
CHECK(!variant_1.is_same_type(variant_2));
}
//*************************************************************************
TEST(Testis_supported_type)
{
CHECK(test_variant_1::is_supported_type<char>());
CHECK(test_variant_1::is_supported_type<int>());
CHECK(test_variant_1::is_supported_type<std::string>());
CHECK(!test_variant_1::is_supported_type<short>());
}
//*************************************************************************
TEST(TestIsValid)
{
test_variant_1 variant;
CHECK(!variant.is_valid());
variant = 1;
CHECK(variant.is_valid());
}
//*************************************************************************
TEST(TestIsType)
{
test_variant_1 variant;
variant = 1;
CHECK(variant.is_type<int>());
variant = 'a';
CHECK(variant.is_type<char>());
variant = std::string("Some Text");
CHECK(variant.is_type<std::string>());
}
//*************************************************************************
TEST(TestGet)
{
test_variant_1 variant;
variant = 1;
CHECK_EQUAL(1, variant.get<int>());
variant = 'a';
CHECK_EQUAL('a', variant.get<char>());
variant = std::string("Some Text");
CHECK_EQUAL(std::string("Some Text"), variant.get<std::string>());
}
//*************************************************************************
TEST(TestGetException)
{
test_variant_1 variant;
variant = 1;
CHECK_THROW(char c =variant.get<char>(), etl::variant_exception);
}
//*************************************************************************
TEST(TestGetReference)
{
test_variant_1 variant;
variant = 1;
int& ir = variant.get<int>();
CHECK_EQUAL(ir, variant.get<int>());
ir = 2;
CHECK_EQUAL(ir, variant.get<int>());
}
//*************************************************************************
TEST(TestGetConstReference)
{
test_variant_1 variant;
variant = 1;
const int& ir = variant.get<int>();
CHECK_EQUAL(1, ir);
variant = 2;
CHECK_EQUAL(2, ir);
}
//*************************************************************************
TEST(TestCallReader)
{
class reader : public test_variant_1::reader
{
public:
reader() : c(' '), s(""), i(0)
{
}
void read(char c_) override
{
c = c_;
}
void read(int i_)
{
i = i_;
}
void read(const std::string& s_)
{
s = s_;
}
char c;
int i;
std::string s;
};
test_variant_1 variant;
reader reader;
variant = 'a';
variant.call(reader);
CHECK_EQUAL(variant.get<char>(), reader.c);
variant = std::string("Some Text");
variant.call(reader);
CHECK_EQUAL(variant.get<std::string>(), reader.s);
variant = 1;
variant.call(reader);
CHECK_EQUAL(variant.get<int>(), reader.i);
}
//*************************************************************************
TEST(TestConversionOperators)
{
test_variant_1 variant;
variant = 1;
int i = variant;
CHECK_EQUAL(i, variant.get<int>());
variant = std::string("Some Text");
std::string text = variant;
CHECK_EQUAL(text, variant.get<std::string>());
variant = 'a';
char c = variant;
CHECK_EQUAL(c, variant.get<char>());
}
//*************************************************************************
TEST(TestConversionOperatorsConstReference)
{
test_variant_1 variant;
variant = 1;
const int& i = variant;
CHECK_EQUAL(i, variant.get<int>());
variant = 2;
CHECK_EQUAL(i, variant.get<int>());
variant = std::string("Some Text");
const std::string& text = variant;
CHECK_EQUAL(text, variant.get<std::string>());
variant = std::string("Text2");
CHECK_EQUAL(text, variant.get<std::string>());
variant = 'a';
const char& c = variant;
CHECK_EQUAL(c, variant.get<char>());
variant = 'B';
CHECK_EQUAL(c, variant.get<char>());
}
//*************************************************************************
TEST(TestSwap)
{
test_variant_1 variant_1;
test_variant_1 variant_2;
variant_1 = 1;
variant_2 = std::string("Some Text");
std::swap(variant_1, variant_2);
CHECK_EQUAL(1, variant_2.get<int>());
CHECK_EQUAL(std::string("Some Text"), variant_1.get<std::string>());
}
//*************************************************************************
TEST(TestClear)
{
test_variant_1 variant;
variant = 1;
variant.clear();
CHECK(!variant.is_valid());
}
//*************************************************************************
TEST(TestPolymorphic)
{
test_variant_polymorphic variant;
variant = derived_1();
variant.upcast<base>().set();
CHECK_EQUAL(1, variant.get<derived_1>().value);
variant = derived_2();
variant.upcast<base>().set();
CHECK_EQUAL(2, variant.get<derived_2>().value);
}
};
}