From 19fcec84d8d7d21e796c7624e521b60d28ee21ed Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sun, 7 Apr 2024 20:45:59 +0200 Subject: Adding upstream version 16.2.11+ds. Signed-off-by: Daniel Baumann --- src/boost/libs/msm/example/mpl_graph/Jamfile.v2 | 34 +++ .../msm/example/mpl_graph/adjacency_list_graph.cpp | 82 +++++++ .../msm/example/mpl_graph/breadth_first_search.cpp | 211 ++++++++++++++++ .../msm/example/mpl_graph/depth_first_search.cpp | 153 ++++++++++++ .../msm/example/mpl_graph/incidence_list_graph.cpp | 72 ++++++ .../libs/msm/example/mpl_graph/msm_adaptor.cpp | 264 +++++++++++++++++++++ 6 files changed, 816 insertions(+) create mode 100644 src/boost/libs/msm/example/mpl_graph/Jamfile.v2 create mode 100644 src/boost/libs/msm/example/mpl_graph/adjacency_list_graph.cpp create mode 100644 src/boost/libs/msm/example/mpl_graph/breadth_first_search.cpp create mode 100644 src/boost/libs/msm/example/mpl_graph/depth_first_search.cpp create mode 100644 src/boost/libs/msm/example/mpl_graph/incidence_list_graph.cpp create mode 100644 src/boost/libs/msm/example/mpl_graph/msm_adaptor.cpp (limited to 'src/boost/libs/msm/example') diff --git a/src/boost/libs/msm/example/mpl_graph/Jamfile.v2 b/src/boost/libs/msm/example/mpl_graph/Jamfile.v2 new file mode 100644 index 000000000..cace3af35 --- /dev/null +++ b/src/boost/libs/msm/example/mpl_graph/Jamfile.v2 @@ -0,0 +1,34 @@ +# msm/example/mpl_graph/Jamfile.v2 tests the mpl_graph examples +# +# Copyright (c) 2010 Gordon Woodhull +# +# Use, modification and distribution is subject to 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) + +import testing ; + +project msm + : + requirements + . + gcc:"-ftemplate-depth-300 -g0" + darwin:"-ftemplate-depth-300 -g0" + intel:"-g0" + gcc:off + darwin:off + intel:off + /boost/test//boost_unit_test_framework/static + /boost/serialization//boost_serialization/static + ; + + +test-suite msm-unit-tests + : + [ compile adjacency_list_graph.cpp ] + [ compile depth_first_search.cpp ] + [ compile breadth_first_search.cpp ] + [ compile incidence_list_graph.cpp ] + [ compile msm_adaptor.cpp ] + ; + diff --git a/src/boost/libs/msm/example/mpl_graph/adjacency_list_graph.cpp b/src/boost/libs/msm/example/mpl_graph/adjacency_list_graph.cpp new file mode 100644 index 000000000..fcf8f2584 --- /dev/null +++ b/src/boost/libs/msm/example/mpl_graph/adjacency_list_graph.cpp @@ -0,0 +1,82 @@ +// 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) + +// mplgraph.cpp : Defines the entry point for the console application. +// + +#include +#include +#include + + +namespace mpl_graph = boost::msm::mpl_graph; +namespace mpl_utils = mpl_graph::mpl_utils; +namespace mpl = boost::mpl; + +/* + test graph and tests are almost identical to incidence_list_graph.cpp + A -> B -> C -\--> D + \ |--> E + \ \--> F + \-----/ + G // except this +*/ + +// vertices +struct A{}; struct B{}; struct C{}; struct D{}; struct E{}; struct F{}; struct G{}; + +// edges +struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; + +typedef mpl::vector< + mpl::pair > >, + mpl::pair, + mpl::pair > >, + mpl::pair, + mpl::pair, + mpl::pair > >, + mpl::pair > > + some_adjacency_list; +typedef mpl_graph::adjacency_list_graph some_graph; + +BOOST_MPL_ASSERT(( boost::is_same::type, B> )); +BOOST_MPL_ASSERT(( boost::is_same::type, C> )); + +BOOST_MPL_ASSERT(( boost::is_same::type, D> )); +BOOST_MPL_ASSERT(( boost::is_same::type, F> )); + + +// shouldn't assume the order but this seems to work +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT_RELATION( (mpl_graph::out_degree::value), ==, 2 ); +BOOST_MPL_ASSERT_RELATION( (mpl_graph::out_degree::value), ==, 3 ); + + +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT_RELATION( (mpl_graph::in_degree::value), ==, 0 ); +BOOST_MPL_ASSERT_RELATION( (mpl_graph::in_degree::value), ==, 2 ); + + +BOOST_MPL_ASSERT_RELATION( (mpl_graph::degree::value), ==, 1 ); +BOOST_MPL_ASSERT_RELATION( (mpl_graph::degree::value), ==, 4 ); + +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT_RELATION( mpl_graph::num_vertices::value, ==, 7 ); + +BOOST_MPL_ASSERT_RELATION( mpl_graph::num_edges::value, ==, 6 ); + + +int main(int argc, char* argv[]) +{ + return 0; +} + diff --git a/src/boost/libs/msm/example/mpl_graph/breadth_first_search.cpp b/src/boost/libs/msm/example/mpl_graph/breadth_first_search.cpp new file mode 100644 index 000000000..3b73651ff --- /dev/null +++ b/src/boost/libs/msm/example/mpl_graph/breadth_first_search.cpp @@ -0,0 +1,211 @@ +// 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) + +#include +#include +#include + +#include + +namespace mpl_graph = boost::msm::mpl_graph; +namespace mpl = boost::mpl; + +// vertices +struct A{}; struct B{}; struct C{}; struct D{}; struct E{}; struct F{}; struct G{}; + +// edges +struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; + + + +/* + incidence list test graph: + A -> B -> C -\--> D + \ |--> E + \ \--> F + \-----/ +*/ + +typedef mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector > + some_incidence_list; +typedef mpl_graph::incidence_list_graph some_incidence_list_graph; + + + +/* + adjacency list test graph: + A -> B -> C -\--> D + \ |--> E + \ \--> F + \-----/ + G +*/ + +typedef mpl::vector< + mpl::pair > >, + mpl::pair, + mpl::pair > >, + mpl::pair, + mpl::pair, + mpl::pair > >, + mpl::pair > > + some_adjacency_list; +typedef mpl_graph::adjacency_list_graph some_adjacency_list_graph; + + +struct preordering_visitor : mpl_graph::bfs_default_visitor_operations { + template + struct discover_vertex : + mpl::push_back + {}; +}; + +struct postordering_visitor : mpl_graph::bfs_default_visitor_operations { + template + struct finish_vertex : + mpl::push_back + {}; +}; + +struct examine_edge_visitor : mpl_graph::bfs_default_visitor_operations { + template + struct examine_edge : + mpl::push_back + {}; +}; + +struct tree_edge_visitor : mpl_graph::bfs_default_visitor_operations { + template + struct tree_edge : + mpl::push_back + {}; +}; + +// adjacency list tests + +// preordering, start from A +typedef mpl::first, + A>::type>::type + preorder_adj_a; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// examine edges, start from A +typedef mpl::first, + A>::type>::type + ex_edges_adj_a; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// tree edges, start from A +typedef mpl::first, + A>::type>::type + tree_edges_adj_a; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering, search all, default start node (first) +typedef mpl::first >::type>::type + preorder_adj; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// postordering, starting at A (same as preordering because BFS fully processes one vertex b4 moving to next) +typedef mpl::first, + A>::type>::type + postorder_adj_a; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// postordering, default start node (same as preordering because BFS fully processes one vertex b4 moving to next) +typedef mpl::first >::type>::type + postorder_adj; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering starting at C +typedef mpl::first, + C>::type>::type + preorder_adj_from_c; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering, search all, starting at C +typedef mpl::first, + C>::type>::type + preorder_adj_from_c_all; +BOOST_MPL_ASSERT(( mpl::equal > )); + + +// incidence list tests + +// preordering, start from A +typedef mpl::first, + A>::type>::type + preorder_inc_a; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering, start from C +typedef mpl::first, + C>::type>::type + preorder_inc_c; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering, default start node (first) +typedef mpl::first >::type>::type + preorder_inc; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// postordering, default start node +typedef mpl::first >::type>::type + postorder_inc; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering, search all, starting at C +typedef mpl::first, + C>::type>::type + preorder_inc_from_c; +BOOST_MPL_ASSERT(( mpl::equal > )); + + +int main() { + return 0; +} \ No newline at end of file diff --git a/src/boost/libs/msm/example/mpl_graph/depth_first_search.cpp b/src/boost/libs/msm/example/mpl_graph/depth_first_search.cpp new file mode 100644 index 000000000..2d6f36e62 --- /dev/null +++ b/src/boost/libs/msm/example/mpl_graph/depth_first_search.cpp @@ -0,0 +1,153 @@ +// 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) + +#include +#include +#include + +#include + +namespace mpl_graph = boost::msm::mpl_graph; +namespace mpl = boost::mpl; + +// vertices +struct A{}; struct B{}; struct C{}; struct D{}; struct E{}; struct F{}; struct G{}; + +// edges +struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; + + + +/* + incidence list test graph: + A -> B -> C -\--> D + \ |--> E + \ \--> F + \-----/ + G +*/ + +typedef mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector > + some_incidence_list; +typedef mpl_graph::incidence_list_graph some_incidence_list_graph; + + + +/* + adjacency list test graph: + A -> B -> C -\--> D + \ |--> E + \ \--> F + \-----/ + G +*/ + +typedef mpl::vector< + mpl::pair > >, + mpl::pair, + mpl::pair > >, + mpl::pair, + mpl::pair, + mpl::pair > >, + mpl::pair > > + some_adjacency_list; +typedef mpl_graph::adjacency_list_graph some_adjacency_list_graph; + + +struct preordering_visitor : mpl_graph::dfs_default_visitor_operations { + template + struct discover_vertex : + mpl::push_back + {}; +}; + +struct postordering_visitor : mpl_graph::dfs_default_visitor_operations { + template + struct finish_vertex : + mpl::push_back + {}; +}; + +// adjacency list tests + +// preordering, default start node (first) +typedef mpl::first >::type>::type + preorder_adj; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// postordering, default start node +typedef mpl::first >::type>::type + postorder_adj; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering all starting at C +typedef mpl::first, + C>::type>::type + preorder_adj_all_from_c; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering just those starting at C +typedef mpl::first, + C>::type>::type + preorder_adj_from_c; +BOOST_MPL_ASSERT(( mpl::equal > )); + + +// incidence list tests + +// preordering, default start node (first) +typedef mpl::first >::type>::type + preorder_inc; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// postordering, default start node +typedef mpl::first >::type>::type + postorder_inc; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering starting at C +typedef mpl::first, + C>::type>::type + preorder_inc_all_from_c; +BOOST_MPL_ASSERT(( mpl::equal > )); + +// preordering starting at B +typedef mpl::first, + B>::type>::type + preorder_inc_from_b; +BOOST_MPL_ASSERT(( mpl::equal > )); + + +int main() { + return 0; +} \ No newline at end of file diff --git a/src/boost/libs/msm/example/mpl_graph/incidence_list_graph.cpp b/src/boost/libs/msm/example/mpl_graph/incidence_list_graph.cpp new file mode 100644 index 000000000..b8ec78f36 --- /dev/null +++ b/src/boost/libs/msm/example/mpl_graph/incidence_list_graph.cpp @@ -0,0 +1,72 @@ +// 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) + +// mplgraph.cpp : Defines the entry point for the console application. +// + +#include +#include + +namespace mpl_graph = boost::msm::mpl_graph; +namespace mpl_utils = mpl_graph::mpl_utils; +namespace mpl = boost::mpl; +/* + test graph: + A -> B -> C -\--> D + \ |--> E + \ \--> F + \-----/ +*/ + +// vertices +struct A{}; struct B{}; struct C{}; struct D{}; struct E{}; struct F{}; + +// edges +struct A_B{}; struct B_C{}; struct C_D{}; struct C_E{}; struct C_F{}; struct B_F{}; + +typedef mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector, + mpl::vector > + some_incidence_list; +typedef mpl_graph::incidence_list_graph some_graph; + +BOOST_MPL_ASSERT(( boost::is_same::type, B> )); +BOOST_MPL_ASSERT(( boost::is_same::type, C> )); + +BOOST_MPL_ASSERT(( boost::is_same::type, D> )); +BOOST_MPL_ASSERT(( boost::is_same::type, F> )); + +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT_RELATION( (mpl_graph::out_degree::value), ==, 2 ); +BOOST_MPL_ASSERT_RELATION( (mpl_graph::out_degree::value), ==, 3 ); + +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT_RELATION( (mpl_graph::in_degree::value), ==, 0 ); +BOOST_MPL_ASSERT_RELATION( (mpl_graph::in_degree::value), ==, 2 ); + +BOOST_MPL_ASSERT_RELATION( (mpl_graph::degree::value), ==, 1 ); +BOOST_MPL_ASSERT_RELATION( (mpl_graph::degree::value), ==, 4 ); + +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT(( mpl_utils::set_equal::type, mpl::vector > )); + +BOOST_MPL_ASSERT_RELATION( mpl_graph::num_vertices::value, ==, 6 ); + +BOOST_MPL_ASSERT_RELATION( mpl_graph::num_edges::value, ==, 6 ); + + +int main(int argc, char* argv[]) +{ + return 0; +} + diff --git a/src/boost/libs/msm/example/mpl_graph/msm_adaptor.cpp b/src/boost/libs/msm/example/mpl_graph/msm_adaptor.cpp new file mode 100644 index 000000000..a7edf7651 --- /dev/null +++ b/src/boost/libs/msm/example/mpl_graph/msm_adaptor.cpp @@ -0,0 +1,264 @@ +// Copyright 2010 Gordon Woodhull +// modified from MSMv2.10/libs/msm/doc/HTML/examples/SimpleTutorial.cpp +// for the purpose of showing how to run mpl_graph algorithms on MSMs +// and distributed same license as source +// Copyright 2008 Christophe Henry +// henry UNDERSCORE christophe AT hotmail DOT com +// This is an extended version of the state machine available in the boost::mpl library +// Distributed under the same license as the original. +// Copyright for the original version: +// Copyright 2005 David Abrahams and Aleksey Gurtovoy. 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) + +#include +// back-end +#include +//front-end +#include + +// mpl_graph graph implementation and depth first search +#include +#include +#include + +namespace msm = boost::msm; +namespace mpl = boost::mpl; + +namespace mpl_graph = boost::msm::mpl_graph; + +namespace +{ + // events + struct play {}; + struct end_pause {}; + struct stop {}; + struct pause {}; + struct open_close {}; + + // A "complicated" event type that carries some data. + enum DiskTypeEnum + { + DISK_CD=0, + DISK_DVD=1 + }; + struct cd_detected + { + cd_detected(std::string name, DiskTypeEnum diskType) + : name(name), + disc_type(diskType) + {} + + std::string name; + DiskTypeEnum disc_type; + }; + + // front-end: define the FSM structure + struct player_ : public msm::front::state_machine_def + { + // The list of FSM states + struct Empty : public msm::front::state<> + { + // every (optional) entry/exit methods get the event passed. + template + void on_entry(Event const&,FSM& ) {std::cout << "entering: Empty" << std::endl;} + template + void on_exit(Event const&,FSM& ) {std::cout << "leaving: Empty" << std::endl;} + }; + struct Open : public msm::front::state<> + { + template + void on_entry(Event const& ,FSM&) {std::cout << "entering: Open" << std::endl;} + template + void on_exit(Event const&,FSM& ) {std::cout << "leaving: Open" << std::endl;} + }; + + // sm_ptr still supported but deprecated as functors are a much better way to do the same thing + struct Stopped : public msm::front::state + { + template + void on_entry(Event const& ,FSM&) {std::cout << "entering: Stopped" << std::endl;} + template + void on_exit(Event const&,FSM& ) {std::cout << "leaving: Stopped" << std::endl;} + void set_sm_ptr(player_* pl) + { + m_player=pl; + } + player_* m_player; + }; + + struct Playing : public msm::front::state<> + { + template + void on_entry(Event const&,FSM& ) {std::cout << "entering: Playing" << std::endl;} + template + void on_exit(Event const&,FSM& ) {std::cout << "leaving: Playing" << std::endl;} + }; + + // state not defining any entry or exit + struct Paused : public msm::front::state<> + { + }; + + // the initial state of the player SM. Must be defined + typedef Empty initial_state; + + // transition actions + void start_playback(play const&) { std::cout << "player::start_playback\n"; } + void open_drawer(open_close const&) { std::cout << "player::open_drawer\n"; } + void close_drawer(open_close const&) { std::cout << "player::close_drawer\n"; } + void store_cd_info(cd_detected const&) { std::cout << "player::store_cd_info\n"; } + void stop_playback(stop const&) { std::cout << "player::stop_playback\n"; } + void pause_playback(pause const&) { std::cout << "player::pause_playback\n"; } + void resume_playback(end_pause const&) { std::cout << "player::resume_playback\n"; } + void stop_and_open(open_close const&) { std::cout << "player::stop_and_open\n"; } + void stopped_again(stop const&) {std::cout << "player::stopped_again\n";} + // guard conditions + bool good_disk_format(cd_detected const& evt) + { + // to test a guard condition, let's say we understand only CDs, not DVD + if (evt.disc_type != DISK_CD) + { + std::cout << "wrong disk, sorry" << std::endl; + return false; + } + return true; + } + // used to show a transition conflict. This guard will simply deactivate one transition and thus + // solve the conflict + bool auto_start(cd_detected const&) + { + return false; + } + + typedef player_ p; // makes transition table cleaner + + // Transition table for player + struct transition_table : mpl::vector< + // Start Event Next Action Guard + // +---------+-------------+---------+---------------------+----------------------+ + a_row < Stopped , play , Playing , &p::start_playback >, + a_row < Stopped , open_close , Open , &p::open_drawer >, + _row < Stopped , stop , Stopped >, + // +---------+-------------+---------+---------------------+----------------------+ + a_row < Open , open_close , Empty , &p::close_drawer >, + // +---------+-------------+---------+---------------------+----------------------+ + a_row < Empty , open_close , Open , &p::open_drawer >, + row < Empty , cd_detected , Stopped , &p::store_cd_info ,&p::good_disk_format >, + row < Empty , cd_detected , Playing , &p::store_cd_info ,&p::auto_start >, + // +---------+-------------+---------+---------------------+----------------------+ + a_row < Playing , stop , Stopped , &p::stop_playback >, + a_row < Playing , pause , Paused , &p::pause_playback >, + a_row < Playing , open_close , Open , &p::stop_and_open >, + // +---------+-------------+---------+---------------------+----------------------+ + a_row < Paused , end_pause , Playing , &p::resume_playback >, + a_row < Paused , stop , Stopped , &p::stop_playback >, + a_row < Paused , open_close , Open , &p::stop_and_open > + // +---------+-------------+---------+---------------------+----------------------+ + > {}; + // Replaces the default no-transition response. + template + void no_transition(Event const& e, FSM&,int state) + { + std::cout << "no transition from state " << state + << " on event " << typeid(e).name() << std::endl; + } + + + // transition table is already an incidence list; + // select Edge, Source, Target = pair, Start, Next + // making Start part of Edge is necessary because Edge tags have to be unique + + template + struct row_to_incidence : + mpl::vector, typename Row::Source, typename Row::Target> {}; + + typedef mpl::fold, + mpl::push_back > >::type + transition_incidence_list; + + typedef mpl_graph::incidence_list_graph + transition_graph; + + struct preordering_dfs_visitor : mpl_graph::dfs_default_visitor_operations { + template + struct discover_vertex : + mpl::push_back + {}; + }; + + typedef mpl::first, + player_::initial_state>::type>::type + dfs_from_initial_state; + + BOOST_MPL_ASSERT(( mpl::equal > )); + + struct preordering_bfs_visitor : mpl_graph::bfs_default_visitor_operations { + template + struct discover_vertex : + mpl::push_back + {}; + }; + typedef mpl::first, + player_::initial_state>::type>::type + bfs_from_initial_state; + + // yawn, BFS happens to produce the same result as DFS for this example + BOOST_MPL_ASSERT(( mpl::equal > )); + + }; + // Pick a back-end + typedef msm::back::state_machine player; + + // + // Testing utilities. + // + static char const* const state_names[] = { "Stopped", "Open", "Empty", "Playing", "Paused" }; + void pstate(player const& p) + { + std::cout << " -> " << state_names[p.current_state()[0]] << std::endl; + } + + + void test() + { + player p; + // needed to start the highest-level SM. This will call on_entry and mark the start of the SM + p.start(); + // go to Open, call on_exit on Empty, then action, then on_entry on Open + p.process_event(open_close()); pstate(p); + p.process_event(open_close()); pstate(p); + // will be rejected, wrong disk type + p.process_event( + cd_detected("louie, louie",DISK_DVD)); pstate(p); + p.process_event( + cd_detected("louie, louie",DISK_CD)); pstate(p); + p.process_event(play()); + + // at this point, Play is active + p.process_event(pause()); pstate(p); + // go back to Playing + p.process_event(end_pause()); pstate(p); + p.process_event(pause()); pstate(p); + p.process_event(stop()); pstate(p); + // event leading to the same state + // no action method called as it is not present in the transition table + p.process_event(stop()); pstate(p); + } +} + +int main() +{ + test(); + return 0; +} -- cgit v1.2.3