- Boost-users - lists.boost.org

Crash in VS2013, bug in compiler, boost or my code ? (flyweight, variant and initializer list)
by Olivier Tristan 16 Dec '13

16 Dec '13

Hello Boost users, Using the following sample code I have some crash in VS2013 but it works fine in LLVM on OSX Is this is a mistake on my side or an issue elsewhere ? #include <string> #include <cstdint> #include <vector> #include <boost/flyweight/flyweight.hpp> #include <boost/flyweight/no_tracking.hpp> #include <boost/flyweight/static_holder.hpp> #include <boost/flyweight/set_factory.hpp> #include <boost/flyweight/simple_locking.hpp> #include <boost/variant.hpp> typedef boost::flyweights::flyweight< std::string, boost::flyweights::no_tracking, boost::flyweights::set_factory<>, boost::flyweights::static_holder, boost::flyweights::simple_locking > string_flyweight; typedef boost::variant< bool, double, string_flyweight > Variant; int main(void) { std::vector<Variant> v = { 1., true, string_flyweight("toto") }; return 0; } Thanks, -- Olivier TRISTAN uvi.net

5 8

library choice
by Mihir Thakkar 15 Dec '13

15 Dec '13

I am new to boost. I would like to contribute to development. I looked through the libraries and got confused from where to start understanding and reading such a large codebase. Is it that all the libraries are independent of each other and I've to look at only those which I want to work with? Please guide me on how to begin understanding. Thanks! :)

3 2

Boost Geometry - RTree with 1D Segments
by Adam Baxter 14 Dec '13

14 Dec '13

Hello all, I've been using boost::icl for interval searching. So far it's been working great. I am using it for closed interval searches for chemical masses. Unfortunately, I've reached a point where I've too much data, I think. The use of sets has started to kill my memory usage. I'd like to switch over to Boost::Geometry, but there's precious little about indexing 1D segments (I don't even mind 2D segments). Can someone point me in the right direction? Thanks! Adam

1 0

Threading question
by Davies, John 13 Dec '13

13 Dec '13

I have the following code and it terminates as expected. When I call the destructor it interrupts the thread. But if I change the this_thread::sleep to this_thread::yield the join() never happens and the program hangs. I must be misunderstanding yield. But I really don't want a sleep if possible. Thanks, John MessageQueueHandler::~MessageQueueHandler() { // Terminate the thread pMessageQueueInputThread->interrupt(); pMessageQueueInputThread->join(); delete pMessageQueueInputThread; } void MessageQueueHandler::MessageQueueInputThread() { unsigned int receivedSize; unsigned int priority; char buffer[queueMaximumMessageSize]; boost::this_thread::interruption_enabled(); try { while(1) { // Process all messages in the queue while(inputMessageQueue->try_receive(buffer, queueMaximumMessageSize, receivedSize, priority)) { BaseMessage * msg = reinterpret_cast<BaseMessage*>(buffer); callbackTable->DispatchMessage(msg); boost::this_thread::interruption_point(); } // Give other threads a chance to run // This is also an interruption point boost::this_thread::sleep(boost::posix_time::millisec(50)); <==Here } } catch(boost::thread_interrupted const&) { return; } } ___________________________________ John Davies Contractor Home Respiratory Care Philips Home Healthcare Solutions 1740 Golden Mile Highway Monroeville, PA 15146 Email: john.davies(a)philips.com Fax: 724-387-4109 ________________________________ The information contained in this message may be confidential and legally protected under applicable law. The message is intended solely for the addressee(s). If you are not the intended recipient, you are hereby notified that any use, forwarding, dissemination, or reproduction of this message is strictly prohibited and may be unlawful. If you are not the intended recipient, please contact the sender by return e-mail and destroy all copies of the original message.

4 5

[Spirit/Qi/Phoenix] non compiling rules...
by Francois Mauger 12 Dec '13

12 Dec '13

Dear Boosters, The following code is one of my first attempts to use Spirit/Qi. For my education, I have tried 2 techniques to parse the simple "aaa=131;" string. The first one (Block A) compiles and seems to output the expected result. The second (B) does not compile with a huge massively templatized backtrace that I don't understand. What is the difference between using online rules and rule objects ? Is there a syntax error somewhere ? I'm afraid the documentation and example are rather terse about the syntax to be used here when coupling Qi and Phoenix... Many thanks for your help. best regards frc -- <pre> #include <iostream> #include <string> #include <vector> // - Boost/Spirit #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_core.hpp> #include <boost/spirit/include/phoenix_operator.hpp> int main( int argc_, char * argv_[]) { int error_code = EXIT_SUCCESS; using boost::spirit::qi::double_; using boost::spirit::qi::string; using boost::spirit::qi::lit; using boost::spirit::qi::lexeme; using boost::spirit::qi::phrase_parse; using boost::spirit::qi::_1; using boost::spirit::qi::as_string; using boost::spirit::ascii::space; using boost::spirit::ascii::char_; using boost::phoenix::ref; { // Block A /// This compiles: std::string s = "aaa=131;"; std::cout << "s: '" << s << "'" << std::endl; std::string::iterator strbegin = s.begin(); std::vector<char> vkey; std::vector<char> vvalue; bool r = phrase_parse( strbegin, s.end(), (+(char_ - '='))[boost::phoenix::ref(vkey) = boost::spirit::qi::_1 ] >> '=' >> *space >> lexeme[+(char_ - ';')][boost::phoenix::ref(vvalue) = boost::spirit::qi::_1 ], space ); if (r) { std::string key(vkey.begin(), vkey.end()); std::string value(vvalue.begin(), vvalue.end()); std::cout << "key : '" << key << "'" << std::endl; std::cout << "value : '" << value << "'" << std::endl; } } { /// Block B /// This doesn't: std::string s = "aaa=131;"; std::cout << "s: '" << s << "'" << std::endl; std::string::iterator strbegin = s.begin(); std::vector<char> vkey; std::vector<char> vvalue; boost::spirit::qi::rule<std::string::iterator> key_rule = +(char_ - '='); boost::spirit::qi::rule<std::string::iterator> value_rule = lexeme[+(char_ - ';')]; bool r = phrase_parse( strbegin, s.end(), key_rule[boost::phoenix::ref(vkey) = boost::spirit::qi::_1 ] >> '=' >> *space >> value_rule[boost::phoenix::ref(vvalue) = boost::spirit::qi::_1 ], space ); if (r) { std::string key(vkey.begin(), vkey.end()); std::string value(vvalue.begin(), vvalue.end()); std::cout << "key : '" << key << "'" << std::endl; std::cout << "value : '" << value << "'" << std::endl; } } return error_code; } </pre> -- François Mauger

3 4

version control choice
by Mihir Thakkar 12 Dec '13

12 Dec '13

Hey all, I am using Ubuntu and Git. Would it be alright if I work on Git? Is everything available on Git repository as well?

2 1

slow exception handling
by XIN LI 12 Dec '13

12 Dec '13

Hi, In my code, I add some protection to catch the exception from boost like "catch (boost::archive::archive_exception& ex)", strangely, it slow exception handling, causing one of our tests to go from around 30 seconds to greater than 5 minutes. I did profiling and found "linear_searc_fdes" spent too much time when process exception now. Does anyone have similar experience, why this happen, and how to fix the problem? Thanks a lot! Best wishes, Andy Li

3 4

How do I build libraries with binaries using two versions of the same toolset
by Ted Byers 11 Dec '13

11 Dec '13

On my OpenSuse box, version 12.3, the default version of gcc is 4.7. I just successfully built gcc 4.8.2, with the binary names ending with 48 (so I have gcc48, g++48, &c.). So, I have two versions of gcc on this machine, and I believe I can use either by setting CC to the one or the other in my make files. Hence my problem. I have built boost 1.55.0 on my Ubuntu 12.04 box (but with the default names, so that gcc -v tells me that I am using gcc 4.8.2: the default version of gcc on that version of Ubuntu is 4.6, which is too old for me to consider). So, a basic build of the boost libraries is simple, and something I have done before. But I do not know how to build boost twice, once with gcc 4.7 and once with gcc 4.8.2, and have them installed in such a way as to ensure that the two builds do not clash and so that if I set CC to the one or the other version of gcc, the right build of boost will automagically be selected (it would be appreciated if someone who knows Gnu make better than I do could show me how to effect that in my makefiles). Obviously I am assuming that a single build of boost will not work with both compilers (is that assumption correct?). Unfortunately, I have not yet found anything in the documentation that talks about building boost with different versions of a given toolset on the same machine. Any help would be appreciated. Thanks Ted

2 3

[spirit::karma | variant] Nested Variants
by Aaron_Wright＠selinc.com 11 Dec '13

11 Dec '13

I am trying to use spirit::karma to generate a CSV file. I want to output a vector of variants. Unfortunately, I also want to add one more type to the variant; a string. So I was thinking I could nest variants. I can get this code to compile, but only the strings print out. What am I doing wrong? template< typename Iterator > class Generator : public boost::spirit::karma::grammar< Iterator, std::vector< boost::variant< std::string, boost::variant< bool, int > > >() > { public: Generator() : Generator::base_type(start) { using boost::spirit::karma::string; using boost::spirit::karma::bool_; using boost::spirit::karma::int_; using boost::spirit::karma::eol; start = (string | bool_ | int_) % Separator() << eol; } boost::spirit::karma::rule< Iterator, Csv_generator_input() > start; }; int main(int argc, char** argv) { std::vector< boost::variant< std::string, boost::variant< bool, int > > > values; values.push_back(std::string("Hello")); values.push_back(true); values.push_back(false); values.push_back(10); values.push_back(std::string("World")); std::string generated; std::back_insert_iterator< std::string > sink(generated); boost::spirit::karma::generate(sink, Generaator(), values); // generated == "Hello,World", Expected "Hello,true,false,10,World" return 0; } --- Aaron Wright

1 0

Problem using a filtered graph in the Ressource constrained shortest path user defined extension and dominance functions
by Berit Dangaard Brouer 11 Dec '13

11 Dec '13

Hi, In our use of the boost ressource constrained shortest path from Boost BGL, we define problem specific ressource extension and dominance function on a user defined graph type mcf_graph (source code is posted below) Our problem is the use of a filtered graph into the resource function. The forfeited edge filter stated in the code below, tries to remove some of the edges in order to speed up the algorithm. It seems that the resource and extension functions do not know how to deal with the filtered graph (I am guessing because they are not template functions), although the filtered graph contains the same Edge and Vertex definitions as the MCF graph, it is not typewise recognised as an mcf_graph, because it also contains the filter map. Is there any way I can work around this? I tried making the resource and extension functions into templates, but this is a problem because my edge bundled properties are problem specific. I would truly appreciate any suggestions as a filter is preferable to copying the graph. mcf_graph.h #ifndef MCF_GRAPH_HPP #define MCF_GRAPH_HPP #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <iostream> using namespace boost; using namespace std; struct Port { Port(int index=-1, int type=-1, int port_code=0, string UN="NN", string name="NN", int service_id=-1 ): m_index(index), m_type(type), m_port_code( port_code), UNLOCODE(UN), m_name(name), m_service_id(service_id) {} int m_index; int m_type;//0 port, 1 port call, 2 transhipment int m_port_code; string UNLOCODE; string m_name; int m_service_id; }; struct Edge { Edge( int id=-1, int type=-1, double weight=0.0, double cost=0.0, double dual_cost=0.0, double util=0.0, double cap=0.0, double r_cap=0.0, double tt=0.0 , int rot=-1) : m_idx(id), m_type(type), m_weight(weight) , m_cost(cost), m_dual_cost(dual_cost), m_utilization(util), m_capacity(cap), m_res_cap(r_cap), m_transittime(tt), m_rot(rot) {} unsigned int m_idx; int m_type;//0 is load edge, 1 is voyage edge, 2 forfeited edge (commodity link), 3 transhipment edge, 4 transhipment ring edge double m_weight; //distance double m_cost; //cost - only on load/unload/transhipment edges double m_dual_cost; double m_utilization; double m_capacity; double m_res_cap; //residual capacity double m_transittime; // transit time on edge with current speed double m_rot; // current rotation }; //Graph typedef adjacency_list< vecS , vecS , bidirectionalS, Port, Edge> mcf_graph; //descriptor typedefs typedef boost::graph_traits<mcf_graph>::vertex_descriptor vertex_descriptor; typedef boost::graph_traits<mcf_graph>::edge_descriptor edge_descriptor; //iterator typedefs typedef boost::graph_traits<mcf_graph>::vertex_iterator Viterator; typedef boost::graph_traits<mcf_graph>::edge_iterator Eiterator; typedef boost::graph_traits<mcf_graph>::in_edge_iterator IEiterator; typedef boost::graph_traits<mcf_graph>::out_edge_iterator OEiterator; template <typename edge_type_map> struct forfeited_edge_type { forfeited_edge_type() { } forfeited_edge_type( edge_type_map type) : forfeited(type) { } bool operator()(const edge_descriptor& e) const { return forfeited[e]==2; } edge_type_map forfeited; }; #endif And resource_extension and dominance functions here in res_path.h #ifndef RESPATH_H_ #define RESPATH_H_ #include <boost/config.hpp> #include <boost/graph/adjacency_list.hpp> #include <boost/graph/r_c_shortest_paths.hpp> #include <iostream> #include "mcf_graph.h" #include "data.h" #include <boost/graph/graphviz.hpp> namespace std { class respath { public: respath(mcf_graph & m, Eiterator & comm); virtual ~respath(); private: mcf_graph & m_res_graph; Eiterator & commodities; }; // data structures for shortest path problem with transit time constraints (spptt) // ResourceContainer model struct spp_spptt_res_cont { spp_spptt_res_cont( double c = 0, double t = 0 ) : cost( c ), time( t ) {} spp_spptt_res_cont& operator=( const spp_spptt_res_cont& other ) { if( this == &other ) return *this; this->~spp_spptt_res_cont(); new( this ) spp_spptt_res_cont( other ); return *this; } double cost; double time; }; bool operator==( const spp_spptt_res_cont& res_cont_1,const spp_spptt_res_cont& res_cont_2 ){ return ( res_cont_1.cost == res_cont_2.cost && res_cont_1.time == res_cont_2.time ); } bool operator<( const spp_spptt_res_cont& res_cont_1,const spp_spptt_res_cont& res_cont_2 ) { if( res_cont_1.cost > res_cont_2.cost ) return false; if( res_cont_1.cost == res_cont_2.cost ) return res_cont_1.time < res_cont_2.time; return true; } // ResourceExtensionFunction model class ref_spptt { static double maxtt; public: static void setmaxtt(double tt){ maxtt=tt; } inline bool operator()( const mcf_graph& g, spp_spptt_res_cont& new_cont, const spp_spptt_res_cont& old_cont, boost::graph_traits <mcf_graph>::edge_descriptor ed) const { const Edge& arc_prop = get( edge_bundle, g )[ed]; new_cont.cost = old_cont.cost + arc_prop.m_cost; new_cont.time=old_cont.time + arc_prop.m_transittime; double& i_time = new_cont.time; return i_time <= (maxtt) ? true : false; } }; double ref_spptt::maxtt=0; // Dominance Function class dom_spptt { public: inline bool operator()( const spp_spptt_res_cont& res_cont_1, const spp_spptt_res_cont& res_cont_2 ) const { return res_cont_1.cost <= res_cont_2.cost && res_cont_1.time <= res_cont_2.time; } }; } /* namespace std */ #endif /* RESPATH_H_ */ -- Best Regards, Ph.D. Berit Dangaard Brouer Post Doc. DTU Management Engineering, Management Science Technical University of Denmark Department of Management Engineering Produktionstorvet, Bygning 426 2800 Kgs. Lyngby blof(a)dtu.dk <mailto:blof@man.dtu.dk> www.ms.man.dtu.dk <http://www.ms.man.dtu.dk> http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/ Please read about the ENERPLAN project here <http://www.maersk.com/innovation/leadingthroughinnovation/enerplan/>

1 0