/usr/include/boost/mpl/list/aux_
NameSizeModeActions
preprocessed/-0755rm
begin_end.hpp9450644editdlrm
clear.hpp7260644editdlrm
empty.hpp7230644editdlrm
front.hpp7000644editdlrm
include_preprocessed.hpp9510644editdlrm
item.hpp11720644editdlrm
iterator.hpp16840644editdlrm
numbered.hpp13070644editdlrm
numbered_c.hpp14350644editdlrm
O1_size.hpp6890644editdlrm
pop_front.hpp7670644editdlrm
push_back.hpp7810644editdlrm
push_front.hpp9140644editdlrm
size.hpp6740644editdlrm
tag.hpp5230644editdlrm
Edit: /usr/include/boost/mpl/list/aux_/item.hpp (1172B)
#ifndef BOOST_MPL_LIST_AUX_NODE_HPP_INCLUDED #define BOOST_MPL_LIST_AUX_NODE_HPP_INCLUDED // Copyright Aleksey Gurtovoy 2000-2004 // // 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 #include #include #include namespace boost { namespace mpl { template< typename Size , typename T , typename Next > struct l_item { // agurt, 17/jul/03: to facilitate the deficient 'is_sequence' implementation #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) typedef int begin; #endif typedef aux::list_tag tag; typedef l_item type; typedef Size size; typedef T item; typedef Next next; }; struct l_end { #if BOOST_WORKAROUND(BOOST_MSVC, <= 1300) typedef int begin; #endif typedef aux::list_tag tag; typedef l_end type; typedef long_<0> size; }; }} #endif // BOOST_MPL_LIST_AUX_NODE_HPP_INCLUDED