boostorg/core
1
0
Fork 1
mirror of https://github.com/boostorg/core.git synced 2025-07-30 04:47:24 +02:00
Code Issues Packages Projects Releases Wiki Activity

Update sv_find_first_of_test

Browse Source
This commit is contained in:
Peter Dimov
2021-10-08 10:21:07 +03:00
parent c3cfe7a861
commit af3e6a667b
1 changed files with 26 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
test/sv_find_first_of_test.cpp
View File

@ -4,6 +4,7 @@
#include <boost/core/string_view.hpp> #include <boost/core/string_view.hpp>
#include <boost/core/lightweight_test.hpp> #include <boost/core/lightweight_test.hpp>
#include <algorithm>
#include <cstddef> #include <cstddef>
int main() int main()
@ -380,6 +381,31 @@ int main()
BOOST_TEST_EQ( sv.find_first_of( L"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz", 12 ), npos ); BOOST_TEST_EQ( sv.find_first_of( L"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz", 12 ), npos );
} }
{
char str[ 256 ];
for( int i = 0; i < 256; ++i )
{
str[ i ] = static_cast< unsigned char >( i );
}
boost::core::string_view sv( str, 256 );
for( int i = 0; i < 256; ++i )
{
std::string needle( 12, static_cast< unsigned char >( i ) );
BOOST_TEST_EQ( sv.find_first_of( needle ), i );
}
std::reverse( str, str + 256 );
for( int i = 0; i < 256; ++i )
{
std::string needle( 12, static_cast< unsigned char >( i ) );
BOOST_TEST_EQ( sv.find_first_of( needle ), 255 - i );
}
}
#if defined(__cpp_char8_t) && __cpp_char8_t >= 201811L #if defined(__cpp_char8_t) && __cpp_char8_t >= 201811L
{ {