diff --git a/alib2std/test-src/extensions/container/ForwardTreeTest.cpp b/alib2std/test-src/extensions/container/ForwardTreeTest.cpp index ef51be6fc7dbbe524b3bd93a16ae5e25aa445a71..9d936d64b14062934b12f484581e678fd7248e4f 100644 --- a/alib2std/test-src/extensions/container/ForwardTreeTest.cpp +++ b/alib2std/test-src/extensions/container/ForwardTreeTest.cpp @@ -54,9 +54,9 @@ TEST_CASE ( "Forward Tree", "[unit][std][container]" ) { print_tree ( t2, ""); - CHECK( ( char ) t2 ( 1, 1 ) == 'b' ); + CHECK( t2 ( 1, 1 ) == 'b' ); t2 ( 1, 1 ) = 'c'; - CHECK( ( char ) t2 ( 1, 1 ) == 'c' ); + CHECK( t2 ( 1, 1 ) == 'c' ); ext::forward_tree < char >::const_prefix_iterator beg = t2.prefix_begin ( ); beg++; diff --git a/alib2std/test-src/extensions/container/LinearSetTest.cpp b/alib2std/test-src/extensions/container/LinearSetTest.cpp index 13015b9e5160594929cc486022821d4072add74a..476a1d6cadc4e38c70b89bdd3292282e3ef4598b 100644 --- a/alib2std/test-src/extensions/container/LinearSetTest.cpp +++ b/alib2std/test-src/extensions/container/LinearSetTest.cpp @@ -86,8 +86,8 @@ TEST_CASE ( "LinearSet", "[unit][std][container]" ) { std::set_difference (first.begin(), first.end(), second.begin(), second.end(), std::inserter(firstMinusSecond, firstMinusSecond.end())); std::set_difference (second.begin(), second.end(), first.begin(), first.end(), std::inserter(secondMinusFirst, secondMinusFirst.end())); - CHECK(firstMinusSecond.size() == (size_t) 0u); - CHECK(secondMinusFirst.size() == (size_t) 2u); + CHECK(firstMinusSecond.size() == 0u); + CHECK(secondMinusFirst.size() == 2u); } SECTION ( "Test3" ) { diff --git a/alib2std/test-src/extensions/container/SetTest.cpp b/alib2std/test-src/extensions/container/SetTest.cpp index 255cfc77fc70b80cd19e45bb4aa8f2495734b2e7..c629078ea7a530a7c193cc2b0cd7cb3de79fb765 100644 --- a/alib2std/test-src/extensions/container/SetTest.cpp +++ b/alib2std/test-src/extensions/container/SetTest.cpp @@ -62,8 +62,8 @@ TEST_CASE ( "Set", "[unit][std][container]" ) { std::set_difference (first.begin(), first.end(), second.begin(), second.end(), std::inserter(firstMinusSecond, firstMinusSecond.end())); std::set_difference (second.begin(), second.end(), first.begin(), first.end(), std::inserter(secondMinusFirst, secondMinusFirst.end())); - CHECK(firstMinusSecond.size() == (size_t) 0u); - CHECK(secondMinusFirst.size() == (size_t) 2u); + CHECK(firstMinusSecond.size() == 0u); + CHECK(secondMinusFirst.size() == 2u); } } diff --git a/alib2std/test-src/extensions/container/TreeTest.cpp b/alib2std/test-src/extensions/container/TreeTest.cpp index 4975de30dd2407719af946e5e066f8a7df755d93..9b7c29c98c9ac865fa6e9c60b61e266085c1ddde 100644 --- a/alib2std/test-src/extensions/container/TreeTest.cpp +++ b/alib2std/test-src/extensions/container/TreeTest.cpp @@ -64,13 +64,13 @@ TEST_CASE ( "Tree", "[unit][std][container]" ) { print_tree ( t2, "" ); - CHECK ( ( char ) t2 ( ) == 'c' ); - CHECK ( ( char ) t2 ( 0 ) == 'c' ); - CHECK ( ( char ) t2 ( 0, 0 ) == 'b' ); + CHECK ( t2 ( ) == 'c' ); + CHECK ( t2 ( 0 ) == 'c' ); + CHECK ( t2 ( 0, 0 ) == 'b' ); - CHECK ( ( char ) t2 ( 1, 1 ) == 'b' ); + CHECK ( t2 ( 1, 1 ) == 'b' ); t2 ( 1, 1 ) = 'c'; - CHECK ( ( char ) t2 ( 1, 1 ) == 'c' ); + CHECK ( t2 ( 1, 1 ) == 'c' ); CHECK ( t2.checkStructure ( ) ); ext::tree < char >::const_prefix_iterator beg = t2.prefix_begin ( ); diff --git a/alib2std/test-src/extensions/container/TrieTest.cpp b/alib2std/test-src/extensions/container/TrieTest.cpp index 60040033db8ede8bf20cbc9066439c5ecc5c3c7f..3e044014b0925bf3105bbee5a3959ded1daa79bb 100644 --- a/alib2std/test-src/extensions/container/TrieTest.cpp +++ b/alib2std/test-src/extensions/container/TrieTest.cpp @@ -66,12 +66,12 @@ TEST_CASE ( "Trie", "[unit][std][container]" ) { t2.getChildren().begin()->second.insert ( 'a', ext::trie < char, int > ( 5 ) ); - CHECK ( ( int ) t2 ( ) == 3 ); - CHECK ( ( int ) t2 ( 'a' ) == 1 ); - CHECK ( ( int ) t2 ( 'a', 'a' ) == 5 ); + CHECK ( t2 ( ) == 3 ); + CHECK ( t2 ( 'a' ) == 1 ); + CHECK ( t2 ( 'a', 'a' ) == 5 ); t2 ( 'a', 'a' ) = 6; - CHECK ( ( int ) t2 ( 'a', 'a' ) == 6 ); + CHECK ( t2 ( 'a', 'a' ) == 6 ); CHECK ( t2.checkStructure ( ) );