- Boost-users - lists.boost.org

reverse_iterators for uBLAS sparse matrices
by Nikos Platis 02 Mar '05

02 Mar '05

Hi, I am relatively new to Boost and I find it an excellent C++ library. During my experiments with the library, I tried the sparse matrix classes offered by uBLAS. Unfortunately, I think that reverse_iterators of these classes do not work correctly. Below is my sample code, which demonstrates some problems; the problems are the same with all three sparse matrix classes. I tried it with gcc 3.4.1 on Linux. Any comments would be appreciated. Thanks in advance, Nikos Platis PS. I post here instead of the uBLAS Yahoo Group because I am still waiting for membership approval... ---------------------------------------------------- #include <iostream> #include <boost/numeric/ublas/matrix_sparse.hpp> #include <boost/numeric/ublas/io.hpp> namespace ublas = boost::numeric::ublas; //typedef ublas::sparse_matrix<double> spmd; //typedef ublas::compressed_matrix<double> spmd; typedef ublas::coordinate_matrix<double> spmd; int main() { // Construct a sample sparse matrix spmd M(5, 5); M(0,0) = 11; M(0,2) = 13; M(1,0) = 21; M(1,1) = 22; M(2,2) = 33; M(2,4) = 35; M(3,3) = 44; M(4,0) = 52; M(4,4) = 55; /* OK */ for (spmd::const_iterator1 it1 = M.begin1(); it1 != M.end1(); ++it1) { for (spmd::const_iterator2 it2 = it1.begin(); it2 != it1.end(); ++it2) { std::cout << it2.index1() << " " << it2.index2() << ": " << *it2 << std::endl; } } std::cout << std::endl << std::endl; /* The following does not compile, error about the const reverse iterators for (spmd::const_reverse_iterator1 it1 = M.rbegin1(); it1 != M.rend1(); ++it1) { for (spmd::const_reverse_iterator2 it2 = it1.rbegin(); it2 != it1.rend(); ++it2) { std::cout << it2.index1() << " " << it2.index2() << ": " << *it2 << std::endl; } } std::cout << std::endl << std::endl; */ /* The following compiles but throws bad_index exception */ for (spmd::reverse_iterator1 it1 = M.rbegin1(); it1 != M.rend1(); ++it1) { for (spmd::reverse_iterator2 it2 = it1.rbegin(); it2 != it1.rend(); ++it2) { std::cout << it2.index1() << " " << it2.index2() << ": " << *it2 << std::endl; } } std::cout << std::endl << std::endl; } ---------------------------------------------------- -- ----------------------------------------------------------------------- Nikos Platis e-mail: nplatis(a)di.uoa.gr Department of Informatics tel: +30 210-727-5106 University of Athens fax: +30 210-727-5114 "The empires of the future are the empires of the mind." - W. Churchill -----------------------------------------------------------------------

1 0

boost regex 1.32/VC7.1 compile problem
by frank fu 02 Mar '05

02 Mar '05

I am trying to move my code from vc6.0 to vc71. Here is the part of code using boost regex: boost::wregex ee(L"[E|e],(\\w+),(.+)$"); boost::wcmatch mr; TString value=L"some char"; if (boost::regex_match(value, mr, ee)) { ... } Those code compiled with UNICODE and was ok on vc6.0. But when I compile with VC71, it gives me error c2664: ============ d:\s\AEM\AEM6.0\source\AEMCore\AEMRulesCfgReg.cpp(176): error C2664: 'bool boost::regex_match<std::char_traits<wchar_t>,std::allocator<_Ty>,std::allocator<boost::sub_match<BidiIterator>>,wchar_t,traits,Allocator>(const std::basic_string<_Elem,_Traits,_Ax> &,boost::match_results<std::basic_string<_Elem,_Traits,_Ax>::const_iterator,std::allocator<boost::sub_match<BidiIterator>>> &,const boost::reg_expression<charT,traits,Allocator> &,boost::regex_constants::match_flag_type)' : cannot convert parameter 2 from 'boost::wcmatch' to 'boost::match_results<BidiIterator,Allocator> &' with [ _Ty=wchar_t, BidiIterator=const unsigned short *, traits=boost::regex_traits<wchar_t>, Allocator=std::allocator<wchar_t>, _Elem=wchar_t, _Traits=std::char_traits<wchar_t>, _Ax=std::allocator<wchar_t>, charT=wchar_t ] and [ BidiIterator=std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t>>::const_iterator, Allocator=std::allocator<boost::sub_match<const unsigned short *>> ] ================== also, I got lots warning C4018: '<' : signed/unsigned mismatch, although that's ok for me right now. Thanks for any help. frank

3 4

Weird behaviour when changing states in boost::fsm
by Jan Eickmann 02 Mar '05

02 Mar '05

Hi, I realized a weird behaviour when using boost::fsm. Here's my state setup: I have a parent state which has two substates. One is basicly a noop as InnerInitial, the other is and OptionsDialog. Now, in a custom_reaction's react function in the parent state, I call transit<OptionsDialog> in order to go to the OptionsDialog-substate. What happens is that the parentstate itself is destroyed and reentered, then it enters the OptionsDialog state. Something similar happens when I use transit<ParentState> to go back to the ParentState (which should automatically enter the InnerInitial, no?). It exits the OptionsDialog, then exits ParentState and reenters ParentState (I haven't checked if it enters the InnerInitial). If in the OptionsDialog, I do a transit<NoOpInnerInitial> it just goes there without first destroying the parent-state (just exits OptionsDialog but not ParentState). Is this the expected behaviour, if so, could someone explain how to get the desired behaviour? Thanks, Jan Eickmann

2 1

[program_options] parsing multiple times for different sets of opts
by Liam Routt 02 Mar '05

02 Mar '05

I'm very hopeful that program_options will simplify the mess that is the options parsing in our application, especially as it should allow us to handle command-line, config-fle, and environment-variable options in one logical step. This is all good. My initial tests have run into a small hitch, and I'm wondering whether there is a way to do what I have been trying to do: We have a core engine which has the largest options requirements. For testing, mainly, we wrap that core engine and provide a user utility. I'd like the core engine to be able to handle a broad set of options from all three directions (config, command line, environment). Easy. I'd also like the wrapping utility to have its own (smaller) set of options that control what it does. Ideally this should be as logically seperate from the engine as possible. At present we do this by simply not using command-line options for the core engine, and only using command-line options for the wrapping utility, but that is the fucntionality I most want to add at the moment - the use of multiple methods of setting (most) options at both levels (wrapper and core engine). What I would most like to be able to do is process the command line (for example) twice - once in the outer wrapping context, looking for the options that are relvant there, and once in the core engine, looking for the options there. When I try a test app with this structure, though, I get exceptions thrown when any options are encountered that are not included in both the options_descriptions used, which sort of defeats what I'm trying to do - I want to have two distinct sets of options: one for the wrapper, and one for the core, with (little or) no overlap. I would be happy if I could disable the exception behaviour, allowing the processing to complete and report to me that it encountered some unknown options along the way. This would mean that I would risk ignoring some unknown options in both passes, but I could live with that, I think. I can see a possible alternative, which requires me to pass the wrapper's options_description to the core engine, get it all parsed there, and pass back the map for examination by the wrapper. This would make some additional work for me, but would probably work fine. I guess I'd just like to know whether the other way of approaching things is going to be supported, or whether there is yet another approach I should consider? Take care, Liam -- Liam Routt Ph: (03) 8344-1315 Research Programmer caligari(a)cs.mu.oz.au Computer Science, Melbourne University (or liam(a)routt.net)

2 1

RE: [Boost-users] Weird behaviour when changing states in boost::fsm
by Darryl Green 02 Mar '05

02 Mar '05

Hi Jan, > -----Original Message----- > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Jan Eickmann > Subject: [Boost-users] Weird behaviour when changing states > in boost::fsm > > I have a parent state which has two substates. One is basicly > a noop as > InnerInitial, the other is and OptionsDialog. > Now, in a custom_reaction's react function in the parent > state, I call > transit<OptionsDialog> in order to go to the OptionsDialog-substate. > What happens is that the parentstate itself is destroyed and > reentered, > then it enters the OptionsDialog state. > Something similar happens when I use transit<ParentState> to > go back to > the ParentState (which should automatically enter the InnerInitial, > no?). It exits the OptionsDialog, then exits ParentState and reenters > ParentState (I haven't checked if it enters the InnerInitial). > If in the OptionsDialog, I do a transit<NoOpInnerInitial> it > just goes > there without first destroying the parent-state (just exits > OptionsDialog but not ParentState). > > Is this the expected behaviour, if so, could someone explain > how to get > the desired behaviour? Yes it is expected. See transit() in reference. In summary, calling transit will always exit the current state, and keep exiting back to the icos of the current state and the final state, then work in again from there to reach the destination state. Note tht exit = destruct, enter = construct. There isn't enough information to properly answer your question. For a start I don't properly understand your fsm, or whether this is just a minimal example to illustrate your problem. The obvious answer is that you should just make the inner states react to the event you currently have the parent reacting to. Using the form of custom reaction that allows a transition context and member function to be specified, you can make the transition context the parent state and a member function of the parent can perform action. Of course, if your reason for using a custom reaction is to implement some form of guard, this won't entirely solve the problem. The other way to look at this is to see if you can replace the guard with more states/events (the reaction to the original event conditionally produces the appropriate more specific event to cause the correct action and final state). hth Darryl. ########################################################################## This e-mail is for the use of the intended recipient(s) only. If you have received this e-mail in error, please notify the sender immediately and then delete it. If you are not the intended recipient, you must not use, disclose or distribute this e-mail without the author's prior permission. We have taken precautions to minimise the risk of transmitting software viruses, but we advise you to carry out your own virus checks on any attachment to this message. We cannot accept liability for any loss or damage caused by software viruses. ##########################################################################

1 0

Debugging a graph visitor
by Stephen Torri 02 Mar '05

02 Mar '05

I am using the default depth_first_search visitor with an graph setup as follows: typedef property< vertex_index_t, uint32_t, property< vertex_name_t, boost::shared_ptr<Component> > > VertexProperty; typedef adjacency_list<setS, // OutEdgeList setS, // VertexList directedS, // Directed VertexProperty> // VertexProperties Graph_Type; typedef graph_traits<Graph_Base::Graph_Type>::vertex_descriptor Vertex; typedef graph_traits<Graph_Base::Graph_Type>::edge_descriptor Edge; The graph contains Component class objects. I want to visit each Component and execute the function run(). The test graph I have is a simple two node graph: node A ---> node B When I use the depth_first_search with my visitor I see that it only visits node A. I do not know why this is the case. I have only implemented the discover_vertex function in it. I have std::cout messages for telling me various steps of run() have been done. I cannot see how to have the visitor say what its doing (e.g. "I'm in node A. Executing run(). Considering moving to node B). What I need assistance on is how do I debug my visitor? I am only sending the graph and the visitor to my call to depth_first_search: // Let Graph Visitor run through the Graph // (visit Input graph) depth_first_search (test_graph_ptr->get_Graph(), visitor(vis)); Stephen

2 2

Re: bjam seg faulting on mac os x 10.3.8
by Andy Espenscheid 02 Mar '05

02 Mar '05

yep, I discovered the $TOP issue yesterday. Had it set as a convienence for another project. Good to know I'm not alone. Thanks for the reply. Andy. > > Message: 1 > Date: Mon, 28 Feb 2005 10:59:40 -0800 > From: "junyi.sun(a)supportlinux.net" <junyi.sun(a)supportlinux.net> > Subject: re: [Boost-users] bjam seg faulting on mac os x 10.3.8 > To: boost-users(a)lists.boost.org > Message-ID: <5.1.0.14.2.20050228104802.00b90540(a)10.0.0.63> > Content-Type: text/plain; charset="us-ascii"; format=flowed > > I saw bjam got segmentation fault with bjam 3.1.10 + boost 1.32 + gcc 3.3.3 > + fedora 2. > After playing it around on different environment, I found that I can always > reproduce the problem when I set environment variable $TOP for my own > development CVS. Once I removed the environment variable $TOP ( I was using > bash shell: run "unset TOP" ), the problem is gone. > I hope this might help. > - Junyi Sun > > From: boost-users-bounces(a)lists.boost.org > [mailto:boost-users-bounces@lists.boost.org] On Behalf Of Andy Espenscheid > Sent: Sunday, February 27, 2005 8:46 PM > To: boost-users(a)lists.boost.org > Subject: [Boost-users] bjam seg faulting on mac os x 10.3.8 > > I am trying to compile boost 1.32.0 on MacOSX 10.3.8 and getting a > Segmentation Fault immediately from bjam immediately. I'm using gcc 3.3. > bjam is crashing with a EXC_BAD_ADDRESS exception. I compiled bjam from the > boost distribution but it has the same behavior. Any pointers would be > greatly appreciated. Seems like I'm doing somehthing dumb. Also, are > binaries available via fink? I seached with fink 0.71 but couldn't find > anything. Thx. >

1 0

Strange error...
by Jason House 01 Mar '05

01 Mar '05

Code that was compiled and tested on windows is now getting ported to unix (by another organization). I'm a bit puzzled by the following error message they are getting: /op_models/FCS_SOSv1.0_Scenarios_v10.5/FCS_SDD/CabWnwSrwPoP.opt32.s1.nt.so: symbol __1cFboostGdetailUsp_counted_base_impl4CpnXtransaction_reservation4nHslot_id_nYchannel_reservation_type___n0APchecked_deleter4n0E____G__vtbl_: referenced symbol not found I believe that it is looking for the implementation of boost::shared_ptr<transaction_reservation<slot_id,channel_reservation_type> Any hints as to what could be wrong? I did not include source code because I suspect the problem is more basic than that. When I asked which compiler was used, he replied "All I know is that we are using SunPro 5.4 for the compiler." -- Jason. 732-578-6378

1 0

[serialization] problem with Borland C++ Builder 6
by Pablo Aguilar 01 Mar '05

01 Mar '05

Hi, I've just started using the serialization library, and am trying to do so with BC++6. If I'm right, it should work just as long as I remove support for xml archives (because Spirit doesn't work on BC++) I've a class Cliente which has an appropriate serialize member fxn. And a manager class called Clientes which stores a std::vector<boost::shared_ptr<Cliente> > When doing: void Clientes::serialize(Archive& ar, unsigned const version) { ar & m_imp->m_clientes; // where m_imp is a pimpl-style struct // m_clientes is of the type specified above } (this is trimmed down code, I can post the original if required) I get the following error: [C++ Error] serialization.hpp(121): E2015 Ambiguity between 'boost::serialization::void serialize< boost::archive::text_iarchive , boost::shared_ptr<cc::servidor::Cliente> > ( boost::archive::text_iarchive & , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > & , const unsigned int )' and 'boost::serialization::void serialize< boost::archive::text_iarchive , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > >( boost::archive::text_iarchive & , _STL::vector<boost::shared_ptr<cc::servidor::Cliente> > & , const unsigned int )' (I removed the allocator parts to make the message clearer) So the question is, how do I remove the ambiguity? Thanks for your help... Pablo Aguilar

3 12

boost::indirect_iterator
by Matthias Kaeppler 01 Mar '05

01 Mar '05

Consider this code: vector<int> coll; // ... push back some values vector<int*> ptrcoll; // ... push back pointers to the values of coll indirect_iterator< vector<int*>::iterator > begin(ptrcoll.begin()), end(ptrcoll.end()); sort( begin, end, less<int> ); -- My question: After the sort statement, coll is sorted, right? (and ptrcoll is not). However, I need to sort a vector of pointers according to a predicate which applies to non-pointers. In this case, I want to sort ptrcoll, according to the less-relation on the pointees in coll. How can I achieve that? -- Matthias Kaeppler

2 4