boostorg/core
1
0
Fork 1
mirror of https://github.com/boostorg/core.git synced 2025-07-31 13:27:29 +02:00
Code Issues Packages Projects Releases Wiki Activity

Update tests

Browse Source
This commit is contained in:
Peter Dimov
2021-10-09 07:13:56 +03:00
parent b01f2fe4d2
commit 62e9d9b868
4 changed files with 120 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

35
test/sv_find_first_not_of_test.cpp
View File

@@ -524,6 +524,41 @@ int main()
} }
} }
{
wchar_t str[ 256 ];
for( int i = 0; i < 256; ++i )
{
str[ i ] = static_cast< wchar_t >( 0x100 + i );
}
boost::core::wstring_view sv( str, 256 );
BOOST_TEST_EQ( sv.find_first_not_of( sv ), npos );
std::wstring str2( sv.data(), sv.size() );
for( int i = 0; i < 256; ++i )
{
std::wstring str3( str2 );
str3[ i ] = ~str3[ i ];
BOOST_TEST_EQ( sv.find_first_not_of( str3 ), i );
}
std::reverse( str, str + 256 );
for( int i = 0; i < 256; ++i )
{
std::wstring str3( str2 );
str3[ i ] = ~str3[ i ];
BOOST_TEST_EQ( sv.find_first_not_of( str3 ), 255 - i );
}
}
#if defined(__cpp_char8_t) && __cpp_char8_t >= 201811L #if defined(__cpp_char8_t) && __cpp_char8_t >= 201811L
{ {

25
test/sv_find_first_of_test.cpp
View File

@@ -446,6 +446,31 @@ int main()
} }
} }
{
wchar_t str[ 256 ];
for( int i = 0; i < 256; ++i )
{
str[ i ] = static_cast< wchar_t >( 0x100 + i );
}
boost::core::wstring_view sv( str, 256 );
for( int i = 0; i < 256; ++i )
{
std::wstring needle( 12, static_cast< wchar_t >( 0x100 + i ) );
BOOST_TEST_EQ( sv.find_first_of( needle ), i );
}
std::reverse( str, str + 256 );
for( int i = 0; i < 256; ++i )
{
std::wstring needle( 12, static_cast< wchar_t >( 0x100 + 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
{ {

35
test/sv_find_last_not_of_test.cpp
View File

@@ -524,6 +524,41 @@ int main()
} }
} }
{
wchar_t str[ 256 ];
for( int i = 0; i < 256; ++i )
{
str[ i ] = static_cast< wchar_t >( 0x100 + i );
}
boost::core::wstring_view sv( str, 256 );
BOOST_TEST_EQ( sv.find_first_not_of( sv ), npos );
std::wstring str2( sv.data(), sv.size() );
for( int i = 0; i < 256; ++i )
{
std::wstring str3( str2 );
str3[ i ] = ~str3[ i ];
BOOST_TEST_EQ( sv.find_first_not_of( str3 ), i );
}
std::reverse( str, str + 256 );
for( int i = 0; i < 256; ++i )
{
std::wstring str3( str2 );
str3[ i ] = ~str3[ i ];
BOOST_TEST_EQ( sv.find_first_not_of( str3 ), 255 - i );
}
}
#if defined(__cpp_char8_t) && __cpp_char8_t >= 201811L #if defined(__cpp_char8_t) && __cpp_char8_t >= 201811L
{ {

25
test/sv_find_last_of_test.cpp
View File

@@ -464,6 +464,31 @@ int main()
} }
} }
{
wchar_t str[ 256 ];
for( int i = 0; i < 256; ++i )
{
str[ i ] = static_cast< wchar_t >( 0x100 + i );
}
boost::core::wstring_view sv( str, 256 );
for( int i = 0; i < 256; ++i )
{
std::wstring needle( 12, static_cast< wchar_t >( 0x100 + i ) );
BOOST_TEST_EQ( sv.find_first_of( needle ), i );
}
std::reverse( str, str + 256 );
for( int i = 0; i < 256; ++i )
{
std::wstring needle( 12, static_cast< wchar_t >( 0x100 + 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
{ {