etl/test/test_string_view.cpp
Eminy 55dcb84bc0
Fix find and rfind position handling in string and string_view (#1637)
* Add docs and tutorial for etl::intrusive_avl_tree (#1608)

* Add docs and tutorial for etl::intrusive_avl_tree

Documents the intrusive AVL tree added in PR #1425: a full API reference
page under Containers/Trees, and a tutorial demonstrating ordered access
to intrusively-linked objects with unpredictable lifetimes, including
move support and destructor-driven automatic removal from the tree.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>

* Add complexity shortcode and document its usage

Introduces a {{< complexity >}} Hugo shortcode (with light/dark styling
for constant/logarithmic/linear/linearithmic/polynomial/exponential
classes) for rendering Big-O complexity inline, applies it throughout
the intrusive_avl_tree API reference in place of raw "O(...)" text, and
documents the Description/Complexity structure and supported classes in
DOCUMENTATION.md.

Co-Authored-By: Claude Sonnet 5 <noreply@anthropic.com>

* Fix issues found by @CodeRabbit

* Put complexity notes on their own lines in intrusive_avl_tree docs

Move the complexity shortcode from the inline "**Complexity:**" label
to its own line under a "**Complexity**" label. Notes that give several
alternatives (e.g. amortized vs. worst-case) now show each one on a
separate line. Update the guideline in DOCUMENTATION.md to match.

* Update complexity examples in DOCUMENTATION.md

Add the hard line break after the "**Complexity**" label in the
example, and rewrite the list of supported complexity classes in the
new two-line format, including an example with several alternatives.

* Add logarithmic complexity example to DOCUMENTATION.md

---------

Co-authored-by: Claude Sonnet 5 <noreply@anthropic.com>
Co-authored-by: John Wellbelove <jwellbelove@users.noreply.github.com>

* Updated sponsors pages

* Refactor the documentation css to group styles for light and dark themes

* Update Codacy badge in README.md

Updated Codacy badge link to reflect new project status.

* Fix Codacy badge display

* refresh codacy integration status

* Expose more Zephyr Kconfigs for error handling (#1622)

* zephyr: make `ETL_DEBUG` default to on if Zephyr assertions are enabled

this is the more appropriate default: ETL_DEBUG controls some container assertions, so it should follow the Zephyr assertions by default

* zephyr: expose new error-checking configs

* zephyr: add Kconfig choices for error handling

* Fix find and rfind position handling in string and string_view

* Default the rfind string_view position to npos

The string_view overload defaulted pos to 0, so rfind(view) only found
a match at the start of the string. The other rfind overloads and
std::basic_string use npos.

---------

Co-authored-by: Sergei <sergej.shirokov@gmail.com>
Co-authored-by: Claude Sonnet 5 <noreply@anthropic.com>
Co-authored-by: John Wellbelove <jwellbelove@users.noreply.github.com>
Co-authored-by: John Wellbelove <john.wellbelove@etlcpp.com>
Co-authored-by: Eden Frosst <edenfrosst@gmail.com>
2026-10-29 11:44:10 +00:00

1306 lines
44 KiB
C++

/******************************************************************************
The MIT License(MIT)
Embedded Template Library.
https://github.com/ETLCPP/etl
https://www.etlcpp.com
Copyright(c) 2017 John Wellbelove
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files(the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and / or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions :
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
******************************************************************************/
#include "unit_test_framework.h"
#include "etl/hash.h"
#include "etl/string.h"
#include "etl/string_view.h"
#include "etl/u16string.h"
#include "etl/u32string.h"
#include "etl/u8string.h"
#include "etl/wstring.h"
#include <algorithm>
#include <array>
#include <iterator>
#include <ostream>
#include <string>
namespace
{
using View = etl::string_view;
using WView = etl::wstring_view;
#if ETL_USING_CPP20
using U8View = etl::u8string_view;
#endif
using U16View = etl::u16string_view;
using U32View = etl::u32string_view;
etl::string<11> etltext = "Hello World";
std::string text = "Hello World";
std::wstring wtext = L"Hello World";
#if ETL_USING_CPP20
std::u8string u8text = u8"Hello World";
#endif
std::u16string u16text = u"Hello World";
std::u32string u32text = U"Hello World";
std::string text_smaller = "Hello Worlc";
std::string text_shorter = "Hello Worl";
std::string text_different = "Goodbye!!!!";
constexpr char cctext[] = {'H', 'e', 'l', 'l', 'o', ' ', 'W', 'o', 'r', 'l', 'd', '\0'};
constexpr wchar_t cwtext[] = {L'H', L'e', L'l', L'l', L'o', L' ', L'W', L'o', L'r', L'l', L'd', L'\0'};
constexpr char16_t cu16text[] = {u'H', u'e', u'l', u'l', u'o', u' ', u'W', u'o', u'r', u'l', u'd', u'\0'};
constexpr char32_t cu32text[] = {U'H', U'e', U'l', U'l', U'o', U' ', U'W', U'o', U'r', U'l', U'd', U'\0'};
const char* pctext = cctext;
const wchar_t* pwtext = cwtext;
const char16_t* pu16text = cu16text;
const char32_t* pu32text = cu32text;
SUITE(test_string_view)
{
//*************************************************************************
#if ETL_USING_CPP14
TEST(test_constexpr)
{
constexpr const char* text = "Hello";
constexpr etl::string_view view1(text);
constexpr etl::string_view view2(text, 5U);
constexpr etl::string_view view3(text, text + 5U);
constexpr etl::string_view view4(view3);
constexpr const char* str1 = view1.begin();
constexpr const char* str2 = view2.begin();
constexpr const char* str3 = view3.begin();
constexpr const char* str4 = view4.begin();
CHECK_ARRAY_EQUAL(text, str1, 5U);
CHECK_ARRAY_EQUAL(text, str2, 5U);
CHECK_ARRAY_EQUAL(text, str3, 5U);
CHECK_ARRAY_EQUAL(text, str4, 5U);
}
#endif
//*************************************************************************
TEST(test_default_constructor)
{
View view;
CHECK(0U == view.size());
CHECK(0U == view.max_size());
CHECK(view.empty());
}
//*************************************************************************
TEST(test_constructor_pointer_range_char)
{
View view(pctext, pctext + etl::strlen(pctext));
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_constructor_pointer_range_wchar_t)
{
WView view(pwtext, pwtext + etl::strlen(pwtext));
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_constructor_pointer_range_u16char_t)
{
U16View view(pu16text, pu16text + etl::strlen(pu16text));
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_constructor_pointer_range_u32char_t)
{
U32View view(pu32text, pu32text + etl::strlen(pu32text));
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_constructor_etl_string)
{
View view(etltext);
CHECK(etltext.size() == view.size());
CHECK(etltext.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), etltext.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_constructor_pointer_size)
{
View view(pctext, strlen(pctext));
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_constructor_pointer)
{
View view(pctext);
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_constructor_literal)
{
View view("Hello World");
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual = std::equal(view.begin(), view.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_make_string_view)
{
auto cview = etl::make_string_view("Hello World");
auto wview = etl::make_string_view(L"Hello World");
auto u16view = etl::make_string_view(u"Hello World");
auto u32view = etl::make_string_view(U"Hello World");
CHECK(std::equal(cview.begin(), cview.end(), text.begin()));
CHECK(std::equal(wview.begin(), wview.end(), wtext.begin()));
CHECK(std::equal(u16view.begin(), u16view.end(), u16text.begin()));
CHECK(std::equal(u32view.begin(), u32view.end(), u32text.begin()));
}
//*************************************************************************
#if ETL_USING_CPP14
TEST(test_constexpr_make_string_view)
{
constexpr auto cview = etl::make_string_view(cctext);
constexpr auto wview = etl::make_string_view(cwtext);
constexpr auto u16view = etl::make_string_view(cu16text);
constexpr auto u32view = etl::make_string_view(cu32text);
CHECK(std::equal(cview.begin(), cview.end(), text.begin()));
CHECK(std::equal(wview.begin(), wview.end(), text.begin()));
CHECK(std::equal(u16view.begin(), u16view.end(), text.begin()));
CHECK(std::equal(u32view.begin(), u32view.end(), text.begin()));
}
#endif
//*************************************************************************
TEST(test_make_string_view_check_consistent_strings_from_arrays_of_char)
{
char text_extra_nulls[10] = {'H', 'e', 'l', 'l', 'o'};
char text_no_null[10] = {'H', 'e', 'l', 'l', 'o'};
std::string text_expected = "Hello";
auto view_extra_nulls = etl::make_string_view(text_extra_nulls);
auto view_no_null = etl::make_string_view(text_no_null);
CHECK_EQUAL(text_expected.size(), view_extra_nulls.size());
CHECK_EQUAL(text_expected.size(), view_no_null.size());
CHECK(std::equal(view_extra_nulls.begin(), view_extra_nulls.end(), text_expected.begin()));
CHECK(std::equal(view_no_null.begin(), view_no_null.end(), text_expected.begin()));
}
//*************************************************************************
TEST(test_make_string_view_check_consistent_strings_from_arrays_of_wchar_t)
{
wchar_t text_extra_nulls[10] = {L'H', L'e', L'l', L'l', L'o'};
wchar_t text_no_null[10] = {L'H', L'e', L'l', L'l', L'o'};
std::wstring text_expected = L"Hello";
auto view_extra_nulls = etl::make_string_view(text_extra_nulls);
auto view_no_null = etl::make_string_view(text_no_null);
CHECK_EQUAL(text_expected.size(), view_extra_nulls.size());
CHECK_EQUAL(text_expected.size(), view_no_null.size());
CHECK(std::equal(view_extra_nulls.begin(), view_extra_nulls.end(), text_expected.begin()));
CHECK(std::equal(view_no_null.begin(), view_no_null.end(), text_expected.begin()));
}
//*************************************************************************
TEST(test_make_string_view_check_consistent_strings_from_arrays_of_char16_t)
{
char16_t text_extra_nulls[10] = {u'H', u'e', u'l', u'l', u'o'};
char16_t text_no_null[10] = {u'H', u'e', u'l', u'l', u'o'};
std::u16string text_expected = u"Hello";
auto view_extra_nulls = etl::make_string_view(text_extra_nulls);
auto view_no_null = etl::make_string_view(text_no_null);
CHECK_EQUAL(text_expected.size(), view_extra_nulls.size());
CHECK_EQUAL(text_expected.size(), view_no_null.size());
CHECK(std::equal(view_extra_nulls.begin(), view_extra_nulls.end(), text_expected.begin()));
CHECK(std::equal(view_no_null.begin(), view_no_null.end(), text_expected.begin()));
}
//*************************************************************************
TEST(test_make_string_view_check_consistent_strings_from_arrays_of_char32_t)
{
char32_t text_extra_nulls[10] = {U'H', U'e', U'l', U'l', U'o'};
char32_t text_no_null[10] = {U'H', U'e', U'l', U'l', U'o'};
std::u32string text_expected = U"Hello";
auto view_extra_nulls = etl::make_string_view(text_extra_nulls);
auto view_no_null = etl::make_string_view(text_no_null);
CHECK_EQUAL(text_expected.size(), view_extra_nulls.size());
CHECK_EQUAL(text_expected.size(), view_no_null.size());
CHECK(std::equal(view_extra_nulls.begin(), view_extra_nulls.end(), text_expected.begin()));
CHECK(std::equal(view_no_null.begin(), view_no_null.end(), text_expected.begin()));
}
//*************************************************************************
#if ETL_USING_CPP17 && ETL_HAS_INITIALIZER_LIST && !defined(ETL_TEMPLATE_DEDUCTION_GUIDE_TESTS_DISABLED)
TEST(test_template_deduction)
{
etl::basic_string_view cview{"Hello World"};
etl::basic_string_view wview{L"Hello World"};
etl::basic_string_view u16view{u"Hello World"};
etl::basic_string_view u32view{U"Hello World"};
CHECK(std::equal(cview.begin(), cview.end(), text.begin()));
CHECK(std::equal(wview.begin(), wview.end(), text.begin()));
CHECK(std::equal(u16view.begin(), u16view.end(), text.begin()));
CHECK(std::equal(u32view.begin(), u32view.end(), text.begin()));
}
#endif
//*************************************************************************
TEST(test_assign_from_string_view)
{
View view1(text.c_str());
View view2;
view2 = view1;
CHECK(view1.size() == view2.size());
CHECK(view1.max_size() == view2.max_size());
bool isEqual;
isEqual = std::equal(view1.begin(), view1.end(), view2.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_assign_from_iterator_range)
{
View view;
view.assign(text.c_str(), text.size());
CHECK(text.size() == view.size());
CHECK(text.size() == view.max_size());
bool isEqual;
isEqual = std::equal(text.begin(), text.end(), view.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_begin_end)
{
View view(text.c_str(), text.size());
CHECK(view.begin() == view.cbegin());
CHECK(view.rbegin().base() == view.crbegin().base());
CHECK(view.end() == view.cend());
CHECK(view.rend().base() == view.crend().base());
}
//*************************************************************************
TEST(test_front_back)
{
View view(text.c_str(), text.size());
CHECK(text.front() == view.front());
CHECK(text.back() == view.back());
}
//*************************************************************************
TEST(test_data)
{
View view(text.c_str(), text.size());
CHECK(text.data() == view.data());
}
//*************************************************************************
TEST(test_index_operator)
{
View view(text.c_str(), text.size());
for (size_t i = 0UL; i < text.size(); ++i)
{
CHECK(text[i] == view[i]);
}
}
//*************************************************************************
TEST(test_at)
{
View view(text.c_str(), text.size());
for (size_t i = 0UL; i < text.size(); ++i)
{
CHECK(text[i] == view.at(i));
}
}
//*************************************************************************
TEST(test_at_uninitialised_exception)
{
View view;
CHECK_THROW(view.at(0), etl::string_view_uninitialised);
}
//*************************************************************************
TEST(test_at_bounds_exception)
{
View view(text.c_str(), text.size());
CHECK_THROW(view.at(view.size()), etl::string_view_bounds);
}
#ifdef ETL_CHECK_INDEX_OPERATOR
//*************************************************************************
TEST(test_index_bounds_exception)
{
View view(text.c_str(), text.size());
CHECK_THROW(view[view.size()], etl::string_view_bounds);
}
#endif
//*************************************************************************
TEST(test_front_bounds_exception)
{
View view(text.c_str(), text.c_str());
CHECK_THROW(view.front(), etl::string_view_empty);
}
//*************************************************************************
TEST(test_back_bounds_exception)
{
View view(text.c_str(), text.c_str());
CHECK_THROW(view.back(), etl::string_view_empty);
}
//*************************************************************************
TEST(test_non_member_same)
{
View view1(text.c_str(), text.size());
View view2(text.c_str(), text.size());
CHECK(view1 == view2);
CHECK(view1 <= view2);
CHECK(view1 >= view2);
CHECK(!(view1 > view2));
CHECK(!(view1 < view2));
}
//*************************************************************************
TEST(test_non_member_smaller)
{
View view1(text.c_str(), text.size());
View view2(text_smaller.c_str(), text_smaller.size());
CHECK(!(view1 == view2));
CHECK(!(view1 <= view2));
CHECK(view2 <= view1);
CHECK(view1 >= view2);
CHECK(!(view2 >= view1));
CHECK(view1 > view2);
CHECK(!(view2 > view1));
CHECK(!(view1 < view2));
CHECK(view2 < view1);
}
//*************************************************************************
TEST(test_non_member_shorter)
{
View view1(text.c_str(), text.size());
View view2(text_shorter.c_str(), text_shorter.size());
CHECK(!(view1 == view2));
CHECK(!(view1 <= view2));
CHECK(view2 <= view1);
CHECK(view1 >= view2);
CHECK(!(view2 >= view1));
CHECK(view1 > view2);
CHECK(!(view2 > view1));
CHECK(!(view1 < view2));
CHECK(view2 < view1);
}
//*************************************************************************
TEST(test_empty)
{
View view1(text.c_str(), text.c_str());
CHECK(view1.empty());
View view2(text.c_str(), text.c_str() + 1);
CHECK(!view2.empty());
}
//*************************************************************************
TEST(test_swap)
{
View view1(text.c_str());
View view2(text_smaller.c_str());
std::swap(view1, view2);
CHECK(text.size() == view1.size());
CHECK(text_smaller.size() == view2.size());
bool isEqual;
isEqual = std::equal(view1.begin(), view1.end(), text_smaller.begin());
CHECK(isEqual);
isEqual = std::equal(view2.begin(), view2.end(), text.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_remove_prefix_suffix)
{
std::string original = "Hello World";
std::string prefix = "llo World";
std::string prefixsuffix = "llo Wor";
View view(original.c_str());
bool isEqual;
view.remove_prefix(2);
isEqual = std::equal(view.begin(), view.end(), prefix.begin());
CHECK(isEqual);
view.remove_suffix(2);
isEqual = std::equal(view.begin(), view.end(), prefixsuffix.begin());
CHECK(isEqual);
}
//*************************************************************************
TEST(test_remove_prefix_empty)
{
std::string original = "Hello World";
View view(original.c_str());
// remove n == size() should result in an empty view
view.remove_prefix(original.size());
CHECK_EQUAL(view.begin(), view.end());
CHECK(view.empty());
}
//*************************************************************************
TEST(test_remove_prefix_assert)
{
std::string original = "Hello World";
View view(original.c_str());
// remove n > size() should trigger ETL_ASSERT
CHECK_THROW(view.remove_prefix(original.size() + 1), etl::string_view_bounds);
}
//*************************************************************************
TEST(test_remove_suffix_empty)
{
std::string original = "Hello World";
View view(original.c_str());
// remove n == size() should result in an empty view
view.remove_suffix(original.size());
CHECK_EQUAL(view.begin(), view.end());
CHECK(view.empty());
}
//*************************************************************************
TEST(test_remove_suffix_assert)
{
std::string original = "Hello World";
View view(original.c_str());
// remove n > size() should trigger ETL_ASSERT
CHECK_THROW(view.remove_suffix(original.size() + 1), etl::string_view_bounds);
}
//*************************************************************************
TEST(test_copy)
{
View view(text.c_str());
std::array<char, 12> destination;
std::array<char, 12> blank;
size_t count;
blank.fill(0);
// Full text.
destination.fill(0);
count = view.copy(destination.data(), text.size(), 0);
CHECK(text.size() == count);
CHECK(text.size() == strlen(destination.data()));
CHECK_ARRAY_EQUAL(text.data(), destination.data(), text.size());
// From position 2, count OK.
destination.fill(0);
count = view.copy(destination.data(), text.size() - 2, 2);
CHECK(text.size() - 2 == count);
CHECK(text.size() - 2 == strlen(destination.data()));
CHECK_ARRAY_EQUAL(text.data() + 2, destination.data(), text.size() - 2);
// From position 2, count too large.
destination.fill(0);
count = view.copy(destination.data(), text.size(), 2);
CHECK(text.size() - 2 == count);
CHECK(text.size() - 2 == strlen(destination.data()));
CHECK_ARRAY_EQUAL(text.data() + 2, destination.data(), text.size() - 2);
// Position too large.
destination.fill(0);
count = view.copy(destination.data(), text.size(), 11);
CHECK(0U == count);
CHECK_ARRAY_EQUAL(blank.data(), destination.data(), text.size());
// From position 2, short range.
destination.fill(0);
count = view.copy(destination.data(), text.size() - 4, 2);
CHECK(text.size() - 4 == count);
CHECK(text.size() - 4 == strlen(destination.data()));
CHECK_ARRAY_EQUAL(text.data() + 2, destination.data(), text.size() - 4);
}
//*************************************************************************
TEST(test_substr)
{
View view1(text.c_str());
View view2(text.c_str() + 2, text.size() - 2);
View view3;
View view4(text.c_str() + 2, text.size() - 2);
View sub;
// Whole string.
sub = view1.substr(0, text.size());
CHECK(view1 == sub);
// From from +2 to -2.
sub = view1.substr(2, text.size() - 2);
CHECK(view2 == sub);
// Position too large.
sub = view1.substr(text.size(), 2);
CHECK(view3 == sub);
// Count too large.
sub = view1.substr(2, text.size());
CHECK(view4 == sub);
}
//*************************************************************************
TEST(test_compare_basic_string_view)
{
View view(text.c_str());
View view_smaller(text_smaller.c_str());
View view_shorter(text_shorter.c_str());
CHECK(0 == view.compare(view));
CHECK(-1 == view_smaller.compare(view));
CHECK(-1 == view_shorter.compare(view));
CHECK(1 == view.compare(view_smaller));
CHECK(1 == view.compare(view_shorter));
}
//*************************************************************************
TEST(test_compare_position_count_view)
{
View view(text.c_str());
View view_smaller(text_smaller.c_str());
View view_shorter(text_shorter.c_str());
std::string text_long = std::string("xx") + text + std::string("xx");
View view_long(text_long.c_str());
std::string text_smaller_long = std::string("xx") + text_smaller + std::string("xx");
View view_smaller_long(text_smaller_long.c_str());
std::string text_shorter_long = std::string("xx") + text_shorter + std::string("xx");
View view_shorter_long(text_shorter_long.c_str());
CHECK(0 == view_long.compare(2, view.size(), view));
CHECK(-1 == view_smaller_long.compare(2, view.size(), view));
CHECK(1 == view_long.compare(2, view.size(), view_smaller));
CHECK(1 == view_long.compare(2, view.size(), view_shorter));
}
//*************************************************************************
TEST(test_compare_position_count_view_position_count)
{
View view(text.c_str());
std::string text_long = std::string("xx") + text + std::string("xx");
View view_long(text_long.c_str());
std::string text_smaller_long = std::string("xx") + text_smaller + std::string("xx");
View view_smaller_long(text_smaller_long.c_str());
std::string text_shorter_long = std::string("xx") + text_shorter + std::string("xx");
View view_shorter_long(text_shorter_long.c_str());
CHECK(0 == view_long.compare(2, view.size(), view_long, 2, view.size()));
CHECK(-1 == view_smaller_long.compare(2, view.size(), view_long, 2, view.size()));
CHECK(-1 == view_shorter_long.compare(2, text_shorter.size(), view_long, 2, view.size()));
CHECK(1 == view_long.compare(2, view.size(), view_smaller_long, 2, view.size()));
CHECK(1 == view_long.compare(2, view.size(), view_shorter_long, 2, text_shorter.size()));
}
//*************************************************************************
TEST(test_compare_text)
{
View view(text.c_str());
View view_smaller(text_smaller.c_str());
View view_shorter(text_shorter.c_str());
CHECK(0 == view.compare(view.data()));
CHECK(-1 == view_smaller.compare(view.data()));
CHECK(1 == view.compare(view_smaller.data()));
CHECK(-1 == view_shorter.compare(view.data()));
CHECK(1 == view.compare(view_shorter.data()));
}
//*************************************************************************
TEST(test_compare_position_count_text)
{
View view(text.c_str());
View view_smaller(text_smaller.c_str());
View view_shorter(text_shorter.c_str());
std::string text_long = std::string("xx") + text + std::string("xx");
View view_long(text_long.c_str());
std::string text_smaller_long = std::string("xx") + text_smaller + std::string("xx");
View view_smaller_long(text_smaller_long.c_str());
std::string text_shorter_long = std::string("xx") + text_shorter + std::string("xx");
View view_shorter_long(text_shorter_long.c_str());
CHECK(0 == view_long.compare(2, view.size(), view.data()));
CHECK(-1 == view_smaller_long.compare(2, view.size(), view_long.data()));
CHECK(-1 == view_shorter_long.compare(2, text_shorter.size(), view_long.data()));
CHECK(1 == view_long.compare(2, view.size(), view_smaller.data()));
CHECK(1 == view_long.compare(2, view.size(), view_shorter.data()));
}
//*************************************************************************
TEST(test_compare_position_count_text_count)
{
View view(text.c_str());
View view_smaller(text_smaller.c_str());
View view_shorter(text_shorter.c_str());
std::string text_long = std::string("xx") + text + std::string("xx");
View view_long(text_long.c_str());
std::string text_smaller_long = std::string("xx") + text_smaller + std::string("xx");
View view_smaller_long(text_smaller_long.c_str());
std::string text_shorter_long = std::string("xx") + text_shorter + std::string("xx");
View view_shorter_long(text_shorter_long.c_str());
CHECK(0 == view_long.compare(2, view.size(), view.data(), view.size()));
CHECK(-1 == view_smaller_long.compare(2, view.size(), view_long.data(), view_long.size()));
CHECK(-1 == view_shorter_long.compare(2, text_shorter.size(), view_long.data(), view_long.size()));
CHECK(1 == view_long.compare(2, view.size(), view_smaller.data(), view_smaller.size()));
CHECK(1 == view_long.compare(2, view.size(), view_shorter.data(), view_shorter.size()));
}
//*************************************************************************
TEST(test_starts_with)
{
View view(text.c_str());
View start("Hello");
View notstart("Gello");
View notstartlong("Hello Worldxxxxxx");
CHECK(view.starts_with(start));
CHECK(!view.starts_with(notstart));
CHECK(!view.starts_with(notstartlong));
CHECK(view.starts_with('H'));
CHECK(!view.starts_with('G'));
CHECK(view.starts_with("Hello"));
CHECK(!view.starts_with("Gello"));
CHECK(!view.starts_with("Hello Worldxxxxxx"));
}
//*************************************************************************
TEST(test_ends_with)
{
View view(text.c_str());
View end("World");
View notend("Xorld");
View notendlong("Hello Worldxxxxxx");
CHECK(view.ends_with(end));
CHECK(!view.ends_with(notend));
CHECK(!view.ends_with(notendlong));
CHECK(view.ends_with('d'));
CHECK(!view.ends_with('e'));
CHECK(view.ends_with("World"));
CHECK(!view.ends_with("Xorld"));
CHECK(!view.ends_with("Hello Worldxxxxxx"));
}
//*************************************************************************
TEST(test_contains)
{
const char* s1 = "Hello";
const char* s2 = "llo Wor";
const char* s3 = "World";
const char* s4 = "Xorld";
const char* s5 = "Hello Worldxxxxxx";
View view(text.c_str());
View v1(s1);
View v2(s2);
View v3(s3);
View v4(s4);
View v5(s5);
CHECK_TRUE(view.contains(v1));
CHECK_TRUE(view.contains(v2));
CHECK_TRUE(view.contains(v3));
CHECK_FALSE(view.contains(v4));
CHECK_FALSE(view.contains(v5));
CHECK_TRUE(view.contains('H'));
CHECK_TRUE(view.contains('l'));
CHECK_FALSE(view.contains('X'));
CHECK_TRUE(view.contains(s1));
CHECK_TRUE(view.contains(s2));
CHECK_TRUE(view.contains(s3));
CHECK_FALSE(view.contains(s4));
CHECK_FALSE(view.contains(s5));
}
//*************************************************************************
TEST(test_find)
{
const char* s1 = "Hello";
const char* s2 = "llo Wor";
const char* s3 = "World";
const char* s4 = "Xorld";
const char* s5 = "Hello Worldxxxxxx";
View view(text.c_str());
View v1(s1);
View v2(s2);
View v3(s3);
View v4(s4);
View v5(s5);
CHECK(0U == view.find(v1));
CHECK(2U == view.find(v2));
CHECK(2U == view.find(v2, 2));
CHECK(6U == view.find(v3));
CHECK(View::npos == view.find(v3, 7));
CHECK(View::npos == view.find(v4));
CHECK(View::npos == view.find(v5));
CHECK(0U == view.find('H'));
CHECK(2U == view.find('l'));
CHECK(2U == view.find('l', 2));
CHECK(View::npos == view.find('X'));
CHECK(0U == view.find(s1));
CHECK(2U == view.find(s2));
CHECK(2U == view.find(s2, 2));
CHECK(6U == view.find(s3));
CHECK(View::npos == view.find(s3, 7));
CHECK(View::npos == view.find(s4));
CHECK(View::npos == view.find(s5));
CHECK(0U == view.find(s1, 0, 3));
CHECK(2U == view.find(s2, 0, 3));
CHECK(2U == view.find(s2, 2, 3));
CHECK(6U == view.find(s3, 0, 3));
CHECK(View::npos == view.find(s3, 7, 3));
CHECK(View::npos == view.find(s4, 0, 3));
CHECK(View::npos == view.find(s5, 0, 15));
}
//*************************************************************************
TEST(test_rfind)
{
const char* s1 = "ab";
const char* s2 = "cd";
const char* s3 = "bcd";
const char* s4 = "abcdabcdabcd";
View view("abcdabcdab");
View v1(s1);
View v2(s2);
View v3(s3);
View v4(s4);
CHECK(8U == view.rfind(v1));
CHECK(6U == view.rfind(v2));
CHECK(2U == view.rfind(v2, 5));
CHECK(View::npos == view.rfind(v4));
CHECK(8U == view.rfind('a'));
CHECK(6U == view.rfind('c'));
CHECK(2U == view.rfind('c', 5));
CHECK(8U == view.rfind(s1));
CHECK(6U == view.rfind(s2));
CHECK(2U == view.rfind(s2, 5));
CHECK(View::npos == view.rfind(s4));
CHECK(5U == view.rfind(s3, 5, 2));
CHECK(View::npos == view.rfind(s4, 0, 11));
}
//*************************************************************************
TEST(test_find_rfind_all_positions)
{
const std::string compare_text("abcdabcdab");
View view(compare_text.c_str());
const char* needles[] = {"cd", "d", "x", ""};
// Every position up to past the end, where the search must not read outside the view.
for (size_t position = 0U; position <= compare_text.size() + 2U; ++position)
{
for (size_t i = 0U; i < 4U; ++i)
{
CHECK_EQUAL(compare_text.find(needles[i], position), view.find(needles[i], position));
CHECK_EQUAL(compare_text.rfind(needles[i], position), view.rfind(needles[i], position));
}
}
CHECK_EQUAL(View::npos, view.find("cd", View::npos));
}
//*************************************************************************
TEST(test_find_first_of)
{
const char* s1 = "l";
const char* s2 = "o";
const char* s3 = "W";
const char* s4 = "Wol";
const char* s5 = "wOL";
View view("Hello World");
View v1(s1);
View v2(s2);
View v3(s3);
View v4(s4);
View v5(s5);
CHECK(2U == view.find_first_of(v1));
CHECK(4U == view.find_first_of(v2));
CHECK(6U == view.find_first_of(v3));
CHECK(2U == view.find_first_of(v4));
CHECK(View::npos == view.find_first_of(v5));
CHECK(3U == view.find_first_of(v1, 3));
CHECK(4U == view.find_first_of(v2, 2));
CHECK(View::npos == view.find_first_of(v3, 7));
CHECK(6U == view.find_first_of(v4, 5));
CHECK(View::npos == view.find_first_of(v5, 2));
CHECK(2U == view.find_first_of('l'));
CHECK(4U == view.find_first_of('o'));
CHECK(6U == view.find_first_of('W'));
CHECK(View::npos == view.find_first_of('w'));
CHECK(2U == view.find_first_of(s1));
CHECK(4U == view.find_first_of(s2));
CHECK(6U == view.find_first_of(s3));
CHECK(2U == view.find_first_of(s4));
CHECK(View::npos == view.find_first_of(s5));
CHECK(3U == view.find_first_of(s1, 3));
CHECK(4U == view.find_first_of(s2, 2));
CHECK(View::npos == view.find_first_of(s3, 7));
CHECK(6U == view.find_first_of(s4, 5));
CHECK(View::npos == view.find_first_of(s5, 2));
CHECK(3U == view.find_first_of(s1, 3, 1));
CHECK(4U == view.find_first_of(s2, 2, 1));
CHECK(View::npos == view.find_first_of(s3, 7, 1));
CHECK(4U == view.find_first_of(s4, 0, 2));
CHECK(View::npos == view.find_first_of(s5, 2, 3));
}
//*************************************************************************
TEST(test_find_last_of)
{
const char* s1 = "l";
const char* s2 = "o";
const char* s3 = "W";
const char* s4 = "Wol";
const char* s5 = "wOL";
View view("Hello World");
View v1(s1);
View v2(s2);
View v3(s3);
View v4(s4);
View v5(s5);
CHECK(9U == view.find_last_of(v1));
CHECK(7U == view.find_last_of(v2));
CHECK(6U == view.find_last_of(v3));
CHECK(9U == view.find_last_of(v4));
CHECK(View::npos == view.find_last_of(v5));
CHECK(3U == view.find_last_of(v1, 3));
CHECK(View::npos == view.find_last_of(v2, 2));
CHECK(6U == view.find_last_of(v3, 7));
CHECK(4U == view.find_last_of(v4, 5));
CHECK(View::npos == view.find_last_of(v5, 2));
CHECK(9U == view.find_last_of('l'));
CHECK(7U == view.find_last_of('o'));
CHECK(6U == view.find_last_of('W'));
CHECK(View::npos == view.find_last_of('w'));
CHECK(9U == view.find_last_of(s1));
CHECK(7U == view.find_last_of(s2));
CHECK(6U == view.find_last_of(s3));
CHECK(9U == view.find_last_of(s4));
CHECK(View::npos == view.find_last_of(s5));
CHECK(3U == view.find_last_of(s1, 3));
CHECK(View::npos == view.find_last_of(s2, 2));
CHECK(6U == view.find_last_of(s3, 7));
CHECK(4U == view.find_last_of(s4, 5));
CHECK(View::npos == view.find_last_of(s5, 2));
CHECK(3U == view.find_last_of(s1, 3, 1));
CHECK(View::npos == view.find_last_of(s2, 2, 1));
CHECK(6U == view.find_last_of(s3, 7, 1));
CHECK(4U == view.find_last_of(s4, 5, 2));
CHECK(View::npos == view.find_last_of(s5, 2, 3));
}
//*************************************************************************
TEST(test_find_first_not_of)
{
const char* s1 = "H";
const char* s2 = "eH";
const char* s3 = "leH";
const char* s4 = " olleH";
const char* s5 = "wOL";
const char* s6 = "Helo Wrd";
View view("Hello World");
View v1(s1);
View v2(s2);
View v3(s3);
View v4(s4);
View v5(s5);
View v6(s6);
CHECK(1U == view.find_first_not_of(v1));
CHECK(2U == view.find_first_not_of(v2));
CHECK(4U == view.find_first_not_of(v3));
CHECK(6U == view.find_first_not_of(v4));
CHECK(0U == view.find_first_not_of(v5));
CHECK(View::npos == view.find_first_not_of(v6));
CHECK(3U == view.find_first_not_of(v1, 3));
CHECK(2U == view.find_first_not_of(v2, 2));
CHECK(7U == view.find_first_not_of(v3, 7));
CHECK(6U == view.find_first_not_of(v4, 5));
CHECK(2U == view.find_first_not_of(v5, 2));
CHECK(View::npos == view.find_first_not_of(v6, 0));
CHECK(1U == view.find_first_not_of('H'));
CHECK(0U == view.find_first_not_of('e'));
CHECK(1U == view.find_first_not_of(s1));
CHECK(2U == view.find_first_not_of(s2));
CHECK(4U == view.find_first_not_of(s3));
CHECK(6U == view.find_first_not_of(s4));
CHECK(0U == view.find_first_not_of(s5));
CHECK(View::npos == view.find_first_not_of(s6));
CHECK(3U == view.find_first_not_of(s1, 3));
CHECK(2U == view.find_first_not_of(s2, 2));
CHECK(7U == view.find_first_not_of(s3, 7));
CHECK(6U == view.find_first_not_of(s4, 5));
CHECK(2U == view.find_first_not_of(s5, 2));
CHECK(View::npos == view.find_first_not_of(s6, 0));
CHECK(3U == view.find_first_not_of(s1, 3, 1));
CHECK(2U == view.find_first_not_of(s2, 2, 1));
CHECK(7U == view.find_first_not_of(s3, 7, 1));
CHECK(6U == view.find_first_not_of(s4, 5, 2));
CHECK(2U == view.find_first_not_of(s5, 2, 3));
CHECK(View::npos == view.find_first_not_of(s6, 0, 8));
}
//*************************************************************************
TEST(test_find_last_not_of)
{
const char* s1 = "d";
const char* s2 = "dl";
const char* s3 = "dlr";
const char* s4 = "dlroW";
const char* s5 = "DLROw";
const char* s6 = "Helo Wrd";
View view("Hello World");
View v1(s1);
View v2(s2);
View v3(s3);
View v4(s4);
View v5(s5);
View v6(s6);
CHECK(9U == view.find_last_not_of(v1));
CHECK(8U == view.find_last_not_of(v2));
CHECK(7U == view.find_last_not_of(v3));
CHECK(5U == view.find_last_not_of(v4));
CHECK(10U == view.find_last_not_of(v5));
CHECK(View::npos == view.find_last_not_of(v6));
CHECK(9U == view.find_last_not_of(v1, 10));
CHECK(8U == view.find_last_not_of(v2, 9));
CHECK(7U == view.find_last_not_of(v3, 8));
CHECK(5U == view.find_last_not_of(v4, 8));
CHECK(8U == view.find_last_not_of(v5, 8));
CHECK(View::npos == view.find_last_not_of(v6, 10));
CHECK(9U == view.find_last_not_of('d'));
CHECK(10U == view.find_last_not_of('l'));
CHECK(9U == view.find_last_not_of(s1));
CHECK(8U == view.find_last_not_of(s2));
CHECK(7U == view.find_last_not_of(s3));
CHECK(5U == view.find_last_not_of(s4));
CHECK(10U == view.find_last_not_of(s5));
CHECK(View::npos == view.find_last_not_of(s6));
CHECK(9U == view.find_last_not_of(s1, 10));
CHECK(8U == view.find_last_not_of(s2, 9));
CHECK(7U == view.find_last_not_of(s3, 8));
CHECK(5U == view.find_last_not_of(s4, 8));
CHECK(8U == view.find_last_not_of(s5, 8));
CHECK(View::npos == view.find_last_not_of(s6, 10));
CHECK(9U == view.find_last_not_of(s1, 10, 1));
CHECK(9U == view.find_last_not_of(s2, 9, 1));
CHECK(8U == view.find_last_not_of(s3, 9, 2));
CHECK(7U == view.find_last_not_of(s4, 8, 3));
CHECK(8U == view.find_last_not_of(s5, 8, 5));
CHECK(View::npos == view.find_last_not_of(s6, 10, 8));
}
//*************************************************************************
TEST(test_hash)
{
typedef etl::string<11> Text;
typedef etl::wstring<11> WText;
typedef etl::u16string<11> U16Text;
typedef etl::u32string<11> U32Text;
typedef etl::string_view View;
typedef etl::wstring_view WView;
typedef etl::u16string_view U16View;
typedef etl::u32string_view U32View;
Text text("Hello World");
WText wtext(L"Hello World");
U16Text u16text(u"Hello World");
U32Text u32text(U"Hello World");
View view(text.data());
WView wview(wtext.data());
U16View u16view(u16text.data());
U32View u32view(u32text.data());
CHECK(etl::hash<Text>()(text) == etl::hash<View>()(view));
CHECK(etl::hash<WText>()(wtext) == etl::hash<WView>()(wview));
CHECK(etl::hash<U16Text>()(u16text) == etl::hash<U16View>()(u16view));
CHECK(etl::hash<U32Text>()(u32text) == etl::hash<U32View>()(u32view));
}
//*************************************************************************
TEST(string_view_literal)
{
typedef etl::string_view View;
typedef etl::wstring_view WView;
typedef etl::u16string_view U16View;
typedef etl::u32string_view U32View;
using namespace etl::literals::string_literals;
View view = "Hello World"_sv;
WView wview = L"Hello World"_sv;
U16View u16view = u"Hello World"_sv;
U32View u32view = U"Hello World"_sv;
CHECK_TRUE((view == View{"Hello World", etl::strlen("Hello World")}));
CHECK_TRUE((wview == WView{L"Hello World", etl::strlen(L"Hello World")}));
CHECK_TRUE((u16view == U16View{u"Hello World", etl::strlen(u"Hello World")}));
CHECK_TRUE((u32view == U32View{U"Hello World", etl::strlen(U"Hello World")}));
}
//*************************************************************************
#if ETL_USING_STL
TEST(write_to_std_stream)
{
View view{"Hello World"};
WView wview{L"Hello World"};
U16View u16view{u"Hello World"};
U32View u32view{U"Hello World"};
std::stringstream sstream;
std::wstringstream wsstream;
std::basic_stringstream<char16_t> u16sstream;
std::basic_stringstream<char32_t> u32sstream;
sstream << view;
std::string sstream_string = sstream.str();
wsstream << wview;
std::wstring wsstream_string = wsstream.str();
u16sstream << u16view;
std::u16string u16sstream_string = u16sstream.str();
u32sstream << u32view;
std::u32string u32sstream_string = u32sstream.str();
View sstream_view(sstream_string.data(), sstream_string.size());
WView wsstream_view(wsstream_string.data(), wsstream_string.size());
U16View u16sstream_view(u16sstream_string.data(), u16sstream_string.size());
U32View u32sstream_view(u32sstream_string.data(), u32sstream_string.size());
CHECK_TRUE(view == sstream_view);
CHECK_TRUE(wview == wsstream_view);
CHECK_TRUE(u16view == u16sstream_view);
CHECK_TRUE(u32view == u32sstream_view);
}
#endif
//*************************************************************************
TEST(test_rfind_boundary_positions)
{
etl::string_view sv("abcabc");
// rfind "abc" with position=3: should find the second "abc" at position 3
size_t pos = sv.rfind(etl::string_view("abc"), 3);
CHECK_EQUAL(3U, pos);
// rfind "abc" with position=2: should find only the first "abc" at position 0
pos = sv.rfind(etl::string_view("abc"), 2);
CHECK_EQUAL(0U, pos);
// rfind "abc" with position=0: should find at position 0
pos = sv.rfind(etl::string_view("abc"), 0);
CHECK_EQUAL(0U, pos);
// rfind with npos (search entire string)
pos = sv.rfind(etl::string_view("abc"));
CHECK_EQUAL(3U, pos);
// rfind something not found
pos = sv.rfind(etl::string_view("xyz"));
CHECK_EQUAL(etl::string_view::npos, pos);
// Compare with std::string to verify exact behavior
std::string std_sv("abcabc");
for (size_t p = 0; p <= std_sv.size(); ++p)
{
size_t std_pos = std_sv.rfind("abc", p);
size_t etl_pos = sv.rfind(etl::string_view("abc"), p);
CHECK_EQUAL(std_pos, etl_pos);
}
}
//*************************************************************************
TEST(test_npos_type_and_value)
{
typedef etl::string_view::size_type size_type;
// npos must have the same type as size_type, not an anonymous enum.
CHECK((etl::is_same<const size_type, decltype(etl::string_view::npos)>::value));
CHECK_EQUAL(etl::integral_limits<size_type>::max, etl::string_view::npos);
// npos must compare equal to the equivalent std::string_view constant.
CHECK_EQUAL(std::string::npos, etl::string_view::npos);
// substr with the default count must return the whole remaining view.
etl::string_view view("Hello World");
CHECK_EQUAL(std::string("World"), std::string(view.substr(6).data(), view.substr(6).size()));
CHECK_EQUAL(5U, view.substr(6, etl::string_view::npos).size());
}
}
} // namespace