Uses unique_ptr for Threads

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

diff --git a/cds/details/bounded_array.h b/cds/details/bounded_array.h
index 0347c9a35f97e7d5e4c81d25b7142d60395dea5e..2336840de7c78107b6a83733f72d48b20b1e8bdc 100644 (file)
--- a/cds/details/bounded_array.h
+++ b/cds/details/bounded_array.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_IMPL_BOUNDED_ARRAY_H
@@ -77,24 +77,24 @@ namespace cds {
             explicit bounded_array(
                 size_t nCapacity            ///< capacity
             )
-            : m_arr( allocator_impl().NewArray( nCapacity ) )
+            : m_arr( allocator_impl().NewArray( nCapacity ))
             , m_nCapacity( nCapacity )
             {}
 
             ~bounded_array()
             {
-                allocator_impl().Delete( m_arr, capacity() );
+                allocator_impl().Delete( m_arr, capacity());
             }
 
             const value_type& operator []( size_t nItem ) const
             {
-                assert( nItem < capacity() );
+                assert( nItem < capacity());
                 return m_arr[nItem];
             }
 
             value_type& operator []( size_t nItem )
             {
-                assert( nItem < capacity() );
+                assert( nItem < capacity());
                 return m_arr[nItem];
             }