boostorg/container
1
0
Fork 1
mirror of https://github.com/boostorg/container.git synced 2025-08-02 14:04:26 +02:00
Code Issues Packages Projects Releases Wiki Activity

Added experimental static_vector first sketch

Browse Source 
[SVN r83036]
This commit is contained in:
Ion Gaztañaga
2013-02-19 21:35:46 +00:00
parent e93994fb72
commit f309f82a8f
7 changed files with 2805 additions and 255 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
include/boost/container/detail/utilities.hpp
View File

@@ -18,6 +18,7 @@
#include <boost/type_traits/is_enum.hpp> #include <boost/type_traits/is_enum.hpp>
#include <boost/type_traits/is_member_pointer.hpp> #include <boost/type_traits/is_member_pointer.hpp>
#include <boost/type_traits/is_class.hpp> #include <boost/type_traits/is_class.hpp>
#include <boost/type_traits/has_trivial_destructor.hpp>
#include <boost/move/utility.hpp> #include <boost/move/utility.hpp>
#include <boost/move/iterator.hpp> #include <boost/move/iterator.hpp>
#include <boost/container/detail/mpl.hpp> #include <boost/container/detail/mpl.hpp>
@@ -700,6 +701,58 @@ inline I move_n_source(I f, typename std::iterator_traits<I>::difference_type n,
return f; return f;
} }
//////////////////////////////////////////////////////////////////////////////
//
// destroy_n
//
//////////////////////////////////////////////////////////////////////////////
template
<typename A
,typename I> // I models InputIterator
inline void destroy_alloc_n(A &a, I f, typename std::iterator_traits<I>::difference_type n
,typename boost::container::container_detail::enable_if_c
< !boost::has_trivial_destructor<typename std::iterator_traits<I>::value_type>::value >::type* = 0)
{
while(n--){
allocator_traits<A>::destroy(a, container_detail::addressof(*f++));
}
}
template
<typename A
,typename I> // I models InputIterator
inline void destroy_alloc_n(A &, I, typename std::iterator_traits<I>::difference_type
,typename boost::container::container_detail::enable_if_c
< boost::has_trivial_destructor<typename std::iterator_traits<I>::value_type>::value >::type* = 0)
{}
//////////////////////////////////////////////////////////////////////////////
//
// deep_swap_alloc_n
//
//////////////////////////////////////////////////////////////////////////////
template
<typename A
,typename F // I models ForwardIterator
,typename G // G models ForwardIterator
>
void deep_swap_alloc_n(A &a, F short_range_f, typename allocator_traits<A>::size_type n_i
, G large_range_f, typename allocator_traits<A>::size_type n_j)
{
typename allocator_traits<A>::size_type n = 0;
typedef typename allocator_traits<A>::value_type value_type;
for (; n != n_i ; ++short_range_f, ++large_range_f, ++n){
//boost::swap(*first_sm, *first_la); // may throw
value_type temp(boost::move(*short_range_f)); // may throw
*short_range_f = boost::move(*large_range_f); // may throw
*large_range_f = boost::move(temp); // may throw
}
uninitialized_move_alloc_n(a, large_range_f, n_j - n, short_range_f); // may throw
destroy_alloc_n(a, large_range_f, n_j - n);
}
} //namespace container { } //namespace container {
} //namespace boost { } //namespace boost {

1040
include/boost/container/static_vector.hpp Normal file
View File

File diff suppressed because it is too large Load Diff

834
include/boost/container/vector.hpp
View File

File diff suppressed because it is too large Load Diff

139
proj/vc7ide/static_vector_test.vcproj Normal file
View File

@@ -0,0 +1,139 @@
<?xml version="1.0" encoding="Windows-1252"?>
<VisualStudioProject
ProjectType="Visual C++"
Version="7.10"
Name="static_vector_test"
ProjectGUID="{58E1C1C3-096A-84FE-4FA2-D6BA79201C02}"
Keyword="Win32Proj">
<Platforms>
<Platform
Name="Win32"/>
</Platforms>
<Configurations>
<Configuration
Name="Debug|Win32"
OutputDirectory="../../Bin/Win32/Debug"
IntermediateDirectory="Debug/static_vector_test"
ConfigurationType="1"
CharacterSet="2">
<Tool
Name="VCCLCompilerTool"
Optimization="0"
AdditionalIncludeDirectories="../../../.."
PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
MinimalRebuild="TRUE"
ExceptionHandling="TRUE"
BasicRuntimeChecks="3"
RuntimeLibrary="3"
TreatWChar_tAsBuiltInType="TRUE"
ForceConformanceInForLoopScope="FALSE"
UsePrecompiledHeader="0"
WarningLevel="4"
Detect64BitPortabilityProblems="TRUE"
DebugInformationFormat="3"/>
<Tool
Name="VCCustomBuildTool"/>
<Tool
Name="VCLinkerTool"
AdditionalDependencies="winmm.lib"
OutputFile="$(OutDir)/static_vector_test_d.exe"
LinkIncremental="1"
AdditionalLibraryDirectories="../../../../stage/lib"
GenerateDebugInformation="TRUE"
ProgramDatabaseFile="$(OutDir)/static_vector_test.pdb"
SubSystem="1"
TargetMachine="1"
FixedBaseAddress="1"/>
<Tool
Name="VCMIDLTool"/>
<Tool
Name="VCPostBuildEventTool"/>
<Tool
Name="VCPreBuildEventTool"/>
<Tool
Name="VCPreLinkEventTool"/>
<Tool
Name="VCResourceCompilerTool"/>
<Tool
Name="VCWebServiceProxyGeneratorTool"/>
<Tool
Name="VCXMLDataGeneratorTool"/>
<Tool
Name="VCWebDeploymentTool"/>
<Tool
Name="VCManagedWrapperGeneratorTool"/>
<Tool
Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
</Configuration>
<Configuration
Name="Release|Win32"
OutputDirectory="../../Bin/Win32/Release"
IntermediateDirectory="Release/static_vector_test"
ConfigurationType="1"
CharacterSet="2">
<Tool
Name="VCCLCompilerTool"
AdditionalIncludeDirectories="../../../.."
PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;BOOST_DATE_TIME_NO_LIB"
RuntimeLibrary="2"
TreatWChar_tAsBuiltInType="TRUE"
ForceConformanceInForLoopScope="FALSE"
UsePrecompiledHeader="0"
WarningLevel="4"
Detect64BitPortabilityProblems="TRUE"
DebugInformationFormat="0"/>
<Tool
Name="VCCustomBuildTool"/>
<Tool
Name="VCLinkerTool"
AdditionalDependencies="winmm.lib"
OutputFile="$(OutDir)/static_vector_test.exe"
LinkIncremental="1"
AdditionalLibraryDirectories="../../../../stage/lib"
GenerateDebugInformation="TRUE"
SubSystem="1"
OptimizeReferences="2"
EnableCOMDATFolding="2"
TargetMachine="1"/>
<Tool
Name="VCMIDLTool"/>
<Tool
Name="VCPostBuildEventTool"/>
<Tool
Name="VCPreBuildEventTool"/>
<Tool
Name="VCPreLinkEventTool"/>
<Tool
Name="VCResourceCompilerTool"/>
<Tool
Name="VCWebServiceProxyGeneratorTool"/>
<Tool
Name="VCXMLDataGeneratorTool"/>
<Tool
Name="VCWebDeploymentTool"/>
<Tool
Name="VCManagedWrapperGeneratorTool"/>
<Tool
Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
</Configuration>
</Configurations>
<References>
</References>
<Files>
<Filter
Name="Source Files"
Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
UniqueIdentifier="{4137B7CF-A066-4312-7AC5-32D732A37AAF}">
<File
RelativePath="..\..\test\static_vector_test.cpp">
</File>
</Filter>
<Filter
Name="Header Files"
Filter="h;hpp;hxx;hm;inl;inc;xsd"
UniqueIdentifier="{93815995-89BD-b043-5E8B-65FBE52E2AFB}">
</Filter>
</Files>
<Globals>
</Globals>
</VisualStudioProject>

92
test/movable.hpp Normal file
View File

@@ -0,0 +1,92 @@
//////////////////////////////////////////////////////////////////////////////
//
// (C) Copyright Ion Gaztanaga 2009.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// See http://www.boost.org/libs/move for documentation.
//
//////////////////////////////////////////////////////////////////////////////
#ifndef BOOST_MOVE_TEST_MOVABLE_HPP
#define BOOST_MOVE_TEST_MOVABLE_HPP
//[movable_definition
//header file "movable.hpp"
#include <boost/move/move.hpp>
//A movable class
class movable
{
BOOST_MOVABLE_BUT_NOT_COPYABLE(movable)
int value_;
public:
movable() : value_(1){}
//Move constructor and assignment
movable(BOOST_RV_REF(movable) m)
{ value_ = m.value_; m.value_ = 0; }
movable & operator=(BOOST_RV_REF(movable) m)
{ value_ = m.value_; m.value_ = 0; return *this; }
bool moved() const //Observer
{ return value_ == 0; }
};
class copy_movable
{
BOOST_COPYABLE_AND_MOVABLE(copy_movable)
int value_;
public:
copy_movable(int value = 1) : value_(value){}
//Move constructor and assignment
copy_movable(BOOST_RV_REF(copy_movable) m)
{ value_ = m.value_; m.value_ = 0; }
copy_movable(const copy_movable &m)
{ value_ = m.value_; }
copy_movable & operator=(BOOST_RV_REF(copy_movable) m)
{ value_ = m.value_; m.value_ = 0; return *this; }
copy_movable & operator=(BOOST_COPY_ASSIGN_REF(copy_movable) m)
{ value_ = m.value_; return *this; }
bool moved() const //Observer
{ return value_ == 0; }
bool operator==(const copy_movable& m) const
{ return value_ == m.value_; }
};
struct copy_movable_wrapper
{
copy_movable cm;
};
copy_movable produce()
{ return copy_movable(); }
namespace boost{
template<>
struct has_nothrow_move<movable>
{
static const bool value = true;
};
template<>
struct has_nothrow_move<copy_movable>
{
static const bool value = true;
};
} //namespace boost{
//]
#endif //BOOST_MOVE_TEST_MOVABLE_HPP

803
test/static_vector_test.cpp Normal file
View File

@@ -0,0 +1,803 @@
// Boost.Container static_vector
// Unit Test
// Copyright (c) 2012-2013 Adam Wulkiewicz, Lodz, Poland.
// Copyright (c) 2012-2013 Andrew Hundt.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <boost/container/detail/config_begin.hpp>
#include <boost/detail/lightweight_test.hpp>
#include <boost/detail/no_exceptions_support.hpp>
namespace boost {
namespace container {
namespace test {
//lightweight_test.hpp does not offer support to check if an operation throws
//so write our own macro
inline void throw_failed_impl(char const * excep, char const * file, int line, char const * function)
{
BOOST_LIGHTWEIGHT_TEST_OSTREAM
<< file << "(" << line << "): Exception '" << excep << "' not thrown in function '"
<< function << "'" << std::endl;
++boost::detail::test_errors();
}
} //namespace detail {
} //namespace container {
} //namespace boost {
#define BOOST_TEST_THROW( S, E ) \
try { \
S; \
::boost::container::test::throw_failed_impl \
(#E, __FILE__, __LINE__, BOOST_CURRENT_FUNCTION); \
} \
catch( E const&) { \
} \
//
// TODO: Disable parts of the unit test that should not run when BOOST_NO_EXCEPTIONS
// if exceptions are enabled there must be a user defined throw_exception function
#ifdef BOOST_NO_EXCEPTIONS
namespace boost {
void throw_exception(std::exception const & e){}; // user defined
} // namespace boost
#endif // BOOST_NO_EXCEPTIONS
#include <vector>
#include <list>
#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
#include <boost/container/vector.hpp>
#include <boost/container/stable_vector.hpp>
#endif
#include "static_vector_test.hpp"
namespace boost {
namespace container {
//Explicit instantiation to detect compilation errors
template class boost::container::static_vector<int, 10>;
}}
template <typename T, size_t N>
void test_ctor_ndc()
{
static_vector<T, N> s;
BOOST_TEST_EQ(s.size() , 0u);
BOOST_TEST(s.capacity() == N);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(0u), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
}
template <typename T, size_t N>
void test_ctor_nc(size_t n)
{
static_vector<T, N> s(n);
BOOST_TEST(s.size() == n);
BOOST_TEST(s.capacity() == N);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(n), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
if ( 1 < n )
{
T val10(10);
s[0] = val10;
BOOST_TEST(T(10) == s[0]);
BOOST_TEST(T(10) == s.at(0));
T val20(20);
s.at(1) = val20;
BOOST_TEST(T(20) == s[1]);
BOOST_TEST(T(20) == s.at(1));
}
}
template <typename T, size_t N>
void test_ctor_nd(size_t n, T const& v)
{
static_vector<T, N> s(n, v);
BOOST_TEST(s.size() == n);
BOOST_TEST(s.capacity() == N);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(n), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
if ( 1 < n )
{
BOOST_TEST(v == s[0]);
BOOST_TEST(v == s.at(0));
BOOST_TEST(v == s[1]);
BOOST_TEST(v == s.at(1));
s[0] = T(10);
BOOST_TEST(T(10) == s[0]);
BOOST_TEST(T(10) == s.at(0));
s.at(1) = T(20);
BOOST_TEST(T(20) == s[1]);
BOOST_TEST(T(20) == s.at(1));
}
}
template <typename T, size_t N>
void test_resize_nc(size_t n)
{
static_vector<T, N> s;
s.resize(n);
BOOST_TEST(s.size() == n);
BOOST_TEST(s.capacity() == N);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(n), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
if ( 1 < n )
{
T val10(10);
s[0] = val10;
BOOST_TEST(T(10) == s[0]);
BOOST_TEST(T(10) == s.at(0));
T val20(20);
s.at(1) = val20;
BOOST_TEST(T(20) == s[1]);
BOOST_TEST(T(20) == s.at(1));
}
}
template <typename T, size_t N>
void test_resize_nd(size_t n, T const& v)
{
static_vector<T, N> s;
s.resize(n, v);
BOOST_TEST(s.size() == n);
BOOST_TEST(s.capacity() == N);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(n), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
if ( 1 < n )
{
BOOST_TEST(v == s[0]);
BOOST_TEST(v == s.at(0));
BOOST_TEST(v == s[1]);
BOOST_TEST(v == s.at(1));
s[0] = T(10);
BOOST_TEST(T(10) == s[0]);
BOOST_TEST(T(10) == s.at(0));
s.at(1) = T(20);
BOOST_TEST(T(20) == s[1]);
BOOST_TEST(T(20) == s.at(1));
}
}
template <typename T, size_t N>
void test_push_back_nd()
{
static_vector<T, N> s;
BOOST_TEST(s.size() == 0);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(0), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
for ( size_t i = 0 ; i < N ; ++i )
{
T t(i);
s.push_back(t);
BOOST_TEST(s.size() == i + 1);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(i + 1), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
BOOST_TEST(T(i) == s.at(i));
BOOST_TEST(T(i) == s[i]);
BOOST_TEST(T(i) == s.back());
BOOST_TEST(T(0) == s.front());
BOOST_TEST(T(i) == *(s.data() + i));
}
}
template <typename T, size_t N>
void test_pop_back_nd()
{
static_vector<T, N> s;
for ( size_t i = 0 ; i < N ; ++i )
{
T t(i);
s.push_back(t);
}
for ( size_t i = N ; i > 1 ; --i )
{
s.pop_back();
BOOST_TEST(s.size() == i - 1);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW( s.at(i - 1), std::out_of_range );
#endif // BOOST_NO_EXCEPTIONS
BOOST_TEST(T(i - 2) == s.at(i - 2));
BOOST_TEST(T(i - 2) == s[i - 2]);
BOOST_TEST(T(i - 2) == s.back());
BOOST_TEST(T(0) == s.front());
}
}
template <typename It1, typename It2>
void test_compare_ranges(It1 first1, It1 last1, It2 first2, It2 last2)
{
BOOST_TEST(std::distance(first1, last1) == std::distance(first2, last2));
for ( ; first1 != last1 && first2 != last2 ; ++first1, ++first2 )
BOOST_TEST(*first1 == *first2);
}
template <typename T, size_t N, typename C>
void test_copy_and_assign(C const& c)
{
{
static_vector<T, N> s(c.begin(), c.end());
BOOST_TEST(s.size() == c.size());
test_compare_ranges(s.begin(), s.end(), c.begin(), c.end());
}
{
static_vector<T, N> s;
BOOST_TEST(0 == s.size());
s.assign(c.begin(), c.end());
BOOST_TEST(s.size() == c.size());
test_compare_ranges(s.begin(), s.end(), c.begin(), c.end());
}
}
template <typename T, size_t N>
void test_copy_and_assign_nd(T const& val)
{
static_vector<T, N> s;
std::vector<T> v;
std::list<T> l;
for ( size_t i = 0 ; i < N ; ++i )
{
T t(i);
s.push_back(t);
v.push_back(t);
l.push_back(t);
}
// copy ctor
{
static_vector<T, N> s1(s);
BOOST_TEST(s.size() == s1.size());
test_compare_ranges(s.begin(), s.end(), s1.begin(), s1.end());
}
// copy assignment
{
static_vector<T, N> s1;
BOOST_TEST(0 == s1.size());
s1 = s;
BOOST_TEST(s.size() == s1.size());
test_compare_ranges(s.begin(), s.end(), s1.begin(), s1.end());
}
// ctor(Iter, Iter) and assign(Iter, Iter)
test_copy_and_assign<T, N>(s);
test_copy_and_assign<T, N>(v);
test_copy_and_assign<T, N>(l);
// assign(N, V)
{
static_vector<T, N> s1(s);
test_compare_ranges(s.begin(), s.end(), s1.begin(), s1.end());
std::vector<T> a(N, val);
s1.assign(N, val);
test_compare_ranges(a.begin(), a.end(), s1.begin(), s1.end());
}
#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
stable_vector<T> bsv(s.begin(), s.end());
vector<T> bv(s.begin(), s.end());
test_copy_and_assign<T, N>(bsv);
test_copy_and_assign<T, N>(bv);
#endif
}
template <typename T, size_t N>
void test_iterators_nd()
{
static_vector<T, N> s;
std::vector<T> v;
for ( size_t i = 0 ; i < N ; ++i )
{
s.push_back(T(i));
v.push_back(T(i));
}
test_compare_ranges(s.begin(), s.end(), v.begin(), v.end());
test_compare_ranges(s.rbegin(), s.rend(), v.rbegin(), v.rend());
s.assign(v.rbegin(), v.rend());
test_compare_ranges(s.begin(), s.end(), v.rbegin(), v.rend());
test_compare_ranges(s.rbegin(), s.rend(), v.begin(), v.end());
}
template <typename T, size_t N>
void test_erase_nd()
{
static_vector<T, N> s;
typedef typename static_vector<T, N>::iterator It;
for ( size_t i = 0 ; i < N ; ++i )
s.push_back(T(i));
// erase(pos)
{
for ( size_t i = 0 ; i < N ; ++i )
{
static_vector<T, N> s1(s);
It it = s1.erase(s1.begin() + i);
BOOST_TEST(s1.begin() + i == it);
BOOST_TEST(s1.size() == N - 1);
for ( size_t j = 0 ; j < i ; ++j )
BOOST_TEST(s1[j] == T(j));
for ( size_t j = i+1 ; j < N ; ++j )
BOOST_TEST(s1[j-1] == T(j));
}
}
// erase(first, last)
{
size_t n = N/3;
for ( size_t i = 0 ; i <= N ; ++i )
{
static_vector<T, N> s1(s);
size_t removed = i + n < N ? n : N - i;
It it = s1.erase(s1.begin() + i, s1.begin() + i + removed);
BOOST_TEST(s1.begin() + i == it);
BOOST_TEST(s1.size() == N - removed);
for ( size_t j = 0 ; j < i ; ++j )
BOOST_TEST(s1[j] == T(j));
for ( size_t j = i+n ; j < N ; ++j )
BOOST_TEST(s1[j-n] == T(j));
}
}
}
template <typename T, size_t N, typename SV, typename C>
void test_insert(SV const& s, C const& c)
{
size_t h = N/2;
size_t n = size_t(h/1.5f);
for ( size_t i = 0 ; i <= h ; ++i )
{
static_vector<T, N> s1(s);
typename C::const_iterator it = c.begin();
std::advance(it, n);
typename static_vector<T, N>::iterator
it1 = s1.insert(s1.begin() + i, c.begin(), it);
BOOST_TEST(s1.begin() + i == it1);
BOOST_TEST(s1.size() == h+n);
for ( size_t j = 0 ; j < i ; ++j )
BOOST_TEST(s1[j] == T(j));
for ( size_t j = 0 ; j < n ; ++j )
BOOST_TEST(s1[j+i] == T(100 + j));
for ( size_t j = 0 ; j < h-i ; ++j )
BOOST_TEST(s1[j+i+n] == T(j+i));
}
}
template <typename T, size_t N>
void test_insert_nd(T const& val)
{
size_t h = N/2;
static_vector<T, N> s, ss;
std::vector<T> v;
std::list<T> l;
typedef typename static_vector<T, N>::iterator It;
for ( size_t i = 0 ; i < h ; ++i )
{
s.push_back(T(i));
ss.push_back(T(100 + i));
v.push_back(T(100 + i));
l.push_back(T(100 + i));
}
// insert(pos, val)
{
for ( size_t i = 0 ; i <= h ; ++i )
{
static_vector<T, N> s1(s);
It it = s1.insert(s1.begin() + i, val);
BOOST_TEST(s1.begin() + i == it);
BOOST_TEST(s1.size() == h+1);
for ( size_t j = 0 ; j < i ; ++j )
BOOST_TEST(s1[j] == T(j));
BOOST_TEST(s1[i] == val);
for ( size_t j = 0 ; j < h-i ; ++j )
BOOST_TEST(s1[j+i+1] == T(j+i));
}
}
// insert(pos, n, val)
{
size_t n = size_t(h/1.5f);
for ( size_t i = 0 ; i <= h ; ++i )
{
static_vector<T, N> s1(s);
It it = s1.insert(s1.begin() + i, n, val);
BOOST_TEST(s1.begin() + i == it);
BOOST_TEST(s1.size() == h+n);
for ( size_t j = 0 ; j < i ; ++j )
BOOST_TEST(s1[j] == T(j));
for ( size_t j = 0 ; j < n ; ++j )
BOOST_TEST(s1[j+i] == val);
for ( size_t j = 0 ; j < h-i ; ++j )
BOOST_TEST(s1[j+i+n] == T(j+i));
}
}
// insert(pos, first, last)
test_insert<T, N>(s, ss);
test_insert<T, N>(s, v);
test_insert<T, N>(s, l);
#if !defined(BOOST_NO_TEMPLATE_PARTIAL_SPECIALIZATION)
stable_vector<T> bsv(ss.begin(), ss.end());
vector<T> bv(ss.begin(), ss.end());
test_insert<T, N>(s, bv);
test_insert<T, N>(s, bsv);
#endif
}
template <typename T>
void test_capacity_0_nd()
{
static_vector<T, 10> v(5u, T(0));
static_vector<T, 0 > s;
BOOST_TEST(s.size() == 0);
BOOST_TEST(s.capacity() == 0);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW(s.at(0), std::out_of_range);
BOOST_TEST_THROW(s.resize(5u, T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.push_back(T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.insert(s.end(), T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.insert(s.end(), 5u, T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.insert(s.end(), v.begin(), v.end()), std::bad_alloc);
BOOST_TEST_THROW(s.assign(v.begin(), v.end()), std::bad_alloc);
BOOST_TEST_THROW(s.assign(5u, T(0)), std::bad_alloc);
try{
static_vector<T, 0> s2(v.begin(), v.end());
BOOST_TEST(false);
}catch(std::bad_alloc &){}
try{
static_vector<T, 0> s1(5u, T(0));
BOOST_TEST(false);
}catch(std::bad_alloc &){}
#endif // BOOST_NO_EXCEPTIONS
}
template <typename T, size_t N>
void test_exceptions_nd()
{
static_vector<T, N> v(N, T(0));
static_vector<T, N/2> s(N/2, T(0));
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW(s.resize(N, T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.push_back(T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.insert(s.end(), T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.insert(s.end(), N, T(0)), std::bad_alloc);
BOOST_TEST_THROW(s.insert(s.end(), v.begin(), v.end()), std::bad_alloc);
BOOST_TEST_THROW(s.assign(v.begin(), v.end()), std::bad_alloc);
BOOST_TEST_THROW(s.assign(N, T(0)), std::bad_alloc);
try{
static_vector<T, N/2> s2(v.begin(), v.end());
BOOST_TEST(false);
}catch(std::bad_alloc &){}
try{
static_vector<T, N/2> s1(N, T(0));
BOOST_TEST(false);
}catch(std::bad_alloc &){}
#endif // BOOST_NO_EXCEPTIONS
}
template <typename T, size_t N>
void test_swap_and_move_nd()
{
{
static_vector<T, N> v1, v2, v3, v4;
static_vector<T, N> s1, s2;
static_vector<T, N> s4;
for (size_t i = 0 ; i < N ; ++i )
{
v1.push_back(T(i));
v2.push_back(T(i));
v3.push_back(T(i));
v4.push_back(T(i));
}
for (size_t i = 0 ; i < N/2 ; ++i )
{
s1.push_back(T(100 + i));
s2.push_back(T(100 + i));
s4.push_back(T(100 + i));
}
s1.swap(v1);
s2 = boost::move(v2);
static_vector<T, N> s3(boost::move(v3));
s4.swap(v4);
BOOST_TEST(v1.size() == N/2);
BOOST_TEST(s1.size() == N);
//iG moving does not imply emptying source
//BOOST_TEST(v2.size() == 0);
BOOST_TEST(s2.size() == N);
//iG moving does not imply emptying source
//BOOST_TEST(v3.size() == 0);
BOOST_TEST(s3.size() == N);
BOOST_TEST(v4.size() == N/2);
BOOST_TEST(s4.size() == N);
for (size_t i = 0 ; i < N/2 ; ++i )
{
BOOST_TEST(v1[i] == T(100 + i));
BOOST_TEST(v4[i] == T(100 + i));
}
for (size_t i = 0 ; i < N ; ++i )
{
BOOST_TEST(s1[i] == T(i));
BOOST_TEST(s2[i] == T(i));
BOOST_TEST(s3[i] == T(i));
BOOST_TEST(s4[i] == T(i));
}
}
{
static_vector<T, N> v1, v2, v3;
static_vector<T, N/2> s1, s2;
for (size_t i = 0 ; i < N/2 ; ++i )
{
v1.push_back(T(i));
v2.push_back(T(i));
v3.push_back(T(i));
}
for (size_t i = 0 ; i < N/3 ; ++i )
{
s1.push_back(T(100 + i));
s2.push_back(T(100 + i));
}
s1.swap(v1);
s2 = boost::move(v2);
static_vector<T, N/2> s3(boost::move(v3));
BOOST_TEST(v1.size() == N/3);
BOOST_TEST(s1.size() == N/2);
//iG moving does not imply emptying source
//BOOST_TEST(v2.size() == 0);
BOOST_TEST(s2.size() == N/2);
//iG moving does not imply emptying source
//BOOST_TEST(v3.size() == 0);
BOOST_TEST(s3.size() == N/2);
for (size_t i = 0 ; i < N/3 ; ++i )
BOOST_TEST(v1[i] == T(100 + i));
for (size_t i = 0 ; i < N/2 ; ++i )
{
BOOST_TEST(s1[i] == T(i));
BOOST_TEST(s2[i] == T(i));
BOOST_TEST(s3[i] == T(i));
}
}
{
static_vector<T, N> v(N, T(0));
static_vector<T, N/2> s(N/2, T(1));
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW(s.swap(v), std::bad_alloc);
v.resize(N, T(0));
BOOST_TEST_THROW(s = boost::move(v), std::bad_alloc);
v.resize(N, T(0));
try {
static_vector<T, N/2> s2(boost::move(v));
BOOST_TEST(false);
} catch (std::bad_alloc &) {}
#endif // BOOST_NO_EXCEPTIONS
}
}
template <typename T, size_t N>
void test_emplace_0p()
{
//emplace_back()
{
static_vector<T, N> v;
for (int i = 0 ; i < int(N) ; ++i )
v.emplace_back();
BOOST_TEST(v.size() == N);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW(v.emplace_back(), std::bad_alloc);
#endif
}
}
template <typename T, size_t N>
void test_emplace_2p()
{
//emplace_back(pos, int, int)
{
static_vector<T, N> v;
for (int i = 0 ; i < int(N) ; ++i )
v.emplace_back(i, 100 + i);
BOOST_TEST(v.size() == N);
#ifndef BOOST_NO_EXCEPTIONS
BOOST_TEST_THROW(v.emplace_back(N, 100 + N), std::bad_alloc);
#endif
BOOST_TEST(v.size() == N);
for (int i = 0 ; i < int(N) ; ++i )
BOOST_TEST(v[i] == T(i, 100 + i));
}
// emplace(pos, int, int)
{
typedef typename static_vector<T, N>::iterator It;
int h = N / 2;
static_vector<T, N> v;
for ( int i = 0 ; i < h ; ++i )
v.emplace_back(i, 100 + i);
for ( int i = 0 ; i <= h ; ++i )
{
static_vector<T, N> vv(v);
It it = vv.emplace(vv.begin() + i, i+100, i+200);
BOOST_TEST(vv.begin() + i == it);
BOOST_TEST(vv.size() == size_t(h+1));
for ( int j = 0 ; j < i ; ++j )
BOOST_TEST(vv[j] == T(j, j+100));
BOOST_TEST(vv[i] == T(i+100, i+200));
for ( int j = 0 ; j < h-i ; ++j )
BOOST_TEST(vv[j+i+1] == T(j+i, j+i+100));
}
}
}
template <typename T, size_t N>
void test_sv_elem(T const& t)
{
typedef static_vector<T, N> V;
static_vector<V, N> v;
v.push_back(V(N/2, t));
V vvv(N/2, t);
v.push_back(boost::move(vvv));
v.insert(v.begin(), V(N/2, t));
v.insert(v.end(), V(N/2, t));
v.emplace_back(N/2, t);
}
int main(int, char* [])
{
BOOST_TEST(counting_value::count() == 0);
test_ctor_ndc<int, 10>();
test_ctor_ndc<value_ndc, 10>();
test_ctor_ndc<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_ctor_ndc<shptr_value, 10>();
test_ctor_ndc<copy_movable, 10>();
test_ctor_nc<int, 10>(5);
test_ctor_nc<value_nc, 10>(5);
test_ctor_nc<counting_value, 10>(5);
BOOST_TEST(counting_value::count() == 0);
test_ctor_nc<shptr_value, 10>(5);
test_ctor_nc<copy_movable, 10>(5);
test_ctor_nd<int, 10>(5, 1);
test_ctor_nd<value_nd, 10>(5, value_nd(1));
test_ctor_nd<counting_value, 10>(5, counting_value(1));
BOOST_TEST(counting_value::count() == 0);
test_ctor_nd<shptr_value, 10>(5, shptr_value(1));
test_ctor_nd<copy_movable, 10>(5, produce());
test_resize_nc<int, 10>(5);
test_resize_nc<value_nc, 10>(5);
test_resize_nc<counting_value, 10>(5);
BOOST_TEST(counting_value::count() == 0);
test_resize_nc<shptr_value, 10>(5);
test_resize_nc<copy_movable, 10>(5);
test_resize_nd<int, 10>(5, 1);
test_resize_nd<value_nd, 10>(5, value_nd(1));
test_resize_nd<counting_value, 10>(5, counting_value(1));
BOOST_TEST(counting_value::count() == 0);
test_resize_nd<shptr_value, 10>(5, shptr_value(1));
test_resize_nd<copy_movable, 10>(5, produce());
test_push_back_nd<int, 10>();
test_push_back_nd<value_nd, 10>();
test_push_back_nd<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_push_back_nd<shptr_value, 10>();
test_push_back_nd<copy_movable, 10>();
test_pop_back_nd<int, 10>();
test_pop_back_nd<value_nd, 10>();
test_pop_back_nd<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_pop_back_nd<shptr_value, 10>();
test_pop_back_nd<copy_movable, 10>();
test_copy_and_assign_nd<int, 10>(1);
test_copy_and_assign_nd<value_nd, 10>(value_nd(1));
test_copy_and_assign_nd<counting_value, 10>(counting_value(1));
BOOST_TEST(counting_value::count() == 0);
test_copy_and_assign_nd<shptr_value, 10>(shptr_value(1));
test_copy_and_assign_nd<copy_movable, 10>(produce());
test_iterators_nd<int, 10>();
test_iterators_nd<value_nd, 10>();
test_iterators_nd<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_iterators_nd<shptr_value, 10>();
test_iterators_nd<copy_movable, 10>();
test_erase_nd<int, 10>();
test_erase_nd<value_nd, 10>();
test_erase_nd<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_erase_nd<shptr_value, 10>();
test_erase_nd<copy_movable, 10>();
test_insert_nd<int, 10>(50);
test_insert_nd<value_nd, 10>(value_nd(50));
test_insert_nd<counting_value, 10>(counting_value(50));
BOOST_TEST(counting_value::count() == 0);
test_insert_nd<shptr_value, 10>(shptr_value(50));
test_insert_nd<copy_movable, 10>(produce());
test_capacity_0_nd<int>();
test_capacity_0_nd<value_nd>();
test_capacity_0_nd<counting_value>();
BOOST_TEST(counting_value::count() == 0);
test_capacity_0_nd<shptr_value>();
test_capacity_0_nd<copy_movable>();
test_exceptions_nd<int, 10>();
test_exceptions_nd<value_nd, 10>();
test_exceptions_nd<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_exceptions_nd<shptr_value, 10>();
test_exceptions_nd<copy_movable, 10>();
test_swap_and_move_nd<int, 10>();
test_swap_and_move_nd<value_nd, 10>();
test_swap_and_move_nd<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_swap_and_move_nd<shptr_value, 10>();
test_swap_and_move_nd<copy_movable, 10>();
test_emplace_0p<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_emplace_2p<counting_value, 10>();
BOOST_TEST(counting_value::count() == 0);
test_sv_elem<int, 10>(50);
test_sv_elem<value_nd, 10>(value_nd(50));
test_sv_elem<counting_value, 10>(counting_value(50));
BOOST_TEST(counting_value::count() == 0);
test_sv_elem<shptr_value, 10>(shptr_value(50));
test_sv_elem<copy_movable, 10>(copy_movable(50));
return boost::report_errors();
}
#include <boost/container/detail/config_end.hpp>

99
test/static_vector_test.hpp Normal file
View File

@@ -0,0 +1,99 @@
// Boost.Container static_vector
// Unit Test
// Copyright (c) 2012-2013 Adam Wulkiewicz, Lodz, Poland.
// Copyright (c) 2012-2013 Andrew Hundt.
// Use, modification and distribution is subject to the Boost Software License,
// Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#ifndef BOOST_CONTAINER_TEST_STATIC_VECTOR_TEST_HPP
#define BOOST_CONTAINER_TEST_STATIC_VECTOR_TEST_HPP
#include <boost/container/static_vector.hpp>
#include <boost/shared_ptr.hpp>
#include "movable.hpp"
using namespace boost::container;
class value_ndc
{
public:
explicit value_ndc(int a) : aa(a) {}
~value_ndc() {}
bool operator==(value_ndc const& v) const { return aa == v.aa; }
bool operator<(value_ndc const& v) const { return aa < v.aa; }
private:
value_ndc(value_ndc const&) {}
value_ndc & operator=(value_ndc const&) { return *this; }
int aa;
};
class value_nd
{
public:
explicit value_nd(int a) : aa(a) {}
~value_nd() {}
bool operator==(value_nd const& v) const { return aa == v.aa; }
bool operator<(value_nd const& v) const { return aa < v.aa; }
private:
int aa;
};
class value_nc
{
public:
explicit value_nc(int a = 0) : aa(a) {}
~value_nc() {}
bool operator==(value_nc const& v) const { return aa == v.aa; }
bool operator<(value_nc const& v) const { return aa < v.aa; }
private:
value_nc(value_nc const&) {}
value_nc & operator=(value_ndc const&) { return *this; }
int aa;
};
class counting_value
{
BOOST_COPYABLE_AND_MOVABLE(counting_value)
public:
explicit counting_value(int a = 0, int b = 0) : aa(a), bb(b) { ++c(); }
counting_value(counting_value const& v) : aa(v.aa), bb(v.bb) { ++c(); }
counting_value(BOOST_RV_REF(counting_value) p) : aa(p.aa), bb(p.bb) { p.aa = 0; p.bb = 0; ++c(); } // Move constructor
counting_value& operator=(BOOST_RV_REF(counting_value) p) { aa = p.aa; p.aa = 0; bb = p.bb; p.bb = 0; return *this; } // Move assignment
counting_value& operator=(BOOST_COPY_ASSIGN_REF(counting_value) p) { aa = p.aa; bb = p.bb; return *this; } // Copy assignment
~counting_value() { --c(); }
bool operator==(counting_value const& v) const { return aa == v.aa && bb == v.bb; }
bool operator<(counting_value const& v) const { return aa < v.aa || ( aa == v.aa && bb < v.bb ); }
static size_t count() { return c(); }
private:
static size_t & c() { static size_t co = 0; return co; }
int aa, bb;
};
namespace boost {
template <>
struct has_nothrow_move<counting_value>
{
static const bool value = true;
};
}
class shptr_value
{
typedef boost::shared_ptr<int> Ptr;
public:
explicit shptr_value(int a = 0) : m_ptr(new int(a)) {}
bool operator==(shptr_value const& v) const { return *m_ptr == *(v.m_ptr); }
bool operator<(shptr_value const& v) const { return *m_ptr < *(v.m_ptr); }
private:
boost::shared_ptr<int> m_ptr;
};
#endif // BOOST_CONTAINER_TEST_STATIC_VECTOR_TEST_HPP