Removed trailing spaces

[libcds.git] / test / unit / queue / fcqueue.cpp

diff --git a/test/unit/queue/fcqueue.cpp b/test/unit/queue/fcqueue.cpp
index f6fccd0be1fe44974f9d99952bef920525582d4d..a757749241e085ed9bfa59087ac67b149a2a1c55 100644 (file)
--- a/test/unit/queue/fcqueue.cpp
+++ b/test/unit/queue/fcqueue.cpp
@@ -28,7 +28,7 @@
     OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
-#include <gtest/gtest.h>
+#include <cds_test/ext_gtest.h>
 #include <cds/container/fcqueue.h>
 #include <test/include/cds_test/fc_hevy_value.h>
 
@@ -53,16 +53,16 @@ namespace {
             // enqueue/dequeue
             for ( int i = 0; i < nSize; ++i ) {
                 ASSERT_TRUE( q.enqueue( value_type(i)));
-                ASSERT_EQ( q.size(), i + 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>(i + 1));
             }
             ASSERT_FALSE( q.empty());
-            ASSERT_EQ( q.size(), nSize );
+            ASSERT_EQ( q.size(), static_cast<size_t>( nSize ));
 
             for ( int i = 0; i < nSize; ++i ) {
                 it = value_type( -1 );
                 ASSERT_TRUE( q.dequeue( it ));
                 ASSERT_EQ( it, value_type( i ));
-                ASSERT_EQ( q.size(), nSize - i - 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>( nSize - i - 1 ));
             }
             ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
@@ -70,16 +70,16 @@ namespace {
             // push/pop
             for ( int i = 0; i < nSize; ++i ) {
                 ASSERT_TRUE( q.push( value_type(i)));
-                ASSERT_EQ( q.size(), i + 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>( i + 1 ));
             }
             ASSERT_FALSE( q.empty());
-            ASSERT_EQ( q.size(), nSize );
+            ASSERT_EQ( q.size(), static_cast<size_t>( nSize ));
 
             for ( int i = 0; i < nSize; ++i ) {
                 it = value_type( -1 );
                 ASSERT_TRUE( q.pop( it ));
                 ASSERT_EQ( it, value_type( i ));
-                ASSERT_EQ( q.size(), nSize - i - 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>( nSize - i - 1 ));
             }
             ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
@@ -89,7 +89,7 @@ namespace {
                 ASSERT_TRUE( q.push( value_type( i )));
             }
             ASSERT_FALSE( q.empty());
-            ASSERT_EQ( q.size(), nSize );
+            ASSERT_EQ( q.size(), static_cast<size_t>( nSize ));
 
             q.clear();
             ASSERT_TRUE( q.empty());
@@ -146,64 +146,64 @@ namespace {
 
             const int nSize = 100;
 
-            ASSERT_TRUE( q.empty() );
+            ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
 
             // enqueue/dequeue
             for ( int i = 0; i < nSize; ++i ) {
                 ASSERT_TRUE( q.enqueue( value_type( i )));
-                ASSERT_EQ( q.size(), i + 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>( i + 1 ));
             }
-            ASSERT_FALSE( q.empty() );
-            ASSERT_EQ( q.size(), nSize );
+            ASSERT_FALSE( q.empty());
+            ASSERT_EQ( q.size(), static_cast<size_t>( nSize ));
 
             for ( int i = 0; i < nSize; ++i ) {
                 it.value = -1;
-                ASSERT_TRUE( q.dequeue( it ) );
+                ASSERT_TRUE( q.dequeue( it ));
                 ASSERT_EQ( it.value, i );
-                ASSERT_EQ( q.size(), nSize - i - 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>( nSize - i - 1 ));
             }
-            ASSERT_TRUE( q.empty() );
+            ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
 
             // push/pop
             for ( int i = 0; i < nSize; ++i ) {
                 ASSERT_TRUE( q.push( value_type( i )));
-                ASSERT_EQ( q.size(), i + 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>( i + 1 ));
             }
-            ASSERT_FALSE( q.empty() );
-            ASSERT_EQ( q.size(), nSize );
+            ASSERT_FALSE( q.empty());
+            ASSERT_EQ( q.size(), static_cast<size_t>( nSize ));
 
             for ( int i = 0; i < nSize; ++i ) {
                 it.value = -1;
-                ASSERT_TRUE( q.pop( it ) );
+                ASSERT_TRUE( q.pop( it ));
                 ASSERT_EQ( it.value, i );
-                ASSERT_EQ( q.size(), nSize - i - 1 );
+                ASSERT_EQ( q.size(), static_cast<size_t>( nSize - i - 1 ));
             }
-            ASSERT_TRUE( q.empty() );
+            ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
 
             // clear
             for ( int i = 0; i < nSize; ++i ) {
                 ASSERT_TRUE( q.push( value_type( i )));
             }
-            ASSERT_FALSE( q.empty() );
-            ASSERT_EQ( q.size(), nSize );
+            ASSERT_FALSE( q.empty());
+            ASSERT_EQ( q.size(), static_cast<size_t>( nSize ));
 
             q.clear();
-            ASSERT_TRUE( q.empty() );
+            ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
 
             // pop from empty queue
             it = value_type( nSize * 2 );
-            ASSERT_FALSE( q.pop( it ) );
+            ASSERT_FALSE( q.pop( it ));
             ASSERT_EQ( it.value, nSize * 2 );
-            ASSERT_TRUE( q.empty() );
+            ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
 
-            ASSERT_FALSE( q.dequeue( it ) );
+            ASSERT_FALSE( q.dequeue( it ));
             ASSERT_EQ( it.value, nSize * 2 );
-            ASSERT_TRUE( q.empty() );
+            ASSERT_TRUE( q.empty());
             ASSERT_EQ( q.size(), 0u );
         }