- Boost-users - lists.boost.org

[statechart] Events not consumed when using derived states?
by Stefan Steuerwald 01 Sep '08

01 Sep '08

Dear statecharters, I would like to request help with a problem building a statemachine from states that I derive from simple_state. Here is minimal code that defines two states StateA and StateB and an event cycling between these two: #include <boost/statechart/state_machine.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/event.hpp> #include <boost/statechart/transition.hpp> namespace sc = boost::statechart; using namespace std; class StateA; struct StateMachine : sc::state_machine< StateMachine, StateA > { void unconsumed_event( const sc::event_base & evt ) { cout << "unconsumed!" << endl; } }; class Event : public sc::event< Event > {}; struct StateA : sc::simple_state< StateA, StateMachine > { typedef sc::transition< Event, StateB > reactions; }; struct StateB : sc::simple_state< StateB, StateMachine > { typedef sc::transition< Event, StateA > reactions; }; ----------------- This works fine as expected with process_event( Event() ). However, I would like to derive the states of my statechart from a class like this: template<class context> struct State : sc::simple_state< State<context>, context > { // Some application-specific things }; struct StateA : State< StateMachine > { typedef sc::transition< Event, StateB > reactions; }; struct StateB : State< StateMachine > { typedef sc::transition< Event, StateA > reactions; }; ----------------- Now, calling process_event( Event() ) does not do anything, except turning the event up at the StateMachine::unconsumed_event() method. I am aware of this one: http://www.boost.org/doc/libs/1_35_0/libs/statechart/doc/faq.html#Templated… but I'm not sure whether this applies in any way to my case, as I don't have any compiler errors. May I be violating some prerequisites here? Thank you for any help you can provide, Stefan.

2 2

unit test XML ouput to HTML XSL?
by Ákos Maróy 01 Sep '08

01 Sep '08

Hi, I'm wondering if someone has already created an XSL stylesheet that transforms the XML output of boost::test to human-friendly HTML? It would be even better if this XSL could combine the output of several test output XML files. I'm also wondering on the state of integration between boost test and continous integration tools, like Hudson, Bitten, etc.. Thanks, Akos

3 2

Serializing a char *
by Diane 01 Sep '08

01 Sep '08

Based on tutorial and reference material, and some previous posts here, it seems like I should be able to serialize a char* by using a wrapper like tracked_char: BOOST_STRONG_TYPEDEF(char, tracked_char) template<class Archive> void serialize(Archive &ar, tracked_char & tc){ ar & tc; } But when I try to serialize my struct that contains char*: typedef struct MYSTRUCT { char chtest; char *chstar; } MYSTRUCT; template<class Archive> void serialize(Archive & ar, MYSTRUCT & it, const unsigned int version) { ar & it.chtest; tracked_char *tcp = it.chstar; //****error on this line****// ar & *tcp; } I get this compile error: cannot convert `char*' to `tracked_char*' in initialization What is the compiler complaining about here? How do I fix it? I'm not sure if I have the correct usage of BOOST_STRONG_TYPEDEF, so I also tried: struct tracked_char { char m_char; // the real data template<class Archive> void serialize(Archive &ar, unsigned int version){ ar & m_char; } // casting operators - not compiled char operator char () const { //****error here****// return m_char; } char & operator char() { //****error here****// return m_char; } }; I need someone to point me in the right direction. Thanks, Diane

4 5

Changing from std::map to boost::bimap
by Sean Farrow 01 Sep '08

01 Sep '08

Hi: I am looking to change from std::map to boost::bimap. I have the following defined: std::bimap<std::bitset<6>, int, BitSetComp> DotsList; And boost::bimap<std::bitset<6>, int, BitSetComp>::iterator DotsIterator; If it's needed BitsetComp is defined as: struct BitSetComp { bool operator()(const std::bitset<6>& lhs, const std::bitset<6>& rhs) const { return lhs.to_ulong() < rhs.to_ulong(); } }; How do I change these definitions to use boost::bimap. Any help apreciated. Chers Sean. __________ Information from ESET NOD32 Antivirus, version of virus signature database 3401 (20080829) __________ The message was checked by ESET NOD32 Antivirus. http://www.eset.com

2 1

[Serialization] Are the serialized char* different when code runs in 32/64 bits machines ?
by jotalo jotalo 01 Sep '08

01 Sep '08

Hi, I use the Bost serialization library to serialize some classes that I put in a char* variable ... I have a Server which publish this char* variable and Clients get this variable and de-serialize it to obtain the original class... Everything work fine when servers and clients are running in machines with the same architecture (64 or 32 bits)... But when I run the server in a 64 bits machine, the char* variable is not recognized in a 32 bits client. In this code: std::stringstream is; is.rdbuf()->pubsetbuf(c, m_StringSize); boost::archive::binary_iarchive *ia = new boost::archive::binary_iarchive(is); The last line returns the std::exception: "invalid signature" To be sure that I am not doing something wrong I printed the first 80 characters of this variable when it is created in a 64 bits server and a 32 bits server: In a 64 bits machine server, the print out is: "........serialization::archive.................MonH1F............Efficiency.(cou" (the "." are not printable ascii characters) in Hexa format it is : 16 00 00 00 00 00 00 00 73 65 72 69 61 6C 69 7A 61 74 69 6F 6E 3A 3A 61 72 63 68 69 76 65 04 04 08 04 08 01 00 00 00 06 00 00 00 00 00 00 00 4D 6F 6E 48 31 46 00 00 00 00 1E 00 00 00 00 00 00 00 45 66 66 69 63 69 65 6E 63 79 20 28 63 6F 75 And ind the case of a 32 bits machine server, it is: "....serialization::archive.............MonH1F........Efficiency.(counter2/counte" 16 00 00 00 73 65 72 69 61 6C 69 7A 61 74 69 6F 6E 3A 3A 61 72 63 68 69 76 65 04 04 04 04 08 01 00 00 00 06 00 00 00 4D 6F 6E 48 31 46 00 00 00 00 1E 00 00 00 45 66 66 69 63 69 65 6E 63 79 20 28 63 6F 75 6E 74 65 72 32 2F 63 6F 75 6E 74 65 They are similar but not equal... Thank you, very much Juan Otalora _________________________________________________________________ Explore the seven wonders of the world http://search.msn.com/results.aspx?q=7+wonders+world&mkt=en-US&form=QBRE

4 4

[Min-Max] Usage with a member function as criteria.
by Rodolfo Federico Gamarra 01 Sep '08

01 Sep '08

Hello Boost users, I'm working on my thesis with the Boost library (Boost-1.34.1) running on g++ (GCC) 4.1.3 20070929 (prerelease) (Ubuntu 4.1.2-16ubuntu2). What I'm trying to do can be done very simply, but I preferred to do it more appropriately, I believe, using the Boost Min-Max library. I'm trying to simultaneously obtain the maximum and minimum values of a member function call over a lists of objects. Suppose there exists a class utl::Particle; with a member function double GetEnergy() const; In a member field of another class I have a list of those particles std::list<utl::Particle> particles; for which I want min/max GetEnergy() values. How is that accomplished using Boost.Min-Max? Below I give some excerpts of some of the things I've tried, but didn't work. In order to try to understand what I was doing I split the code over several lines, so to minimize the non-compiling one. In both cases the error seems to be (that line is what I believe to be the most important part of all the error messages): boost/iterator/iterator_adaptor.hpp:353: error: no match for 'operator-' in... First attempt: boost::function<double(const utl::Particle&)> energy = boost::lambda::bind(&utl::Particle::GetEnergy, boost::lambda::_1 ); boost::transform_iterator< boost::function<double(const utl::Particle&)> , list<utl::Particle>::const_iterator> itBeg(particles.begin(), energy),itEnd(particles.end(), energy); boost::minmax(itBeg, itEnd); // This call doesn't compile. Second attempt: boost::function<double(const utl::Particle&)> energy = boost::lambda::bind(&utl::Particle::GetEnergy, boost::lambda::_1 ); // As in the first case. boost::minmax( boost::make_transform_iterator(particles.begin(),energy ), boost::make_transform_iterator(particles.end() ,energy )); // This call doesn't compile. Thanks a lot for your help. -- Rodolfo Federico Gamarra

2 1

problem with boost io_service
by lakers fan 01 Sep '08

01 Sep '08

Hello, I have an application in which I created an io_service object in the main thread of the application. Then I created a listener object (listener socket class), this class creates a new worker thread and waits for incoming messages. First I created listener socket in the context of the main thread and called async_receive_from() so that io_service has something to work, and then I called io_service.run() in the worker thread. But the run() returned immediately. So I tried creating the socket in the worker thread and called async_receive_from() and then called io_service.run(). Again run() returned immeidately with boost::system::error_code's m_val = 0. Can someone point me in the right direction? i m kind of clueless.. Thanks, Bharani _________________________________________________________________ Talk to your Yahoo! Friends via Windows Live Messenger. Find out how. http://www.windowslive.com/explore/messenger?ocid=TXT_TAGLM_WL_messenger_ya…

3 3

cycle iterator that does keep track of wraparound.
by e r 01 Sep '08

01 Sep '08

hi, regarding http://www.boostpro.com/vault/index.php?action=downloadfile&filename=cycle_… is there an illustration/explanation of the different behaviors of cycle_iterator.hpp and cycle_iterator2.hpp thanks!

1 0

Boost::Thread
by Daryl Haresign 01 Sep '08

01 Sep '08

I've been trying to use boost::thread with a movable structure (see end for code + error). From the online manual ( http://www.boost.org/doc/libs/1_36_0/doc/html/thread/thread_management.html… ) template <class F, class A1, class A2, ...> thread(F f, A1 a1, A2 a2, ...); Preconditions: F and each An must by copyable or movable. Effects: As if thread(boost::bind(f,a1,a2,...)). Consequently, f and each an are copied into internal storage for access by the new thread. I've been running into a problem with this however. The use of boost::bind means that F needs to have a copy constructor, which seems odd as the manual says "or movable". Am I doing something wrong, or is this an oversight, or what? Regards, Daryl. ---------- Code: (built with: gcc version 4.4.0 20080831 (experimental) (GCC) g++-trunk -o move_thread move_thread.cpp --std=c++0x /usr/local/lib/libboost_thread-gcc43-mt.a) ---------- #include <iostream> #include <vector> #include <boost/preprocessor/iteration/iterate.hpp> #include <boost/thread.hpp> using std::cout; using std::endl; using std::vector; using boost::thread; struct S { S(int) { cout << "S()" << endl; } S(S &&) { cout << "S() move" << endl; } void operator()(int i) { cout << "Thread running [" << i << "]" << endl; } S(S const &) = delete; }; int main() { vector<thread> v; for (int i = 0; i < 10; ++i) { v.push_back(thread(S(i), i)); } for (int i = 0; i < 10; ++i) { v[i].join(); } } ---------- Error: ---------- In file included from /usr/local/include/boost/thread/thread.hpp:22, from /usr/local/include/boost/thread.hpp:13, from move_thread.cpp:4: move_thread.cpp: In constructor ‘boost::thread::thread(F, A1) [with F = S, A1 = int]’: move_thread.cpp:26: instantiated from here move_thread.cpp:18: error: deleted function ‘S::S(const S&)’ /usr/local/include/boost/thread/detail/thread.hpp:227: error: used here /usr/local/include/boost/thread/detail/thread.hpp:227: error: initializing argument 2 of ‘boost::_bi::bind_t<R, F, typename boost::_bi::list_av_1<A1>::type> boost::bind(boost::type<R>, F, A1) [with R = void, F = S, A1 = int]’

2 1

[graph] Compressed Sparse Row graph - undirected?
by Mojmir Svoboda 01 Sep '08

01 Sep '08

hello, i am using directed CSR from boost::graph and i have a small problem with memory consumption, as each edge property is duplicated. i can of course make edge property to be some index and reduce this, but i have an editor part of graph that is adjacency_list and i'd like the properties to be the same. my primary question is: is there a way to implement an undirected csr graph? anyway, when constructing directed graph from undirected there is a slight bug in implementation, because it allocates space for only N edges(properties) instead of 2N. or am i missing something? another thing: perhaps i am doing something wrong, but this code seems to go 'one field beyond' the allocated space. can you confirm, please? edge_iterator& operator++() { ++current_edge.idx; while (current_edge.idx == end_of_this_vertex) { ++current_edge.src; end_of_this_vertex = rowstart_array[current_edge.src + 1]; ^^^^^^^^^^^^^^^^^^^^ } return *this; } many thanks for your attention, mojmir

1 0