-//$$CDS-header$$
+/*
+ This file is a part of libcds - Concurrent Data Structures library
-#ifndef __CDS_DETAILS_ALLOCATOR_H
-#define __CDS_DETAILS_ALLOCATOR_H
+ (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:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ 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.
+*/
+
+#ifndef CDSLIB_DETAILS_ALLOCATOR_H
+#define CDSLIB_DETAILS_ALLOCATOR_H
#include <type_traits>
#include <memory>
, typename Alloc::template rebind<T>::other
>::type allocator_type;
+ /// \p true if underlined allocator is \p std::allocator, \p false otherwise
+ static CDS_CONSTEXPR bool const c_bStdAllocator = std::is_same< allocator_type, std::allocator<T>>::value;
+
/// Element type
typedef T value_type;
template <typename... S>
value_type * New( S const&... src )
{
- return Construct( allocator_type::allocate(1), src... );
+ return Construct( allocator_type::allocate( 1, nullptr ), src... );
}
/// Analogue of <tt>operator new T( std::forward<Args>(args)... )</tt> (move semantics)
template <typename... Args>
value_type * MoveNew( Args&&... args )
{
- return MoveConstruct( allocator_type::allocate(1), std::forward<Args>(args)... );
+ return MoveConstruct( allocator_type::allocate( 1, nullptr ), std::forward<Args>(args)... );
}
/// Analogue of operator new T[\p nCount ]
value_type * NewArray( size_t nCount )
{
- value_type * p = allocator_type::allocate( nCount );
+ value_type * p = allocator_type::allocate( nCount, nullptr );
for ( size_t i = 0; i < nCount; ++i )
Construct( p + i );
return p;
template <typename S>
value_type * NewArray( size_t nCount, S const& src )
{
- value_type * p = allocator_type::allocate( nCount );
+ value_type * p = allocator_type::allocate( nCount, nullptr );
for ( size_t i = 0; i < nCount; ++i )
Construct( p + i, src );
return p;
template <typename... S>
value_type * Construct( void * p, S const&... src )
{
- return new( p ) value_type( src... );
+ value_type * pv = new( p ) value_type( src... );
+ return pv;
}
/// Analogue of placement <tt>operator new( p ) T( std::forward<Args>(args)... )</tt>
template <typename... Args>
value_type * MoveConstruct( void * p, Args&&... args )
{
- return new( p ) value_type( std::forward<Args>(args)... );
+ value_type * pv = new( p ) value_type( std::forward<Args>(args)... );
+ return pv;
}
/// Rebinds allocator to other type \p Q instead of \p T
*/
static void free( T * p )
{
- Allocator<T, Alloc> a;
+ Allocator<type, allocator_type> a;
a.Delete( p );
}
};
} // namespace details
} // namespace cds
-#endif // #ifndef __CDS_DETAILS_ALLOCATOR_H
+#endif // #ifndef CDSLIB_DETAILS_ALLOCATOR_H