11 #include <boost/concept_check.hpp> 14 #include <adobe/implementation/swap.hpp> 27 boost::function_requires< boost::ContainerConcept<T> >();
33 typename T::const_iterator i1=d1.begin(), i2=d1.end(), i3=d2.begin(), i4=d2.end();
34 typename T::iterator j1=d2.begin(), j2=d2.end();
40 BOOST_CHECK_MESSAGE(c.size() == d.size(),
"container copy-ctor size");
41 typename T::const_iterator i=c.begin(), j=d.begin();
43 BOOST_CHECK_MESSAGE(d==c,
"container copy-ctor values");
49 BOOST_CHECK_MESSAGE(c.size() == d.size(),
"container assignment copy-ctor size");
52 BOOST_CHECK_MESSAGE(d==c,
"container copy-ctor values");
58 BOOST_CHECK_MESSAGE(c.max_size() >= c.size() && 0 <= c.size(),
"container maximum size");
59 BOOST_CHECK_MESSAGE(d.max_size() >= d.size() && 0 <= d.size(),
"container maximum size");
60 BOOST_CHECK_MESSAGE(c.empty() == (c.size() == 0),
"container empty");
61 BOOST_CHECK_MESSAGE(d.empty() == (d.size() == 0),
"container empty");
74 BOOST_CHECK_MESSAGE(d1 == d3 && d2 == d4,
"container swap");
79 typename T::iterator x;
80 typename T::const_iterator y;
void swap(adobe::lex_stream_t &, adobe::lex_stream_t &)
void check_traversable(const T &c)
void check_regular(const T &x)
void swap(circular_queue< T > &, circular_queue< T > &)
BOOST_TEST_CASE_TEMPLATE_FUNCTION(check_regulars, T)