etl/test/test_multiset.cpp
David Hebbeker 3392a6cd88
add static assert with auto message (#740)
* 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 commit 1da177e4c3)

* 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 commit 8f7c2c3731)

* 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>
2024-02-22 19:11:38 +00:00

1654 lines
52 KiB
C++

/******************************************************************************
The MIT License(MIT)
Embedded Template Library.
https://github.com/ETLCPP/etl
https://www.etlcpp.com
Copyright(c) 2014 John Wellbelove, rlindeman
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 "etl/multiset.h"
#include "etl/checksum.h"
#include "data.h"
static const size_t MAX_SIZE = 10UL;
#define TEST_GREATER_THAN
#ifdef TEST_GREATER_THAN
using Data = etl::multiset<int, MAX_SIZE, std::greater<int>>;
using IData = etl::imultiset<int, std::greater<int>>;
using Compare_Data = std::multiset<int, std::greater<int>>;
#else
using Data = etl::multiset<int, MAX_SIZE, std::less<int>>;
using IData = etl::multiset<int, std::less<int>>;
using Compare_Data = std::multiset<int, std::less<int>>;
#endif
using ItemM = TestDataM<int>;
struct simple_hash
{
size_t operator ()(const ItemM& value) const
{
etl::checksum<size_t> sum;
sum.add(value.valid);
sum.add(value.value);
return sum.value();
}
};
using DataM = etl::multiset<ItemM, MAX_SIZE>;
using Data_iterator = Data::iterator;
using Data_const_iterator = Data::const_iterator;
using Compare_Data_iterator = Compare_Data::iterator;
using Compare_Data_const_iterator = Compare_Data::const_iterator;
namespace
{
struct Key
{
Key(int k_)
: k(k_)
{
}
int k;
};
bool operator <(const Key& lhs, const int& rhs)
{
return (lhs.k < rhs);
}
bool operator <(const int& lhs, const Key& rhs)
{
return (lhs < rhs.k);
}
SUITE(test_multiset)
{
//*************************************************************************
template <typename T1, typename T2>
bool Check_Equal(T1 begin1, T1 end1, T2 begin2)
{
while (begin1 != end1)
{
if (*begin1 != *begin2)
{
return false;
}
++begin1;
++begin2;
}
return true;
}
//*************************************************************************
struct SetupFixture
{
// Multisets of predefined data from which to constuct multisets used in
// each test
std::multiset<int> initial_data;
std::multiset<int> excess_data;
std::multiset<int> different_data;
std::multiset<int> random_data;
std::multiset<int> initial_data_even;
std::multiset<int> test_data;
SetupFixture()
{
// Create a multiset of initial data
initial_data.insert(0);
initial_data.insert(0);
initial_data.insert(1);
initial_data.insert(1);
initial_data.insert(1);
initial_data.insert(2);
initial_data.insert(2);
initial_data.insert(2);
initial_data.insert(3);
initial_data.insert(4);
// Create a multiset of excess data
excess_data.insert(0);
excess_data.insert(1);
excess_data.insert(2);
excess_data.insert(2);
excess_data.insert(3);
excess_data.insert(3);
excess_data.insert(3);
excess_data.insert(4);
excess_data.insert(5);
excess_data.insert(6);
excess_data.insert(10);
// Create a multiset of different data
different_data.insert(10);
different_data.insert(11);
different_data.insert(12);
different_data.insert(13);
different_data.insert(14);
different_data.insert(15);
different_data.insert(16);
different_data.insert(17);
different_data.insert(18);
different_data.insert(19);
// Create a multiset of random data
random_data.insert(3);
random_data.insert(3);
random_data.insert(0);
random_data.insert(5);
random_data.insert(6);
random_data.insert(2);
random_data.insert(0);
random_data.insert(2);
random_data.insert(4);
random_data.insert(3);
//even values
initial_data_even.insert(0);
initial_data_even.insert(2);
initial_data_even.insert(4);
initial_data_even.insert(6);
initial_data_even.insert(8);
initial_data_even.insert(10);
initial_data_even.insert(12);
initial_data_even.insert(14);
initial_data_even.insert(16);
initial_data_even.insert(18);
//test set
test_data.insert(0);
test_data.insert(1);
test_data.insert(2);
test_data.insert(3);
test_data.insert(4);
test_data.insert(5);
test_data.insert(6);
test_data.insert(7);
test_data.insert(8);
test_data.insert(9);
test_data.insert(10);
test_data.insert(11);
test_data.insert(12);
test_data.insert(13);
test_data.insert(14);
test_data.insert(15);
test_data.insert(16);
test_data.insert(17);
test_data.insert(18);
test_data.insert(19);
}
};
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_default_constructor)
{
Data data;
CHECK_EQUAL(data.size(), size_t(0UL));
CHECK(data.empty());
CHECK_EQUAL(data.capacity(), MAX_SIZE);
CHECK_EQUAL(data.max_size(), MAX_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::multiset data{ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
etl::multiset<int, 10U> check = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
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_copy_constructor)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data1(compare_data.begin(), compare_data.end());
Data data2(data1);
CHECK_EQUAL(initial_data.size(), data1.size());
CHECK(data1.size() == data2.size());
bool isEqual = false;
isEqual = Check_Equal(data1.begin(),
data1.end(),
compare_data.begin());
CHECK(isEqual);
isEqual = Check_Equal(data2.begin(),
data2.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_move_constructor)
{
DataM data1;
ItemM d1(1);
ItemM d2(2);
ItemM d3(3);
data1.insert(etl::move(d1));
data1.insert(etl::move(d2));
data1.insert(etl::move(d3));
data1.insert(ItemM(4));
DataM data2(std::move(data1));
CHECK(!data1.empty()); // Move does not clear the source.
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_destruct_via_imultiset)
{
Data* pdata = new Data(initial_data.begin(), initial_data.end());
IData* pidata = pdata;
delete pidata;
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_constructor_range)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(compare_data.begin(), compare_data.end());
CHECK(data.size() == MAX_SIZE);
CHECK(!data.empty());
}
#if ETL_HAS_INITIALIZER_LIST
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_constructor_initializer_list)
{
Compare_Data compare_data = { 0, 1, 1, 3, 4, 4, 6, 7, 7, 9 };
Data data = { 0, 1, 1, 3, 4, 4, 6, 7, 7, 9 };
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_assignment)
{
Data data(initial_data.begin(), initial_data.end());
Data otherData;
otherData = data;
bool isEqual = Check_Equal(data.begin(),
data.end(),
otherData.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_assignment_interface)
{
Data data1(initial_data.begin(), initial_data.end());
Data data2;
IData& idata1 = data1;
IData& idata2 = data2;
idata2 = idata1;
bool isEqual = std::equal(data1.begin(),
data1.end(),
data2.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_self_assignment)
{
Data data(initial_data.begin(), initial_data.end());
Data 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_move_assignment)
{
DataM data1;
ItemM d1(1);
ItemM d2(2);
ItemM d3(3);
data1.insert(etl::move(d1));
data1.insert(etl::move(d2));
data1.insert(etl::move(d3));
data1.insert(ItemM(4));
DataM data2;
data2.insert(ItemM(5));
data2 = std::move(data1);
CHECK(!data1.empty()); // Move does not clear the source.
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_begin)
{
Data data(initial_data.begin(), initial_data.end());
const Data constData(data);
CHECK(data.begin() == std::begin(data));
CHECK(constData.begin() == std::begin(constData));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_end)
{
Data data(initial_data.begin(), initial_data.end());
const Data constData(data);
CHECK(data.end() == std::end(data));
CHECK(constData.end() == std::end(constData));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_empty)
{
Data data;
data.insert(initial_data.begin(), initial_data.end());
CHECK(data.full());
CHECK(!data.empty());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_full)
{
Data data;
CHECK(!data.full());
CHECK(data.empty());
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_assign_range)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data;
data.assign(compare_data.begin(), compare_data.end());
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_value)
{
Compare_Data compare_data;
Data data;
Data::iterator data_result = data.insert(2);
Compare_Data::iterator compare_result = compare_data.insert(2);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
data_result = data.insert(1);
compare_result = compare_data.insert(1);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
data_result = data.insert(2);
compare_result = compare_data.insert(2);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
data_result = data.insert(3);
compare_result = compare_data.insert(3);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
// Adding this next 2 will trigger a 3 node rotate RL on insert
data_result = data.insert(2);
compare_result = compare_data.insert(2);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
// Adding this next 4 will trigger a 2 node rotate left on insert
data_result = data.insert(4);
compare_result = compare_data.insert(4);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
data_result = data.insert(0);
compare_result = compare_data.insert(0);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
// Check that elements in multiset are the same
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_hint_value)
{
Compare_Data compare_data;
Data data;
Data::iterator data_result = data.insert(0);
Compare_Data::iterator compare_result = compare_data.insert(0);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
// Check that elements in multiset are the same
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
data.insert(data_result, 1);
compare_data.insert(compare_result, 1);
isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_const_hint_value)
{
Compare_Data compare_data;
Data data;
Data::iterator data_result = data.insert(2);
Compare_Data::iterator compare_result = compare_data.insert(2);
// Check that both return successful return results
CHECK_EQUAL(*compare_result, *data_result);
// Check that elements in multiset are the same
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
data.insert(Data::const_iterator(data_result), 1);
compare_data.insert(Compare_Data::const_iterator(compare_result), 1);
isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_value_excess)
{
Data data(initial_data.begin(), initial_data.end());
CHECK_THROW(data.insert(10), etl::multiset_full);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_range)
{
Compare_Data compare_data;
Data data;
data.insert(initial_data.begin(), initial_data.end());
compare_data.insert(initial_data.begin(), initial_data.end());
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_range_random)
{
Compare_Data compare_data;
Data data;
data.insert(random_data.begin(), random_data.end());
compare_data.insert(random_data.begin(), random_data.end());
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_range_excess)
{
Data data;
CHECK_THROW(data.insert(excess_data.begin(), excess_data.end()), etl::multiset_full);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_insert_moved_value)
{
DataM data;
ItemM d1(1);
ItemM d2(2);
ItemM d3(3);
data.insert(etl::move(d1));
data.insert(etl::move(d2));
data.insert(etl::move(d3));
data.insert(ItemM(4));
CHECK(!bool(d1));
CHECK(!bool(d2));
CHECK(!bool(d3));
CHECK_EQUAL(1, data.find(ItemM(1))->value);
CHECK_EQUAL(2, data.find(ItemM(2))->value);
CHECK_EQUAL(3, data.find(ItemM(3))->value);
CHECK_EQUAL(4, data.find(ItemM(4))->value);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_equal_range)
{
Compare_Data compare_data(random_data.begin(), random_data.end());
Data data(random_data.begin(), random_data.end());
// Test a number not available
ETL_OR_STD::pair<Data::iterator, Data::iterator> data_result = data.equal_range(1);
ETL_OR_STD::pair<Compare_Data::iterator, Compare_Data::iterator> compare_result = compare_data.equal_range(1);
// Check that both return the same return results
CHECK_EQUAL(*compare_result.first, *data_result.first);
CHECK_EQUAL(*compare_result.second, *data_result.second);
bool isEqual = Check_Equal(data.begin(), data.end(), compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_const_equal_range)
{
const Compare_Data compare_data(initial_data.begin(), initial_data.end());
const Data data(initial_data.begin(), initial_data.end());
// Test a number with several of the same key
ETL_OR_STD::pair<Data::const_iterator, Data::const_iterator> data_result = data.equal_range(2);
ETL_OR_STD::pair<Compare_Data::const_iterator, Compare_Data::const_iterator> compare_result = compare_data.equal_range(2);
// Check that both return the same return results
CHECK_EQUAL(*compare_result.first, *data_result.first);
CHECK_EQUAL(*compare_result.second, *data_result.second);
bool isEqual = Check_Equal(data.begin(), data.end(), compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_erase_value)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(initial_data.begin(), initial_data.end());
size_t compare_count = compare_data.erase(2);
size_t data_count = data.erase(2);
// Check that both return the same return results
CHECK_EQUAL(compare_count, data_count);
// Erase another value
compare_count = compare_data.erase(1);
data_count = data.erase(1);
// Check that both return the same return results
CHECK_EQUAL(compare_count, data_count);
// Erase another value
compare_count = compare_data.erase(3);
data_count = data.erase(3);
// Check that both return the same return results
CHECK_EQUAL(compare_count, data_count);
bool isEqual = Check_Equal(data.begin(), data.end(), compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_erase_value_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
ESet data(initial_data.begin(), initial_data.end());
size_t compare_count = compare_data.erase(2);
size_t data_count = data.erase(Key(2));
// Check that both return the same return results
CHECK_EQUAL(compare_count, data_count);
// Erase another value
compare_count = compare_data.erase(1);
data_count = data.erase(1);
// Check that both return the same return results
CHECK_EQUAL(compare_count, data_count);
// Erase another value
compare_count = compare_data.erase(3);
data_count = data.erase(3);
// Check that both return the same return results
CHECK_EQUAL(compare_count, data_count);
bool isEqual = Check_Equal(data.begin(), data.end(), compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_erase_single)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(initial_data.begin(), initial_data.end());
Compare_Data::iterator i_compare = compare_data.begin();
Data::iterator i_data = data.begin();
Compare_Data::iterator i_compare1 = compare_data.erase(i_compare);
Data::iterator i_data1 = data.erase(i_data);
CHECK_EQUAL(*i_compare1, *i_data1);
bool isEqual = Check_Equal(data.begin(), data.end(), compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_const_erase_single)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(initial_data.begin(), initial_data.end());
Compare_Data::const_iterator i_compare = compare_data.cbegin();
Data::const_iterator i_data = data.cbegin();
std::advance(i_compare, 8);
std::advance(i_data, 8);
Compare_Data::const_iterator i_compare1 = compare_data.erase(i_compare);
Data::const_iterator i_data1 = data.erase(i_data);
CHECK_EQUAL(*i_compare1, *i_data1);
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_erase_range)
{
Compare_Data compare_data(random_data.begin(), random_data.end());
Data data(random_data.begin(), random_data.end());
Compare_Data::iterator i_compare = compare_data.begin();
Data::iterator i_data = data.begin();
Compare_Data::iterator i_compare_end = compare_data.begin();
Data::iterator i_data_end = data.begin();
std::advance(i_compare, 1);
std::advance(i_data, 1);
std::advance(i_compare_end, 4);
std::advance(i_data_end, 4);
compare_data.erase(i_compare, i_compare_end);
data.erase(i_data, i_data_end);
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_const_erase_range)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(initial_data.begin(), initial_data.end());
compare_data.erase(compare_data.cbegin(), compare_data.cend());
data.erase(data.cbegin(), data.cend());
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_clear)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(compare_data.begin(), compare_data.end());
data.clear();
CHECK_EQUAL(data.size(), size_t(0UL));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_count)
{
const Data data(initial_data.begin(), initial_data.end());
const Compare_Data compare_data(initial_data.begin(), initial_data.end());
CHECK_EQUAL(compare_data.count(-1), data.count(-1));
CHECK_EQUAL(compare_data.count(0), data.count(0));
CHECK_EQUAL(compare_data.count(1), data.count(1));
CHECK_EQUAL(compare_data.count(2), data.count(2));
CHECK_EQUAL(compare_data.count(3), data.count(3));
CHECK_EQUAL(compare_data.count(4), data.count(4));
CHECK_EQUAL(compare_data.count(99), data.count(99));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_count_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
const CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
const ESet data(initial_data.begin(), initial_data.end());
CHECK_EQUAL(compare_data.count(-1), data.count(Key(-1)));
CHECK_EQUAL(compare_data.count(0), data.count(Key(0)));
CHECK_EQUAL(compare_data.count(1), data.count(Key(1)));
CHECK_EQUAL(compare_data.count(2), data.count(Key(2)));
CHECK_EQUAL(compare_data.count(3), data.count(Key(3)));
CHECK_EQUAL(compare_data.count(4), data.count(Key(4)));
CHECK_EQUAL(compare_data.count(99), data.count(Key(99)));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_iterator)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(compare_data.begin(), compare_data.end());
bool isEqual = Check_Equal(data.begin(),
data.end(),
compare_data.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_const_iterator)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(compare_data.begin(), compare_data.end());
bool isEqual = Check_Equal(data.cbegin(),
data.cend(),
compare_data.cbegin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_reverse_iterator)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(compare_data.begin(), compare_data.end());
bool isEqual = Check_Equal(data.rbegin(),
data.rend(),
compare_data.rbegin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_const_reverse_iterator)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(compare_data.begin(), compare_data.end());
bool isEqual = Check_Equal(data.crbegin(),
data.crend(),
compare_data.crbegin());
CHECK(isEqual);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_find)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(initial_data.begin(), initial_data.end());
Data::iterator i_data = data.find(0);
Compare_Data::iterator i_compare = compare_data.find(0);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(1);
i_compare = compare_data.find(1);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(2);
i_compare = compare_data.find(2);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(3);
i_compare = compare_data.find(3);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(-1);
i_compare = compare_data.find(-1);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
i_data = data.find(99);
i_compare = compare_data.find(99);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_find_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
ESet data(initial_data.begin(), initial_data.end());
ESet::iterator i_data = data.find(Key(0));
CSet::iterator i_compare = compare_data.find(0);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(1));
i_compare = compare_data.find(1);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(2));
i_compare = compare_data.find(2);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(3));
i_compare = compare_data.find(3);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(-1));
i_compare = compare_data.find(-1);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
i_data = data.find(Key(99));
i_compare = compare_data.find(99);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_find_const)
{
const Compare_Data compare_data(initial_data.begin(), initial_data.end());
const Data data(initial_data.begin(), initial_data.end());
Data::const_iterator i_data = data.find(0);
Compare_Data::const_iterator i_compare = compare_data.find(0);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(1);
i_compare = compare_data.find(1);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(2);
i_compare = compare_data.find(2);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(3);
i_compare = compare_data.find(3);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(-1);
i_compare = compare_data.find(-1);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
i_data = data.find(99);
i_compare = compare_data.find(99);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_find_const_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
ESet data(initial_data.begin(), initial_data.end());
ESet::const_iterator i_data = data.find(Key(0));
CSet::const_iterator i_compare = compare_data.find(0);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(1));
i_compare = compare_data.find(1);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(2));
i_compare = compare_data.find(2);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(3));
i_compare = compare_data.find(3);
// Check that both return successful return results
CHECK_EQUAL(*i_compare, *i_data);
i_data = data.find(Key(-1));
i_compare = compare_data.find(-1);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
i_data = data.find(Key(99));
i_compare = compare_data.find(99);
// Check that both return successful return results
CHECK(data.end() == i_data);
CHECK(compare_data.end() == i_compare);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_equal)
{
const Data initial1(initial_data.begin(), initial_data.end());
const Data initial2(initial_data.begin(), initial_data.end());
CHECK(initial1 == initial2);
const Data different(different_data.begin(), different_data.end());
CHECK(!(initial1 == different));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_not_equal)
{
const Data initial1(initial_data.begin(), initial_data.end());
const Data initial2(initial_data.begin(), initial_data.end());
CHECK(!(initial1 != initial2));
const Data different(different_data.begin(), different_data.end());
CHECK(initial1 != different);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_lower_bound)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(initial_data.begin(), initial_data.end());
Compare_Data::iterator i_compare = compare_data.lower_bound(2);
Data::iterator i_data = data.lower_bound(2);
CHECK_EQUAL(*i_compare, *i_data);
#ifdef TEST_GREATER_THAN
i_compare = compare_data.lower_bound(-1);
CHECK(compare_data.end() == i_compare);
i_data = data.lower_bound(-1);
CHECK(data.end() == i_data);
i_compare = compare_data.lower_bound(99);
i_data = data.lower_bound(99);
CHECK(*i_compare == *i_data);
#else
i_compare = compare_data.lower_bound(-1);
i_data = data.lower_bound(-1);
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.lower_bound(99);
CHECK_EQUAL(compare_data.end(), i_compare);
i_data = data.lower_bound(99);
CHECK_EQUAL(data.end(), i_data);
#endif
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_lower_bound_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
ESet data(initial_data.begin(), initial_data.end());
CSet::iterator i_compare = compare_data.lower_bound(2);
ESet::iterator i_data = data.lower_bound(Key(2));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.lower_bound(-1);
i_data = data.lower_bound(Key(-1));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.lower_bound(99);
CHECK(compare_data.end() == i_compare);
i_data = data.lower_bound(Key(99));
CHECK(data.end() == i_data);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_lower_bound_const)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
const Data data(initial_data.begin(), initial_data.end());
Compare_Data::const_iterator i_compare = compare_data.lower_bound(4);
Data::const_iterator i_data = data.lower_bound(4);
CHECK_EQUAL(*i_compare, *i_data);
#ifdef TEST_GREATER_THAN
i_compare = compare_data.lower_bound(-1);
CHECK(compare_data.end() == i_compare);
i_data = data.lower_bound(-1);
CHECK(data.end() == i_data);
i_compare = compare_data.lower_bound(99);
i_data = data.lower_bound(99);
CHECK(*i_compare == *i_data);
#else
i_compare = compare_data.lower_bound(-1);
i_data = data.lower_bound(-1);
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.lower_bound(99);
CHECK_EQUAL(compare_data.end(), i_compare);
i_data = data.lower_bound(99);
CHECK_EQUAL(data.end(), i_data);
#endif
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_lower_bound_const_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
ESet data(initial_data.begin(), initial_data.end());
CSet::const_iterator i_compare = compare_data.lower_bound(4);
ESet::const_iterator i_data = data.lower_bound(Key(4));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.lower_bound(-1);
i_data = data.lower_bound(Key(-1));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.lower_bound(99);
CHECK(compare_data.end() == i_compare);
i_data = data.lower_bound(Key(99));
CHECK(data.end() == i_data);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_upper_bound)
{
Compare_Data compare_data(initial_data.begin(), initial_data.end());
Data data(initial_data.begin(), initial_data.end());
Compare_Data::iterator i_compare = compare_data.upper_bound(1);
Data::iterator i_data = data.upper_bound(1);
CHECK_EQUAL(*i_compare, *i_data);
#ifdef TEST_GREATER_THAN
i_compare = compare_data.upper_bound(-1);
CHECK(compare_data.end() == i_compare);
i_data = data.upper_bound(-1);
CHECK(data.end() == i_data);
i_compare = compare_data.upper_bound(99);
i_data = data.upper_bound(99);
CHECK(*i_compare == *i_data);
#else
i_compare = compare_data.upper_bound(-1);
i_data = data.upper_bound(-1);
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.upper_bound(99);
CHECK_EQUAL(compare_data.end(), i_compare);
i_data = data.upper_bound(99);
CHECK_EQUAL(data.end(), i_data);
#endif
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_upper_bound_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
ESet data(initial_data.begin(), initial_data.end());
CSet::iterator i_compare = compare_data.upper_bound(1);
ESet::iterator i_data = data.upper_bound(Key(1));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.upper_bound(-1);
i_data = data.upper_bound(Key(-1));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.upper_bound(99);
CHECK(compare_data.end() == i_compare);
i_data = data.upper_bound(Key(99));
CHECK(data.end() == i_data);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_upper_bound_const)
{
const Compare_Data compare_data(initial_data.begin(), initial_data.end());
const Data data(initial_data.begin(), initial_data.end());
Compare_Data::const_iterator i_compare = compare_data.upper_bound(3);
Data::const_iterator i_data = data.upper_bound(3);
CHECK_EQUAL(*i_compare, *i_data);
#ifdef TEST_GREATER_THAN
i_compare = compare_data.upper_bound(-1);
CHECK(compare_data.end() == i_compare);
i_data = data.upper_bound(-1);
CHECK(data.end() == i_data);
i_compare = compare_data.upper_bound(99);
i_data = data.upper_bound(99);
CHECK(*i_compare == *i_data);
#else
i_compare = compare_data.upper_bound(-1);
i_data = data.upper_bound(-1);
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.upper_bound(99);
CHECK_EQUAL(compare_data.end(), i_compare);
i_data = data.upper_bound(99);
CHECK_EQUAL(data.end(), i_data);
#endif
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_upper_bound_const_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
const CSet compare_data(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
const ESet data(initial_data.begin(), initial_data.end());
CSet::const_iterator i_compare = compare_data.upper_bound(3);
ESet::const_iterator i_data = data.upper_bound(Key(3));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.upper_bound(-1);
i_data = data.upper_bound(Key(-1));
CHECK_EQUAL(*i_compare, *i_data);
i_compare = compare_data.upper_bound(99);
CHECK(compare_data.end() == i_compare);
i_data = data.upper_bound(Key(99));
CHECK(data.end() == i_data);
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_key_compare)
{
const Data data(initial_data.begin(), initial_data.end());
Data::key_compare compare = data.key_comp();
Data::key_type a(1);
Data::key_type b(2);
#ifdef TEST_GREATER_THAN
CHECK(!compare(a, b));
CHECK(compare(b, a));
#else
CHECK(compare(a, b));
CHECK(!compare(b, a));
#endif
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_key_compare_using_transparent_comparator)
{
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
const ESet data(initial_data.begin(), initial_data.end());
ESet::key_compare compare = data.key_comp();
int a(1);
ESet::key_type b(2);
CHECK(compare(a, b));
CHECK(!compare(b, a));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_value_compare)
{
const Data data(initial_data.begin(), initial_data.end());
Data::value_compare compare = data.value_comp();
Data::value_type a(1);
Data::value_type b(2);
#ifdef TEST_GREATER_THAN
CHECK(!compare(a, b));
CHECK(compare(b, a));
#else
CHECK(compare(a, b));
CHECK(!compare(b, a));
#endif
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_compare_lower_upper_bound)
{
Data data(initial_data_even.begin(), initial_data_even.end());
Compare_Data compare(initial_data_even.begin(), initial_data_even.end());
std::vector<int> tab(test_data.begin(), test_data.end());
//make sure both data and compare contain same elements
std::vector<int> data_elements(data.begin(), data.end());
std::vector<int> compare_data_elements(compare.begin(), compare.end());
CHECK(data_elements == compare_data_elements);
CHECK_EQUAL(data_elements.size(), MAX_SIZE);
for(std::vector<int>::iterator it = tab.begin() ; it != tab.end() ; ++it)
{
int i = *it;
//lower_bound
CHECK_EQUAL(compare.lower_bound(i) == compare.end(), data.lower_bound(i) == data.end());
//if both end, or none
if((compare.lower_bound(i) == compare.end()) == (data.lower_bound(i) == data.end()))
{
//if both are not end
if(compare.lower_bound(i) != compare.end())
{
CHECK((*compare.lower_bound(i)) == (*data.lower_bound(i)));
}
ETL_OR_STD::pair<Compare_Data::const_iterator, Compare_Data::const_iterator> stlret = compare.equal_range(i);
ETL_OR_STD::pair<Data::const_iterator, Data::const_iterator> etlret = data.equal_range(i);
CHECK_EQUAL(stlret.first == compare.end(), etlret.first == data.end());
if((stlret.first != compare.end()) && (etlret.first != data.end()))
{
CHECK((*stlret.first) == (*etlret.first));
}
CHECK_EQUAL(stlret.second == compare.end(), etlret.second == data.end());
if((stlret.second != compare.end()) && (etlret.second != data.end()))
{
CHECK((*stlret.second) == (*etlret.second));
}
}
//upper_bound
CHECK_EQUAL(compare.upper_bound(i) == compare.end(), data.upper_bound(i) == data.end());
//if both end, or none
if((compare.upper_bound(i) == compare.end()) == (data.upper_bound(i) == data.end()))
{
//if both are not end
if(compare.upper_bound(i) != compare.end())
{
CHECK((*compare.upper_bound(i)) == (*data.upper_bound(i)));
}
}
}
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_compare_lower_upper_bound_using_transparent_comparator)
{
using CSet = std::multiset<int, std::less<int>>;
CSet compare(initial_data.begin(), initial_data.end());
using ESet = etl::multiset<int, MAX_SIZE, etl::less<>>;
ESet data(initial_data.begin(), initial_data.end());
std::vector<int> tab(test_data.begin(), test_data.end());
//make sure both data and compare contain same elements
std::vector<int> data_elements(data.begin(), data.end());
std::vector<int> compare_data_elements(compare.begin(), compare.end());
CHECK(data_elements == compare_data_elements);
CHECK_EQUAL(data_elements.size(), MAX_SIZE);
for (std::vector<int>::iterator it = tab.begin(); it != tab.end(); ++it)
{
int i = *it;
//lower_bound
CHECK_EQUAL(compare.lower_bound(i) == compare.end(), data.lower_bound(i) == data.end());
//if both end, or none
if ((compare.lower_bound(i) == compare.end()) == (data.lower_bound(i) == data.end()))
{
//if both are not end
if (compare.lower_bound(i) != compare.end())
{
CHECK((*compare.lower_bound(i)) == (*data.lower_bound(i)));
}
ETL_OR_STD::pair<CSet::const_iterator, CSet::const_iterator> stlret = compare.equal_range(i);
ETL_OR_STD::pair<ESet::const_iterator, ESet::const_iterator> etlret = data.equal_range(Key(i));
CHECK_EQUAL(stlret.first == compare.end(), etlret.first == data.end());
if ((stlret.first != compare.end()) && (etlret.first != data.end()))
{
CHECK((*stlret.first) == (*etlret.first));
}
CHECK_EQUAL(stlret.second == compare.end(), etlret.second == data.end());
if ((stlret.second != compare.end()) && (etlret.second != data.end()))
{
CHECK((*stlret.second) == (*etlret.second));
}
}
//upper_bound
CHECK_EQUAL(compare.upper_bound(i) == compare.end(), data.upper_bound(i) == data.end());
//if both end, or none
if ((compare.upper_bound(i) == compare.end()) == (data.upper_bound(i) == data.end()))
{
//if both are not end
if (compare.upper_bound(i) != compare.end())
{
CHECK((*compare.upper_bound(i)) == (*data.upper_bound(i)));
}
}
}
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_erase_bug)
{
using Data = etl::multiset<int, 10>;
int keys[10] = { 3, 2, 1, 0, 3, 0, 3, 0, 2, 2 };
Data data;
for (int eltNum = 0; eltNum != 10; ++eltNum)
{
data.insert(Data::value_type(keys[eltNum]));
}
data.erase(2);
int prv = INT_MAX;
Data::const_reverse_iterator pos;
bool pass = true;
for (pos = data.crbegin(); pos != data.crend(); ++pos)
{
if (*pos > prv)
{
pass = false;
break;
}
prv = *pos;
}
CHECK(pass);
}
//*************************************************************************
#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST && !defined(ETL_TEMPLATE_DEDUCTION_GUIDE_TESTS_DISABLED)
TEST_FIXTURE(SetupFixture, test_multiset_template_deduction)
{
etl::multiset data{ std::string("A"), std::string("B"), std::string("C"), std::string("D"), std::string("E"), std::string("F") };
auto v = *data.begin();
using Type = decltype(v);
CHECK((std::is_same_v<std::string, Type>));
decltype(data)::const_iterator itr = data.begin();
CHECK_EQUAL("A", *itr);
++itr;
CHECK_EQUAL("B", *itr);
++itr;
CHECK_EQUAL("C", *itr);
++itr;
CHECK_EQUAL("D", *itr);
++itr;
CHECK_EQUAL("E", *itr);
++itr;
CHECK_EQUAL("F", *itr);
}
#endif
//*************************************************************************
#if ETL_HAS_INITIALIZER_LIST
TEST_FIXTURE(SetupFixture, test_make_multiset)
{
auto data = etl::make_multiset< std::string>(std::string("A"), std::string("B"), std::string("C"), std::string("D"), std::string("E"), std::string("F"));
auto v = *data.begin();
using Type = decltype(v);
CHECK((std::is_same<std::string, Type>::value));
decltype(data)::const_iterator itr = data.begin();
CHECK_EQUAL("A", *itr);
++itr;
CHECK_EQUAL("B", *itr);
++itr;
CHECK_EQUAL("C", *itr);
++itr;
CHECK_EQUAL("D", *itr);
++itr;
CHECK_EQUAL("E", *itr);
++itr;
CHECK_EQUAL("F", *itr);
}
#endif
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_contains)
{
std::array<int, 6U> initial = { 1, 2, 3, 4, 5, 6 };
etl::multiset<int, 6U, etl::less<>> data(initial.begin(), initial.end());
CHECK(data.contains(1));
CHECK(!data.contains(99));
}
//*************************************************************************
TEST_FIXTURE(SetupFixture, test_contains_using_transparent_comparator)
{
std::array<int, 6U> initial = { 1, 2, 3, 4, 5, 6 };
etl::multiset<int, 6U, etl::less<>> data(initial.begin(), initial.end());
CHECK(data.contains(1));
CHECK(data.contains(Key(1)));
CHECK(!data.contains(99));
CHECK(!data.contains(Key(99)));
}
};
}