![]() System : Linux absol.cf 5.4.0-198-generic #218-Ubuntu SMP Fri Sep 27 20:18:53 UTC 2024 x86_64 User : www-data ( 33) PHP Version : 7.4.33 Disable Function : pcntl_alarm,pcntl_fork,pcntl_waitpid,pcntl_wait,pcntl_wifexited,pcntl_wifstopped,pcntl_wifsignaled,pcntl_wifcontinued,pcntl_wexitstatus,pcntl_wtermsig,pcntl_wstopsig,pcntl_signal,pcntl_signal_get_handler,pcntl_signal_dispatch,pcntl_get_last_error,pcntl_strerror,pcntl_sigprocmask,pcntl_sigwaitinfo,pcntl_sigtimedwait,pcntl_exec,pcntl_getpriority,pcntl_setpriority,pcntl_async_signals,pcntl_unshare, Directory : /usr/include/boost/msm/mpl_graph/detail/ |
Upload File : |
// Copyright 2008-2010 Gordon Woodhull // 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) #ifndef BOOST_MSM_MPL_GRAPH_DETAIL_INCIDENCE_LIST_GRAPH_IPP_INCLUDED #define BOOST_MSM_MPL_GRAPH_DETAIL_INCIDENCE_LIST_GRAPH_IPP_INCLUDED // these metafunctions provide the metadata structures needed by the public interface // in mpl_graph.hpp #include <boost/mpl/map.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/copy.hpp> #include <boost/mpl/vector.hpp> #include <boost/mpl/next.hpp> #include <boost/mpl/front.hpp> #include <boost/mpl/back.hpp> #include <boost/mpl/deref.hpp> #include <boost/mpl/if.hpp> #include <boost/mpl/size.hpp> #include <boost/mpl/void.hpp> #include <boost/mpl/erase_key.hpp> #include <boost/mpl/has_key.hpp> #include <boost/mpl/inserter.hpp> #include <boost/mpl/back_inserter.hpp> #include <boost/mpl/set.hpp> #include <boost/mpl/insert.hpp> #include <boost/mpl/transform.hpp> #include <boost/mpl/pair.hpp> #include <boost/mpl/size.hpp> #include <boost/mpl/fold.hpp> #include <boost/mpl/transform.hpp> #include <boost/mpl/at.hpp> #include <boost/mpl/push_back.hpp> #include <boost/mpl/filter_view.hpp> #include <boost/mpl/transform_view.hpp> #include <boost/mpl/equal.hpp> #include <boost/type_traits.hpp> namespace boost { namespace msm { namespace mpl_graph { namespace detail { // tag to identify this graph implementation (not defined) struct incidence_list_tag; // clarifiers template<typename EST> struct fetch_edge : mpl::front<EST> {}; template<typename EST> struct fetch_source : mpl::deref<typename mpl::next<typename mpl::begin<EST>::type>::type> {}; template<typename EST> struct fetch_target : mpl::back<EST> {}; // Edge->Target map for an Source for out_*, adjacent_vertices template<typename Source, typename ESTSequence> struct produce_out_map<incidence_list_tag, Source, ESTSequence> : mpl::fold<typename mpl::filter_view<ESTSequence, boost::is_same<fetch_source<mpl::_1>,Source> >::type, mpl::map<>, mpl::insert<mpl::_1,mpl::pair<fetch_edge<mpl::_2>,fetch_target<mpl::_2> > > > {}; // Edge->Source map for a Target for in_*, degree template<typename Target, typename ESTSequence> struct produce_in_map<incidence_list_tag, Target, ESTSequence> : mpl::fold<typename mpl::filter_view<ESTSequence, boost::is_same<fetch_target<mpl::_1>,Target> >::type, mpl::map<>, mpl::insert<mpl::_1,mpl::pair<fetch_edge<mpl::_2>,fetch_source<mpl::_2> > > > {}; // Edge->pair<Source,Target> map for source, target template<typename ESTSequence> struct produce_edge_st_map<incidence_list_tag, ESTSequence> : mpl::fold<ESTSequence, mpl::map<>, mpl::insert<mpl::_1,mpl::pair<fetch_edge<mpl::_2>, mpl::pair<fetch_source<mpl::_2>, fetch_target<mpl::_2> > > > > {}; // Vertex set for VertexListGraph template<typename ESTSequence> struct produce_vertex_set<incidence_list_tag, ESTSequence> : mpl::fold<ESTSequence, typename mpl::fold<ESTSequence, mpl::set<>, mpl::insert<mpl::_1,fetch_target<mpl::_2> > >::type, mpl::insert<mpl::_1, fetch_source<mpl::_2> > > {}; // Edge set for EdgeListGraph template<typename ESTSequence> struct produce_edge_set<incidence_list_tag, ESTSequence> : mpl::fold<ESTSequence, mpl::set<>, mpl::insert<mpl::_1,fetch_edge<mpl::_2> > > {}; } } } } #endif // BOOST_MSM_MPL_GRAPH_DETAIL_INCIDENCE_LIST_GRAPH_IPP_INCLUDED