January 2021 - Boost-users - lists.preview.boost.org

Clarification on statechart post_event vs process_event within react()
by John McCabe 10 Jan '22

10 Jan '22

Hi, Apologies if this has already been answered/clarified, but my search of the internet to try to get a definitive answer, at least one I recognised as being definitive, was unsuccessful. Below I have posted some source code, based on the stopwatch example from the tutorial, but using an 'external' object to delegate the actual handling of event stuff to and using the state, rather than simple_state base class, and some other tweaks. This is a cut down version of something that someone I work with has devised, but I just wanted to get a clear answer on whether process_event() should be getting called in cases like this. I think it probably should not since, in the code below, you change state (with a state object's destructor being executed) whilst you're executing that state's react(EvStartStop) function. If someone can confirm this is the correct interpretation that would be very much appreciated. Any questions, feel free to ask (BTW - I'm compiling for C++17) John PS - In case it's of any use, the output from running this code is: ------ Entered Active Entered Stopped Stopped - payload2 m_charValue: a Exited ~Stopped <<<--- This is the bit I don't like the look of because... Entered Running Active - payload2 m_charValue: a <<<--- ... this happens from the forward_event() call payload1 value1: 20 payload1 value2: 200.2 Exited ~Running Entered Stopped Exiting Program Exited ~Stopped Exited ~Active ------ If I swap the //*** comments to the doProcess() lines instead of doPost(), the output seems more sensible ------ Entered Active Entered Stopped Stopped - payload2 m_charValue: a Exited ~Stopped Entered Running Active - payload2 m_charValue: a payload1 value1: 20 payload1 value2: 200.2 Exited ~Running Entered Stopped Exiting Program Exited ~Stopped Exited ~Active ------ ========== code =========== #include <boost/statechart/event.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/state.hpp> #include <boost/statechart/transition.hpp> #include <boost/statechart/custom_reaction.hpp> #include <boost/mpl/list.hpp> #include <iostream> #include <string> namespace sc = boost::statechart; namespace mpl = boost::mpl; // Forward declare a handler 'class' that's going to have activity delegated to it struct Handler; // Normal example start/stop and reset events struct EvStartStop : sc::event<EvStartStop> {}; struct EvReset : sc::event<EvReset> {}; // A couple of events that carry data with them struct EvPayload1 : sc::event<EvPayload1> { EvPayload1(int value1, double value2) : m_value1 { value1 }, m_value2 { value2 } {}; int m_value1 { 0 }; double m_value2 { 0.0 }; }; struct EvPayload2 : sc::event<EvPayload2> { EvPayload2(const char& charValue) : m_charValue { charValue } {}; char m_charValue { false }; }; // Back to the example bits struct Active; struct StopWatch : sc::state_machine<StopWatch, Active> { typedef sc::transition<EvReset, Active> reactions; // The extra 'handler' stuff void setHandler(Handler* handler) { m_handler = handler; }; Handler* getHandler() const { return m_handler; }; Handler* m_handler { nullptr }; // Used to make post_event() accessible from an external class...seems unpleasant, but... using sc::state_machine<StopWatch, Active>::post_event; }; // The implementation of the Handler class; created with a reference to a StopWatch object struct Handler { Handler(StopWatch& stopWatch) : m_stopWatch { stopWatch } {}; void doPost() { m_stopWatch.post_event(EvStartStop()); } void doProcess() { m_stopWatch.process_event(EvStartStop()); } StopWatch& m_stopWatch; }; struct Stopped; struct Active : sc::state<Active, StopWatch, Stopped> { Active(my_context ctx) : my_base { ctx } { std::cout << "Entered Active" << std::endl; }; ~Active() { std::cout << "Exited ~Active" << std::endl; }; typedef mpl::list<sc::custom_reaction<EvPayload1>, sc::custom_reaction<EvPayload2>, sc::transition<EvReset, Active>> reactions; sc::result react(const EvPayload1& payload1) { std::cout << "payload1 Event NOT HANDLED" << std::endl; return discard_event(); } sc::result react(const EvPayload2& payload2) { std::cout << "Active - payload2 m_charValue: " << payload2.m_charValue << std::endl; return discard_event(); } }; struct Running : sc::state<Running, Active> { Running(my_context ctx) : my_base { ctx } { std::cout << "Entered Running" << std::endl; }; ~Running() { std::cout << "Exited ~Running" << std::endl; }; typedef mpl::list<sc::custom_reaction<EvPayload1>, sc::transition<EvStartStop, Stopped>> reactions; sc::result react(const EvPayload1& payload1) { std::cout << "payload1 value1: " << payload1.m_value1 << std::endl; std::cout << "payload1 value2: " << payload1.m_value2 << std::endl; //***context<StopWatch>().getHandler()->doPost(); context<StopWatch>().getHandler()->doProcess(); return discard_event(); } }; struct Stopped : sc::state<Stopped, Active> { Stopped(my_context ctx) : my_base { ctx } { std::cout << "Entered Stopped" << std::endl; }; ~Stopped() { std::cout << "Exited ~Stopped" << std::endl; }; typedef mpl::list<sc::custom_reaction<EvPayload2>, sc::transition<EvStartStop, Running>> reactions; sc::result react(const EvPayload2& payload2) { std::cout << "Stopped - payload2 m_charValue: " << payload2.m_charValue << std::endl; //***context<StopWatch>().getHandler()->doPost(); context<StopWatch>().getHandler()->doProcess(); return forward_event(); } }; int main() { StopWatch myWatch; Handler myHandler(myWatch); myWatch.setHandler(&myHandler); myWatch.initiate(); myWatch.process_event(EvPayload2 { 'a' }); myWatch.process_event(EvPayload1 { 20, 200.2 }); std::cout << "Exiting Program" << std::endl; return 0; }

1 1

TOMS748 question
by Shriramana Sharma 29 Jan '21

29 Jan '21

Namaste. This is wrt the TOMS748 math root finding implementation: Given that `if(fa == 0)` is handled at: https://github.com/boostorg/math/blob/develop/include/boost/math/tools/toms… … and the function returns in case of the above condition, it is not clear to me what the need is for the `if (fa != 0)` at: https://github.com/boostorg/math/blob/develop/include/boost/math/tools/toms… Note that I do not find the condition being applied at the SciPy implementation of this algorithm at: https://github.com/scipy/scipy/blob/v1.6.0/scipy/optimize/zeros.py#L1220 Now I also note similar checks at: https://github.com/boostorg/math/blob/develop/include/boost/math/tools/toms… https://github.com/boostorg/math/blob/develop/include/boost/math/tools/toms… … but regarding those lines, while I can understand the need for checking there after more bracketing work is done, it is not clear to me why `(fa == 0)` is alone checked for, and not `(fb == 0)` as well. I would have thought the algorithm is not biased towards a or b. Indeed, in the last steps from: https://github.com/boostorg/math/blob/develop/include/boost/math/tools/toms…, … both the conditions are checked for, which is what I would expect even in the intervening steps. Now the lines seem to have originated in the very first commit implementing this algorithm: https://github.com/boostorg/math/commit/79a8199f9c26ba353fb52ec4543f75ffc2a… … but I do not see a way to contact the author jzmaddock other than posting to this list, so I hope someone/they see here and reply. Thanks! -- Shriramana Sharma ஶ்ரீரமணஶர்மா श्रीरमणशर्मा 𑀰𑁆𑀭𑀻𑀭𑀫𑀡𑀰𑀭𑁆𑀫𑀸

2 7

Correct way to handle error in boost::filesystem::recursive_directory_iterator::increment()?
by Dominique Pellé 23 Jan '21

23 Jan '21

Hi I see code like this in an application to iterate over files in a directory with boost::filesystem (v1.70) without using exceptions: boost::filesystem::path dir("somedir"); boost::system::error_code error; boost::filesystem::directory_iterator node(dir, error), end; if (error) { return ...; } for (; node != end; node.increment(error)) { const boost::filesystem::path& path = node->path(); // ... } It appears to work... or mostly work since a crash was reported and the stack points to this area of the code. It's a rare crash that I could not reproduce myself. I suspect that there is a bug in the above code and it should instead be: boost::filesystem::path dir("somedir"); boost::system::error_code error; boost::filesystem::directory_iterator node(dir, error), end; for (; !error && node != end; node.increment(error)) { const boost::filesystem::path& path = node->path(); // ... } In other words, I suspect that we need to check that node.increment(error) in the for loop did not give an error before checking the condition "node != end", or else we may enter the loop in case of error and then it may access node->path() with an invalid node iterator. I could not find in the doc at ... https://www.boost.org/doc/libs/1_75_0/libs/filesystem/doc/reference.html ... what exactly happens when node.increment(error) gives an error. Perhaps the doc deserves clarification or an example illustrating how to reliably iterate over files without using exceptions would be welcome. Thanks Dominique

1 1

Serialization and static Libraries
by Wolfgang Meyerle 20 Jan '21

20 Jan '21

Hi, probably has been asked already thousand of times but I'm stuck currently with some code: Assuming I have the following files (The Base class Action is serialized in the same way): File: Ping.h #include"Action.h" classPing:publicAction{ public: voidoperator()(); Ping(); Ping*clone()const; ~Ping(); template<typenameArchive> voidserialize(Archive&ar,constunsignedint); }; BOOST_CLASS_EXPORT_KEY2(Ping,"Ping"); File: Ping.cpp #include"Ping.h" #include<iostream> #include<boost/serialization/base_object.hpp> #include<boost/serialization/export.hpp> #include<boost/serialization/tracking.hpp> #include"Action.h" #include"system.h" #include"pong.h" #include"serializerdeserializer.h" #include"system.h" #include"connection.h" #include"communication.h" voidPing::operator()(){ } Ping::Ping() { } Ping*Ping::clone()const{ Ping*ping=newPing(*this); returnping; } template<typenameArchive> voidPing::serialize(Archive&ar,constunsignedint){ ar&BOOST_SERIALIZATION_BASE_OBJECT_NVP(Action); } Ping::~Ping(){} BOOST_CLASS_EXPORT_IMPLEMENT(Ping); BOOST_CLASS_TRACKING(Ping,boost::serialization::track_never); If I now compile the project into a library. And link this library to a different project. If I try to serialize the class now it doesn't work. I get the following error: unregistered class - derived class not registered or exported According to the boost documentation I need to use BOOST_CLASS_EXPORT_KEY in the header file and BOOST_CLASS_EXPORT_IMPLEMENT in the corresponding cpp file. What did I miss? Regards, Wolfgang

1 0

[Boost-MPI][Boost-ODEINT] Running odeint within MPI-context without using mpi_state
by Roland Richter 19 Jan '21

19 Jan '21

Hei, I am currently using the odeint-solver for calculating the right hand side of a non-linear equation. For speeding up the calculation of the right hand side, I decided to test the MPI-implementation. Now, after I would prefer to keep the code backwards compatible, I did not want to replace state_type with mpi_state, and instead split up the initial vector by hand before calling odeint without telling odeint that I am operating within an MPI context. I take care of all communications which involve the vectors, and therefore I assumed that this approach should work (especially after it worked correctly in small test programs). Nevertheless, I encountered the issue that after a certain amount of steps the step size between the different threads starts to differ by a small amount, even though I am in the same iteration. As example: step number rank step size n 1 0.00025 n 0 0.00025 //Ok n + 1 1 0.00051152 n + 1 0 0.000511523 //Not ok I checked my program with valgrind for possible memory leaks/corruption which could overwrite something, but nothing relevant came up. The problem is repeatable. Therefore, is the general idea correct at all, or am I doing something wrong here by neglecting a possible communication between the different threads within odeint? Thanks! Regards, Roland

2 2

Conversion numeric::array in numpy::ndarray
by philippe DALET 17 Jan '21

17 Jan '21

Hello, It's my first mail on this maillist. I started to upgrade a package for python 3.7, 3.8, 3.9 (linux and windows): vpython-wx. One file gives me some problems num_util.hpp My context: ubuntu 20.04: boost 1.71 python3.7 windows 10: boost 1.75 python3.7, 3.8, 3.9 I want to create a double_array class: Original version --------------------- namespace cvisual { namespace python { using boost::python::numeric::array; class double_array : public array { public: explicit double_array( const boost::python::handle<>& h ) : array(h) {} }; array makeNum(npy_intp n, NPY_TYPES t =NPY_DOUBLE); New version ----------------- namespace cvisual { namespace python { using boost::python::numpy::ndarray; class double_array : public ndarray { public: explicit double_array( const boost::python::handle<>& h ) : ndarray(h) {} }; ndarray makeNum(npy_intp n, NPY_TYPES t =NPY_DOUBLE); error message with VC2019 community error conversion 'const boost::python::handle<PyObject>' in 'boost::python::detail::borrowed_reference' error message with gcc 9.3 no matching function for call to ‘boost::python::numpy::ndarray::ndarray(const boost::python::handle<>&)’ Thanks a lot for your help. Philippe DALET Laboratoire de Physique Lyp Champollion, Figeac FRANCE

1 0

Re: [Boost-users] boost::regex: regex meta data or AST for regex?
by Frank Bergemann 16 Jan '21

16 Jan '21

On 16.12.20 18:05, Frank Bergemann via Boost-users wrote: > in concrete: > Is it possible to not only get the #no of groups (sub-expressions) via > basic_regex::mark_count(), but also their position (begin() / end() > iterators) in the given regex string (c'tor argument)? > > more general: > Can an AST be created for a the given regex string (c'tor argument)? > E.g with boost::spirit? I am busy with #2 parsers: 1) RegexParser: Intended to be a full regular expression parser https://github.com/F-Bergemann/RegexParser 2) RegexSplitter: to just break up regular expression into substrings for top level regex-group & non-regex-group substrings: https://github.com/F-Bergemann/RegexSplitter It's just a start and so much wrong within, i know. But i have one concrete question for the RegexSplitter: How can i avoid in RegexSplitter.cpp to use #157 ( tok_element >> *tok_element ) [ qi::_val = phx::new_<ASTNode> (qi::_1, qi::_2, ASTNode::COLLECTION_c) ]; I want to pass a SINGLE std::vector<ATSNode *> only to the receiving #51 // COLLECTION_c #52 ASTNode::ASTNode( #53 ASTNode const * first, #54 std::vector<ASTNode *> & others, #55 Type const type) without the SEPARATE parameter 'first'. I.e. i need to "merge" qi::_1 and qi::_2.

1 0

Re: [Boost-users] boost ptr_map memory access violation
by roland kapl 08 Jan '21

08 Jan '21

Dear All! After finding some inspiration on https://stackoverflow.com/questions/4088387/how-to-store-pointers-in-map , I've succeeded storing the property tree pointers in a std::map... std::string TreeizeRelD::writeTree(const std::vector<std::vector<std::string>> &control, const std::vector<std::vector<std::vector<std::string>>> &data, pt::ptree & ptTree) { // now the map is local... typedef std::map<std::string, pt::ptree*> treeMap; std::map<std::string, treeMap> parentTableTrees; .... std::string subRootNode = parentNode + (subnodeOfParent != "" ? "." + subnodeOfParent : ""); std::string tableLookup = subRootNode + "." + rootElemRec; // simply add records if no foreign key name exists (usually the top (root) table) if (foreignKeyName == "") { for (std::pair<std::string, pt::ptree> && keyPair : tables[tableLookup]) { parentTableTrees[subRootNode].insert(std::make_pair(keyPair.first, &ptTree.add_child(subRootNode, keyPair.second))); ... // iterate through all parent key record collections referred to by subtables parentNode (rootnode + optional subnode) for (std::pair<std::string, pt::ptree*> && parentKeysPair : parentTableTrees.find(lookupNode)->second) { // iterate through all records (ptrees) in key collection for (pt::ptree::iterator parentRecPair = parentKeysPair.second->begin(); parentRecPair != parentKeysPair.second->end(); ++parentRecPair) { // important here: assign a reference to parentRecPtree (pointer!), otherwise a copy is created! pt::ptree &parentRecPtree = parentRecPair->second; ... parentTableTrees[subRootNode].insert(std::make_pair(rowsFK, &parentRecPair->second.get_child(subnodeFRec))); ... parentTableTrees[subRootNode].insert(std::make_pair(rowsFK, &parentRecPtree.put_child(subnodeOfParent, foreignRecordset))); The complete source of this: https://github.com/rkapl123/OreControl/blob/master/OreMgr/TreeizeRelD/treei… -regards, Roland ---------------------------------------------------------------------- Message: 1 Date: Wed, 6 Jan 2021 11:49:07 +0000 From: roland kapl <roland.kapl(a)hotmail.com<mailto:roland.kapl@hotmail.com>> To: "boost-users(a)lists.boost.org<mailto:boost-users@lists.boost.org>" <boost-users(a)lists.boost.org<mailto:boost-users@lists.boost.org>> Subject: [Boost-users] boost ptr_map memory access violation (stack/heap problem) Message-ID: <AM0PR03MB424285F7832EDC3C73C96860EDD00(a)AM0PR03MB4242.eurprd03.prod.outlook.com<mailto:AM0PR03MB424285F7832EDC3C73C96860EDD00@AM0PR03MB4242.eurprd03.prod.outlook.com>> Content-Type: text/plain; charset="us-ascii" Dear Boost-Experts! I'm trying to use a ptr_map along with boost property trees. I need to store pointers to specific parts of a built up property tree to access these parts later on for easy insertion there. However, when the ptr_map is cleared/destroyed, I get memory access violations/stack overflow messages for my test cases. The ptr_map (typedef treeMap) is globally defined within a std::map to a ptr_map to property trees as follows (I know this isn't good practice, but passing it as a reference didn't make a difference, so I left it that way): namespace pt = boost::property_tree; typedef boost::ptr_map<std::string, pt::ptree> treeMap; std::map<std::string, treeMap> parentTableTrees; The property tree is defined as follows in this function (this builds a property tree from tabular data in the passed table variable "data" using definitions form table variable "control"): std::string TreeizeRelD::writeTreeAndCreateXML(const std::vector<std::vector<std::string>>& control, const std::vector<std::vector<std::vector<std::string>>>& data, int *result) { std::string resultString; pt::ptree &propTree = pt::ptree(); std::string returnStr = TreeizeRelD::writeTree(control, data, propTree); *result = 0; if (returnStr != "") { *result = 1; return returnStr; } returnStr = TreeizeRelD::createXML(propTree, resultString); if (returnStr != "") { *result = 1; return returnStr; } // here the memory access violation occurs: parentTableTrees.clear(); return resultString; } In function writeTree the propTree (being passed by ref as ptTree) is populated in following three lines: std::string TreeizeRelD::writeTree(const std::vector<std::vector<std::string>> &control, const std::vector<std::vector<std::vector<std::string>>> &data, pt::ptree & ptTree) ... // FIRST LINE parentTableTrees[subRootNode].insert(keyPair.first, &ptTree.add_child(subRootNode, keyPair.second)); ... // iterate through all parent key record collections referred to by subtables parentNode (rootnode + optional subnode) for (treeMap::value_type && parentKeysPair : parentTableTrees.find(lookupNode)->second) { // iterate through all records (ptrees) in key collection for (pt::ptree::iterator parentRecPair = parentKeysPair.second->begin(); parentRecPair != parentKeysPair.second->end(); ++parentRecPair) { pt::ptree &parentRecPtree = parentRecPair->second; ... // SECOND LINE // parentRecPair is an iterator variable from the ptr_map: parentTableTrees[subRootNode].insert(rowsFK, &parentRecPair->second.get_child(subnodeFRec)); ... // THIRD LINE // parentRecPtree is the referenced property tree itself: parentTableTrees[subRootNode].insert(rowsFK, &parentRecPtree.put_child(subnodeOfParent, foreignRecordset)); I already have the suspicion that the memory access violation comes from ptr_map taking ownership of the pointers (references) passed to it in the above three lines and that these are all created on the stack and not the heap, where ptr_map expects them to be. When the ptr_map is finally destroyed, it tries to access memory, that's impossible to access... But I didn't manage to successfully create heap objects that also do NOT copy the property tree objects, which is important as I only need references to the property trees. Any help is appreciated. -regards, Roland

1 0

boost ptr_map memory access violation (stack/heap problem)
by roland kapl 06 Jan '21

06 Jan '21

Dear Boost-Experts! I'm trying to use a ptr_map along with boost property trees. I need to store pointers to specific parts of a built up property tree to access these parts later on for easy insertion there. However, when the ptr_map is cleared/destroyed, I get memory access violations/stack overflow messages for my test cases. The ptr_map (typedef treeMap) is globally defined within a std::map to a ptr_map to property trees as follows (I know this isn't good practice, but passing it as a reference didn't make a difference, so I left it that way): namespace pt = boost::property_tree; typedef boost::ptr_map<std::string, pt::ptree> treeMap; std::map<std::string, treeMap> parentTableTrees; The property tree is defined as follows in this function (this builds a property tree from tabular data in the passed table variable "data" using definitions form table variable "control"): std::string TreeizeRelD::writeTreeAndCreateXML(const std::vector<std::vector<std::string>>& control, const std::vector<std::vector<std::vector<std::string>>>& data, int *result) { std::string resultString; pt::ptree &propTree = pt::ptree(); std::string returnStr = TreeizeRelD::writeTree(control, data, propTree); *result = 0; if (returnStr != "") { *result = 1; return returnStr; } returnStr = TreeizeRelD::createXML(propTree, resultString); if (returnStr != "") { *result = 1; return returnStr; } // here the memory access violation occurs: parentTableTrees.clear(); return resultString; } In function writeTree the propTree (being passed by ref as ptTree) is populated in following three lines: std::string TreeizeRelD::writeTree(const std::vector<std::vector<std::string>> &control, const std::vector<std::vector<std::vector<std::string>>> &data, pt::ptree & ptTree) ... // FIRST LINE parentTableTrees[subRootNode].insert(keyPair.first, &ptTree.add_child(subRootNode, keyPair.second)); ... // iterate through all parent key record collections referred to by subtables parentNode (rootnode + optional subnode) for (treeMap::value_type && parentKeysPair : parentTableTrees.find(lookupNode)->second) { // iterate through all records (ptrees) in key collection for (pt::ptree::iterator parentRecPair = parentKeysPair.second->begin(); parentRecPair != parentKeysPair.second->end(); ++parentRecPair) { pt::ptree &parentRecPtree = parentRecPair->second; ... // SECOND LINE // parentRecPair is an iterator variable from the ptr_map: parentTableTrees[subRootNode].insert(rowsFK, &parentRecPair->second.get_child(subnodeFRec)); ... // THIRD LINE // parentRecPtree is the referenced property tree itself: parentTableTrees[subRootNode].insert(rowsFK, &parentRecPtree.put_child(subnodeOfParent, foreignRecordset)); I already have the suspicion that the memory access violation comes from ptr_map taking ownership of the pointers (references) passed to it in the above three lines and that these are all created on the stack and not the heap, where ptr_map expects them to be. When the ptr_map is finally destroyed, it tries to access memory, that's impossible to access... But I didn't manage to successfully create heap objects that also do NOT copy the property tree objects, which is important as I only need references to the property trees. Any help is appreciated. -regards, Roland

1 0

[statechart] Event dispatching for orthogonal states
by B A 03 Jan '21

03 Jan '21

Hello, I have following code : ///////////////////////////////////////////// #include <iostream> #include <boost/mpl/list.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/event.hpp> #include <boost/statechart/transition.hpp> #include <boost/statechart/custom_reaction.hpp> namespace sc = boost::statechart; struct Event1 : sc::event<Event1> {}; struct Event11 : sc::event<Event11> {}; struct Meta; struct Machine : sc::state_machine<Machine, Meta> {}; struct Meta2 : sc::simple_state<Meta2, Machine> { Meta2() { std::cout << "Meta2\n"; } }; struct Inner1; struct Inner2; struct Meta : sc::simple_state<Meta, Machine, boost::mpl::list<Inner1, Inner2>> { Meta() { std::cout << "Meta\n"; } typedef sc::transition<Event1, Meta2> reactions; }; struct Inner11 : sc::simple_state<Inner11, Meta::orthogonal<0>> { Inner11() { std::cout << "Inner11\n"; } typedef sc::custom_reaction<Event1> reactions; sc::result react(const Event1& ev) { std::cout << "Inner1 reaction\n"; return forward_event(); } }; struct Inner1 : sc::simple_state<Inner1, Meta::orthogonal<0>> { Inner1() { std::cout << "Inner1\n"; } typedef sc::transition<Event11, Inner11> reactions; }; struct Inner2 : sc::simple_state<Inner2, Meta::orthogonal<1>> { Inner2() { std::cout << "Inner2\n"; } }; int main() { Machine m; m.initiate(); m.process_event(Event11()); m.process_event(Event1()); return 0; } //////////////////// That gives me output: Meta Inner1 Inner2 Inner11 Meta2 The goal was to get Event1 processed first in Inner11 state and then forward it to outer state Meta for further processing but looks like event dispatching does not work as expected. I can make it work in that way only if I put Event1 handling into Inner1 state. I'm aware of limitation (https://www.boost.org/doc/libs/1_61_0/libs/statechart/doc/rationale.html#Li… #Event dispatch to orthogonal regions) but as far I understand that considers that case when both Inner1 and Inner11 have same event processing, please correct me if I'm wrong. Is current dispatching work correctly for my code? Regards, Andrew

1 0