From c0497ea64387865ba57a890fe01d22fead035b29 Mon Sep 17 00:00:00 2001 From: bemandawes Date: Sun, 4 Sep 2011 18:12:44 +0000 Subject: [PATCH] Final cleanups; tests now pass on Windows/g++ git-svn-id: http://svn.boost.org/svn/boost/sandbox/endian@74230 b8fc166d-592f-0410-95f2-cb63ce0dd405 --- libs/endian/doc/conversion.html | 4 ++-- libs/endian/doc/index.html | 8 ++++---- libs/endian/doc/integers.html | 4 ++-- libs/endian/test/Jamfile.v2 | 2 -- libs/endian/test/endian_test.cpp | 6 +++--- 5 files changed, 11 insertions(+), 13 deletions(-) diff --git a/libs/endian/doc/conversion.html b/libs/endian/doc/conversion.html index 974a5d0..b5111b6 100644 --- a/libs/endian/doc/conversion.html +++ b/libs/endian/doc/conversion.html @@ -23,10 +23,10 @@ - + Integer Types     Tutorial
Boost Home     + Boost Home     Endian Home     Conversion Functions     - Integer Types     Tutorial
diff --git a/libs/endian/doc/index.html b/libs/endian/doc/index.html index f0222a4..38a6c00 100644 --- a/libs/endian/doc/index.html +++ b/libs/endian/doc/index.html @@ -23,10 +23,10 @@
- + Integer Types     Tutorial
Boost Home     + Boost Home     Endian Home     Conversion Functions     - Integer Types     Tutorial
@@ -122,7 +122,7 @@ file transfers or over a network, programmers have to deal with endianness.

-

Endian conversions for native integers - The application uses the +

Endian conversions for native integers - The application uses the built-in integer types, and calls the provided conversion functions to convert byte ordering as needed. Both mutating and non-mutating conversions are supplied, and each comes in unconditional and conditional variants. This approach is simple @@ -130,7 +130,7 @@ and usually more efficient, but is less flexible in terms of size and alignment, hard-to-manage and error-prone in code with many logical paths involving endianness transitions, and can foster very hard to debug logic errors.

-

Endian integer types - The application uses the provided endian types +

Endian integer types - The application uses the provided endian types which mimic the built-in integer types. For example, big32_t or little64_t. This approach is also simple, but can be less efficient. Types with lengths of diff --git a/libs/endian/doc/integers.html b/libs/endian/doc/integers.html index cc1d10c..216cf15 100644 --- a/libs/endian/doc/integers.html +++ b/libs/endian/doc/integers.html @@ -25,10 +25,10 @@

- + Integer Types     Tutorial
Boost Home     + Boost Home     Endian Home     Conversion Functions     - Integer Types     Tutorial
diff --git a/libs/endian/test/Jamfile.v2 b/libs/endian/test/Jamfile.v2 index 366b6ae..961da78 100644 --- a/libs/endian/test/Jamfile.v2 +++ b/libs/endian/test/Jamfile.v2 @@ -11,11 +11,9 @@ test-suite "endian" : - [ run ../../io/test/bin_manip_test.cpp ] [ run endian_test.cpp ] [ run endian_operations_test.cpp : : : gcc:-Wno-sign-compare ] [ run endian_in_union_test.cpp ] - [ run scoped_enum_emulation_test.cpp ] [ run conversion_test.cpp ] ; diff --git a/libs/endian/test/endian_test.cpp b/libs/endian/test/endian_test.cpp index 0c2ccef..11d4f8a 100644 --- a/libs/endian/test/endian_test.cpp +++ b/libs/endian/test/endian_test.cpp @@ -698,13 +698,13 @@ namespace } // check_representation_and_range - long iterations = 10000000; + long iterations = 10000; template< class Endian > Endian timing_test( const char * s) { cout << s << " timing test, " << iterations << " iterations: "; - progress_timer t; +// progress_timer t; Endian v = 1; for ( long i = 0; i < iterations; ++i ) @@ -726,7 +726,7 @@ int cpp_main( int argc, char * argv[] ) { cout << "Usage: " << argv[0] << " [#],\n where # specifies iteration count\n" - " default iteration count is 1000000" << endl; + " default iteration count is " << iterations << endl; if ( argc > 1 ) iterations = atol( argv[1] );