Fix spelling and spaces.
authorMike Krinkin <krinkin.m.u@gmail.com>
Thu, 16 Apr 2015 14:20:49 +0000 (17:20 +0300)
committerkhizmax <khizmax@gmail.com>
Tue, 21 Apr 2015 12:51:45 +0000 (15:51 +0300)
cds/algo/atomic.h
cds/intrusive/details/split_list_base.h
cds/intrusive/split_list.h

index 1d3cd24382185960c53e43bb622a4f58ad8a2a07..92bb48d9cc0b1d2441a0c21be019eb8be7c8613f 100644 (file)
@@ -187,7 +187,7 @@ namespace cds {
             {}
 
             /// Returns current value of the counter
-            counter_type    value(atomics::memory_order order = atomics::memory_order_relaxed) const
+            counter_type value(atomics::memory_order order = atomics::memory_order_relaxed) const
             {
                 return m_Counter.load( order );
             }
@@ -199,13 +199,13 @@ namespace cds {
             }
 
             /// Returns underlying atomic interface
-            atomic_type&  getAtomic()
+            atomic_type& getAtomic()
             {
                 return m_Counter;
             }
 
             /// Returns underlying atomic interface (const)
-            const atomic_type&  getAtomic() const
+            const atomic_type& getAtomic() const
             {
                 return m_Counter;
             }
@@ -264,7 +264,7 @@ namespace cds {
             typedef size_t counter_type    ;  ///< Counter type
         public:
             /// Returns 0
-            counter_type    value(atomics::memory_order /*order*/ = atomics::memory_order_relaxed) const
+            counter_type value(atomics::memory_order /*order*/ = atomics::memory_order_relaxed) const
             {
                 return 0;
             }
index cef83734e697fa87d5b4094ec671eb41d288fcc9..cddfb628bfc7aecede37bb11eaa4ac247bc7cda8 100644 (file)
@@ -418,7 +418,7 @@ namespace cds { namespace intrusive {
             {
                 metrics m;
 
-                // Calculate m_nSegmentSize and m_nSegmentCount  by nItemCount
+                // Calculate m_nSegmentSize and m_nSegmentCount by nItemCount
                 m.nLoadFactor = nLoadFactor > 0 ? nLoadFactor : 1;
 
                 size_t nBucketCount = (size_t)( ((float) nItemCount) / m.nLoadFactor );
index d67ab64daa876e0e8327a689f8d65876ff03426c..4a560c57681620d89414b2387477051e60767951 100644 (file)
@@ -415,7 +415,6 @@ namespace cds { namespace intrusive {
             // In this point, we must wait while nBucket is empty.
             // The compiler can decide that waiting loop can be "optimized" (stripped)
             // To prevent this situation, we use waiting on volatile bucket_head_ptr pointer.
-            //
             m_Stat.onBucketInitContenton();
             back_off bkoff;
             while ( true ) {
@@ -458,7 +457,7 @@ namespace cds { namespace intrusive {
             m_Buckets.bucket( 0, pNode );
         }
 
-        void    inc_item_count()
+        void inc_item_count()
         {
             size_t sz = m_nBucketCountLog2.load(memory_model::memory_order_relaxed);
             if ( ( ++m_ItemCounter >> sz ) > m_Buckets.load_factor() && ((size_t)(1 << sz )) < m_Buckets.capacity() )
@@ -583,7 +582,7 @@ namespace cds { namespace intrusive {
         /// Initialize split-ordered list of default capacity
         /**
             The default capacity is defined in bucket table constructor.
-            See \p split_list::expandable_bucket_table, \p split_list::static_ducket_table
+            See \p split_list::expandable_bucket_table, \p split_list::static_bucket_table
             which selects by \p split_list::dynamic_bucket_table option.
         */
         SplitListSet()