diff --git a/include/etl/const_multiset.h b/include/etl/const_multiset.h new file mode 100644 index 00000000..ee618480 --- /dev/null +++ b/include/etl/const_multiset.h @@ -0,0 +1,574 @@ +///\file + +/****************************************************************************** +The MIT License(MIT) + +Embedded Template Library. +https://github.com/ETLCPP/etl +https://www.etlcpp.com + +Copyright(c) 2025 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. +******************************************************************************/ + +#ifndef ETL_CONST_MULTISET_INCLUDED +#define ETL_CONST_MULTISET_INCLUDED + +#include "platform.h" + +#if ETL_NOT_USING_CPP11 + #error NOT SUPPORTED FOR C++03 OR BELOW +#endif + +#include "algorithm.h" +#include "type_traits.h" +#include "functional.h" +#include "nth_type.h" +#include "span.h" + +#include "private/comparator_is_transparent.h" + +///\defgroup const_multiset const_multiset +///\ingroup containers + +namespace etl +{ + template > + class iconst_multiset + { + public: + + using key_type = TKey; + using value_type = TKey; + using key_compare = TKeyCompare; + using value_compare = TKeyCompare; + using const_reference = const value_type&; + using const_pointer = const value_type*; + using const_iterator = const value_type*; + using size_type = size_t; + + //************************************************************************* + /// Check that the elements are valid for a multiset. + /// The elements must be sorted. + /// \return true if the elements are valid for the multiset. + //************************************************************************* + ETL_CONSTEXPR14 bool is_valid() const ETL_NOEXCEPT + { + return etl::is_sorted(begin(), end(), vcompare); + } + + //************************************************************************* + ///\brief Gets the beginning of the multiset. + ///\return const_iterator to the beginning of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 const_iterator begin() const ETL_NOEXCEPT + { + return element_list; + } + + //************************************************************************* + ///\brief Gets the beginning of the multiset. + ///\return const_iterator to the beginning of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 const_iterator cbegin() const ETL_NOEXCEPT + { + return element_list; + } + + //************************************************************************* + ///\brief Gets the end of the multiset. + ///\return const_iterator to the end of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 const_iterator end() const ETL_NOEXCEPT + { + return element_list_end; + } + + //************************************************************************* + ///\brief Gets the end of the multiset. + ///\return const_iterator to the end of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 const_iterator cend() const ETL_NOEXCEPT + { + return element_list_end; + } + + //************************************************************************* + ///\brief Gets the beginning of the multiset. + ///\return const_pointer to the beginning of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 const_pointer data() const ETL_NOEXCEPT + { + return element_list; + } + + //************************************************************************* + ///\brief Gets a const_iterator to the value at the key index. + ///\param key The key of the element to find. + ///\return A const_iterator to the value at the index, + /// or end() if not found. + //************************************************************************* + ETL_CONSTEXPR14 const_iterator find(const key_type& key) const ETL_NOEXCEPT + { + const_iterator itr = lower_bound(key); + + if ((itr != end()) && (keys_are_equal(*itr, key))) + { + return itr; + } + + return end(); + } + + //************************************************************************* + ///\brief Gets a const_iterator to the value at the key index. + /// Enabled if the comparator is transparent. + ///\param key The key of the element to find. + ///\return A const_iterator to the value at the index, + /// or end() if not found. + //************************************************************************* + template ::value, int> = 0> + ETL_CONSTEXPR14 const_iterator find(const K& key) const ETL_NOEXCEPT + { + const_iterator itr = lower_bound(key); + + if ((itr != end()) && (keys_are_equal(*itr, key))) + { + return itr; + } + + return end(); + } + + //************************************************************************* + ///\brief Checks if the multiset contains an element with key. + ///\param key The key of the element to check. + ///\return true if the multiset contains an element with key. + //************************************************************************* + ETL_CONSTEXPR14 bool contains(const key_type& key) const ETL_NOEXCEPT + { + return find(key) != end(); + } + + //************************************************************************* + ///\brief Checks if the multiset contains an element with key. + /// Enabled if the comparator is transparent. + ///\param key The key of the element to check. + ///\return true if the multiset contains an element with key. + //************************************************************************* + template ::value, int> = 0> + ETL_CONSTEXPR14 bool contains(const K& key) const ETL_NOEXCEPT + { + return find(key) != end(); + } + + //************************************************************************* + ///\brief Counts the numbeer elements with key. + ///\param key The key of the element to count. + ///\return 0 or 1 + //************************************************************************* + ETL_CONSTEXPR14 size_type count(const key_type& key) const ETL_NOEXCEPT + { + auto range = equal_range(key); + + return size_type(etl::distance(range.first, range.second)); + } + + //************************************************************************* + ///\brief Counts the numbeer elements with key. + /// Enabled if the comparator is transparent. + ///\param key The key of the element to count. + ///\return 0 or 1 + //************************************************************************* + template ::value, int> = 0> + ETL_CONSTEXPR14 size_type count(const K& key) const ETL_NOEXCEPT + { + auto range = equal_range(key); + + return size_type(etl::distance(range.first, range.second)); + } + + //************************************************************************* + ///\brief Returns a range containing all elements with the key. + /// The range is defined by a pair of two iterators, one to the + /// first element that is not less than the key and second to the first + /// element greater than the key. + ///\param key The key of the element + ///\return etl::pair or std::pair containing a pair of iterators. + //************************************************************************* + ETL_CONSTEXPR14 ETL_OR_STD::pair equal_range(const key_type& key) const ETL_NOEXCEPT + { + return etl::equal_range(begin(), end(), key, vcompare); + } + + //************************************************************************* + ///\brief Returns a range containing all elements with the key. + /// The range is defined by a pair of two iterators, one to the + /// first element that is not less than the key and second to the first + /// element greater than the key. + /// Enabled if the comparator is transparent. + ///\param key The key of the element + ///\return etl::pair or std::pair containing a pair of iterators. + //************************************************************************* + template ::value, int> = 0> + ETL_CONSTEXPR14 ETL_OR_STD::pair equal_range(const K& key) const ETL_NOEXCEPT + { + return etl::equal_range(begin(), end(), key, vcompare); + } + + //************************************************************************* + ///\brief Returns a const_iterator to the first element that is not less than the key. + /// Returns a const_iterator to the first element that is not less than the key. + ///\param key The key of the element + ///\return const_iterator to the element or end() + //************************************************************************* + ETL_CONSTEXPR14 const_iterator lower_bound(const key_type& key) const ETL_NOEXCEPT + { + return etl::lower_bound(begin(), end(), key, vcompare); + } + + //************************************************************************* + ///\brief Returns a const_iterator to the first element that is not less than the key. + /// Returns a const_iterator to the first element that is not less than the key. + /// Enabled if the comparator is transparent. + ///\param key The key of the element + ///\return const_iterator to the element or end() + //************************************************************************* + template ::value, int> = 0> + ETL_CONSTEXPR14 const_iterator lower_bound(const K& key) const ETL_NOEXCEPT + { + return etl::lower_bound(begin(), end(), key, vcompare); + } + + //************************************************************************* + ///\brief Returns a const_iterator to the first element that is greater than the key. + /// Returns a const_iterator to the first element that is greater than the key. + ///\param key The key of the element + ///\return const_iterator to the element or end() + //************************************************************************* + ETL_CONSTEXPR14 const_iterator upper_bound(const key_type& key) const ETL_NOEXCEPT + { + return etl::upper_bound(begin(), end(), key, vcompare); + } + + //************************************************************************* + ///\brief Returns a const_iterator to the first element that is greater than the key. + /// Returns a const_iterator to the first element that is greater than the key. + /// Enabled if the comparator is transparent. + ///\param key The key of the element + ///\return const_iterator to the element or end() + //************************************************************************* + template ::value, int> = 0> + ETL_CONSTEXPR14 const_iterator upper_bound(const K& key) const ETL_NOEXCEPT + { + return etl::upper_bound(begin(), end(), key, vcompare); + } + + //************************************************************************* + /// Checks if the multiset is empty. + ///\return true if the multiset is empty. + //************************************************************************* + ETL_CONSTEXPR14 size_type empty() const ETL_NOEXCEPT + { + return size() == 0U; + } + + //************************************************************************* + /// Checks if the multiset is full. + ///\return true if the multiset is full. + //************************************************************************* + ETL_CONSTEXPR14 size_type full() const ETL_NOEXCEPT + { + return (max_elements != 0) && (size() == max_elements); + } + + //************************************************************************* + /// Gets the size of the multiset. + ///\return The size of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 size_type size() const ETL_NOEXCEPT + { + return size_type(element_list_end - element_list); + } + + //************************************************************************* + /// Gets the maximum size of the multiset. + ///\return The maximum size of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 size_type max_size() const ETL_NOEXCEPT + { + return max_elements; + } + + //************************************************************************* + /// Gets the capacity of the multiset. + /// This is always equal to max_size(). + ///\return The capacity of the multiset. + //************************************************************************* + ETL_CONSTEXPR14 size_type capacity() const ETL_NOEXCEPT + { + return max_elements; + } + + //************************************************************************* + /// How to compare two key elements. + ///\return An instance of the key_compare type. + //************************************************************************* + ETL_CONSTEXPR14 key_compare key_comp() const ETL_NOEXCEPT + { + return kcompare; + } + + //************************************************************************* + /// How to compare two value elements. + ///\return An instance of the value_compare type. + //************************************************************************* + ETL_CONSTEXPR14 value_compare value_comp() const ETL_NOEXCEPT + { + return vcompare; + } + + protected: + + //************************************************************************* + /// Constructor + //************************************************************************* + template + ETL_CONSTEXPR14 explicit iconst_multiset(const value_type* element_list_, size_type size_, size_type max_elements_) ETL_NOEXCEPT + : element_list(element_list_) + , element_list_end{element_list_ + size_} + , max_elements(max_elements_) + { + } + + private: + + //********************************************************************* + /// Check to see if the keys are equal. + //********************************************************************* + ETL_CONSTEXPR14 bool keys_are_equal(const key_type& key1, const key_type& key2) const ETL_NOEXCEPT + { + return !key_compare()(key1, key2) && !key_compare()(key2, key1); + } + + //********************************************************************* + /// Check to see if the keys are equal. + /// Enabled if the comparator is transparent. + //********************************************************************* + template ::value, int> = 0> + ETL_CONSTEXPR14 bool keys_are_equal(const K1& key1, const K2& key2) const ETL_NOEXCEPT + { + return !key_compare()(key1, key2) && !key_compare()(key2, key1); + } + + key_compare kcompare; + value_compare vcompare; + + const value_type* element_list; + const value_type* element_list_end; + size_type max_elements; + }; + + //************************************************************************* + /// Multiset type designed for constexpr. + //************************************************************************* + template > + class const_multiset : public iconst_multiset + { + public: + + using base_t = iconst_multiset; + + using key_type = typename base_t::key_type; + using value_type = typename base_t::value_type; + using key_compare = typename base_t::key_compare; + using const_reference = typename base_t::const_reference; + using const_pointer = typename base_t::const_pointer; + using const_iterator = typename base_t::const_iterator; + using size_type = typename base_t::size_type; + + static_assert((etl::is_default_constructible::value), "key_type must be default constructible"); + + //************************************************************************* + ///\brief Construct a const_set from a variadic list of elements. + /// Static asserts if the element type is not constructible. + /// Static asserts if the elements are not of type value_type. + /// Static asserts if the number of elements is greater than the capacity of the const_set. + //************************************************************************* + template + ETL_CONSTEXPR14 explicit const_multiset(TElements&&... elements) ETL_NOEXCEPT + : iconst_multiset(element_list, sizeof...(elements), Size) + , element_list{etl::forward(elements)...} + { + static_assert((etl::are_all_same...>::value), "All elements must be value_type"); + static_assert(sizeof...(elements) <= Size, "Number of elements exceeds capacity"); + } + + private: + + value_type element_list[Size]; + }; + + //************************************************************************* + /// Template deduction guides. + //************************************************************************* +#if ETL_USING_CPP17 + template + const_multiset(TElements...) -> const_multiset, sizeof...(TElements)>; +#endif + + //********************************************************************* + /// Multiset type designed for constexpr. + //********************************************************************* + template > + class const_multiset_ext : public iconst_multiset + { + public: + + using base_t = iconst_multiset; + + using key_type = typename base_t::key_type; + using value_type = typename base_t::value_type; + using key_compare = typename base_t::key_compare; + using const_reference = typename base_t::const_reference; + using const_pointer = typename base_t::const_pointer; + using const_iterator = typename base_t::const_iterator; + using size_type = typename base_t::size_type; + + static_assert((etl::is_default_constructible::value), "key_type must be default constructible"); + + //************************************************************************* + ///\brief Default construct a const_multiset. + //************************************************************************* + ETL_CONSTEXPR14 const_multiset_ext() ETL_NOEXCEPT + : iconst_multiset(nullptr, 0, 0) + { + } + + //************************************************************************* + ///\brief Construct a const_multiset from a variadic list of elements. + //************************************************************************* + template + ETL_CONSTEXPR14 explicit const_multiset_ext(const etl::span& sp) ETL_NOEXCEPT + : iconst_multiset(sp.data(), Size, Size) + { + } + + //************************************************************************* + ///\brief Construct a const_multiset from an array. + //************************************************************************* + template + ETL_CONSTEXPR14 explicit const_multiset_ext(const value_type(&begin_)[Size]) ETL_NOEXCEPT + : iconst_multiset(begin_, Size, Size) + { + } + }; + + //************************************************************************* + /// Template deduction guides. + //************************************************************************* +#if ETL_USING_CPP17 + template + const_multiset_ext(const etl::span&) -> const_multiset_ext; + + template + const_multiset_ext(const TElements(&)[N]) -> const_multiset_ext; +#endif + + //************************************************************************* + /// Equality test. + //************************************************************************* + template + ETL_CONSTEXPR14 bool operator ==(const etl::iconst_multiset& lhs, + const etl::iconst_multiset& rhs) ETL_NOEXCEPT + { + return (lhs.size() == rhs.size()) && etl::equal(lhs.begin(), lhs.end(), rhs.begin()); + } + + //************************************************************************* + /// Inequality test. + //************************************************************************* + template + ETL_CONSTEXPR14 bool operator !=(const etl::iconst_multiset& lhs, + const etl::iconst_multiset& rhs) ETL_NOEXCEPT + { + return !(lhs == rhs); + } + + //************************************************************************* + /// Less than operator. + ///\param lhs Reference to the first list. + ///\param rhs Reference to the second list. + ///\return true if the first list is lexicographically less than the + /// second, otherwise false. + //************************************************************************* + template + ETL_CONSTEXPR14 bool operator <(const etl::iconst_multiset& lhs, + const etl::iconst_multiset& rhs) ETL_NOEXCEPT + { + return etl::lexicographical_compare(lhs.begin(), lhs.end(), + rhs.begin(), rhs.end(), + lhs.value_comp()); + } + + //************************************************************************* + /// Greater than operator. + ///\param lhs Reference to the first list. + ///\param rhs Reference to the second list. + ///\return true if the first list is lexicographically greater than the + /// second, otherwise false. + //************************************************************************* + template + ETL_CONSTEXPR14 bool operator >(const etl::iconst_multiset& lhs, + const etl::iconst_multiset& rhs) ETL_NOEXCEPT + { + return (rhs < lhs); + } + + //************************************************************************* + /// Less than or equal operator. + ///\param lhs Reference to the first list. + ///\param rhs Reference to the second list. + ///\return true if the first list is lexicographically less than or equal + /// to the second, otherwise false. + //************************************************************************* + template + ETL_CONSTEXPR14 bool operator <=(const etl::iconst_multiset& lhs, + const etl::iconst_multiset& rhs) ETL_NOEXCEPT + { + return !(rhs < lhs); + } + + //************************************************************************* + /// Greater than or equal operator. + ///\param lhs Reference to the first list. + ///\param rhs Reference to the second list. + ///\return true if the first list is lexicographically greater than or + /// equal to the second, otherwise false. + //************************************************************************* + template + ETL_CONSTEXPR14 bool operator >=(const etl::iconst_multiset& lhs, + const etl::iconst_multiset& rhs) ETL_NOEXCEPT + { + return !(lhs < rhs); + } +} + +#endif diff --git a/include/etl/const_set.h b/include/etl/const_set.h index a65ab5dd..4ef5194a 100644 --- a/include/etl/const_set.h +++ b/include/etl/const_set.h @@ -398,7 +398,7 @@ namespace etl /// Defines the parameter types using const_key_reference = const key_type&; - static_assert((etl::is_default_constructible::value), "key_type must be default constructible"); + static_assert((etl::is_default_constructible::value), "key_type must be default constructible"); //************************************************************************* ///\brief Construct a const_set from a variadic list of elements. diff --git a/test/test_const_map.cpp b/test/test_const_map.cpp index 98a10923..65efe5b4 100644 --- a/test/test_const_map.cpp +++ b/test/test_const_map.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 diff --git a/test/test_const_map_constexpr.cpp b/test/test_const_map_constexpr.cpp index 64ac1df3..eca2b48e 100644 --- a/test/test_const_map_constexpr.cpp +++ b/test/test_const_map_constexpr.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -102,7 +102,7 @@ namespace using IDataTransparentComparator = etl::iconst_map>; #else using Data = etl::const_map>; - using Data2 = etl::const_map>; + using Data2 = etl::const_map>; using IData = etl::iconst_map>; using DataTransparentComparator = etl::const_map>; using DataTransparentComparator2 = etl::const_map>; @@ -114,7 +114,7 @@ namespace using mapped_type = Data::mapped_type; using const_iterator = Data::const_iterator; - SUITE(test_const_map) + SUITE(test_const_map_constexpr) { //************************************************************************* TEST(test_default_constructor) diff --git a/test/test_const_map_ext.cpp b/test/test_const_map_ext.cpp index b4b35e99..fc3ed33e 100644 --- a/test/test_const_map_ext.cpp +++ b/test/test_const_map_ext.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -96,9 +96,9 @@ namespace using DataTransparentComparator = etl::const_map_ext>; using IDataTransparentComparator = etl::iconst_map>; #else - using Data = etl::const_map>; + using Data = etl::const_map_ext>; using IData = etl::iconst_map>; - using DataTransparentComparator = etl::const_map>; + using DataTransparentComparator = etl::const_map_ext>; using IDataTransparentComparator = etl::iconst_map>; #endif @@ -108,7 +108,7 @@ namespace using const_iterator = Data::const_iterator; using span_type = etl::span; - SUITE(test_const_map) + SUITE(test_const_map_ext) { //************************************************************************* TEST(test_default_constructor) diff --git a/test/test_const_map_ext_constexpr.cpp b/test/test_const_map_ext_constexpr.cpp index bfe58b35..845f9185 100644 --- a/test/test_const_map_ext_constexpr.cpp +++ b/test/test_const_map_ext_constexpr.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -96,9 +96,9 @@ namespace using DataTransparentComparator = etl::const_map_ext>; using IDataTransparentComparator = etl::iconst_map>; #else - using Data = etl::const_map>; + using Data = etl::const_map_ext>; using IData = etl::iconst_map>; - using DataTransparentComparator = etl::const_map>; + using DataTransparentComparator = etl::const_map_ext>; using IDataTransparentComparator = etl::iconst_map>; #endif @@ -108,7 +108,7 @@ namespace using const_iterator = Data::const_iterator; using span_type = etl::span; - SUITE(test_const_map) + SUITE(test_const_map_ext_constexpr) { //************************************************************************* TEST(test_default_constructor) diff --git a/test/test_const_multimap.cpp b/test/test_const_multimap.cpp index 0825778b..46457b41 100644 --- a/test/test_const_multimap.cpp +++ b/test/test_const_multimap.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 diff --git a/test/test_const_multimap_constexpr.cpp b/test/test_const_multimap_constexpr.cpp index 80c4817b..a881c491 100644 --- a/test/test_const_multimap_constexpr.cpp +++ b/test/test_const_multimap_constexpr.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -113,7 +113,7 @@ namespace using mapped_type = Data::mapped_type; using const_iterator = Data::const_iterator; - SUITE(test_const_multimap) + SUITE(test_const_multimap_constexpr) { //************************************************************************* TEST(test_default_constructor) diff --git a/test/test_const_multimap_ext.cpp b/test/test_const_multimap_ext.cpp index 93432fa6..b68ad450 100644 --- a/test/test_const_multimap_ext.cpp +++ b/test/test_const_multimap_ext.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -98,7 +98,7 @@ namespace #else using Data = etl::const_multimap_ext>; using IData = etl::iconst_multimap>; - using DataTransparentComparator = etl::const_multimap_ext>; + using DataTransparentComparator = etl::const_multimap_ext>; using IDataTransparentComparator = etl::iconst_multimap>; #endif @@ -108,7 +108,7 @@ namespace using const_iterator = Data::const_iterator; using span_type = etl::span; - SUITE(test_const_multimap) + SUITE(test_const_multimap_ext) { //************************************************************************* TEST(test_default_constructor) diff --git a/test/test_const_multimap_ext_constexpr.cpp b/test/test_const_multimap_ext_constexpr.cpp index 10789349..0c059c90 100644 --- a/test/test_const_multimap_ext_constexpr.cpp +++ b/test/test_const_multimap_ext_constexpr.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -98,7 +98,7 @@ namespace #else using Data = etl::const_multimap_ext>; using IData = etl::iconst_multimap>; - using DataTransparentComparator = etl::const_multimap_ext>; + using DataTransparentComparator = etl::const_multimap_ext>; using IDataTransparentComparator = etl::iconst_multimap>; #endif @@ -108,7 +108,7 @@ namespace using const_iterator = Data::const_iterator; using span_type = etl::span; - SUITE(test_const_multimap) + SUITE(test_const_multimap_ext_constexpr) { //************************************************************************* TEST(test_default_constructor) diff --git a/test/test_const_multiset.cpp b/test/test_const_multiset.cpp new file mode 100644 index 00000000..ae97994b --- /dev/null +++ b/test/test_const_multiset.cpp @@ -0,0 +1,1326 @@ +/****************************************************************************** +The MIT License(MIT) + +Embedded Template Library. +https://github.com/ETLCPP/etl +https://www.etlcpp.com + +Copyright(c) 2025 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 +#include +#include +#include + +#include "etl/const_multiset.h" + +#include "data.h" + +namespace +{ + static const size_t Max_Size = 10UL; + + //************************************************************************* + // The key type + //************************************************************************* + struct Key + { + // Default constructor + constexpr Key() + : k(0) + { + } + + // Construct from char key + constexpr explicit Key(char k_) + : k(k_) + { + } + + char k; + }; + + // Less-than operator for Key < Key + constexpr bool operator <(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k < rhs.k); + } + + // Less-than operator for Key < char + constexpr bool operator <(const Key& lhs, char rhs) noexcept + { + return (lhs.k < rhs); + } + + // Less-than operator for char < Key + constexpr bool operator <(char lhs, const Key& rhs) noexcept + { + return (lhs < rhs.k); + } + + // Equality operator for Key == Key + constexpr bool operator ==(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k == rhs.k); + } + + // Equality operator for Key != Key + constexpr bool operator !=(const Key& lhs, const Key& rhs) noexcept + { + return !(lhs.k == rhs.k); + } + +#define TEST_GREATER_THAN +#ifdef TEST_GREATER_THAN + using Data = etl::const_multiset>; + using Data2 = etl::const_multiset>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset>; + using DataTransparentComparator2 = etl::const_multiset>; + using IDataTransparentComparator = etl::iconst_multiset>; +#else + using Data = etl::const_multiset>; + using Data2 = etl::const_multiset>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset>; + using DataTransparentComparator2 = etl::const_multiset>; + using IDataTransparentComparator = etl::iconst_multiset>; +#endif + + using value_type = Data::value_type; + using key_type = Data::key_type; + using const_iterator = Data::const_iterator; + + SUITE(test_const_multiset) + { + //************************************************************************* + TEST(test_default_constructor) + { + static const Data data; + + static const bool is_valid = data.is_valid(); + static const size_t size = data.size(); + static const bool empty = data.empty(); + static const bool full = data.full(); + static const size_t capacity = data.capacity(); + static const size_t max_size = data.max_size(); + static const const_iterator begin = data.begin(); + static const const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 0UL); + CHECK_TRUE(empty); + CHECK_FALSE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_TRUE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_min_size) + { + static const Data data{ Key('A') }; + + static const bool is_valid = data.is_valid(); + static const size_t size = data.size(); + static const bool empty = data.empty(); + static const bool full = data.full(); + static const size_t capacity = data.capacity(); + static const size_t max_size = data.max_size(); + static const const_iterator begin = data.begin(); + static const const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 1U); + CHECK_FALSE(empty); + CHECK_FALSE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_FALSE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_max_size) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const bool is_valid = data.is_valid(); + static const size_t size = data.size(); + static const bool empty = data.empty(); + static const bool full = data.full(); + static const size_t capacity = data.capacity(); + static const size_t max_size = data.max_size(); + static const const_iterator begin = data.begin(); + static const const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == Max_Size); + CHECK_FALSE(empty); + CHECK_TRUE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_FALSE(begin == end); + } + + //************************************************************************* + // Enable to check static_assert "Number of elements exceeds capacity" + //************************************************************************* + //TEST(test_constructor_excess_size) + //{ + // static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + // Key('F'), Key('G'), value_type{Key('G')), 7 }, Key('G'), Key('J'), + // Key('K') }; + //} + +#if ETL_USING_CPP17 + //************************************************************************* + TEST(test_cpp17_deduced_constructor) + { + static const etl::const_multiset data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; + + etl::const_multiset check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + CHECK_TRUE(data.is_valid()); + CHECK_TRUE(data.size() == Max_Size); + CHECK_FALSE(data.empty()); + CHECK_TRUE(data.full()); + CHECK_TRUE(data.capacity() == Max_Size); + CHECK_TRUE(data.max_size() == Max_Size); + CHECK_FALSE(data.begin() == data.end()); + } +#endif + + //************************************************************************* + TEST(test_begin_const) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + CHECK_TRUE(data.is_valid()); + static const auto value = *data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(Key('J') == value); +#else + CHECK_TRUE(Key('A') == value); +#endif + } + + //************************************************************************* + TEST(test_end_const) + { + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; + + static const const_iterator end_itr = data.end(); + + CHECK_TRUE(end_itr == (data.begin() + data.size())); + } + + //************************************************************************* + TEST(test_equal_range_const) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const ETL_OR_STD::pair resultA = data.equal_range(Key('A')); + static const ETL_OR_STD::pair resultB = data.equal_range(Key('B')); + static const ETL_OR_STD::pair resultC = data.equal_range(Key('C')); + static const ETL_OR_STD::pair resultD = data.equal_range(Key('D')); + static const ETL_OR_STD::pair resultE = data.equal_range(Key('E')); + static const ETL_OR_STD::pair resultF = data.equal_range(Key('F')); + static const ETL_OR_STD::pair resultG = data.equal_range(Key('G')); + static const ETL_OR_STD::pair resultH = data.equal_range(Key('H')); + static const ETL_OR_STD::pair resultI = data.equal_range(Key('I')); + static const ETL_OR_STD::pair resultJ = data.equal_range(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_equal_range_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const ETL_OR_STD::pair resultA = data.equal_range('A'); + static const ETL_OR_STD::pair resultB = data.equal_range('B'); + static const ETL_OR_STD::pair resultC = data.equal_range('C'); + static const ETL_OR_STD::pair resultD = data.equal_range('D'); + static const ETL_OR_STD::pair resultE = data.equal_range('E'); + static const ETL_OR_STD::pair resultF = data.equal_range('F'); + static const ETL_OR_STD::pair resultG = data.equal_range('G'); + static const ETL_OR_STD::pair resultH = data.equal_range('H'); + static const ETL_OR_STD::pair resultI = data.equal_range('I'); + static const ETL_OR_STD::pair resultJ = data.equal_range('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const const_iterator resultA = data.lower_bound(Key('A')); + static const const_iterator resultB = data.lower_bound(Key('B')); + static const const_iterator resultC = data.lower_bound(Key('C')); + static const const_iterator resultD = data.lower_bound(Key('D')); + static const const_iterator resultE = data.lower_bound(Key('E')); + static const const_iterator resultF = data.lower_bound(Key('F')); + static const const_iterator resultG = data.lower_bound(Key('G')); + static const const_iterator resultH = data.lower_bound(Key('H')); + static const const_iterator resultI = data.lower_bound(Key('I')); + static const const_iterator resultJ = data.lower_bound(Key('J')); + static const const_iterator resultK = data.lower_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const const_iterator resultA = data.lower_bound('A'); + static const const_iterator resultB = data.lower_bound('B'); + static const const_iterator resultC = data.lower_bound('C'); + static const const_iterator resultD = data.lower_bound('D'); + static const const_iterator resultE = data.lower_bound('E'); + static const const_iterator resultF = data.lower_bound('F'); + static const const_iterator resultG = data.lower_bound('G'); + static const const_iterator resultH = data.lower_bound('H'); + static const const_iterator resultI = data.lower_bound('I'); + static const const_iterator resultJ = data.lower_bound('J'); + static const const_iterator resultK = data.lower_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const const_iterator resultA = data.upper_bound(Key('A')); + static const const_iterator resultB = data.upper_bound(Key('B')); + static const const_iterator resultC = data.upper_bound(Key('C')); + static const const_iterator resultD = data.upper_bound(Key('D')); + static const const_iterator resultE = data.upper_bound(Key('E')); + static const const_iterator resultF = data.upper_bound(Key('F')); + static const const_iterator resultG = data.upper_bound(Key('G')); + static const const_iterator resultH = data.upper_bound(Key('H')); + static const const_iterator resultI = data.upper_bound(Key('I')); + static const const_iterator resultJ = data.upper_bound(Key('J')); + static const const_iterator resultK = data.upper_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const const_iterator resultA = data.upper_bound('A'); + static const const_iterator resultB = data.upper_bound('B'); + static const const_iterator resultC = data.upper_bound('C'); + static const const_iterator resultD = data.upper_bound('D'); + static const const_iterator resultE = data.upper_bound('E'); + static const const_iterator resultF = data.upper_bound('F'); + static const const_iterator resultG = data.upper_bound('G'); + static const const_iterator resultH = data.upper_bound('H'); + static const const_iterator resultI = data.upper_bound('I'); + static const const_iterator resultJ = data.upper_bound('J'); + static const const_iterator resultK = data.upper_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_count_const) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + CHECK_EQUAL(1, data.count(Key('A'))); + CHECK_EQUAL(1, data.count(Key('B'))); + CHECK_EQUAL(1, data.count(Key('C'))); + CHECK_EQUAL(1, data.count(Key('D'))); + CHECK_EQUAL(1, data.count(Key('E'))); + CHECK_EQUAL(1, data.count(Key('F'))); + CHECK_EQUAL(3, data.count(Key('G'))); + CHECK_EQUAL(0, data.count(Key('H'))); + CHECK_EQUAL(0, data.count(Key('I'))); + CHECK_EQUAL(1, data.count(Key('J'))); + CHECK_EQUAL(0, data.count(Key('K'))); + } + + //************************************************************************* + TEST(test_count_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + CHECK_EQUAL(1, data.count('A')); + CHECK_EQUAL(1, data.count('B')); + CHECK_EQUAL(1, data.count('C')); + CHECK_EQUAL(1, data.count('D')); + CHECK_EQUAL(1, data.count('E')); + CHECK_EQUAL(1, data.count('F')); + CHECK_EQUAL(3, data.count('G')); + CHECK_EQUAL(0, data.count('H')); + CHECK_EQUAL(0, data.count('I')); + CHECK_EQUAL(1, data.count('J')); + CHECK_EQUAL(0, data.count('K')); + } + + //************************************************************************* + TEST(test_const_iterator) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + const_iterator itr = data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE(itr == data.end()); +#else + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE(itr == data.end()); +#endif + } + + //************************************************************************* + TEST(test_find_const) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const const_iterator resultA = data.find(Key('A')); + static const const_iterator resultB = data.find(Key('B')); + static const const_iterator resultC = data.find(Key('C')); + static const const_iterator resultD = data.find(Key('D')); + static const const_iterator resultE = data.find(Key('E')); + static const const_iterator resultF = data.find(Key('F')); + static const const_iterator resultG = data.find(Key('G')); + static const const_iterator resultH = data.find(Key('H')); + static const const_iterator resultI = data.find(Key('I')); + static const const_iterator resultJ = data.find(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_find_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const const_iterator resultA = data.find('A'); + static const const_iterator resultB = data.find('B'); + static const const_iterator resultC = data.find('C'); + static const const_iterator resultD = data.find('D'); + static const const_iterator resultE = data.find('E'); + static const const_iterator resultF = data.find('F'); + static const const_iterator resultG = data.find('G'); + static const const_iterator resultH = data.find('H'); + static const const_iterator resultI = data.find('I'); + static const const_iterator resultJ = data.find('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_contains_const) + { +#ifdef TEST_GREATER_THAN + static const Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const bool containsA = data.contains(Key('A')); + static const bool containsB = data.contains(Key('B')); + static const bool containsC = data.contains(Key('C')); + static const bool containsD = data.contains(Key('D')); + static const bool containsE = data.contains(Key('E')); + static const bool containsF = data.contains(Key('F')); + static const bool containsG = data.contains(Key('G')); + static const bool containsH = data.contains(Key('H')); + static const bool containsI = data.contains(Key('I')); + static const bool containsJ = data.contains(Key('J')); + static const bool containsK = data.contains(Key('K')); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_contains_with_transparent_comparator_const) + { +#ifdef TEST_GREATER_THAN + static const DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const bool containsA = data.contains('A'); + static const bool containsB = data.contains('B'); + static const bool containsC = data.contains('C'); + static const bool containsD = data.contains('D'); + static const bool containsE = data.contains('E'); + static const bool containsF = data.contains('F'); + static const bool containsG = data.contains('G'); + static const bool containsH = data.contains('H'); + static const bool containsI = data.contains('I'); + static const bool containsJ = data.contains('J'); + static const bool containsK = data.contains('K'); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_key_comp_const) + { + static const Data data; + static const Data::key_compare compare = data.key_comp(); + + static const bool compareAA = compare(Key{ 'A' }, Key{ 'A' }); + static const bool compareBA = compare(Key{ 'B' }, Key{ 'A' }); + static const bool compareAB = compare(Key{ 'A' }, Key{ 'B' }); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_key_comp_const_transparent_comparator) + { + static const DataTransparentComparator data; + static const DataTransparentComparator::key_compare compare = data.key_comp(); + + static const bool compareAA = compare('A', 'A'); + static const bool compareBA = compare('B', 'A'); + static const bool compareAB = compare('A', 'B'); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const) + { + static const Data data; + static const Data::value_compare compare = data.value_comp(); + + static const bool compareAA1 = compare(Key('A'), Key('A')); + static const bool compareAA2 = compare(Key('A'), Key{ 'A' }); + static const bool compareAA3 = compare(Key{ 'A' }, Key('A')); + + static const bool compareBA1 = compare(Key('B'), Key('A')); + static const bool compareBA2 = compare(Key('B'), Key{ 'A' }); + static const bool compareBA3 = compare(Key{ 'B' }, Key('A')); + + static const bool compareAB1 = compare(Key('A'), Key('B')); + static const bool compareAB2 = compare(Key('A'), Key{ 'B' }); + static const bool compareAB3 = compare(Key{ 'A' }, Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const_transparent_comparator) + { + static const DataTransparentComparator data; + static const DataTransparentComparator::value_compare compare = data.value_comp(); + + static const bool compareAA1 = compare(Key('A'), Key('A')); + static const bool compareAA2 = compare(Key('A'), 'A'); + static const bool compareAA3 = compare('A', Key('A')); + + static const bool compareBA1 = compare(Key('B'), Key('A')); + static const bool compareBA2 = compare(Key('B'), 'A'); + static const bool compareBA3 = compare('B', Key('A')); + + static const bool compareAB1 = compare(Key('A'), Key('B')); + static const bool compareAB2 = compare(Key('A'), 'B'); + static const bool compareAB3 = compare('A', Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_equal) + { + static const Data data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const Data2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const bool equal12 = (data1 == data2); + static const bool equal13 = (data1 == data3); + static const bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_equal_with_transparent_comparator) + { + static const DataTransparentComparator data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const DataTransparentComparator2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const bool equal12 = (data1 == data2); + static const bool equal13 = (data1 == data3); + static const bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_not_equal) + { + static const Data data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const Data2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const bool not_equal12 = (data1 != data2); + static const bool not_equal13 = (data1 != data3); + static const bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_not_equal_with_transparent_comparator) + { + static const DataTransparentComparator data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const DataTransparentComparator2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const bool not_equal12 = (data1 != data2); + static const bool not_equal13 = (data1 != data3); + static const bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_less_than) + { + static const Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool less_than12 = (data1 < data2); + static const bool less_than23 = (data2 < data3); + static const bool less_than21 = (data2 < data1); + static const bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_with_transparent_comparator) + { + static const DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool less_than12 = (data1 < data2); + static const bool less_than23 = (data2 < data3); + static const bool less_than21 = (data2 < data1); + static const bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal) + { + static const Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool less_than_equal12 = (data1 <= data2); + static const bool less_than_equal23 = (data2 <= data3); + static const bool less_than_equal21 = (data2 <= data1); + static const bool less_than_equal32 = (data3 <= data2); + static const bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal_with_transparent_comparator) + { + static const DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool less_than_equal12 = (data1 <= data2); + static const bool less_than_equal23 = (data2 <= data3); + static const bool less_than_equal21 = (data2 <= data1); + static const bool less_than_equal32 = (data3 <= data2); + static const bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than) + { + static const Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool greater_than12 = (data1 > data2); + static const bool greater_than23 = (data2 > data3); + static const bool greater_than21 = (data2 > data1); + static const bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_with_transparent_comparator) + { + static const DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool greater_than12 = (data1 > data2); + static const bool greater_than23 = (data2 > data3); + static const bool greater_than21 = (data2 > data1); + static const bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal) + { + static const Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool greater_than_equal12 = (data1 >= data2); + static const bool greater_than_equal23 = (data2 >= data3); + static const bool greater_than_equal21 = (data2 >= data1); + static const bool greater_than_equal32 = (data3 >= data2); + static const bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal_with_transparent_comparator) + { + static const DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const bool greater_than_equal12 = (data1 >= data2); + static const bool greater_than_equal23 = (data2 >= data3); + static const bool greater_than_equal21 = (data2 >= data1); + static const bool greater_than_equal32 = (data3 >= data2); + static const bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + }; +} diff --git a/test/test_const_multiset_constexpr.cpp b/test/test_const_multiset_constexpr.cpp new file mode 100644 index 00000000..d431466a --- /dev/null +++ b/test/test_const_multiset_constexpr.cpp @@ -0,0 +1,1326 @@ +/****************************************************************************** +The MIT License(MIT) + +Embedded Template Library. +https://github.com/ETLCPP/etl +https://www.etlcpp.com + +Copyright(c) 2025 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 +#include +#include +#include + +#include "etl/const_multiset.h" + +#include "data.h" + +namespace +{ + static constexpr size_t Max_Size = 10UL; + + //************************************************************************* + // The key type + //************************************************************************* + struct Key + { + // Default constructor + constexpr Key() + : k(0) + { + } + + // Construct from char key + constexpr explicit Key(char k_) + : k(k_) + { + } + + char k; + }; + + // Less-than operator for Key < Key + constexpr bool operator <(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k < rhs.k); + } + + // Less-than operator for Key < char + constexpr bool operator <(const Key& lhs, char rhs) noexcept + { + return (lhs.k < rhs); + } + + // Less-than operator for char < Key + constexpr bool operator <(char lhs, const Key& rhs) noexcept + { + return (lhs < rhs.k); + } + + // Equality operator for Key == Key + constexpr bool operator ==(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k == rhs.k); + } + + // Equality operator for Key != Key + constexpr bool operator !=(const Key& lhs, const Key& rhs) noexcept + { + return !(lhs.k == rhs.k); + } + +#define TEST_GREATER_THAN +#ifdef TEST_GREATER_THAN + using Data = etl::const_multiset>; + using Data2 = etl::const_multiset>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset>; + using DataTransparentComparator2 = etl::const_multiset>; + using IDataTransparentComparator = etl::iconst_multiset>; +#else + using Data = etl::const_multiset>; + using Data2 = etl::const_multiset>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset>; + using DataTransparentComparator2 = etl::const_multiset>; + using IDataTransparentComparator = etl::iconst_multiset>; +#endif + + using value_type = Data::value_type; + using key_type = Data::key_type; + using const_iterator = Data::const_iterator; + + SUITE(test_const_multiset_constexpr) + { + //************************************************************************* + TEST(test_default_constructor) + { + static constexpr Data data; + + static constexpr bool is_valid = data.is_valid(); + static constexpr size_t size = data.size(); + static constexpr bool empty = data.empty(); + static constexpr bool full = data.full(); + static constexpr size_t capacity = data.capacity(); + static constexpr size_t max_size = data.max_size(); + static constexpr const_iterator begin = data.begin(); + static constexpr const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 0UL); + CHECK_TRUE(empty); + CHECK_FALSE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_TRUE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_min_size) + { + static constexpr Data data{ Key('A') }; + + static constexpr bool is_valid = data.is_valid(); + static constexpr size_t size = data.size(); + static constexpr bool empty = data.empty(); + static constexpr bool full = data.full(); + static constexpr size_t capacity = data.capacity(); + static constexpr size_t max_size = data.max_size(); + static constexpr const_iterator begin = data.begin(); + static constexpr const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 1U); + CHECK_FALSE(empty); + CHECK_FALSE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_FALSE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_max_size) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr bool is_valid = data.is_valid(); + static constexpr size_t size = data.size(); + static constexpr bool empty = data.empty(); + static constexpr bool full = data.full(); + static constexpr size_t capacity = data.capacity(); + static constexpr size_t max_size = data.max_size(); + static constexpr const_iterator begin = data.begin(); + static constexpr const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == Max_Size); + CHECK_FALSE(empty); + CHECK_TRUE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_FALSE(begin == end); + } + + //************************************************************************* + // Enable to check static_assert "Number of elements exceeds capacity" + //************************************************************************* + //TEST(test_constructor_excess_size) + //{ + // static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + // Key('F'), Key('G'), value_type{Key('G')), 7 }, Key('G'), Key('J'), + // Key('K') }; + //} + +#if ETL_USING_CPP17 + //************************************************************************* + TEST(test_cpp17_deduced_constructor) + { + static constexpr etl::const_multiset data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; + + etl::const_multiset check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + CHECK_TRUE(data.is_valid()); + CHECK_TRUE(data.size() == Max_Size); + CHECK_FALSE(data.empty()); + CHECK_TRUE(data.full()); + CHECK_TRUE(data.capacity() == Max_Size); + CHECK_TRUE(data.max_size() == Max_Size); + CHECK_FALSE(data.begin() == data.end()); + } +#endif + + //************************************************************************* + TEST(test_begin_const) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + CHECK_TRUE(data.is_valid()); + static constexpr auto value = *data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(Key('J') == value); +#else + CHECK_TRUE(Key('A') == value); +#endif + } + + //************************************************************************* + TEST(test_end_const) + { + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; + + static constexpr const_iterator end_itr = data.end(); + + CHECK_TRUE(end_itr == (data.begin() + data.size())); + } + + //************************************************************************* + TEST(test_equal_range_const) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr ETL_OR_STD::pair resultA = data.equal_range(Key('A')); + static constexpr ETL_OR_STD::pair resultB = data.equal_range(Key('B')); + static constexpr ETL_OR_STD::pair resultC = data.equal_range(Key('C')); + static constexpr ETL_OR_STD::pair resultD = data.equal_range(Key('D')); + static constexpr ETL_OR_STD::pair resultE = data.equal_range(Key('E')); + static constexpr ETL_OR_STD::pair resultF = data.equal_range(Key('F')); + static constexpr ETL_OR_STD::pair resultG = data.equal_range(Key('G')); + static constexpr ETL_OR_STD::pair resultH = data.equal_range(Key('H')); + static constexpr ETL_OR_STD::pair resultI = data.equal_range(Key('I')); + static constexpr ETL_OR_STD::pair resultJ = data.equal_range(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_equal_range_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr ETL_OR_STD::pair resultA = data.equal_range('A'); + static constexpr ETL_OR_STD::pair resultB = data.equal_range('B'); + static constexpr ETL_OR_STD::pair resultC = data.equal_range('C'); + static constexpr ETL_OR_STD::pair resultD = data.equal_range('D'); + static constexpr ETL_OR_STD::pair resultE = data.equal_range('E'); + static constexpr ETL_OR_STD::pair resultF = data.equal_range('F'); + static constexpr ETL_OR_STD::pair resultG = data.equal_range('G'); + static constexpr ETL_OR_STD::pair resultH = data.equal_range('H'); + static constexpr ETL_OR_STD::pair resultI = data.equal_range('I'); + static constexpr ETL_OR_STD::pair resultJ = data.equal_range('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr const_iterator resultA = data.lower_bound(Key('A')); + static constexpr const_iterator resultB = data.lower_bound(Key('B')); + static constexpr const_iterator resultC = data.lower_bound(Key('C')); + static constexpr const_iterator resultD = data.lower_bound(Key('D')); + static constexpr const_iterator resultE = data.lower_bound(Key('E')); + static constexpr const_iterator resultF = data.lower_bound(Key('F')); + static constexpr const_iterator resultG = data.lower_bound(Key('G')); + static constexpr const_iterator resultH = data.lower_bound(Key('H')); + static constexpr const_iterator resultI = data.lower_bound(Key('I')); + static constexpr const_iterator resultJ = data.lower_bound(Key('J')); + static constexpr const_iterator resultK = data.lower_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr const_iterator resultA = data.lower_bound('A'); + static constexpr const_iterator resultB = data.lower_bound('B'); + static constexpr const_iterator resultC = data.lower_bound('C'); + static constexpr const_iterator resultD = data.lower_bound('D'); + static constexpr const_iterator resultE = data.lower_bound('E'); + static constexpr const_iterator resultF = data.lower_bound('F'); + static constexpr const_iterator resultG = data.lower_bound('G'); + static constexpr const_iterator resultH = data.lower_bound('H'); + static constexpr const_iterator resultI = data.lower_bound('I'); + static constexpr const_iterator resultJ = data.lower_bound('J'); + static constexpr const_iterator resultK = data.lower_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr const_iterator resultA = data.upper_bound(Key('A')); + static constexpr const_iterator resultB = data.upper_bound(Key('B')); + static constexpr const_iterator resultC = data.upper_bound(Key('C')); + static constexpr const_iterator resultD = data.upper_bound(Key('D')); + static constexpr const_iterator resultE = data.upper_bound(Key('E')); + static constexpr const_iterator resultF = data.upper_bound(Key('F')); + static constexpr const_iterator resultG = data.upper_bound(Key('G')); + static constexpr const_iterator resultH = data.upper_bound(Key('H')); + static constexpr const_iterator resultI = data.upper_bound(Key('I')); + static constexpr const_iterator resultJ = data.upper_bound(Key('J')); + static constexpr const_iterator resultK = data.upper_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr const_iterator resultA = data.upper_bound('A'); + static constexpr const_iterator resultB = data.upper_bound('B'); + static constexpr const_iterator resultC = data.upper_bound('C'); + static constexpr const_iterator resultD = data.upper_bound('D'); + static constexpr const_iterator resultE = data.upper_bound('E'); + static constexpr const_iterator resultF = data.upper_bound('F'); + static constexpr const_iterator resultG = data.upper_bound('G'); + static constexpr const_iterator resultH = data.upper_bound('H'); + static constexpr const_iterator resultI = data.upper_bound('I'); + static constexpr const_iterator resultJ = data.upper_bound('J'); + static constexpr const_iterator resultK = data.upper_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_count_const) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + CHECK_EQUAL(1, data.count(Key('A'))); + CHECK_EQUAL(1, data.count(Key('B'))); + CHECK_EQUAL(1, data.count(Key('C'))); + CHECK_EQUAL(1, data.count(Key('D'))); + CHECK_EQUAL(1, data.count(Key('E'))); + CHECK_EQUAL(1, data.count(Key('F'))); + CHECK_EQUAL(3, data.count(Key('G'))); + CHECK_EQUAL(0, data.count(Key('H'))); + CHECK_EQUAL(0, data.count(Key('I'))); + CHECK_EQUAL(1, data.count(Key('J'))); + CHECK_EQUAL(0, data.count(Key('K'))); + } + + //************************************************************************* + TEST(test_count_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + CHECK_EQUAL(1, data.count('A')); + CHECK_EQUAL(1, data.count('B')); + CHECK_EQUAL(1, data.count('C')); + CHECK_EQUAL(1, data.count('D')); + CHECK_EQUAL(1, data.count('E')); + CHECK_EQUAL(1, data.count('F')); + CHECK_EQUAL(3, data.count('G')); + CHECK_EQUAL(0, data.count('H')); + CHECK_EQUAL(0, data.count('I')); + CHECK_EQUAL(1, data.count('J')); + CHECK_EQUAL(0, data.count('K')); + } + + //************************************************************************* + TEST(test_const_iterator) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + const_iterator itr = data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE(itr == data.end()); +#else + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE(itr == data.end()); +#endif + } + + //************************************************************************* + TEST(test_find_const) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr const_iterator resultA = data.find(Key('A')); + static constexpr const_iterator resultB = data.find(Key('B')); + static constexpr const_iterator resultC = data.find(Key('C')); + static constexpr const_iterator resultD = data.find(Key('D')); + static constexpr const_iterator resultE = data.find(Key('E')); + static constexpr const_iterator resultF = data.find(Key('F')); + static constexpr const_iterator resultG = data.find(Key('G')); + static constexpr const_iterator resultH = data.find(Key('H')); + static constexpr const_iterator resultI = data.find(Key('I')); + static constexpr const_iterator resultJ = data.find(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_find_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr const_iterator resultA = data.find('A'); + static constexpr const_iterator resultB = data.find('B'); + static constexpr const_iterator resultC = data.find('C'); + static constexpr const_iterator resultD = data.find('D'); + static constexpr const_iterator resultE = data.find('E'); + static constexpr const_iterator resultF = data.find('F'); + static constexpr const_iterator resultG = data.find('G'); + static constexpr const_iterator resultH = data.find('H'); + static constexpr const_iterator resultI = data.find('I'); + static constexpr const_iterator resultJ = data.find('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_contains_const) + { +#ifdef TEST_GREATER_THAN + static constexpr Data data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr Data data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr bool containsA = data.contains(Key('A')); + static constexpr bool containsB = data.contains(Key('B')); + static constexpr bool containsC = data.contains(Key('C')); + static constexpr bool containsD = data.contains(Key('D')); + static constexpr bool containsE = data.contains(Key('E')); + static constexpr bool containsF = data.contains(Key('F')); + static constexpr bool containsG = data.contains(Key('G')); + static constexpr bool containsH = data.contains(Key('H')); + static constexpr bool containsI = data.contains(Key('I')); + static constexpr bool containsJ = data.contains(Key('J')); + static constexpr bool containsK = data.contains(Key('K')); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_contains_with_transparent_comparator_const) + { +#ifdef TEST_GREATER_THAN + static constexpr DataTransparentComparator data{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr DataTransparentComparator data{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr bool containsA = data.contains('A'); + static constexpr bool containsB = data.contains('B'); + static constexpr bool containsC = data.contains('C'); + static constexpr bool containsD = data.contains('D'); + static constexpr bool containsE = data.contains('E'); + static constexpr bool containsF = data.contains('F'); + static constexpr bool containsG = data.contains('G'); + static constexpr bool containsH = data.contains('H'); + static constexpr bool containsI = data.contains('I'); + static constexpr bool containsJ = data.contains('J'); + static constexpr bool containsK = data.contains('K'); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_key_comp_const) + { + static constexpr Data data; + static constexpr Data::key_compare compare = data.key_comp(); + + static constexpr bool compareAA = compare(Key{ 'A' }, Key{ 'A' }); + static constexpr bool compareBA = compare(Key{ 'B' }, Key{ 'A' }); + static constexpr bool compareAB = compare(Key{ 'A' }, Key{ 'B' }); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_key_comp_const_transparent_comparator) + { + static constexpr DataTransparentComparator data; + static constexpr DataTransparentComparator::key_compare compare = data.key_comp(); + + static constexpr bool compareAA = compare('A', 'A'); + static constexpr bool compareBA = compare('B', 'A'); + static constexpr bool compareAB = compare('A', 'B'); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const) + { + static constexpr Data data; + static constexpr Data::value_compare compare = data.value_comp(); + + static constexpr bool compareAA1 = compare(Key('A'), Key('A')); + static constexpr bool compareAA2 = compare(Key('A'), Key{ 'A' }); + static constexpr bool compareAA3 = compare(Key{ 'A' }, Key('A')); + + static constexpr bool compareBA1 = compare(Key('B'), Key('A')); + static constexpr bool compareBA2 = compare(Key('B'), Key{ 'A' }); + static constexpr bool compareBA3 = compare(Key{ 'B' }, Key('A')); + + static constexpr bool compareAB1 = compare(Key('A'), Key('B')); + static constexpr bool compareAB2 = compare(Key('A'), Key{ 'B' }); + static constexpr bool compareAB3 = compare(Key{ 'A' }, Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const_transparent_comparator) + { + static constexpr DataTransparentComparator data; + static constexpr DataTransparentComparator::value_compare compare = data.value_comp(); + + static constexpr bool compareAA1 = compare(Key('A'), Key('A')); + static constexpr bool compareAA2 = compare(Key('A'), 'A'); + static constexpr bool compareAA3 = compare('A', Key('A')); + + static constexpr bool compareBA1 = compare(Key('B'), Key('A')); + static constexpr bool compareBA2 = compare(Key('B'), 'A'); + static constexpr bool compareBA3 = compare('B', Key('A')); + + static constexpr bool compareAB1 = compare(Key('A'), Key('B')); + static constexpr bool compareAB2 = compare(Key('A'), 'B'); + static constexpr bool compareAB3 = compare('A', Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_equal) + { + static constexpr Data data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr Data2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr bool equal12 = (data1 == data2); + static constexpr bool equal13 = (data1 == data3); + static constexpr bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_equal_with_transparent_comparator) + { + static constexpr DataTransparentComparator data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr bool equal12 = (data1 == data2); + static constexpr bool equal13 = (data1 == data3); + static constexpr bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_not_equal) + { + static constexpr Data data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr Data2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr bool not_equal12 = (data1 != data2); + static constexpr bool not_equal13 = (data1 != data3); + static constexpr bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_not_equal_with_transparent_comparator) + { + static constexpr DataTransparentComparator data1{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data3{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator2 data4{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr bool not_equal12 = (data1 != data2); + static constexpr bool not_equal13 = (data1 != data3); + static constexpr bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_less_than) + { + static constexpr Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool less_than12 = (data1 < data2); + static constexpr bool less_than23 = (data2 < data3); + static constexpr bool less_than21 = (data2 < data1); + static constexpr bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_with_transparent_comparator) + { + static constexpr DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool less_than12 = (data1 < data2); + static constexpr bool less_than23 = (data2 < data3); + static constexpr bool less_than21 = (data2 < data1); + static constexpr bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal) + { + static constexpr Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool less_than_equal12 = (data1 <= data2); + static constexpr bool less_than_equal23 = (data2 <= data3); + static constexpr bool less_than_equal21 = (data2 <= data1); + static constexpr bool less_than_equal32 = (data3 <= data2); + static constexpr bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal_with_transparent_comparator) + { + static constexpr DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool less_than_equal12 = (data1 <= data2); + static constexpr bool less_than_equal23 = (data2 <= data3); + static constexpr bool less_than_equal21 = (data2 <= data1); + static constexpr bool less_than_equal32 = (data3 <= data2); + static constexpr bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than) + { + static constexpr Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool greater_than12 = (data1 > data2); + static constexpr bool greater_than23 = (data2 > data3); + static constexpr bool greater_than21 = (data2 > data1); + static constexpr bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_with_transparent_comparator) + { + static constexpr DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool greater_than12 = (data1 > data2); + static constexpr bool greater_than23 = (data2 > data3); + static constexpr bool greater_than21 = (data2 > data1); + static constexpr bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal) + { + static constexpr Data data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool greater_than_equal12 = (data1 >= data2); + static constexpr bool greater_than_equal23 = (data2 >= data3); + static constexpr bool greater_than_equal21 = (data2 >= data1); + static constexpr bool greater_than_equal32 = (data3 >= data2); + static constexpr bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal_with_transparent_comparator) + { + static constexpr DataTransparentComparator data1{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data2{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data3{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr bool greater_than_equal12 = (data1 >= data2); + static constexpr bool greater_than_equal23 = (data2 >= data3); + static constexpr bool greater_than_equal21 = (data2 >= data1); + static constexpr bool greater_than_equal32 = (data3 >= data2); + static constexpr bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + }; +} diff --git a/test/test_const_multiset_ext.cpp b/test/test_const_multiset_ext.cpp new file mode 100644 index 00000000..a05fef54 --- /dev/null +++ b/test/test_const_multiset_ext.cpp @@ -0,0 +1,1423 @@ +/****************************************************************************** +The MIT License(MIT) + +Embedded Template Library. +https://github.com/ETLCPP/etl +https://www.etlcpp.com + +Copyright(c) 2025 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 +#include +#include +#include + +#include "etl/const_multiset.h" +#include "etl/span.h" + +#include "data.h" + +namespace +{ + static const size_t Max_Size = 10UL; + + //************************************************************************* + // The key type + //************************************************************************* + struct Key + { + // Default constructor + constexpr Key() + : k(0) + { + } + + // Construct from char key + constexpr explicit Key(char k_) + : k(k_) + { + } + + char k; + }; + + // Less-than operator for Key < Key + constexpr bool operator <(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k < rhs.k); + } + + // Less-than operator for Key < char + constexpr bool operator <(const Key& lhs, char rhs) noexcept + { + return (lhs.k < rhs); + } + + // Less-than operator for char < Key + constexpr bool operator <(char lhs, const Key& rhs) noexcept + { + return (lhs < rhs.k); + } + + // Equality operator for Key == Key + constexpr bool operator ==(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k == rhs.k); + } + + // Equality operator for Key != Key + constexpr bool operator !=(const Key& lhs, const Key& rhs) noexcept + { + return !(lhs.k == rhs.k); + } + +#define TEST_GREATER_THAN +#ifdef TEST_GREATER_THAN + using Data = etl::const_multiset_ext>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset_ext>; + using IDataTransparentComparator = etl::iconst_multiset>; +#else + using Data = etl::const_multiset_ext>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset_ext>; + using IDataTransparentComparator = etl::iconst_multiset>; +#endif + + using value_type = Data::value_type; + using key_type = Data::key_type; + using const_iterator = Data::const_iterator; + using span_type = etl::span; + + SUITE(test_const_multiset_ext) + { + //************************************************************************* + TEST(test_default_constructor) + { + static const Data data; + + static const bool is_valid = data.is_valid(); + static const size_t size = data.size(); + static const bool empty = data.empty(); + static const bool full = data.full(); + static const size_t capacity = data.capacity(); + static const size_t max_size = data.max_size(); + static const const_iterator begin = data.begin(); + static const const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 0UL); + CHECK_TRUE(empty); + CHECK_FALSE(full); + CHECK_TRUE(capacity == 0UL); + CHECK_TRUE(max_size == 0UL); + CHECK_TRUE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_min_size) + { + static const value_type values[]{ Key('A') }; + + static const Data data(values); + + static const bool is_valid = data.is_valid(); + static const size_t size = data.size(); + static const bool empty = data.empty(); + static const bool full = data.full(); + static const size_t capacity = data.capacity(); + static const size_t max_size = data.max_size(); + static const const_iterator begin = data.begin(); + static const const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 1U); + CHECK_FALSE(empty); + CHECK_TRUE(full); + CHECK_TRUE(capacity == 1U); + CHECK_TRUE(max_size == 1U); + CHECK_FALSE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_max_size) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + static const bool is_valid = data.is_valid(); + static const size_t size = data.size(); + static const bool empty = data.empty(); + static const bool full = data.full(); + static const size_t capacity = data.capacity(); + static const size_t max_size = data.max_size(); + static const const_iterator begin = data.begin(); + static const const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == Max_Size); + CHECK_FALSE(empty); + CHECK_TRUE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_FALSE(begin == end); + } + +#if ETL_USING_CPP17 + //************************************************************************* + TEST(test_cpp17_deduced_constructor_from_span) + { + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const span_type span(values); + static const etl::const_multiset_ext data{span}; + + etl::const_multiset check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + CHECK_TRUE(data.is_valid()); + CHECK_TRUE(data.size() == Max_Size); + CHECK_FALSE(data.empty()); + CHECK_TRUE(data.full()); + CHECK_TRUE(data.capacity() == Max_Size); + CHECK_TRUE(data.max_size() == Max_Size); + CHECK_FALSE(data.begin() == data.end()); + } + + //************************************************************************* + TEST(test_cpp17_deduced_constructor_from_array) + { + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const etl::const_multiset_ext data{values}; + + etl::const_multiset check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + CHECK_TRUE(data.is_valid()); + CHECK_TRUE(data.size() == Max_Size); + CHECK_FALSE(data.empty()); + CHECK_TRUE(data.full()); + CHECK_TRUE(data.capacity() == Max_Size); + CHECK_TRUE(data.max_size() == Max_Size); + CHECK_FALSE(data.begin() == data.end()); + } +#endif + + //************************************************************************* + TEST(test_begin_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + CHECK_TRUE(data.is_valid()); + static const auto value = *data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(Key('J') == value); +#else + CHECK_TRUE(Key('A') == value); +#endif + } + + //************************************************************************* + TEST(test_end_const) + { + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; + + static const Data data(values); + + static const const_iterator end_itr = data.end(); + + CHECK_TRUE(end_itr == (data.begin() + data.size())); + } + + //************************************************************************* + TEST(test_equal_range_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + static const ETL_OR_STD::pair resultA = data.equal_range(Key('A')); + static const ETL_OR_STD::pair resultB = data.equal_range(Key('B')); + static const ETL_OR_STD::pair resultC = data.equal_range(Key('C')); + static const ETL_OR_STD::pair resultD = data.equal_range(Key('D')); + static const ETL_OR_STD::pair resultE = data.equal_range(Key('E')); + static const ETL_OR_STD::pair resultF = data.equal_range(Key('F')); + static const ETL_OR_STD::pair resultG = data.equal_range(Key('G')); + static const ETL_OR_STD::pair resultH = data.equal_range(Key('H')); + static const ETL_OR_STD::pair resultI = data.equal_range(Key('I')); + static const ETL_OR_STD::pair resultJ = data.equal_range(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_equal_range_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const DataTransparentComparator data(values); + + static const ETL_OR_STD::pair resultA = data.equal_range('A'); + static const ETL_OR_STD::pair resultB = data.equal_range('B'); + static const ETL_OR_STD::pair resultC = data.equal_range('C'); + static const ETL_OR_STD::pair resultD = data.equal_range('D'); + static const ETL_OR_STD::pair resultE = data.equal_range('E'); + static const ETL_OR_STD::pair resultF = data.equal_range('F'); + static const ETL_OR_STD::pair resultG = data.equal_range('G'); + static const ETL_OR_STD::pair resultH = data.equal_range('H'); + static const ETL_OR_STD::pair resultI = data.equal_range('I'); + static const ETL_OR_STD::pair resultJ = data.equal_range('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + static const const_iterator resultA = data.lower_bound(Key('A')); + static const const_iterator resultB = data.lower_bound(Key('B')); + static const const_iterator resultC = data.lower_bound(Key('C')); + static const const_iterator resultD = data.lower_bound(Key('D')); + static const const_iterator resultE = data.lower_bound(Key('E')); + static const const_iterator resultF = data.lower_bound(Key('F')); + static const const_iterator resultG = data.lower_bound(Key('G')); + static const const_iterator resultH = data.lower_bound(Key('H')); + static const const_iterator resultI = data.lower_bound(Key('I')); + static const const_iterator resultJ = data.lower_bound(Key('J')); + static const const_iterator resultK = data.lower_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const DataTransparentComparator data(values); + + static const const_iterator resultA = data.lower_bound('A'); + static const const_iterator resultB = data.lower_bound('B'); + static const const_iterator resultC = data.lower_bound('C'); + static const const_iterator resultD = data.lower_bound('D'); + static const const_iterator resultE = data.lower_bound('E'); + static const const_iterator resultF = data.lower_bound('F'); + static const const_iterator resultG = data.lower_bound('G'); + static const const_iterator resultH = data.lower_bound('H'); + static const const_iterator resultI = data.lower_bound('I'); + static const const_iterator resultJ = data.lower_bound('J'); + static const const_iterator resultK = data.lower_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + static const const_iterator resultA = data.upper_bound(Key('A')); + static const const_iterator resultB = data.upper_bound(Key('B')); + static const const_iterator resultC = data.upper_bound(Key('C')); + static const const_iterator resultD = data.upper_bound(Key('D')); + static const const_iterator resultE = data.upper_bound(Key('E')); + static const const_iterator resultF = data.upper_bound(Key('F')); + static const const_iterator resultG = data.upper_bound(Key('G')); + static const const_iterator resultH = data.upper_bound(Key('H')); + static const const_iterator resultI = data.upper_bound(Key('I')); + static const const_iterator resultJ = data.upper_bound(Key('J')); + static const const_iterator resultK = data.upper_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const DataTransparentComparator data(values); + + static const const_iterator resultA = data.upper_bound('A'); + static const const_iterator resultB = data.upper_bound('B'); + static const const_iterator resultC = data.upper_bound('C'); + static const const_iterator resultD = data.upper_bound('D'); + static const const_iterator resultE = data.upper_bound('E'); + static const const_iterator resultF = data.upper_bound('F'); + static const const_iterator resultG = data.upper_bound('G'); + static const const_iterator resultH = data.upper_bound('H'); + static const const_iterator resultI = data.upper_bound('I'); + static const const_iterator resultJ = data.upper_bound('J'); + static const const_iterator resultK = data.upper_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_count_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + CHECK_EQUAL(1, data.count(Key('A'))); + CHECK_EQUAL(1, data.count(Key('B'))); + CHECK_EQUAL(1, data.count(Key('C'))); + CHECK_EQUAL(1, data.count(Key('D'))); + CHECK_EQUAL(1, data.count(Key('E'))); + CHECK_EQUAL(1, data.count(Key('F'))); + CHECK_EQUAL(3, data.count(Key('G'))); + CHECK_EQUAL(0, data.count(Key('H'))); + CHECK_EQUAL(0, data.count(Key('I'))); + CHECK_EQUAL(1, data.count(Key('J'))); + CHECK_EQUAL(0, data.count(Key('K'))); + } + + //************************************************************************* + TEST(test_count_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const DataTransparentComparator data(values); + + CHECK_EQUAL(1, data.count('A')); + CHECK_EQUAL(1, data.count('B')); + CHECK_EQUAL(1, data.count('C')); + CHECK_EQUAL(1, data.count('D')); + CHECK_EQUAL(1, data.count('E')); + CHECK_EQUAL(1, data.count('F')); + CHECK_EQUAL(3, data.count('G')); + CHECK_EQUAL(0, data.count('H')); + CHECK_EQUAL(0, data.count('I')); + CHECK_EQUAL(1, data.count('J')); + CHECK_EQUAL(0, data.count('K')); + } + + //************************************************************************* + TEST(test_const_iterator) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + const_iterator itr = data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE(itr == data.end()); +#else + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE(itr == data.end()); +#endif + } + + //************************************************************************* + TEST(test_find_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + static const const_iterator resultA = data.find(Key('A')); + static const const_iterator resultB = data.find(Key('B')); + static const const_iterator resultC = data.find(Key('C')); + static const const_iterator resultD = data.find(Key('D')); + static const const_iterator resultE = data.find(Key('E')); + static const const_iterator resultF = data.find(Key('F')); + static const const_iterator resultG = data.find(Key('G')); + static const const_iterator resultH = data.find(Key('H')); + static const const_iterator resultI = data.find(Key('I')); + static const const_iterator resultJ = data.find(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_find_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const DataTransparentComparator data(values); + + static const const_iterator resultA = data.find('A'); + static const const_iterator resultB = data.find('B'); + static const const_iterator resultC = data.find('C'); + static const const_iterator resultD = data.find('D'); + static const const_iterator resultE = data.find('E'); + static const const_iterator resultF = data.find('F'); + static const const_iterator resultG = data.find('G'); + static const const_iterator resultH = data.find('H'); + static const const_iterator resultI = data.find('I'); + static const const_iterator resultJ = data.find('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_contains_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const Data data(values); + + static const bool containsA = data.contains(Key('A')); + static const bool containsB = data.contains(Key('B')); + static const bool containsC = data.contains(Key('C')); + static const bool containsD = data.contains(Key('D')); + static const bool containsE = data.contains(Key('E')); + static const bool containsF = data.contains(Key('F')); + static const bool containsG = data.contains(Key('G')); + static const bool containsH = data.contains(Key('H')); + static const bool containsI = data.contains(Key('I')); + static const bool containsJ = data.contains(Key('J')); + static const bool containsK = data.contains(Key('K')); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_contains_with_transparent_comparator_const) + { +#ifdef TEST_GREATER_THAN + static const value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static const value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static const DataTransparentComparator data(values); + + static const bool containsA = data.contains('A'); + static const bool containsB = data.contains('B'); + static const bool containsC = data.contains('C'); + static const bool containsD = data.contains('D'); + static const bool containsE = data.contains('E'); + static const bool containsF = data.contains('F'); + static const bool containsG = data.contains('G'); + static const bool containsH = data.contains('H'); + static const bool containsI = data.contains('I'); + static const bool containsJ = data.contains('J'); + static const bool containsK = data.contains('K'); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_key_comp_const) + { + static const Data data; + static const Data::key_compare compare = data.key_comp(); + + static const bool compareAA = compare(Key{ 'A' }, Key{ 'A' }); + static const bool compareBA = compare(Key{ 'B' }, Key{ 'A' }); + static const bool compareAB = compare(Key{ 'A' }, Key{ 'B' }); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_key_comp_const_transparent_comparator) + { + static const DataTransparentComparator data; + static const DataTransparentComparator::key_compare compare = data.key_comp(); + + static const bool compareAA = compare('A', 'A'); + static const bool compareBA = compare('B', 'A'); + static const bool compareAB = compare('A', 'B'); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const) + { + static const Data data; + static const Data::value_compare compare = data.value_comp(); + + static const bool compareAA1 = compare(Key('A'), Key('A')); + static const bool compareAA2 = compare(Key('A'), Key{ 'A' }); + static const bool compareAA3 = compare(Key{ 'A' }, Key('A')); + + static const bool compareBA1 = compare(Key('B'), Key('A')); + static const bool compareBA2 = compare(Key('B'), Key{ 'A' }); + static const bool compareBA3 = compare(Key{ 'B' }, Key('A')); + + static const bool compareAB1 = compare(Key('A'), Key('B')); + static const bool compareAB2 = compare(Key('A'), Key{ 'B' }); + static const bool compareAB3 = compare(Key{ 'A' }, Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const_transparent_comparator) + { + static const DataTransparentComparator data; + static const DataTransparentComparator::value_compare compare = data.value_comp(); + + static const bool compareAA1 = compare(Key('A'), Key('A')); + static const bool compareAA2 = compare(Key('A'), 'A'); + static const bool compareAA3 = compare('A', Key('A')); + + static const bool compareBA1 = compare(Key('B'), Key('A')); + static const bool compareBA2 = compare(Key('B'), 'A'); + static const bool compareBA3 = compare('B', Key('A')); + + static const bool compareAB1 = compare(Key('A'), Key('B')); + static const bool compareAB2 = compare(Key('A'), 'B'); + static const bool compareAB3 = compare('A', Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_equal) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const Data data1(values1); + static const Data data2(values2); + static const Data data3(values3); + static const Data data4(values4); + + static const bool equal12 = (data1 == data2); + static const bool equal13 = (data1 == data3); + static const bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_equal_with_transparent_comparator) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const DataTransparentComparator data1(values1); + static const DataTransparentComparator data2(values2); + static const DataTransparentComparator data3(values3); + static const DataTransparentComparator data4(values4); + + static const bool equal12 = (data1 == data2); + static const bool equal13 = (data1 == data3); + static const bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_not_equal) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const Data data1(values1); + static const Data data2(values2); + static const Data data3(values3); + static const Data data4(values4); + + static const bool not_equal12 = (data1 != data2); + static const bool not_equal13 = (data1 != data3); + static const bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_not_equal_with_transparent_comparator) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static const value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static const DataTransparentComparator data1(values1); + static const DataTransparentComparator data2(values2); + static const DataTransparentComparator data3(values3); + static const DataTransparentComparator data4(values4); + + static const bool not_equal12 = (data1 != data2); + static const bool not_equal13 = (data1 != data3); + static const bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_less_than) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data1(values1); + static const Data data2(values2); + static const Data data3(values3); + + static const bool less_than12 = (data1 < data2); + static const bool less_than23 = (data2 < data3); + static const bool less_than21 = (data2 < data1); + static const bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_with_transparent_comparator) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data1(values1); + static const DataTransparentComparator data2(values2); + static const DataTransparentComparator data3(values3); + + static const bool less_than12 = (data1 < data2); + static const bool less_than23 = (data2 < data3); + static const bool less_than21 = (data2 < data1); + static const bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data1(values1); + static const Data data2(values2); + static const Data data3(values3); + + static const bool less_than_equal12 = (data1 <= data2); + static const bool less_than_equal23 = (data2 <= data3); + static const bool less_than_equal21 = (data2 <= data1); + static const bool less_than_equal32 = (data3 <= data2); + static const bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal_with_transparent_comparator) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data1(values1); + static const DataTransparentComparator data2(values2); + static const DataTransparentComparator data3(values3); + + static const bool less_than_equal12 = (data1 <= data2); + static const bool less_than_equal23 = (data2 <= data3); + static const bool less_than_equal21 = (data2 <= data1); + static const bool less_than_equal32 = (data3 <= data2); + static const bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data1(values1); + static const Data data2(values2); + static const Data data3(values3); + + static const bool greater_than12 = (data1 > data2); + static const bool greater_than23 = (data2 > data3); + static const bool greater_than21 = (data2 > data1); + static const bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_with_transparent_comparator) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data1(values1); + static const DataTransparentComparator data2(values2); + static const DataTransparentComparator data3(values3); + + static const bool greater_than12 = (data1 > data2); + static const bool greater_than23 = (data2 > data3); + static const bool greater_than21 = (data2 > data1); + static const bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const Data data1(values1); + static const Data data2(values2); + static const Data data3(values3); + + static const bool greater_than_equal12 = (data1 >= data2); + static const bool greater_than_equal23 = (data2 >= data3); + static const bool greater_than_equal21 = (data2 >= data1); + static const bool greater_than_equal32 = (data3 >= data2); + static const bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal_with_transparent_comparator) + { + static const value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static const DataTransparentComparator data1(values1); + static const DataTransparentComparator data2(values2); + static const DataTransparentComparator data3(values3); + + static const bool greater_than_equal12 = (data1 >= data2); + static const bool greater_than_equal23 = (data2 >= data3); + static const bool greater_than_equal21 = (data2 >= data1); + static const bool greater_than_equal32 = (data3 >= data2); + static const bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + }; +} diff --git a/test/test_const_multiset_ext_constexpr.cpp b/test/test_const_multiset_ext_constexpr.cpp new file mode 100644 index 00000000..da032198 --- /dev/null +++ b/test/test_const_multiset_ext_constexpr.cpp @@ -0,0 +1,1423 @@ +/****************************************************************************** +The MIT License(MIT) + +Embedded Template Library. +https://github.com/ETLCPP/etl +https://www.etlcpp.com + +Copyright(c) 2025 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 +#include +#include +#include + +#include "etl/const_multiset.h" +#include "etl/span.h" + +#include "data.h" + +namespace +{ + static constexpr size_t Max_Size = 10UL; + + //************************************************************************* + // The key type + //************************************************************************* + struct Key + { + // Default constructor + constexpr Key() + : k(0) + { + } + + // Construct from char key + constexpr explicit Key(char k_) + : k(k_) + { + } + + char k; + }; + + // Less-than operator for Key < Key + constexpr bool operator <(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k < rhs.k); + } + + // Less-than operator for Key < char + constexpr bool operator <(const Key& lhs, char rhs) noexcept + { + return (lhs.k < rhs); + } + + // Less-than operator for char < Key + constexpr bool operator <(char lhs, const Key& rhs) noexcept + { + return (lhs < rhs.k); + } + + // Equality operator for Key == Key + constexpr bool operator ==(const Key& lhs, const Key& rhs) noexcept + { + return (lhs.k == rhs.k); + } + + // Equality operator for Key != Key + constexpr bool operator !=(const Key& lhs, const Key& rhs) noexcept + { + return !(lhs.k == rhs.k); + } + +#define TEST_GREATER_THAN +#ifdef TEST_GREATER_THAN + using Data = etl::const_multiset_ext>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset_ext>; + using IDataTransparentComparator = etl::iconst_multiset>; +#else + using Data = etl::const_multiset_ext>; + using IData = etl::iconst_multiset>; + using DataTransparentComparator = etl::const_multiset_ext>; + using IDataTransparentComparator = etl::iconst_multiset>; +#endif + + using value_type = Data::value_type; + using key_type = Data::key_type; + using const_iterator = Data::const_iterator; + using span_type = etl::span; + + SUITE(test_const_multiset_ext_constexpr) + { + //************************************************************************* + TEST(test_default_constructor) + { + static constexpr Data data; + + static constexpr bool is_valid = data.is_valid(); + static constexpr size_t size = data.size(); + static constexpr bool empty = data.empty(); + static constexpr bool full = data.full(); + static constexpr size_t capacity = data.capacity(); + static constexpr size_t max_size = data.max_size(); + static constexpr const_iterator begin = data.begin(); + static constexpr const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 0UL); + CHECK_TRUE(empty); + CHECK_FALSE(full); + CHECK_TRUE(capacity == 0UL); + CHECK_TRUE(max_size == 0UL); + CHECK_TRUE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_min_size) + { + static constexpr value_type values[]{ Key('A') }; + + static constexpr Data data(values); + + static constexpr bool is_valid = data.is_valid(); + static constexpr size_t size = data.size(); + static constexpr bool empty = data.empty(); + static constexpr bool full = data.full(); + static constexpr size_t capacity = data.capacity(); + static constexpr size_t max_size = data.max_size(); + static constexpr const_iterator begin = data.begin(); + static constexpr const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == 1U); + CHECK_FALSE(empty); + CHECK_TRUE(full); + CHECK_TRUE(capacity == 1U); + CHECK_TRUE(max_size == 1U); + CHECK_FALSE(begin == end); + } + + //************************************************************************* + TEST(test_constructor_max_size) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + static constexpr bool is_valid = data.is_valid(); + static constexpr size_t size = data.size(); + static constexpr bool empty = data.empty(); + static constexpr bool full = data.full(); + static constexpr size_t capacity = data.capacity(); + static constexpr size_t max_size = data.max_size(); + static constexpr const_iterator begin = data.begin(); + static constexpr const_iterator end = data.end(); + + CHECK_TRUE(is_valid); + CHECK_TRUE(size == Max_Size); + CHECK_FALSE(empty); + CHECK_TRUE(full); + CHECK_TRUE(capacity == Max_Size); + CHECK_TRUE(max_size == Max_Size); + CHECK_FALSE(begin == end); + } + +#if ETL_USING_CPP17 + //************************************************************************* + TEST(test_cpp17_deduced_constructor_from_span) + { + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr span_type span(values); + static constexpr etl::const_multiset_ext data{span}; + + etl::const_multiset check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + CHECK_TRUE(data.is_valid()); + CHECK_TRUE(data.size() == Max_Size); + CHECK_FALSE(data.empty()); + CHECK_TRUE(data.full()); + CHECK_TRUE(data.capacity() == Max_Size); + CHECK_TRUE(data.max_size() == Max_Size); + CHECK_FALSE(data.begin() == data.end()); + } + + //************************************************************************* + TEST(test_cpp17_deduced_constructor_from_array) + { + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr etl::const_multiset_ext data{values}; + + etl::const_multiset check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + CHECK_TRUE(data.is_valid()); + CHECK_TRUE(data.size() == Max_Size); + CHECK_FALSE(data.empty()); + CHECK_TRUE(data.full()); + CHECK_TRUE(data.capacity() == Max_Size); + CHECK_TRUE(data.max_size() == Max_Size); + CHECK_FALSE(data.begin() == data.end()); + } +#endif + + //************************************************************************* + TEST(test_begin_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + CHECK_TRUE(data.is_valid()); + static constexpr auto value = *data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(Key('J') == value); +#else + CHECK_TRUE(Key('A') == value); +#endif + } + + //************************************************************************* + TEST(test_end_const) + { + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; + + static constexpr Data data(values); + + static constexpr const_iterator end_itr = data.end(); + + CHECK_TRUE(end_itr == (data.begin() + data.size())); + } + + //************************************************************************* + TEST(test_equal_range_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + static constexpr ETL_OR_STD::pair resultA = data.equal_range(Key('A')); + static constexpr ETL_OR_STD::pair resultB = data.equal_range(Key('B')); + static constexpr ETL_OR_STD::pair resultC = data.equal_range(Key('C')); + static constexpr ETL_OR_STD::pair resultD = data.equal_range(Key('D')); + static constexpr ETL_OR_STD::pair resultE = data.equal_range(Key('E')); + static constexpr ETL_OR_STD::pair resultF = data.equal_range(Key('F')); + static constexpr ETL_OR_STD::pair resultG = data.equal_range(Key('G')); + static constexpr ETL_OR_STD::pair resultH = data.equal_range(Key('H')); + static constexpr ETL_OR_STD::pair resultI = data.equal_range(Key('I')); + static constexpr ETL_OR_STD::pair resultJ = data.equal_range(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_equal_range_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr DataTransparentComparator data(values); + + static constexpr ETL_OR_STD::pair resultA = data.equal_range('A'); + static constexpr ETL_OR_STD::pair resultB = data.equal_range('B'); + static constexpr ETL_OR_STD::pair resultC = data.equal_range('C'); + static constexpr ETL_OR_STD::pair resultD = data.equal_range('D'); + static constexpr ETL_OR_STD::pair resultE = data.equal_range('E'); + static constexpr ETL_OR_STD::pair resultF = data.equal_range('F'); + static constexpr ETL_OR_STD::pair resultG = data.equal_range('G'); + static constexpr ETL_OR_STD::pair resultH = data.equal_range('H'); + static constexpr ETL_OR_STD::pair resultI = data.equal_range('I'); + static constexpr ETL_OR_STD::pair resultJ = data.equal_range('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(10, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ.second))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA.first))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB.first))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC.first))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD.first))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE.first))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF.first))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.first))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ.first))); + + CHECK_EQUAL(1, (std::distance(data.begin(), resultA.second))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB.second))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC.second))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD.second))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE.second))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH.second))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI.second))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ.second))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + static constexpr const_iterator resultA = data.lower_bound(Key('A')); + static constexpr const_iterator resultB = data.lower_bound(Key('B')); + static constexpr const_iterator resultC = data.lower_bound(Key('C')); + static constexpr const_iterator resultD = data.lower_bound(Key('D')); + static constexpr const_iterator resultE = data.lower_bound(Key('E')); + static constexpr const_iterator resultF = data.lower_bound(Key('F')); + static constexpr const_iterator resultG = data.lower_bound(Key('G')); + static constexpr const_iterator resultH = data.lower_bound(Key('H')); + static constexpr const_iterator resultI = data.lower_bound(Key('I')); + static constexpr const_iterator resultJ = data.lower_bound(Key('J')); + static constexpr const_iterator resultK = data.lower_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_lower_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr DataTransparentComparator data(values); + + static constexpr const_iterator resultA = data.lower_bound('A'); + static constexpr const_iterator resultB = data.lower_bound('B'); + static constexpr const_iterator resultC = data.lower_bound('C'); + static constexpr const_iterator resultD = data.lower_bound('D'); + static constexpr const_iterator resultE = data.lower_bound('E'); + static constexpr const_iterator resultF = data.lower_bound('F'); + static constexpr const_iterator resultG = data.lower_bound('G'); + static constexpr const_iterator resultH = data.lower_bound('H'); + static constexpr const_iterator resultI = data.lower_bound('I'); + static constexpr const_iterator resultJ = data.lower_bound('J'); + static constexpr const_iterator resultK = data.lower_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + static constexpr const_iterator resultA = data.upper_bound(Key('A')); + static constexpr const_iterator resultB = data.upper_bound(Key('B')); + static constexpr const_iterator resultC = data.upper_bound(Key('C')); + static constexpr const_iterator resultD = data.upper_bound(Key('D')); + static constexpr const_iterator resultE = data.upper_bound(Key('E')); + static constexpr const_iterator resultF = data.upper_bound(Key('F')); + static constexpr const_iterator resultG = data.upper_bound(Key('G')); + static constexpr const_iterator resultH = data.upper_bound(Key('H')); + static constexpr const_iterator resultI = data.upper_bound(Key('I')); + static constexpr const_iterator resultJ = data.upper_bound(Key('J')); + static constexpr const_iterator resultK = data.upper_bound(Key('K')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_upper_bound_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr DataTransparentComparator data(values); + + static constexpr const_iterator resultA = data.upper_bound('A'); + static constexpr const_iterator resultB = data.upper_bound('B'); + static constexpr const_iterator resultC = data.upper_bound('C'); + static constexpr const_iterator resultD = data.upper_bound('D'); + static constexpr const_iterator resultE = data.upper_bound('E'); + static constexpr const_iterator resultF = data.upper_bound('F'); + static constexpr const_iterator resultG = data.upper_bound('G'); + static constexpr const_iterator resultH = data.upper_bound('H'); + static constexpr const_iterator resultI = data.upper_bound('I'); + static constexpr const_iterator resultJ = data.upper_bound('J'); + static constexpr const_iterator resultK = data.upper_bound('K'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(10, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultK))); +#else + CHECK_EQUAL(1, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultJ))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultK))); +#endif + } + + //************************************************************************* + TEST(test_count_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + CHECK_EQUAL(1, data.count(Key('A'))); + CHECK_EQUAL(1, data.count(Key('B'))); + CHECK_EQUAL(1, data.count(Key('C'))); + CHECK_EQUAL(1, data.count(Key('D'))); + CHECK_EQUAL(1, data.count(Key('E'))); + CHECK_EQUAL(1, data.count(Key('F'))); + CHECK_EQUAL(3, data.count(Key('G'))); + CHECK_EQUAL(0, data.count(Key('H'))); + CHECK_EQUAL(0, data.count(Key('I'))); + CHECK_EQUAL(1, data.count(Key('J'))); + CHECK_EQUAL(0, data.count(Key('K'))); + } + + //************************************************************************* + TEST(test_count_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr DataTransparentComparator data(values); + + CHECK_EQUAL(1, data.count('A')); + CHECK_EQUAL(1, data.count('B')); + CHECK_EQUAL(1, data.count('C')); + CHECK_EQUAL(1, data.count('D')); + CHECK_EQUAL(1, data.count('E')); + CHECK_EQUAL(1, data.count('F')); + CHECK_EQUAL(3, data.count('G')); + CHECK_EQUAL(0, data.count('H')); + CHECK_EQUAL(0, data.count('I')); + CHECK_EQUAL(1, data.count('J')); + CHECK_EQUAL(0, data.count('K')); + } + + //************************************************************************* + TEST(test_const_iterator) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + const_iterator itr = data.begin(); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE(itr == data.end()); +#else + CHECK_TRUE((Key('A')) == *itr++); + CHECK_TRUE((Key('B')) == *itr++); + CHECK_TRUE((Key('C')) == *itr++); + CHECK_TRUE((Key('D')) == *itr++); + CHECK_TRUE((Key('E')) == *itr++); + CHECK_TRUE((Key('F')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('G')) == *itr++); + CHECK_TRUE((Key('J')) == *itr++); + CHECK_TRUE(itr == data.end()); +#endif + } + + //************************************************************************* + TEST(test_find_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + static constexpr const_iterator resultA = data.find(Key('A')); + static constexpr const_iterator resultB = data.find(Key('B')); + static constexpr const_iterator resultC = data.find(Key('C')); + static constexpr const_iterator resultD = data.find(Key('D')); + static constexpr const_iterator resultE = data.find(Key('E')); + static constexpr const_iterator resultF = data.find(Key('F')); + static constexpr const_iterator resultG = data.find(Key('G')); + static constexpr const_iterator resultH = data.find(Key('H')); + static constexpr const_iterator resultI = data.find(Key('I')); + static constexpr const_iterator resultJ = data.find(Key('J')); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_find_const_using_transparent_comparator) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr DataTransparentComparator data(values); + + static constexpr const_iterator resultA = data.find('A'); + static constexpr const_iterator resultB = data.find('B'); + static constexpr const_iterator resultC = data.find('C'); + static constexpr const_iterator resultD = data.find('D'); + static constexpr const_iterator resultE = data.find('E'); + static constexpr const_iterator resultF = data.find('F'); + static constexpr const_iterator resultG = data.find('G'); + static constexpr const_iterator resultH = data.find('H'); + static constexpr const_iterator resultI = data.find('I'); + static constexpr const_iterator resultJ = data.find('J'); + +#ifdef TEST_GREATER_THAN + CHECK_EQUAL(9, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(8, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(7, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(0, (std::distance(data.begin(), resultJ))); +#else + CHECK_EQUAL(0, (std::distance(data.begin(), resultA))); + CHECK_EQUAL(1, (std::distance(data.begin(), resultB))); + CHECK_EQUAL(2, (std::distance(data.begin(), resultC))); + CHECK_EQUAL(3, (std::distance(data.begin(), resultD))); + CHECK_EQUAL(4, (std::distance(data.begin(), resultE))); + CHECK_EQUAL(5, (std::distance(data.begin(), resultF))); + CHECK_EQUAL(6, (std::distance(data.begin(), resultG))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultH))); + CHECK_EQUAL(10, (std::distance(data.begin(), resultI))); + CHECK_EQUAL(9, (std::distance(data.begin(), resultJ))); +#endif + } + + //************************************************************************* + TEST(test_contains_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr Data data(values); + + static constexpr bool containsA = data.contains(Key('A')); + static constexpr bool containsB = data.contains(Key('B')); + static constexpr bool containsC = data.contains(Key('C')); + static constexpr bool containsD = data.contains(Key('D')); + static constexpr bool containsE = data.contains(Key('E')); + static constexpr bool containsF = data.contains(Key('F')); + static constexpr bool containsG = data.contains(Key('G')); + static constexpr bool containsH = data.contains(Key('H')); + static constexpr bool containsI = data.contains(Key('I')); + static constexpr bool containsJ = data.contains(Key('J')); + static constexpr bool containsK = data.contains(Key('K')); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_contains_with_transparent_comparator_const) + { +#ifdef TEST_GREATER_THAN + static constexpr value_type values[]{ Key('J'), Key('G'), Key('G'), Key('G'), Key('F'), + Key('E'), Key('D'), Key('C'), Key('B'), Key('A') }; +#else + static constexpr value_type values[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('G'), Key('J') }; +#endif + + static constexpr DataTransparentComparator data(values); + + static constexpr bool containsA = data.contains('A'); + static constexpr bool containsB = data.contains('B'); + static constexpr bool containsC = data.contains('C'); + static constexpr bool containsD = data.contains('D'); + static constexpr bool containsE = data.contains('E'); + static constexpr bool containsF = data.contains('F'); + static constexpr bool containsG = data.contains('G'); + static constexpr bool containsH = data.contains('H'); + static constexpr bool containsI = data.contains('I'); + static constexpr bool containsJ = data.contains('J'); + static constexpr bool containsK = data.contains('K'); + + CHECK_TRUE(containsA); + CHECK_TRUE(containsB); + CHECK_TRUE(containsC); + CHECK_TRUE(containsD); + CHECK_TRUE(containsE); + CHECK_TRUE(containsF); + CHECK_TRUE(containsG); + CHECK_FALSE(containsH); + CHECK_FALSE(containsI); + CHECK_TRUE(containsJ); + CHECK_FALSE(containsK); + } + + //************************************************************************* + TEST(test_key_comp_const) + { + static constexpr Data data; + static constexpr Data::key_compare compare = data.key_comp(); + + static constexpr bool compareAA = compare(Key{ 'A' }, Key{ 'A' }); + static constexpr bool compareBA = compare(Key{ 'B' }, Key{ 'A' }); + static constexpr bool compareAB = compare(Key{ 'A' }, Key{ 'B' }); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_key_comp_const_transparent_comparator) + { + static constexpr DataTransparentComparator data; + static constexpr DataTransparentComparator::key_compare compare = data.key_comp(); + + static constexpr bool compareAA = compare('A', 'A'); + static constexpr bool compareBA = compare('B', 'A'); + static constexpr bool compareAB = compare('A', 'B'); + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA); + CHECK_TRUE(compareBA); + CHECK_FALSE(compareAB); + #else + CHECK_FALSE(compareAA); + CHECK_FALSE(compareBA); + CHECK_TRUE(compareAB); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const) + { + static constexpr Data data; + static constexpr Data::value_compare compare = data.value_comp(); + + static constexpr bool compareAA1 = compare(Key('A'), Key('A')); + static constexpr bool compareAA2 = compare(Key('A'), Key{ 'A' }); + static constexpr bool compareAA3 = compare(Key{ 'A' }, Key('A')); + + static constexpr bool compareBA1 = compare(Key('B'), Key('A')); + static constexpr bool compareBA2 = compare(Key('B'), Key{ 'A' }); + static constexpr bool compareBA3 = compare(Key{ 'B' }, Key('A')); + + static constexpr bool compareAB1 = compare(Key('A'), Key('B')); + static constexpr bool compareAB2 = compare(Key('A'), Key{ 'B' }); + static constexpr bool compareAB3 = compare(Key{ 'A' }, Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_value_comp_const_transparent_comparator) + { + static constexpr DataTransparentComparator data; + static constexpr DataTransparentComparator::value_compare compare = data.value_comp(); + + static constexpr bool compareAA1 = compare(Key('A'), Key('A')); + static constexpr bool compareAA2 = compare(Key('A'), 'A'); + static constexpr bool compareAA3 = compare('A', Key('A')); + + static constexpr bool compareBA1 = compare(Key('B'), Key('A')); + static constexpr bool compareBA2 = compare(Key('B'), 'A'); + static constexpr bool compareBA3 = compare('B', Key('A')); + + static constexpr bool compareAB1 = compare(Key('A'), Key('B')); + static constexpr bool compareAB2 = compare(Key('A'), 'B'); + static constexpr bool compareAB3 = compare('A', Key('B'));; + + #ifdef TEST_GREATER_THAN + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_TRUE(compareBA1); + CHECK_TRUE(compareBA2); + CHECK_TRUE(compareBA3); + + CHECK_FALSE(compareAB1); + CHECK_FALSE(compareAB2); + CHECK_FALSE(compareAB3); + #else + CHECK_FALSE(compareAA1); + CHECK_FALSE(compareAA2); + CHECK_FALSE(compareAA3); + + CHECK_FALSE(compareBA1); + CHECK_FALSE(compareBA2); + CHECK_FALSE(compareBA3); + + CHECK_TRUE(compareAB1); + CHECK_TRUE(compareAB2); + CHECK_TRUE(compareAB3); + #endif + } + + //************************************************************************* + TEST(test_equal) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr Data data1(values1); + static constexpr Data data2(values2); + static constexpr Data data3(values3); + static constexpr Data data4(values4); + + static constexpr bool equal12 = (data1 == data2); + static constexpr bool equal13 = (data1 == data3); + static constexpr bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_equal_with_transparent_comparator) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr DataTransparentComparator data1(values1); + static constexpr DataTransparentComparator data2(values2); + static constexpr DataTransparentComparator data3(values3); + static constexpr DataTransparentComparator data4(values4); + + static constexpr bool equal12 = (data1 == data2); + static constexpr bool equal13 = (data1 == data3); + static constexpr bool equal14 = (data1 == data4); + + CHECK_TRUE(equal12); + CHECK_FALSE(equal13); + CHECK_FALSE(equal14); + } + + //************************************************************************* + TEST(test_not_equal) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr Data data1(values1); + static constexpr Data data2(values2); + static constexpr Data data3(values3); + static constexpr Data data4(values4); + + static constexpr bool not_equal12 = (data1 != data2); + static constexpr bool not_equal13 = (data1 != data3); + static constexpr bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_not_equal_with_transparent_comparator) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('G'), Key('I'), Key('J') }; + + static constexpr value_type values4[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J'), Key('K') }; + + static constexpr DataTransparentComparator data1(values1); + static constexpr DataTransparentComparator data2(values2); + static constexpr DataTransparentComparator data3(values3); + static constexpr DataTransparentComparator data4(values4); + + static constexpr bool not_equal12 = (data1 != data2); + static constexpr bool not_equal13 = (data1 != data3); + static constexpr bool not_equal14 = (data1 != data4); + + CHECK_FALSE(not_equal12); + CHECK_TRUE(not_equal13); + CHECK_TRUE(not_equal14); + } + + //************************************************************************* + TEST(test_less_than) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data1(values1); + static constexpr Data data2(values2); + static constexpr Data data3(values3); + + static constexpr bool less_than12 = (data1 < data2); + static constexpr bool less_than23 = (data2 < data3); + static constexpr bool less_than21 = (data2 < data1); + static constexpr bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_with_transparent_comparator) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data1(values1); + static constexpr DataTransparentComparator data2(values2); + static constexpr DataTransparentComparator data3(values3); + + static constexpr bool less_than12 = (data1 < data2); + static constexpr bool less_than23 = (data2 < data3); + static constexpr bool less_than21 = (data2 < data1); + static constexpr bool less_than32 = (data3 < data2); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than12); + CHECK_FALSE(less_than23); + CHECK_TRUE(less_than21); + CHECK_TRUE(less_than32); +#else + CHECK_TRUE(less_than12); + CHECK_TRUE(less_than23); + CHECK_FALSE(less_than21); + CHECK_FALSE(less_than32); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data1(values1); + static constexpr Data data2(values2); + static constexpr Data data3(values3); + + static constexpr bool less_than_equal12 = (data1 <= data2); + static constexpr bool less_than_equal23 = (data2 <= data3); + static constexpr bool less_than_equal21 = (data2 <= data1); + static constexpr bool less_than_equal32 = (data3 <= data2); + static constexpr bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_less_than_equal_with_transparent_comparator) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data1(values1); + static constexpr DataTransparentComparator data2(values2); + static constexpr DataTransparentComparator data3(values3); + + static constexpr bool less_than_equal12 = (data1 <= data2); + static constexpr bool less_than_equal23 = (data2 <= data3); + static constexpr bool less_than_equal21 = (data2 <= data1); + static constexpr bool less_than_equal32 = (data3 <= data2); + static constexpr bool less_than_equal11 = (data1 <= data1); + +#ifdef TEST_GREATER_THAN + CHECK_FALSE(less_than_equal12); + CHECK_FALSE(less_than_equal23); + CHECK_TRUE(less_than_equal21); + CHECK_TRUE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#else + CHECK_TRUE(less_than_equal12); + CHECK_TRUE(less_than_equal23); + CHECK_FALSE(less_than_equal21); + CHECK_FALSE(less_than_equal32); + CHECK_TRUE(less_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data1(values1); + static constexpr Data data2(values2); + static constexpr Data data3(values3); + + static constexpr bool greater_than12 = (data1 > data2); + static constexpr bool greater_than23 = (data2 > data3); + static constexpr bool greater_than21 = (data2 > data1); + static constexpr bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_with_transparent_comparator) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data1(values1); + static constexpr DataTransparentComparator data2(values2); + static constexpr DataTransparentComparator data3(values3); + + static constexpr bool greater_than12 = (data1 > data2); + static constexpr bool greater_than23 = (data2 > data3); + static constexpr bool greater_than21 = (data2 > data1); + static constexpr bool greater_than32 = (data3 > data2); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than12); + CHECK_TRUE(greater_than23); + CHECK_FALSE(greater_than21); + CHECK_FALSE(greater_than32); +#else + CHECK_FALSE(greater_than12); + CHECK_FALSE(greater_than23); + CHECK_TRUE(greater_than21); + CHECK_TRUE(greater_than32); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr Data data1(values1); + static constexpr Data data2(values2); + static constexpr Data data3(values3); + + static constexpr bool greater_than_equal12 = (data1 >= data2); + static constexpr bool greater_than_equal23 = (data2 >= data3); + static constexpr bool greater_than_equal21 = (data2 >= data1); + static constexpr bool greater_than_equal32 = (data3 >= data2); + static constexpr bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + + //************************************************************************* + TEST(test_greater_than_equal_with_transparent_comparator) + { + static constexpr value_type values1[]{ Key('A'), Key('B'), Key('B'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values2[]{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr value_type values3[]{ Key('A'), Key('B'), Key('D'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + + static constexpr DataTransparentComparator data1(values1); + static constexpr DataTransparentComparator data2(values2); + static constexpr DataTransparentComparator data3(values3); + + static constexpr bool greater_than_equal12 = (data1 >= data2); + static constexpr bool greater_than_equal23 = (data2 >= data3); + static constexpr bool greater_than_equal21 = (data2 >= data1); + static constexpr bool greater_than_equal32 = (data3 >= data2); + static constexpr bool greater_than_equal11 = (data1 >= data1); + +#ifdef TEST_GREATER_THAN + CHECK_TRUE(greater_than_equal12); + CHECK_TRUE(greater_than_equal23); + CHECK_FALSE(greater_than_equal21); + CHECK_FALSE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#else + CHECK_FALSE(greater_than_equal12); + CHECK_FALSE(greater_than_equal23); + CHECK_TRUE(greater_than_equal21); + CHECK_TRUE(greater_than_equal32); + CHECK_TRUE(greater_than_equal11); +#endif + } + }; +} diff --git a/test/test_const_set.cpp b/test/test_const_set.cpp index 18436870..c923a3e2 100644 --- a/test/test_const_set.cpp +++ b/test/test_const_set.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -102,7 +102,7 @@ namespace using Data2 = etl::const_set>; using IData = etl::iconst_set>; using DataTransparentComparator = etl::const_set>; - using DataTransparentComparator2 = etl::const_set>; + using DataTransparentComparator2 = etl::const_set>; using IDataTransparentComparator = etl::iconst_set>; #endif diff --git a/test/test_const_set_constexpr.cpp b/test/test_const_set_constexpr.cpp index 7c97a4a0..0e2a0cfa 100644 --- a/test/test_const_set_constexpr.cpp +++ b/test/test_const_set_constexpr.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 diff --git a/test/test_const_set_ext.cpp b/test/test_const_set_ext.cpp index 786a1aaa..b96fffb4 100644 --- a/test/test_const_set_ext.cpp +++ b/test/test_const_set_ext.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -102,9 +102,9 @@ namespace using DataTransparentComparator = etl::const_set_ext>; using IDataTransparentComparator = etl::iconst_set>; #else - using Data = etl::const_set>; + using Data = etl::const_set_ext>; using IData = etl::iconst_set>; - using DataTransparentComparator = etl::const_set>; + using DataTransparentComparator = etl::const_set_ext>; using IDataTransparentComparator = etl::iconst_set>; #endif @@ -269,8 +269,8 @@ namespace static const span_type span(values); static const etl::const_set_ext data{span}; - etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), - Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; CHECK_TRUE(data.is_valid()); CHECK_TRUE(data.size() == Max_Size); @@ -289,8 +289,8 @@ namespace static const etl::const_set_ext data{values}; - etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), - Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; CHECK_TRUE(data.is_valid()); CHECK_TRUE(data.size() == Max_Size); diff --git a/test/test_const_set_ext_constexpr.cpp b/test/test_const_set_ext_constexpr.cpp index 15f47e0a..feb15cc7 100644 --- a/test/test_const_set_ext_constexpr.cpp +++ b/test/test_const_set_ext_constexpr.cpp @@ -5,7 +5,7 @@ Embedded Template Library. https://github.com/ETLCPP/etl https://www.etlcpp.com -Copyright(c) 2025 John Wellbelove, rlindeman +Copyright(c) 2025 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 @@ -102,9 +102,9 @@ namespace using DataTransparentComparator = etl::const_set_ext>; using IDataTransparentComparator = etl::iconst_set>; #else - using Data = etl::const_set>; + using Data = etl::const_set_ext>; using IData = etl::iconst_set>; - using DataTransparentComparator = etl::const_set>; + using DataTransparentComparator = etl::const_set_ext>; using IDataTransparentComparator = etl::iconst_set>; #endif @@ -269,8 +269,8 @@ namespace static constexpr span_type span(values); static constexpr etl::const_set_ext data{span}; - etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), - Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; CHECK_TRUE(data.is_valid()); CHECK_TRUE(data.size() == Max_Size); @@ -289,8 +289,8 @@ namespace static constexpr etl::const_set_ext data{values}; - etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), - Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; + etl::const_set check{ Key('A'), Key('B'), Key('C'), Key('D'), Key('E'), + Key('F'), Key('G'), Key('H'), Key('I'), Key('J') }; CHECK_TRUE(data.is_valid()); CHECK_TRUE(data.size() == Max_Size); diff --git a/test/vs2022/etl.vcxproj b/test/vs2022/etl.vcxproj index 4d84b121..2ee1f507 100644 --- a/test/vs2022/etl.vcxproj +++ b/test/vs2022/etl.vcxproj @@ -3293,6 +3293,7 @@ + @@ -9281,6 +9282,10 @@ + + + + diff --git a/test/vs2022/etl.vcxproj.filters b/test/vs2022/etl.vcxproj.filters index 8f448150..5f9dce4c 100644 --- a/test/vs2022/etl.vcxproj.filters +++ b/test/vs2022/etl.vcxproj.filters @@ -1521,6 +1521,9 @@ ETL\Containers + + ETL\Containers + @@ -3638,6 +3641,18 @@ Tests\Containers + + Tests\Containers + + + Tests\Containers + + + Tests\Containers + + + Tests\Containers +