-
Notifications
You must be signed in to change notification settings - Fork 67
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
65 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,63 @@ | ||
// Copyright 2009 Andy Tompkins 2009 | ||
// Copyright 2024 Peter Dimov | ||
// Distributed under the Boost Software License, Version 1.0. | ||
// https://www.boost.org/LICENSE_1_0.txt | ||
|
||
#include <boost/uuid/uuid.hpp> | ||
#include <boost/uuid/uuid_io.hpp> | ||
#include <boost/core/lightweight_test.hpp> | ||
#include <string> | ||
#include <algorithm> | ||
|
||
using namespace boost::uuids; | ||
|
||
template<class Ch> void test( uuid const& u, Ch const* expected ) | ||
{ | ||
int const N = 56; | ||
|
||
for( int n = 0; n < 36; ++n ) | ||
{ | ||
Ch buffer[ N ]; | ||
|
||
std::fill( buffer + 0, buffer + N, '@' ); | ||
|
||
// insufficient buffer size; must fail | ||
BOOST_TEST_NOT( to_chars( u, buffer + 0, buffer + n ) ); | ||
|
||
// make sure nothing is written beyond the end | ||
BOOST_TEST( std::basic_string<Ch>( buffer + n, buffer + N ) == std::basic_string<Ch>( N - n, '@' ) ); | ||
} | ||
|
||
for( int n = 36; n < 48; ++n ) | ||
{ | ||
Ch buffer[ N ]; | ||
|
||
std::fill( buffer + 0, buffer + N, '@' ); | ||
|
||
// sufficient buffer size; must succeed | ||
BOOST_TEST( to_chars( u, buffer + 0, buffer + n ) ); | ||
|
||
// check that the correct string is produced | ||
BOOST_TEST( std::basic_string<Ch>( buffer + 0, buffer + 36 ) == std::basic_string<Ch>( expected ) ); | ||
|
||
// make sure nothing is written beyond the end | ||
BOOST_TEST( std::basic_string<Ch>( buffer + n, buffer + N ) == std::basic_string<Ch>( N - n, '@' ) ); | ||
} | ||
} | ||
|
||
int main() | ||
{ | ||
uuid const u1 = {{ 0 }}; | ||
uuid const u2 = {{ 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, 0x0f }}; | ||
uuid const u3 = {{ 0x12, 0x34, 0x56, 0x78, 0x90, 0xab, 0xcd, 0xef, 0x12, 0x34, 0x56, 0x78, 0x90, 0xab, 0xcd, 0xef }}; | ||
|
||
test( u1, "00000000-0000-0000-0000-000000000000" ); | ||
test( u2, "00010203-0405-0607-0809-0a0b0c0d0e0f" ); | ||
test( u3, "12345678-90ab-cdef-1234-567890abcdef" ); | ||
|
||
test( u1, L"00000000-0000-0000-0000-000000000000" ); | ||
test( u2, L"00010203-0405-0607-0809-0a0b0c0d0e0f" ); | ||
test( u3, L"12345678-90ab-cdef-1234-567890abcdef" ); | ||
|
||
return boost::report_errors(); | ||
} |