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>
1361 lines
40 KiB
C++
1361 lines
40 KiB
C++
/******************************************************************************
|
|
The MIT License(MIT)
|
|
|
|
Embedded Template Library.
|
|
https://github.com/ETLCPP/etl
|
|
https://www.etlcpp.com
|
|
|
|
Copyright(c) 2015 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 <set>
|
|
#include <array>
|
|
#include <algorithm>
|
|
#include <utility>
|
|
#include <iterator>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
#include "data.h"
|
|
|
|
#include "etl/flat_multiset.h"
|
|
|
|
namespace
|
|
{
|
|
static const size_t SIZE = 10UL;
|
|
|
|
typedef TestDataDC<std::string> DC;
|
|
typedef TestDataNDC<std::string> NDC;
|
|
typedef TestDataM<std::string> MC;
|
|
|
|
typedef etl::flat_multiset<DC, SIZE> DataDC;
|
|
typedef etl::flat_multiset<NDC, SIZE> DataNDC;
|
|
typedef etl::iflat_multiset<NDC> IDataNDC;
|
|
|
|
typedef etl::flat_multiset<int, SIZE> DataInt;
|
|
|
|
typedef etl::flat_multiset<MC, SIZE> DataM;
|
|
typedef etl::iflat_multiset<MC> IDataM;
|
|
|
|
typedef std::multiset<DC> Compare_DataDC;
|
|
typedef std::multiset<NDC> Compare_DataNDC;
|
|
|
|
struct D1
|
|
{
|
|
D1()
|
|
: a("a")
|
|
{
|
|
}
|
|
|
|
D1(const std::string& a_)
|
|
: a(a_)
|
|
{
|
|
}
|
|
|
|
std::string a;
|
|
};
|
|
|
|
struct D2
|
|
{
|
|
D2()
|
|
: a("a")
|
|
, b("b")
|
|
{
|
|
}
|
|
|
|
D2(const std::string& a_, const std::string& b_)
|
|
: a(a_)
|
|
, b(b_)
|
|
{
|
|
}
|
|
|
|
std::string a;
|
|
std::string b;
|
|
};
|
|
|
|
struct D3
|
|
{
|
|
D3()
|
|
: a("a")
|
|
, b("b")
|
|
, c("c")
|
|
{
|
|
}
|
|
|
|
D3(const std::string& a_, const std::string& b_, const std::string& c_)
|
|
: a(a_)
|
|
, b(b_)
|
|
, c(c_)
|
|
{
|
|
}
|
|
|
|
std::string a;
|
|
std::string b;
|
|
std::string c;
|
|
};
|
|
|
|
struct D4
|
|
{
|
|
D4()
|
|
: a("a")
|
|
, b("b")
|
|
, c("c")
|
|
, d("d")
|
|
{
|
|
}
|
|
|
|
D4(const std::string& a_, const std::string& b_, const std::string& c_, const std::string& d_)
|
|
: a(a_)
|
|
, b(b_)
|
|
, c(c_)
|
|
, d(d_)
|
|
{
|
|
}
|
|
|
|
std::string a;
|
|
std::string b;
|
|
std::string c;
|
|
std::string d;
|
|
};
|
|
|
|
bool operator == (const D1& lhs, const D1& rhs)
|
|
{
|
|
return (lhs.a == rhs.a);
|
|
}
|
|
|
|
bool operator == (const D2& lhs, const D2& rhs)
|
|
{
|
|
return (lhs.a == rhs.a) && (lhs.b == rhs.b);
|
|
}
|
|
|
|
bool operator == (const D3& lhs, const D3& rhs)
|
|
{
|
|
return (lhs.a == rhs.a) && (lhs.b == rhs.b) && (lhs.c == rhs.c);
|
|
}
|
|
|
|
bool operator == (const D4& lhs, const D4& rhs)
|
|
{
|
|
return (lhs.a == rhs.a) && (lhs.b == rhs.b) && (lhs.c == rhs.c) && (lhs.d == rhs.d);
|
|
}
|
|
|
|
bool operator < (const D1& lhs, const D1& rhs)
|
|
{
|
|
return (lhs.a < rhs.a);
|
|
}
|
|
|
|
bool operator < (const D2& lhs, const D2& rhs)
|
|
{
|
|
return (lhs.a < rhs.a) && (lhs.b < rhs.b);
|
|
}
|
|
|
|
bool operator < (const D3& lhs, const D3& rhs)
|
|
{
|
|
return (lhs.a < rhs.a) && (lhs.b < rhs.b) && (lhs.c < rhs.c);
|
|
}
|
|
|
|
bool operator < (const D4& lhs, const D4& rhs)
|
|
{
|
|
return (lhs.a < rhs.a) && (lhs.b < rhs.b) && (lhs.c < rhs.c) && (lhs.d < rhs.d);
|
|
}
|
|
|
|
typedef etl::flat_multiset<D1, SIZE> Data1;
|
|
typedef etl::flat_multiset<D2, SIZE> Data2;
|
|
typedef etl::flat_multiset<D3, SIZE> Data3;
|
|
typedef etl::flat_multiset<D4, SIZE> Data4;
|
|
|
|
typedef std::multiset<D1> Compare1;
|
|
typedef std::multiset<D2> Compare2;
|
|
typedef std::multiset<D3> Compare3;
|
|
typedef std::multiset<D4> Compare4;
|
|
|
|
struct Key
|
|
{
|
|
Key(const NDC& k_)
|
|
: k(k_)
|
|
{
|
|
}
|
|
|
|
NDC k;
|
|
};
|
|
|
|
bool operator <(const Key& lhs, const NDC& rhs)
|
|
{
|
|
return (lhs.k.value < rhs.value);
|
|
}
|
|
|
|
bool operator <(const NDC& lhs, const Key& rhs)
|
|
{
|
|
return (lhs.value < rhs.k.value);
|
|
}
|
|
|
|
SUITE(test_flat_multiset)
|
|
{
|
|
NDC NX = NDC("@");
|
|
NDC NY = NDC("[");
|
|
|
|
NDC N0 = NDC("A");
|
|
NDC N1 = NDC("B");
|
|
NDC N2 = NDC("C");
|
|
NDC N3 = NDC("D");
|
|
NDC N4 = NDC("E");
|
|
NDC N5 = NDC("F");
|
|
NDC N6 = NDC("G");
|
|
NDC N7 = NDC("H");
|
|
NDC N8 = NDC("I");
|
|
NDC N9 = NDC("J");
|
|
NDC N10 = NDC("K");
|
|
NDC N11 = NDC("L");
|
|
NDC N12 = NDC("M");
|
|
NDC N13 = NDC("N");
|
|
NDC N14 = NDC("O");
|
|
NDC N15 = NDC("P");
|
|
NDC N16 = NDC("Q");
|
|
NDC N17 = NDC("R");
|
|
NDC N18 = NDC("S");
|
|
NDC N19 = NDC("T");
|
|
|
|
std::vector<NDC> initial_data;
|
|
std::vector<NDC> excess_data;
|
|
std::vector<NDC> different_data;
|
|
std::vector<NDC> multi_data;
|
|
|
|
std::vector<int> int_data;
|
|
|
|
//*************************************************************************
|
|
struct SetupFixture
|
|
{
|
|
SetupFixture()
|
|
{
|
|
NDC n[] =
|
|
{
|
|
N0, N1, N2, N3, N4, N5, N6, N7, N8, N9
|
|
};
|
|
|
|
NDC n2[] =
|
|
{
|
|
N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, N10
|
|
};
|
|
|
|
NDC n3[] =
|
|
{
|
|
N10, N11, N12, N13, N14, N15, N16, N17, N18, N19
|
|
};
|
|
|
|
NDC n4[] =
|
|
{
|
|
N0, N0, N1, N2, N3, N1, N3, N3, N4, N2
|
|
};
|
|
|
|
int n5[] =
|
|
{
|
|
10, 11, 12, 13, 14, 15, 16, 17, 18, 19
|
|
};
|
|
|
|
initial_data.assign(std::begin(n), std::end(n));
|
|
excess_data.assign(std::begin(n2), std::end(n2));
|
|
different_data.assign(std::begin(n3), std::end(n3));
|
|
multi_data.assign(std::begin(n4), std::end(n4));
|
|
int_data.assign(std::begin(n5), std::end(n5));
|
|
}
|
|
};
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_default_constructor)
|
|
{
|
|
DataDC data;
|
|
|
|
CHECK_EQUAL(data.size(), size_t(0UL));
|
|
CHECK(data.empty());
|
|
CHECK_EQUAL(data.capacity(), SIZE);
|
|
CHECK_EQUAL(data.max_size(), SIZE);
|
|
CHECK(data.begin() == data.end());
|
|
}
|
|
|
|
#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST && !defined(ETL_TEMPLATE_DEDUCTION_GUIDE_TESTS_DISABLED)
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_cpp17_deduced_constructor)
|
|
{
|
|
etl::flat_multiset data{ N0, N1, N2, N3, N4, N5, N6, N7, N8, N9 };
|
|
etl::flat_multiset<NDC, 10U> check = { N0, N1, N2, N3, N4, N5, N6, N7, N8, N9 };
|
|
|
|
CHECK(!data.empty());
|
|
CHECK(data.full());
|
|
CHECK(data.begin() != data.end());
|
|
CHECK_EQUAL(10U, data.size());
|
|
CHECK_EQUAL(0U, data.available());
|
|
CHECK_EQUAL(10U, data.capacity());
|
|
CHECK_EQUAL(10U, data.max_size());
|
|
CHECK(data == check);
|
|
}
|
|
#endif
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_destruct_via_iflat_multiset)
|
|
{
|
|
int current_count = NDC::get_instance_count();
|
|
|
|
DataNDC* pdata = new DataNDC(initial_data.begin(), initial_data.end());
|
|
CHECK_EQUAL(int(current_count + initial_data.size()), NDC::get_instance_count());
|
|
|
|
IDataNDC* pidata = pdata;
|
|
delete pidata;
|
|
CHECK_EQUAL(current_count, NDC::get_instance_count());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_constructor_range)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC data(compare_data.begin(), compare_data.end());
|
|
|
|
CHECK(data.size() == SIZE);
|
|
CHECK(!data.empty());
|
|
}
|
|
|
|
#if ETL_HAS_INITIALIZER_LIST
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_constructor_initializer_list)
|
|
{
|
|
Compare_DataNDC compare_data = { N0, N0, N1, N2, N3, N1, N3, N3, N4, N2 };
|
|
|
|
DataNDC data = { N0, N0, N1, N2, N3, N1, N3, N3, N4, N2 };
|
|
|
|
CHECK_EQUAL(compare_data.size(), data.size());
|
|
CHECK(!data.empty());
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
CHECK(isEqual);
|
|
}
|
|
#endif
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_move_constructor)
|
|
{
|
|
using Item = MC;
|
|
|
|
Item p1(Item("1"));
|
|
Item p2a("2a");
|
|
Item p2b("2b");
|
|
Item p3("3");
|
|
Item p4(Item("4"));
|
|
|
|
DataM data1;
|
|
data1.insert(std::move(p1));
|
|
data1.insert(std::move(p2a));
|
|
data1.insert(std::move(p3));
|
|
data1.insert(std::move(p4));
|
|
data1.insert(std::move(p2b));
|
|
|
|
CHECK(!bool(p1));
|
|
CHECK(!bool(p2a));
|
|
CHECK(!bool(p2b));
|
|
CHECK(!bool(p3));
|
|
CHECK(!bool(p4));
|
|
|
|
DataM data2(std::move(data1));
|
|
|
|
CHECK_EQUAL(5U, data1.size()); // Move does not clear the source.
|
|
CHECK_EQUAL(5U, data2.size());
|
|
|
|
DataM::iterator itr = data2.begin();
|
|
|
|
Item pr = std::move(*itr++);
|
|
|
|
CHECK_EQUAL("1", pr.value);
|
|
CHECK_EQUAL("2a", (*itr++).value);
|
|
CHECK_EQUAL("2b", (*itr++).value);
|
|
CHECK_EQUAL("3", (*itr++).value);
|
|
CHECK_EQUAL("4", (*itr++).value);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_assignment)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
DataNDC other_data;
|
|
|
|
other_data = data;
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
other_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_assignment_interface)
|
|
{
|
|
DataNDC data1(initial_data.begin(), initial_data.end());
|
|
DataNDC data2;
|
|
|
|
IDataNDC& idata1 = data1;
|
|
IDataNDC& idata2 = data2;
|
|
|
|
idata2 = idata1;
|
|
|
|
bool isEqual = std::equal(data1.begin(),
|
|
data1.end(),
|
|
data2.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_self_assignment)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
DataNDC other_data(data);
|
|
|
|
#include "etl/private/diagnostic_self_assign_overloaded_push.h"
|
|
other_data = other_data;
|
|
#include "etl/private/diagnostic_pop.h"
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
other_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_begin)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
const DataNDC constData(data);
|
|
|
|
CHECK(data.begin() == std::begin(data));
|
|
CHECK(constData.begin() == std::begin(constData));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_end)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
const DataNDC constData(data);
|
|
|
|
CHECK(data.end() == std::end(data));
|
|
CHECK(constData.end() == std::end(constData));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_empty)
|
|
{
|
|
DataNDC data;
|
|
data.insert(initial_data.begin(), initial_data.end());
|
|
|
|
CHECK(data.full());
|
|
CHECK(!data.empty());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_full)
|
|
{
|
|
DataNDC data;
|
|
|
|
CHECK(!data.full());
|
|
CHECK(data.empty());
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_assign_range)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC data;
|
|
|
|
data.assign(compare_data.begin(), compare_data.end());
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
|
|
CHECK(std::is_sorted(data.begin(), data.end()));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_insert_value)
|
|
{
|
|
Compare_DataNDC compare_data;
|
|
DataNDC data;
|
|
|
|
data.insert(N0);
|
|
compare_data.insert(N0);
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
|
|
data.insert(N2);
|
|
compare_data.insert(N2);
|
|
|
|
isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
|
|
data.insert(N1);
|
|
compare_data.insert(N1);
|
|
|
|
isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
|
|
CHECK(std::is_sorted(data.begin(), data.end()));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_insert_value_multiple)
|
|
{
|
|
Compare_DataNDC compare_data;
|
|
DataNDC data;
|
|
|
|
data.insert(N0);
|
|
compare_data.insert(N0);
|
|
|
|
data.insert(N1);
|
|
compare_data.insert(N1);
|
|
|
|
data.insert(N2);
|
|
compare_data.insert(N2);
|
|
|
|
// Do it again.
|
|
data.insert(N0);
|
|
compare_data.insert(N0);
|
|
|
|
data.insert(N1);
|
|
compare_data.insert(N1);
|
|
|
|
data.insert(N2);
|
|
compare_data.insert(N2);
|
|
|
|
CHECK_EQUAL(compare_data.size(), data.size());
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
|
|
CHECK(std::is_sorted(data.begin(), data.end()));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_insert_value_excess)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
CHECK_THROW(data.insert(N10), etl::flat_multiset_full);
|
|
|
|
CHECK(std::is_sorted(data.begin(), data.end()));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_insert_range)
|
|
{
|
|
Compare_DataNDC compare_data;
|
|
DataNDC data;
|
|
|
|
data.insert(initial_data.begin(), initial_data.end());
|
|
compare_data.insert(initial_data.begin(), initial_data.end());
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
|
|
CHECK(std::is_sorted(data.begin(), data.end()));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_insert_range_excess)
|
|
{
|
|
DataNDC data;
|
|
|
|
CHECK_THROW(data.insert(excess_data.begin(), excess_data.end()), etl::flat_multiset_full);
|
|
|
|
CHECK(std::is_sorted(data.begin(), data.end()));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_emplace_default_value)
|
|
{
|
|
Compare1 compare;
|
|
Data1 data;
|
|
|
|
data.emplace();
|
|
compare.emplace();
|
|
|
|
data.emplace();
|
|
compare.emplace();
|
|
|
|
data.emplace();
|
|
compare.emplace();
|
|
|
|
// Do it again.
|
|
data.emplace();
|
|
compare.emplace();
|
|
|
|
data.emplace();
|
|
compare.emplace();
|
|
|
|
data.emplace();
|
|
compare.emplace();
|
|
|
|
CHECK_EQUAL(compare.size(), data.size());
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), compare.begin());
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_emplace_value1)
|
|
{
|
|
Compare1 compare;
|
|
Data1 data;
|
|
|
|
data.emplace("0");
|
|
compare.emplace("0");
|
|
|
|
data.emplace("1");
|
|
compare.emplace("1");
|
|
|
|
data.emplace("2");
|
|
compare.emplace("2");
|
|
|
|
// Do it again.
|
|
data.emplace("0");
|
|
compare.emplace("0");
|
|
|
|
data.emplace("1");
|
|
compare.emplace("1");
|
|
|
|
data.emplace("2");
|
|
compare.emplace("2");
|
|
|
|
CHECK_EQUAL(compare.size(), data.size());
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), compare.begin());
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_emplace_value2)
|
|
{
|
|
Compare2 compare;
|
|
Data2 data;
|
|
|
|
data.emplace("0", "1");
|
|
compare.emplace("0", "1");
|
|
|
|
data.emplace("1", "2");
|
|
compare.emplace("1", "2");
|
|
|
|
data.emplace("2", "3");
|
|
compare.emplace("2", "3");
|
|
|
|
// Do it again.
|
|
data.emplace("0", "1");
|
|
compare.emplace("0", "1");
|
|
|
|
data.emplace("1", "2");
|
|
compare.emplace("1", "2");
|
|
|
|
data.emplace("2", "3");
|
|
compare.emplace("2", "3");
|
|
|
|
CHECK_EQUAL(compare.size(), data.size());
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), compare.begin());
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_emplace_value3)
|
|
{
|
|
Compare3 compare;
|
|
Data3 data;
|
|
|
|
data.emplace("0", "1", "2");
|
|
compare.emplace("0", "1", "2");
|
|
|
|
data.emplace("1", "2", "3");
|
|
compare.emplace("1", "2", "3");
|
|
|
|
data.emplace("2", "3", "4");
|
|
compare.emplace("2", "3", "4");
|
|
|
|
// Do it again.
|
|
data.emplace("0", "1", "2");
|
|
compare.emplace("0", "1", "2");
|
|
|
|
data.emplace("1", "2", "3");
|
|
compare.emplace("1", "2", "3");
|
|
|
|
data.emplace("2", "3", "4");
|
|
compare.emplace("2", "3", "4");
|
|
|
|
CHECK_EQUAL(compare.size(), data.size());
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), compare.begin());
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_emplace_value4)
|
|
{
|
|
Compare4 compare;
|
|
Data4 data;
|
|
|
|
data.emplace("0", "1", "2", "3");
|
|
compare.emplace("0", "1", "2", "3");
|
|
|
|
data.emplace("1", "2", "3", "4");
|
|
compare.emplace("1", "2", "3", "4");
|
|
|
|
data.emplace("2", "3", "4", "5");
|
|
compare.emplace("2", "3", "4", "5");
|
|
|
|
// Do it again.
|
|
data.emplace("0", "1", "2", "3");
|
|
compare.emplace("0", "1", "2", "3");
|
|
|
|
data.emplace("1", "2", "3", "4");
|
|
compare.emplace("1", "2", "3", "4");
|
|
|
|
data.emplace("2", "3", "4", "5");
|
|
compare.emplace("2", "3", "4", "5");
|
|
|
|
CHECK_EQUAL(compare.size(), data.size());
|
|
|
|
bool isEqual = std::equal(data.begin(), data.end(), compare.begin());
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_erase_key)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
size_t count_compare = compare_data.erase(N5);
|
|
size_t count = data.erase(N5);
|
|
|
|
CHECK_EQUAL(count_compare, count);
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_erase_key_using_transparent_comparator)
|
|
{
|
|
using CSet = std::multiset<NDC>;
|
|
CSet compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
size_t count_compare = compare_data.erase(N5);
|
|
size_t count = data.erase(Key(N5));
|
|
|
|
CHECK_EQUAL(count_compare, count);
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_erase_single_iterator)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
Compare_DataNDC::iterator i_compare_begin = compare_data.begin();
|
|
DataNDC::iterator i_data_begin = data.begin();
|
|
|
|
Compare_DataNDC::iterator i_compare = i_compare_begin;
|
|
DataNDC::iterator i_data = i_data_begin;
|
|
|
|
Compare_DataNDC::iterator i_compare_expected = i_compare_begin;
|
|
DataNDC::iterator i_data_expected = i_data_begin;
|
|
|
|
std::advance(i_compare, 2);
|
|
std::advance(i_data, 2);
|
|
|
|
std::advance(i_compare_expected, 3);
|
|
std::advance(i_data_expected, 3);
|
|
|
|
NDC compare_expected = *i_compare_expected;
|
|
NDC data_expected = *i_data_expected;
|
|
|
|
Compare_DataNDC::iterator i_compare_result = compare_data.erase(i_compare);
|
|
DataNDC::iterator i_data_result = data.erase(i_data);
|
|
|
|
CHECK(compare_expected == *i_compare_result);
|
|
CHECK(data_expected == *i_data_result);
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_erase_single_const_iterator)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
Compare_DataNDC::iterator i_compare_begin = compare_data.begin();
|
|
DataNDC::iterator i_data_begin = data.begin();
|
|
|
|
Compare_DataNDC::const_iterator i_compare = i_compare_begin;
|
|
DataNDC::const_iterator i_data = i_data_begin;
|
|
|
|
Compare_DataNDC::iterator i_compare_expected = i_compare_begin;
|
|
DataNDC::iterator i_data_expected = i_data_begin;
|
|
|
|
std::advance(i_compare, 2);
|
|
std::advance(i_data, 2);
|
|
|
|
std::advance(i_compare_expected, 3);
|
|
std::advance(i_data_expected, 3);
|
|
|
|
NDC compare_expected = *i_compare_expected;
|
|
NDC data_expected = *i_data_expected;
|
|
|
|
Compare_DataNDC::iterator i_compare_result = compare_data.erase(i_compare);
|
|
DataNDC::iterator i_data_result = data.erase(i_data);
|
|
|
|
CHECK(compare_expected == *i_compare_result);
|
|
CHECK(data_expected == *i_data_result);
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_erase_range)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
Compare_DataNDC::const_iterator i_compare = compare_data.begin();
|
|
DataNDC::const_iterator i_data = data.begin();
|
|
|
|
Compare_DataNDC::const_iterator i_compare_end = compare_data.begin();
|
|
DataNDC::const_iterator i_data_end = data.begin();
|
|
|
|
std::advance(i_compare, 2);
|
|
std::advance(i_data, 2);
|
|
|
|
std::advance(i_compare_end, 4);
|
|
std::advance(i_data_end, 4);
|
|
|
|
NDC compare_expected = *i_compare_end;
|
|
NDC data_expected = *i_data_end;
|
|
|
|
Compare_DataNDC::iterator i_compare_result = compare_data.erase(i_compare, i_compare_end);
|
|
DataNDC::iterator i_data_result = data.erase(i_data, i_data_end);
|
|
|
|
CHECK(compare_expected == *i_compare_result);
|
|
CHECK(data_expected == *i_data_result);
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_clear)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC data(compare_data.begin(), compare_data.end());
|
|
data.clear();
|
|
CHECK_EQUAL(data.size(), size_t(0UL));
|
|
|
|
// Do it again to check that clear() didn't screw up the internals.
|
|
data.assign(compare_data.begin(), compare_data.end());
|
|
CHECK_EQUAL(data.size(), compare_data.size());
|
|
data.clear();
|
|
CHECK_EQUAL(data.size(), size_t(0UL));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_clear_pod)
|
|
{
|
|
DataInt data(int_data.begin(), int_data.end());
|
|
|
|
data.clear();
|
|
CHECK_EQUAL(data.size(), size_t(0UL));
|
|
|
|
// Do it again to check that clear() didn't screw up the internals.
|
|
data.assign(int_data.begin(), int_data.end());
|
|
CHECK_EQUAL(data.size(), int_data.size());
|
|
data.clear();
|
|
CHECK_EQUAL(data.size(), size_t(0UL));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_iterator)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC data(compare_data.begin(), compare_data.end());
|
|
|
|
bool isEqual = std::equal(data.begin(),
|
|
data.end(),
|
|
compare_data.begin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_const_iterator)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC data(compare_data.begin(), compare_data.end());
|
|
|
|
bool isEqual = std::equal(data.cbegin(),
|
|
data.cend(),
|
|
compare_data.cbegin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_reverse_iterator)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC data(compare_data.begin(), compare_data.end());
|
|
|
|
bool isEqual = std::equal(data.rbegin(),
|
|
data.rend(),
|
|
compare_data.rbegin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_const_reverse_iterator)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC data(compare_data.begin(), compare_data.end());
|
|
|
|
bool isEqual = std::equal(data.crbegin(),
|
|
data.crend(),
|
|
compare_data.crbegin());
|
|
|
|
CHECK(isEqual);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC::iterator it = data.find(N3);
|
|
CHECK_EQUAL(N3, *it);
|
|
|
|
it = data.find(N19);
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find_using_transparent_comparator)
|
|
{
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
ESet::iterator it = data.find(Key(N3));
|
|
CHECK_EQUAL(N3, *it);
|
|
|
|
it = data.find(N19);
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find_not_present)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC::iterator it = data.find(NX);
|
|
CHECK(data.end() == it);
|
|
|
|
it = data.find(NY);
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find_not_present_using_transparent_comparator)
|
|
{
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
ESet::iterator it = data.find(Key(NX));
|
|
CHECK(data.end() == it);
|
|
|
|
it = data.find(Key(NY));
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find_const)
|
|
{
|
|
const DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC::const_iterator it = data.find(N3);
|
|
CHECK_EQUAL(N3, *it);
|
|
|
|
it = data.find(N19);
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find_const_using_transparent_comparator)
|
|
{
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
const ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
ESet::const_iterator it = data.find(Key(N3));
|
|
CHECK_EQUAL(N3, *it);
|
|
|
|
it = data.find(Key(N19));
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find_const_not_present)
|
|
{
|
|
const DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
DataNDC::const_iterator it = data.find(NX);
|
|
CHECK(data.end() == it);
|
|
|
|
it = data.find(NY);
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_find_const_not_present_using_transparent_comparator)
|
|
{
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
const ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
ESet::const_iterator it = data.find(Key(NX));
|
|
CHECK(data.end() == it);
|
|
|
|
it = data.find(Key(NY));
|
|
CHECK(data.end() == it);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_lower_bound)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
Compare_DataNDC::iterator i_compare = compare_data.lower_bound(N5);
|
|
DataNDC::iterator i_data = data.lower_bound(N5);
|
|
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare), std::distance(data.begin(), i_data));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_lower_bound_using_transparent_comparator)
|
|
{
|
|
using CSet = std::multiset<NDC>;
|
|
CSet compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
CSet::iterator i_compare = compare_data.lower_bound(N5);
|
|
ESet::iterator i_data = data.lower_bound(Key(N5));
|
|
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare), std::distance(data.begin(), i_data));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_upper_bound)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
Compare_DataNDC::iterator i_compare = compare_data.upper_bound(N5);
|
|
DataNDC::iterator i_data = data.upper_bound(N5);
|
|
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare), std::distance(data.begin(), i_data));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_upper_bound_using_transparent_comparator)
|
|
{
|
|
using CSet = std::multiset<NDC>;
|
|
CSet compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
CSet::iterator i_compare = compare_data.upper_bound(N5);
|
|
ESet::iterator i_data = data.upper_bound(Key(N5));
|
|
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare), std::distance(data.begin(), i_data));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_equal_range)
|
|
{
|
|
Compare_DataNDC compare_data(initial_data.begin(), initial_data.end());
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
ETL_OR_STD::pair<Compare_DataNDC::iterator, Compare_DataNDC::iterator> i_compare = compare_data.equal_range(N5);
|
|
ETL_OR_STD::pair<DataNDC::iterator, DataNDC::iterator> i_data = data.equal_range(N5);
|
|
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare.first), std::distance(data.begin(), i_data.first));
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare.second), std::distance(data.begin(), i_data.second));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_equal_range_using_transparent_comparator)
|
|
{
|
|
using CSet = std::multiset<NDC>;
|
|
CSet compare_data(initial_data.begin(), initial_data.end());
|
|
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
ETL_OR_STD::pair<CSet::iterator, CSet::iterator> i_compare = compare_data.equal_range(N5);
|
|
ETL_OR_STD::pair<ESet::iterator, ESet::iterator> i_data = data.equal_range(Key(N5));
|
|
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare.first), std::distance(data.begin(), i_data.first));
|
|
CHECK_EQUAL(std::distance(compare_data.begin(), i_compare.second), std::distance(data.begin(), i_data.second));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_equal_range_not_present)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
ETL_OR_STD::pair<DataNDC::iterator, DataNDC::iterator> i_data;
|
|
|
|
i_data = data.equal_range(NX);
|
|
CHECK(data.begin() == i_data.first);
|
|
CHECK(data.begin() == i_data.second);
|
|
|
|
i_data = data.equal_range(NY);
|
|
CHECK(data.end() == i_data.first);
|
|
CHECK(data.end() == i_data.second);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_equal_range_not_present_using_transparent_comparator)
|
|
{
|
|
using ESet = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
ESet data(initial_data.begin(), initial_data.end());
|
|
|
|
ETL_OR_STD::pair<ESet::iterator, ESet::iterator> i_data;
|
|
|
|
i_data = data.equal_range(Key(NX));
|
|
CHECK(data.begin() == i_data.first);
|
|
CHECK(data.begin() == i_data.second);
|
|
|
|
i_data = data.equal_range(Key(NY));
|
|
CHECK(data.end() == i_data.first);
|
|
CHECK(data.end() == i_data.second);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_equal)
|
|
{
|
|
const DataNDC initial1(initial_data.begin(), initial_data.end());
|
|
const DataNDC initial2(initial_data.begin(), initial_data.end());
|
|
|
|
CHECK(initial1 == initial2);
|
|
|
|
const DataNDC different(different_data.begin(), different_data.end());
|
|
|
|
CHECK(!(initial1 == different));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_not_equal)
|
|
{
|
|
const DataNDC initial1(initial_data.begin(), initial_data.end());
|
|
const DataNDC initial2(initial_data.begin(), initial_data.end());
|
|
|
|
CHECK(!(initial1 != initial2));
|
|
|
|
const DataNDC different(different_data.begin(), different_data.end());
|
|
|
|
CHECK(initial1 != different);
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_multi)
|
|
{
|
|
Compare_DataNDC compare_data(multi_data.begin(), multi_data.end());
|
|
DataNDC data(multi_data.begin(), multi_data.end());
|
|
|
|
ETL_OR_STD::pair<Compare_DataNDC::iterator, Compare_DataNDC::iterator> compare_range;
|
|
ETL_OR_STD::pair<DataNDC::iterator, DataNDC::iterator> test_range;
|
|
|
|
compare_range = compare_data.equal_range(N0);
|
|
test_range = data.equal_range(N0);
|
|
CHECK_EQUAL(std::distance(compare_range.first, compare_range.second), std::distance(test_range.first, test_range.second));
|
|
|
|
compare_range = compare_data.equal_range(N1);
|
|
test_range = data.equal_range(N1);
|
|
CHECK_EQUAL(std::distance(compare_range.first, compare_range.second), std::distance(test_range.first, test_range.second));
|
|
|
|
compare_range = compare_data.equal_range(N2);
|
|
test_range = data.equal_range(N2);
|
|
CHECK_EQUAL(std::distance(compare_range.first, compare_range.second), std::distance(test_range.first, test_range.second));
|
|
|
|
compare_range = compare_data.equal_range(N3);
|
|
test_range = data.equal_range(N3);
|
|
CHECK_EQUAL(std::distance(compare_range.first, compare_range.second), std::distance(test_range.first, test_range.second));
|
|
|
|
compare_range = compare_data.equal_range(N4);
|
|
test_range = data.equal_range(N4);
|
|
CHECK_EQUAL(std::distance(compare_range.first, compare_range.second), std::distance(test_range.first, test_range.second));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_count)
|
|
{
|
|
Compare_DataNDC compare_data(multi_data.begin(), multi_data.end());
|
|
DataNDC data(multi_data.begin(), multi_data.end());
|
|
|
|
CHECK_EQUAL(compare_data.count(N0), data.count(N0));
|
|
CHECK_EQUAL(compare_data.count(N1), data.count(N1));
|
|
CHECK_EQUAL(compare_data.count(N2), data.count(N2));
|
|
CHECK_EQUAL(compare_data.count(N3), data.count(N3));
|
|
CHECK_EQUAL(compare_data.count(N4), data.count(N4));
|
|
}
|
|
|
|
//*************************************************************************
|
|
#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST && !defined(ETL_TEMPLATE_DEDUCTION_GUIDE_TESTS_DISABLED)
|
|
TEST_FIXTURE(SetupFixture, test_flat_set_template_deduction)
|
|
{
|
|
etl::flat_multiset data{ NDC("A"), NDC("B"), NDC("B2"), NDC("C"), NDC("D"), NDC("E"), NDC("F") };
|
|
|
|
auto v = *data.begin();
|
|
using Type = decltype(v);
|
|
CHECK((std::is_same_v<NDC, Type>));
|
|
|
|
decltype(data)::const_iterator itr = data.begin();
|
|
|
|
CHECK_EQUAL(NDC("A"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("B"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("B2"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("C"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("D"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("E"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("F"), *itr);
|
|
}
|
|
#endif
|
|
|
|
//*************************************************************************
|
|
#if ETL_HAS_INITIALIZER_LIST
|
|
TEST_FIXTURE(SetupFixture, test_make_flat_multiset)
|
|
{
|
|
auto data = etl::make_flat_multiset<NDC>(NDC("A"), NDC("B"), NDC("B2"), NDC("C"), NDC("D"), NDC("E"), NDC("F"));
|
|
|
|
auto v = *data.begin();
|
|
using Type = decltype(v);
|
|
CHECK((std::is_same<NDC, Type>::value));
|
|
|
|
decltype(data)::const_iterator itr = data.begin();
|
|
|
|
CHECK_EQUAL(NDC("A"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("B"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("B2"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("C"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("D"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("E"), *itr);
|
|
++itr;
|
|
CHECK_EQUAL(NDC("F"), *itr);
|
|
}
|
|
#endif
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_contains)
|
|
{
|
|
DataNDC data(initial_data.begin(), initial_data.end());
|
|
|
|
CHECK(data.contains(N5));
|
|
CHECK(!data.contains(NX));
|
|
}
|
|
|
|
//*************************************************************************
|
|
TEST_FIXTURE(SetupFixture, test_contains_with_transparent_comparator)
|
|
{
|
|
using EMap = etl::flat_multiset<NDC, SIZE, etl::less<>>;
|
|
EMap data(initial_data.begin(), initial_data.end());
|
|
|
|
CHECK(data.contains(Key(N5)));
|
|
CHECK(!data.contains(Key(NX)));
|
|
}
|
|
};
|
|
}
|