1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
|
// Copyright Aleksey Gurtovoy 2000-2004
// Copyright Steven Watanabe 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/mpl for documentation.
// $Id$
// $Date$
// $Revision$
#include <boost/mpl/push_front.hpp>
#include <boost/mpl/push_back.hpp>
#include <boost/mpl/list/list10.hpp>
#include <boost/mpl/size.hpp>
#include <boost/mpl/front.hpp>
#include <boost/mpl/aux_/test.hpp>
struct no_push_front_tag {};
struct no_push_front
{
typedef no_push_front_tag tag;
};
MPL_TEST_CASE()
{
typedef push_front<list0<>,long>::type res1;
typedef push_front<list1<long>,int>::type res2;
typedef push_front<list2<int,long>,char>::type res3;
MPL_ASSERT_RELATION( size<res1>::value, ==, 1 );
MPL_ASSERT_RELATION( size<res2>::value, ==, 2 );
MPL_ASSERT_RELATION( size<res3>::value, ==, 3 );
MPL_ASSERT(( is_same< front<res1>::type, long > ));
MPL_ASSERT(( is_same< front<res2>::type, int > ));
MPL_ASSERT(( is_same< front<res3>::type, char > ));
MPL_ASSERT(( has_push_front< list0<> > ));
MPL_ASSERT(( has_push_front< list1<long> > ));
MPL_ASSERT_NOT(( has_push_back< list0<> > ));
MPL_ASSERT_NOT(( has_push_front< no_push_front > ));
}
|
