feedc0de/boost_mpl
1
0
Fork 0
forked from boostorg/mpl
Code Pull Requests Activity

merge new MPL version from 'mplbook' branch

Browse Source 
[SVN r24874]
This commit is contained in:
Aleksey Gurtovoy
2004-09-02 15:41:37 +00:00
parent e2e70427cc
commit 1689c8ef83
1216 changed files with 89913 additions and 36752 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/list.cpp
+60 -17
View File
@@ -1,25 +1,68 @@
//-----------------------------------------------------------------------------
// boost mpl/test/list.cpp source file
// See http://www.boost.org for updates, documentation, and revision history.
//-----------------------------------------------------------------------------
// Copyright Aleksey Gurtovoy 2000-2004
//
// Copyright (c) 2000-02
// Aleksey Gurtovoy
//
// Distributed under the Boost Software License, Version 1.0. (See
// accompanying file LICENSE_1_0.txt or copy at
// 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.
#include "boost/mpl/list.hpp"
// $Source$
// $Date$
// $Revision$
namespace mpl = boost::mpl;
#include <boost/mpl/list.hpp>
#include <boost/mpl/push_front.hpp>
#include <boost/mpl/pop_front.hpp>
#include <boost/mpl/front.hpp>
#include <boost/mpl/size.hpp>
#include <boost/mpl/empty.hpp>
int main()
#include <boost/mpl/aux_/test.hpp>
MPL_TEST_CASE()
{
typedef mpl::list0<> list0;
typedef mpl::list1<char> list1;
typedef mpl::list2<char,long> list2;
typedef mpl::list9<char,char,char,char,char,char,char,char,char> list9;
typedef list0<> l0;
typedef list1<char> l1;
typedef list2<char,long> l2;
typedef list9<char,char,char,char,char,char,char,char,char> l9;
return 0;
MPL_ASSERT_RELATION(size<l0>::value, ==, 0);
MPL_ASSERT_RELATION(size<l1>::value, ==, 1);
MPL_ASSERT_RELATION(size<l2>::value, ==, 2);
MPL_ASSERT_RELATION(size<l9>::value, ==, 9);
MPL_ASSERT(( empty<l0> ));
MPL_ASSERT_NOT(( empty<l1> ));
MPL_ASSERT_NOT(( empty<l2> ));
MPL_ASSERT_NOT(( empty<l9> ));
MPL_ASSERT(( is_same<front<l1>::type,char> ));
MPL_ASSERT(( is_same<front<l2>::type,char> ));
MPL_ASSERT(( is_same<front<l9>::type,char> ));
}
MPL_TEST_CASE()
{
typedef list2<char,long> l2;
typedef begin<l2>::type i1;
typedef next<i1>::type i2;
typedef next<i2>::type i3;
MPL_ASSERT(( is_same<deref<i1>::type,char> ));
MPL_ASSERT(( is_same<deref<i2>::type,long> ));
MPL_ASSERT(( is_same< i3, end<l2>::type > ));
}
MPL_TEST_CASE()
{
typedef list0<> l0;
typedef push_front<l0,char>::type l1;
MPL_ASSERT(( is_same<front<l1>::type,char> ));
typedef push_front<l1,long>::type l2;
MPL_ASSERT(( is_same<front<l2>::type,long> ));
}