mirror of
https://github.com/ETLCPP/etl.git
synced 2026-05-01 11:29:09 +08:00
* Resolve all C++ -O2 warnings Resolve all C++ -O2 warnings Resolve all C++ -O2 warnings * Updated release notes and version * Made unit test suite names unique * Added etl::bit_v for C++17 * add stringify macro (#741) * Add include/linux/stringify.h from Linux kernel 2.6.12-rc2 (cherry picked from commit1da177e4c3) * Make __stringify support variable argument macros too For example: __stringify(__entry->irq, __entry->ret) will now convert it to: "REC->irq, REC->ret" It also still supports single arguments as the old macro did. Signed-off-by: Zhao Lei <zhaolei@cn.fujitsu.com> Acked-by: Frederic Weisbecker <fweisbec@gmail.com> Cc: Steven Rostedt <rostedt@goodmis.org> LKML-Reference: <49DC6751.30308@cn.fujitsu.com> Signed-off-by: Ingo Molnar <mingo@elte.hu> (cherry picked from commit8f7c2c3731) * Add documentation. * Adjust names in order to satisfy naming convention. * Use __VA_ARGS__ instead a GNU extension as this works with more compilers. Works with the newest versions of ICCAVR, GCC, CLANG and MSCV. C++11 may be required. * Adjust to ETL folder structure. * Change include guard to the one usual in ETL. * Add definition guard for STRINGIFY. --------- Co-authored-by: Linus Torvalds <torvalds@ppc970.osdl.org> Co-authored-by: Zhaolei <zhaolei@cn.fujitsu.com> * Updated stringify macro for variadic parameters * Edited comments * Added multi char type strcmp, strncmp, strcpy & strncpy * Added support for self transitions * Remove some unreachable code in bitset_new.h (#743) Warning[Pe111]: statement is unreachable * Re-enabled tests for etl::string_ext * Changes require for non-virtual messages * MutexMessageRouter example * Allow C++03 delegate in etl::callback_timer * #745 Assertion triggered in hash.h when compiling for MSP430 * Removed redundant #includes * Removed unused variable Minor format edit * Added time_to_next() status function * Added 'sentence case' versions of constants * Added C++03 compatible etl::move or etl::move_backward * Added c++03 zero parameter emplace member functions * Fix issue of release of an object on empty an pool * Remove used variable * Remove used variable * Change to require semicolons after debug count macros. Added error assert for vector reserve greater than capacity. * Added destructor to CMSIS_RTOS2 mutex * Updated version and release notes * Removed semicolon warnings * Updated vesrion and release notes * #753 [porting] IAR's overload resolution struggles with etl::span::span(etl::array&) #754 ambiguous etl::bit_stream_reader::bit_stream_reader() for some etl::span * #755 warning about constexpr in array.h * Re-enabled tests * const_reference at(size_t i) const is only constexpr from C++14 * Added conversion operators to std::span * MacOS clang span issue * MacOS clang span issue * MacOS clang span issue * MacOS clang span issue * MacOS clang span issue * Updated version and release notes * Possible fix for #756 * Fixed: move assignment not working for non-empty containers (#759) * Updated release notes * Make "private" includes relativ (#761) Avoid "include not found" when indirectly including etl-header Co-authored-by: Andreas Pelczer <pelczer@stoerk-tronic.com> * Make "private" includes relativ (#761) Avoid "include not found" when indirectly including etl-header Co-authored-by: Andreas Pelczer <pelczer@stoerk-tronic.com> * Remove BOM from random.h (#762) random.h is the only file with UTF8-BOM and IAR can not handle it. For compatibility reasons it should be removed. Co-authored-by: Andreas Pelczer <pelczer@stoerk-tronic.com> * Enabled etl::overload for C++11 & C++14 * Added conversion operators to std::span MacOS clang span issue MacOS clang span issue MacOS clang span issue MacOS clang span issue MacOS clang span issue * Updated version and release notes * Possible fix for #756 * Fixed: move assignment not working for non-empty containers (#759) * Updated release notes * Make "private" includes relativ (#761) Avoid "include not found" when indirectly including etl-header Co-authored-by: Andreas Pelczer <pelczer@stoerk-tronic.com> * Remove BOM from random.h (#762) random.h is the only file with UTF8-BOM and IAR can not handle it. For compatibility reasons it should be removed. Co-authored-by: Andreas Pelczer <pelczer@stoerk-tronic.com> * Enabled etl::overload for C++11 & C++14 * Commets added * #766 etl::unique_ptr::reset() can call deleter with nullptr argument * Refactored storage for etl::optional * Updated release notes * Updated release notes * Test name updates * Fixed alignment functionality * Updated versions * Updated versions * Initial code * Final changes * Fix maybe-uninitialized warning * Fix maybe-uninitialized warning * Added etl::string::fill() * Added etl::string interface to etl::base64 * static_cast for string_view & array_view size() member functions * Return raw pointer for `etl::multi_span::operator->()`. (#773) - using `operator*()` in case getting the current element is changed one day - using `&` to get the address Simply returning `p_value` may break in case the internal type of `p_value` would change. This way it is more robust to changes. * Added -> operator test * #773 Return raw pointer for etl::multi_span::operator->() * static_cast for string_view & array_view size() member functions * Initial code * Final changes * Fix maybe-uninitialized warning * Added etl::string::fill() * Added etl::string interface to etl::base64 * Add missing semicolons (#776) * #776 Add missing semicolons * moved BUILD_TESTS check outside of root cmake check to allow building tests in submodules (#777) added check for GNUC >= 11 for -Wstringop-overread ignore pragma since it isn't introduced until gcc/g++-11 Co-authored-by: Josh <joshua.martens@magna.com> * Try to fix library error for Github Actions for Clang C++20 * Try to fix library error for Github Actions for Clang C++20 * Added pul-request branches to CI * Removed temporary fix * Refactored swap * Added add_lvalue_reference for rvalue reference * Revert "Added add_lvalue_reference for rvalue reference" This reverts commit a09efffb8fadb0c25923fe5435b7b1f9bdd673f1. * Updated version and release notes * Updated version and release notes * Try to fix library error for Github Actions for Clang C++20 (cherry picked from commit f208eb4073c98b3c190b17a73db3b61aa35fae25) The line got lost in 95c7f44cc61d51406a70ccb9048724f9fbdd78f9. * Add helper macro which enables function-like macro overload with 1 or 2 arguments. Inspired by https://stackoverflow.com/a/11763277/ Warning: This requires support for variadic macros (`__VA_ARGS__`). These were officially added in C99 and C++11. * Add unit test for static_assert.h (cherry picked from commit 91e7f46effac2884de80a12ab0c7eda5ade5cabe) * Add static assert overload for only 1 argument. (cherry picked from commit ae8c19e8cba69ca209a13109a7225ce6281d945d) * Add test case for static_assert with only 1 argument. (cherry picked from commit 4d6e7a63094221feec22fe3addcccd903b2d81de) * Spelling. --------- Co-authored-by: John Wellbelove <jwellbelove@users.noreply.github.com> Co-authored-by: David Hebbeker <dhebbeker@users.noreply.github.com> Co-authored-by: Linus Torvalds <torvalds@ppc970.osdl.org> Co-authored-by: Zhaolei <zhaolei@cn.fujitsu.com> Co-authored-by: John Wellbelove <john.wellbelove@etlcpp.com> Co-authored-by: Soma Veszelovszki <soma.veszelovszki@gmail.com> Co-authored-by: Andreas <and1p@web.de> Co-authored-by: Andreas Pelczer <pelczer@stoerk-tronic.com> Co-authored-by: H1MSK <ksda47832338@Outlook.com> Co-authored-by: jmartens-42 <jmartens@jayhawk.us> Co-authored-by: Josh <joshua.martens@magna.com> Co-authored-by: John Wellbelove <john.wellbelove@etlcpp.co.uk>
579 lines
18 KiB
C++
579 lines
18 KiB
C++
///******************************************************************************
|
|
//The MIT License(MIT)
|
|
//
|
|
//Embedded Template Library.
|
|
//https://github.com/ETLCPP/etl
|
|
//https://www.etlcpp.com
|
|
//
|
|
//Copyright(c) 2021 John Wellbelove
|
|
//
|
|
//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 "unit_test_framework.h"
|
|
|
|
#include "etl/vector.h"
|
|
#include "etl/multi_vector.h"
|
|
|
|
#include <array>
|
|
#include <vector>
|
|
#include <algorithm>
|
|
#include <iterator>
|
|
|
|
#include "etl/integral_limits.h"
|
|
|
|
namespace
|
|
{
|
|
static const size_t SIZE1 = 4UL;
|
|
static const size_t SIZE2 = 3UL;
|
|
|
|
using Data = etl::multi_vector<int, SIZE1, SIZE2>;
|
|
using Compare_Data = std::vector<std::vector<int>>;
|
|
using Array = std::array<std::array<int, SIZE2>, SIZE1>;
|
|
|
|
void Copy(const Array& from, Data& to)
|
|
{
|
|
to.resize(SIZE1);
|
|
|
|
for (size_t i = 0U; i < SIZE1; ++i)
|
|
{
|
|
to[i].resize(SIZE2);
|
|
|
|
for (size_t j = 0U; j < SIZE2; ++j)
|
|
{
|
|
to[i][j] = from[i][j];
|
|
}
|
|
}
|
|
}
|
|
|
|
Compare_Data compare_data = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
SUITE(test_multi_vector_external_buffer)
|
|
{
|
|
//*************************************************************************
|
|
TEST(test_constructor)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
CHECK_EQUAL(data.size(), SIZE1);
|
|
CHECK_EQUAL(data.max_size(), SIZE1);
|
|
|
|
CHECK_EQUAL(data[0].size(), SIZE2);
|
|
CHECK_EQUAL(data[0].max_size(), SIZE2);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_assignment)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Data other_data;
|
|
Copy(initial, data);
|
|
|
|
other_data = data;
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), other_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_at)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
for (size_t i = 0UL; i < data.size(); ++i)
|
|
{
|
|
for (size_t j = 0UL; j < data[0].size(); ++j)
|
|
{
|
|
CHECK_EQUAL(data[i].at(j), compare_data[i].at(j));
|
|
}
|
|
}
|
|
|
|
CHECK_THROW(data.at(data.size()), etl::vector_out_of_bounds);
|
|
CHECK_THROW(data[0].at(data[0].size()), etl::vector_out_of_bounds);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_at_const)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
for (size_t i = 0UL; i < data.size(); ++i)
|
|
{
|
|
for (size_t j = 0UL; j < data[0].size(); ++j)
|
|
{
|
|
CHECK_EQUAL(data[i].at(j), compare_data[i].at(j));
|
|
}
|
|
|
|
CHECK_THROW(data.at(data.size()), etl::vector_out_of_bounds);
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_index_operator)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
for (size_t i = 0UL; i < data.size(); ++i)
|
|
{
|
|
for (size_t j = 0UL; j < data[0].size(); ++j)
|
|
{
|
|
CHECK_EQUAL(data[i][j], compare_data[i][j]);
|
|
}
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_index_operator_const)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
for (size_t i = 0UL; i < data.size(); ++i)
|
|
{
|
|
for (size_t j = 0UL; j < data[0].size(); ++j)
|
|
{
|
|
CHECK_EQUAL(data[i][j], compare_data[i][j]);
|
|
}
|
|
}
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_front)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
int& ref = data.front().front();
|
|
CHECK(ref == compare_data.front().front());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_front_const)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
const int& ref = data.front().front();
|
|
CHECK(ref == compare_data.front().front());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_back)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
int& ref = data.back().back();
|
|
CHECK(ref == compare_data.back().back());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_back_const)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
const int& ref = data.back().back();
|
|
CHECK(ref == compare_data.back().back());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_data)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), data.data());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_data_const)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), data.data());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_begin)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
CHECK(data.begin() == &data[0]);
|
|
CHECK(data[0].begin() == &data[0][0]);
|
|
CHECK(data[1].begin() == &data[1][0]);
|
|
CHECK(data[2].begin() == &data[2][0]);
|
|
CHECK(data[3].begin() == &data[3][0]);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_end)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
CHECK(data.end() == &data[0] + SIZE1);
|
|
CHECK(data[0].end() == &data[0][0] + SIZE2);
|
|
CHECK(data[1].end() == &data[1][0] + SIZE2);
|
|
CHECK(data[2].end() == &data[2][0] + SIZE2);
|
|
CHECK(data[3].end() == &data[3][0] + SIZE2);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_cbegin)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
CHECK(data.cbegin() == &data[0]);
|
|
CHECK(data[0].cbegin() == &data[0][0]);
|
|
CHECK(data[1].cbegin() == &data[1][0]);
|
|
CHECK(data[2].cbegin() == &data[2][0]);
|
|
CHECK(data[3].cbegin() == &data[3][0]);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_cend)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
CHECK(data.cend() == &data[0] + SIZE1);
|
|
CHECK(data[0].cend() == &data[0][0] + SIZE2);
|
|
CHECK(data[1].cend() == &data[1][0] + SIZE2);
|
|
CHECK(data[2].cend() == &data[2][0] + SIZE2);
|
|
CHECK(data[3].cend() == &data[3][0] + SIZE2);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_rbegin)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
typedef etl::multi_vector<int, SIZE2> Inner;
|
|
|
|
CHECK(data.rbegin() == Data::reverse_iterator(&data[0] + SIZE1));
|
|
CHECK(data[0].rbegin() == Inner::reverse_iterator(&data[0][0] + SIZE2));
|
|
CHECK(data[1].rbegin() == Inner::reverse_iterator(&data[1][0] + SIZE2));
|
|
CHECK(data[2].rbegin() == Inner::reverse_iterator(&data[2][0] + SIZE2));
|
|
CHECK(data[3].rbegin() == Inner::reverse_iterator(&data[3][0] + SIZE2));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_rend)
|
|
{
|
|
Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
typedef etl::multi_vector<int, SIZE2> Inner;
|
|
|
|
CHECK(data.rend() == Data::reverse_iterator(&data[0]));
|
|
CHECK(data[0].rend() == Inner::reverse_iterator(&data[0][0]));
|
|
CHECK(data[1].rend() == Inner::reverse_iterator(&data[1][0]));
|
|
CHECK(data[2].rend() == Inner::reverse_iterator(&data[2][0]));
|
|
CHECK(data[3].rend() == Inner::reverse_iterator(&data[3][0]));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_crbegin)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
typedef etl::multi_vector<int, SIZE2> Inner;
|
|
|
|
CHECK(data.rbegin() == Data::const_reverse_iterator(&data[0] + SIZE1));
|
|
CHECK(data[0].rbegin() == Inner::const_reverse_iterator(&data[0][0] + SIZE2));
|
|
CHECK(data[1].rbegin() == Inner::const_reverse_iterator(&data[1][0] + SIZE2));
|
|
CHECK(data[2].rbegin() == Inner::const_reverse_iterator(&data[2][0] + SIZE2));
|
|
CHECK(data[3].rbegin() == Inner::const_reverse_iterator(&data[3][0] + SIZE2));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_crend)
|
|
{
|
|
const Array initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data data;
|
|
Copy(initial, data);
|
|
|
|
typedef etl::multi_vector<int, SIZE2> Inner;
|
|
|
|
CHECK(data.rend() == Data::const_reverse_iterator(&data[0]));
|
|
CHECK(data[0].rend() == Inner::const_reverse_iterator(&data[0][0]));
|
|
CHECK(data[1].rend() == Inner::const_reverse_iterator(&data[1][0]));
|
|
CHECK(data[2].rend() == Inner::const_reverse_iterator(&data[2][0]));
|
|
CHECK(data[3].rend() == Inner::const_reverse_iterator(&data[3][0]));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_empty)
|
|
{
|
|
Data data;
|
|
|
|
CHECK(data.empty());
|
|
|
|
data.resize(1);
|
|
CHECK(data[0].empty());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_size)
|
|
{
|
|
Data data;
|
|
|
|
CHECK_EQUAL(0, data.size());
|
|
|
|
data.resize(1);
|
|
CHECK_EQUAL(1, data.size());
|
|
CHECK_EQUAL(0, data[0].size());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_max_size)
|
|
{
|
|
Data data;
|
|
data.resize(1);
|
|
|
|
CHECK_EQUAL(SIZE1, data.max_size());
|
|
CHECK_EQUAL(SIZE2, data[0].max_size());
|
|
}
|
|
|
|
#if ETL_HAS_INITIALIZER_LIST
|
|
//*************************************************************************
|
|
TEST(test_swap)
|
|
{
|
|
Data initial1 = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data initial2 = { { { 12, 13, 14 }, { 15, 16, 17 }, { 18, 19, 20 }, { 21, 22, 23 } } };
|
|
|
|
Data data1 = initial1;
|
|
Data data2 = initial2;
|
|
|
|
using ETL_OR_STD::swap;
|
|
swap(data1, data2);
|
|
|
|
CHECK(std::equal(initial2.begin(), initial2.end(), data1.begin()));
|
|
CHECK(std::equal(initial1.begin(), initial1.end(), data2.begin()));
|
|
}
|
|
#endif
|
|
|
|
#if ETL_HAS_INITIALIZER_LIST
|
|
//*************************************************************************
|
|
TEST(test_assign)
|
|
{
|
|
Data initial = { { { -1, -1, -1 }, { -1, -1, -1 }, { -1, -1, -1 }, { -1, -1, -1 } } };
|
|
Data initial_source = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data initial_check1 = { { { 0, 1, 2 }, { 3, 4, 5 }, { -1, -1, -1 }, { -1, -1, -1 } } };
|
|
Data initial_check2 = { { { 0, 1, 2 }, { 3, 4, 5 }, { 99, 99, 99 }, { 99, 99, 99 } } };
|
|
|
|
Data source = initial_source;
|
|
Data check1 = initial_check1;
|
|
Data check2 = initial_check2;
|
|
|
|
Data data;
|
|
|
|
// Initial data.
|
|
data.assign(std::begin(initial), std::end(initial));
|
|
bool isEqual = std::equal(data.begin(), data.end(), std::begin(initial));
|
|
CHECK(isEqual);
|
|
|
|
// Assign smaller.
|
|
data.assign(std::begin(initial), std::end(initial));
|
|
data.assign(&source[0], &source[2]);
|
|
isEqual = std::equal(data.begin(), data.end(), std::begin(check1));
|
|
CHECK(isEqual);
|
|
}
|
|
#endif
|
|
|
|
#if ETL_HAS_INITIALIZER_LIST
|
|
//*************************************************************************
|
|
TEST(test_insert_value)
|
|
{
|
|
Data initial = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 } } };
|
|
Data initial_check1 = { { { 9, 10, 11 }, { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 } } };
|
|
Data initial_check2 = { { { 0, 1, 2 }, { 9, 10, 11 }, { 3, 4, 5 }, { 6, 7, 8 } } };
|
|
Data initial_check3 = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
Data check1 = initial_check1;
|
|
Data check2 = initial_check2;
|
|
Data check3 = initial_check3;
|
|
|
|
typedef etl::multi_vector<int, SIZE2> Inner;
|
|
const Inner inserted = { { 9, 10, 11 } };
|
|
|
|
Data data;
|
|
Data::iterator result;
|
|
|
|
// Insert beginning.
|
|
data.assign(std::begin(initial), std::end(initial));
|
|
result = data.insert(data.begin(), inserted);
|
|
CHECK(data[0] == *result);
|
|
bool isEqual = std::equal(data.begin(), data.end(), check1.begin());
|
|
CHECK(isEqual);
|
|
|
|
// Insert middle.
|
|
data.assign(std::begin(initial), std::end(initial));
|
|
result = data.insert(data.begin() + 1U, inserted);
|
|
CHECK(data[1] == *result);
|
|
isEqual = std::equal(data.begin(), data.end(), check2.begin());
|
|
CHECK(isEqual);
|
|
|
|
// Insert end.
|
|
data.assign(std::begin(initial), std::end(initial));
|
|
result = data.insert(data.begin() + 3U, inserted);
|
|
CHECK(data[3] == *result);
|
|
isEqual = std::equal(data.begin(), data.end(), check3.begin());
|
|
CHECK(isEqual);
|
|
}
|
|
#endif
|
|
|
|
//*************************************************************************
|
|
#if ETL_HAS_INITIALIZER_LIST
|
|
TEST(test_equal)
|
|
{
|
|
Data initial1 = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Data initial2 = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
CHECK(initial1 == initial2);
|
|
}
|
|
#endif
|
|
|
|
//*************************************************************************
|
|
#if ETL_HAS_INITIALIZER_LIST
|
|
TEST(test_not_equal)
|
|
{
|
|
Array initial1 = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial2 = { { { 0, 1, 2 }, { 3, 4, 6 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
CHECK(initial1 != initial2);
|
|
}
|
|
#endif
|
|
|
|
//*************************************************************************
|
|
TEST(test_less_than)
|
|
{
|
|
Array initial_data = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_lesser = { { { 0, 1, 2 }, { 3, 4, 4 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_greater = { { { 0, 1, 2 }, { 3, 4, 6 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
Data data;
|
|
Data lesser;
|
|
Data greater;
|
|
|
|
Copy(initial_data, data);
|
|
Copy(initial_lesser, lesser);
|
|
Copy(initial_greater, greater);
|
|
|
|
CHECK(lesser < data);
|
|
CHECK(!(data < data));
|
|
CHECK(!(greater < data));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_less_than_equal)
|
|
{
|
|
Array initial_data = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_lesser = { { { 0, 1, 2 }, { 3, 4, 4 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_greater = { { { 0, 1, 2 }, { 3, 4, 6 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
Data data;
|
|
Data lesser;
|
|
Data greater;
|
|
|
|
Copy(initial_data, data);
|
|
Copy(initial_lesser, lesser);
|
|
Copy(initial_greater, greater);
|
|
|
|
CHECK(lesser <= data);
|
|
CHECK(data <= data);
|
|
CHECK(!(greater <= data));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_greater_than)
|
|
{
|
|
Array initial_data = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_lesser = { { { 0, 1, 2 }, { 3, 4, 4 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_greater = { { { 0, 1, 2 }, { 3, 4, 6 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
Data data;
|
|
Data lesser;
|
|
Data greater;
|
|
|
|
Copy(initial_data, data);
|
|
Copy(initial_lesser, lesser);
|
|
Copy(initial_greater, greater);
|
|
|
|
CHECK(greater > data);
|
|
CHECK(!(data > data));
|
|
CHECK(!(lesser > data));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST(test_greater_than_equal)
|
|
{
|
|
Array initial_data = { { { 0, 1, 2 }, { 3, 4, 5 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_lesser = { { { 0, 1, 2 }, { 3, 4, 4 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
Array initial_greater = { { { 0, 1, 2 }, { 3, 4, 6 }, { 6, 7, 8 }, { 9, 10, 11 } } };
|
|
|
|
Data data;
|
|
Data lesser;
|
|
Data greater;
|
|
|
|
Copy(initial_data, data);
|
|
Copy(initial_lesser, lesser);
|
|
Copy(initial_greater, greater);
|
|
|
|
CHECK(greater >= data);
|
|
CHECK(data >= data);
|
|
CHECK(!(lesser >= data));
|
|
}
|
|
};
|
|
}
|