Refactors sequential test cases

[libcds.git] / cds / details / bit_reverse_counter.h

diff --git a/cds/details/bit_reverse_counter.h b/cds/details/bit_reverse_counter.h
index 90c9d0ad6adafbf72d94ee5580aed5e533978037..86c9406aff6e39adc36efda68bd02777ffae86fd 100644 (file)
--- a/cds/details/bit_reverse_counter.h
+++ b/cds/details/bit_reverse_counter.h
@@ -1,11 +1,11 @@
 /*
     This file is a part of libcds - Concurrent Data Structures library
 
-    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+    (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
 
     Source code repo: http://github.com/khizmax/libcds/
     Download: http://sourceforge.net/projects/libcds/files/
-    
+
     Redistribution and use in source and binary forms, with or without
     modification, are permitted provided that the following conditions are met:
 
@@ -25,7 +25,7 @@
     SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
     CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
     OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.     
+    OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
 #ifndef CDSLIB_DETAILS_BIT_REVERSE_COUNTER_H
@@ -75,7 +75,7 @@ namespace cds { namespace bitop {
             --m_nCounter;
             int nBit;
             for ( nBit = m_nHighBit - 1; nBit >= 0; --nBit ) {
-                if ( cds::bitop::complement( m_nReversed, nBit ) )
+                if ( cds::bitop::complement( m_nReversed, nBit ))
                     break;
             }
             if ( nBit < 0 ) {