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

[spirit] qi pheonix struct adaptation
by Michael Powell 06 Sep '13

06 Sep '13

Hello, Need a little guidance when it comes to adapting structs. Let's say I've got a simple struct: struct data_t { int a; int b; int c; }; When I adapt it, I need to specify the fields into which the values are being consumed and subsequently synthesized? What happens for optional consumers, in one use-case? In another use-case, what happens if one value or another value or a third value can be consumed for that field? So, something like this, pardoning the pseudo-code: using qi::int_; using qi::lit; qi::rule<Iterator, data_t()> rule_; //a is optional, followed by b is mandatory, followed by c can be 1 | 2 | 3 rule_ %= -( int_ ) >> lit(',') >> int_ >> lit('.') >> ( int_(1) | int_(2) | int_(3) ); This is applying into a GPS NMEA parser domain, so along these lines for things like geo-spacial-coordinates, latitude/longitude, time, etc. Thank you... Regards, Michael Powell

1 0

compilation error
by Николай Кинаш 06 Sep '13

06 Sep '13

Hello all! My programm: `--# cat test_boost.hpp #include <boost/graph/adjacency_list.hpp> #include <boost/graph/rmat_graph_generator.hpp> #include <boost/random/linear_congruential.hpp> typedef boost::adjacency_list<>Graph; typedef boost::unique_rmat_iterator<boost::minstd_rand, Graph> RMATGen; int main() { boost::minstd_rand gen; // Create graph with 100 nodes and 400 edges Graph g(RMATGen(gen, 100, 400, 0.57, 0.19, 0.19, 0.05), RMATGen(), 100); return 0; } `--# mpic++ test_boost.hpp -I./boost/boost/graph/ -I./boost/ -I./boost/boost/random/ -o test_boost /usr/lib/gcc/x86_64-linux-gnu/4.7/../../../x86_64-linux-gnu/crt1.o: In function `_start': (.text+0x20): undefined reference to `main' collect2: error: ld returned 1 exit status what's wrong ?

2 1

[filesystem] path destructor crash
by Patrick Steele 06 Sep '13

06 Sep '13

boost = 1.54 IDE = Visual Studio 2005 / 2012 OS = Windows 7 Hi, I have a 32-bit application that I am upgrading from Visual Studio 2005 to 2012. If I place the following code at the beginning of the application: { //test 1 boost::filesystem::path blahPath; } { //test 2 boost::filesystem::path blahPath = _T( "C:\\ProgramData\\blah" ); } { //test 3 boost::filesystem::path blahPath; std::wstring text = _T( "C:\\ProgramData\\blah" ); blahPath = text; } then it works fine in Visual Studio 2005, however test 3 crashes in Visual Studio 2012 with: --------------------------- Microsoft Visual C++ Runtime Library --------------------------- Debug Assertion Failed! File: f:\dd\vctools\crt_bld\self_x86\crt\src\dbgdel.cpp Line: 52 Expression: _BLOCK_TYPE_IS_VALID(pHead->nBlockUse) and this callstack: msvcr110d.dll!operator delete(void * pUserData) Line 52 C++ boost_filesystem-vc110-mt-gd-1_54.dll!std::allocator<wchar_t>::deallocate(wchar_t * _Ptr, unsigned int __formal) Line 586 C++ boost_filesystem-vc110-mt-gd-1_54.dll!std::_Wrap_alloc<std::allocator<wchar_t> >::deallocate(wchar_t * _Ptr, unsigned int _Count) Line 888 C++ boost_filesystem-vc110-mt-gd-1_54.dll!std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >::_Tidy(bool _Built, unsigned int _Newsize) Line 2265 C++ boost_filesystem-vc110-mt-gd-1_54.dll!std::basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >::~basic_string<wchar_t,std::char_traits<wchar_t>,std::allocator<wchar_t> >() Line 965 C++ boost_filesystem-vc110-mt-gd-1_54.dll!boost::filesystem::path::~path() C++ blah.exe!CPlanarApp::InitInstance() Line 152 C++ mfc110ud.dll!AfxWinMain(HINSTANCE__ * hInstance, HINSTANCE__ * hPrevInstance, wchar_t * lpCmdLine, int nCmdShow) Line 37 C++ blah.exe!wWinMain(HINSTANCE__ * hInstance, HINSTANCE__ * hPrevInstance, wchar_t * lpCmdLine, int nCmdShow) Line 26 C++ blah.exe!__tmainCRTStartup() Line 528 C blah.exe!wWinMainCRTStartup() Line 377 C kernel32.dll!75ce33aa() Unknown [Frames below may be incorrect and/or missing, no symbols loaded for kernel32.dll] ntdll.dll!76f09ef2() Unknown ntdll.dll!76f09ec5() Unknown The boost::filesystem::path destructor is being called and is causing a crash. I do not understand how the first two tests can pass yet there is a problem with the third test. Is there something that I am doing wrong here or does anyone have any advice please? Thanks, Patrick

3 7

[BGL] Having a cost function as weight map
by Maxime van Noppen 06 Sep '13

06 Sep '13

Hi, I can't find how to do this pretty basic thing : having a function instead of a field to compute the cost of edges for various path finding algorithms. I couldn't find the answer in the documentation and Google was of no help. Did I miss something obvious ? Example : ------------------- #include <boost/graph/dijkstra_shortest_paths.hpp> #include <boost/graph/graph_traits.hpp> #include <boost/graph/adjacency_list.hpp> struct my_edge { double cost() const { return cost_ * 2; } double cost_; }; struct my_node { }; int main() { typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::directedS, my_node, my_edge > graph_t; typedef boost::graph_traits<graph_t>::vertex_descriptor vertex_t; graph_t graph; vertex_t v /*= ... */; using boost::weight_map; // Works : boost::dijkstra_shortest_paths(graph, v, weight_map(boost::get(&my_edge::cost_, graph))); // Doesn't compile : //boost::dijkstra_shortest_paths(graph, v, // weight_map(boost::get(&my_edge::cost, graph))); } ------------------- Thanks ! -- Maxime

4 8

How to build Boost binary libraries on Windows X64 using GCC
by guxiaobo1982 06 Sep '13

06 Sep '13

Hi, We are trying to develop a custom R package, which will utilize Boost and RCPP. We are using R 3.0.1 64bit, and the corresponding RTools3 toolchain, which can be downloaded from CRAN, such as http://cran.at.r-project.org/bin/windows/Rtools/Rtools31.exe. Upon our environment we can build test R packages which with C++ srouces and without any other third-part denpendencies, and can use Eclipse C++ IDE to develop demo C++ programes. When comes to Boost, there is a problem to build the binary libraries such as regex, we found a guide at http://fischerlaender.de/development/using-boost-c-libraries-with-gcc-g-und…, it only tells how to use a pre-built Boost binary, and we have tried the steps at http://stackoverflow.com/questions/5299468/unable-to-build-boost-libraries-… 1. cd to toos\build\v2\engine (there is not a src directory) 2. build.bat gcc 3. put the new bjam.exe and b2.exe into the root the boost 4. execute b2 under root of boost It seems boost still looks for cl (which is from the visual studio toolchain) So do you have a pre-built boost library for windows and gcc, or what's the wright way? Thanks. Xiaobo Gu

1 0

[spirit] Qi rule for GPS NMEA
by Michael Powell 06 Sep '13

06 Sep '13

Hello, I'm digging into a qi rule for GPS NMEA and want to approach it as a kind of 2-pass parser. First pass to extract the message and hex-formatted checksum. Next pass to parse out the actual messages from the message. I believe I comprehend how to go about the second pass. For the first pass, I want to parse $XYZ*HH\r\n. That's the literal '$', and everything between there and the literal '*', followed by the two hex characters, as a complete field, followed by the terminal CR+LF. How do I express the "all characters excluding '*'" for the NMEA message? Then the hex field? Thanks... Regards, Michael Powell

3 9

[BGL] Cannot use vertex indices managed through bundled properties with r_c_shortest_path if EdgeList is listS
by potato_research 05 Sep '13

05 Sep '13

As per the thread topic. Given the following minimal (not-)working example: http://pastebin.com/6zpwCb4X I receive the following compilation error: /usr/local/include/boost/graph/r_c_shortest_paths.hpp:244:50: error: invalid conversion from 'boost::graph_traits<boost::adjacency_list<boost::listS, boost::listS, boost::bidirectionalS, VertexProperty, EdgeProperty> >::vertex_descriptor {aka void*}' to 'int' [-fpermissive] int i_cur_resident_vertex_num = cur_label->resident_vertex; If I change my graph from: adjacency_list<listS, listS, bidirectionalS, VertexProperty, EdgeProperty> to adjacency_list<listS, vecS, bidirectionalS, VertexProperty, EdgeProperty> everything seems to be working fine. However, I need to use listS in my code for iterator validity purposes. Is it possible to use r_c_shortest_paths with a graph with listS EdgeList? If so, how? Thanks. -- View this message in context: http://boost.2283326.n4.nabble.com/BGL-Cannot-use-vertex-indices-managed-th… Sent from the Boost - Users mailing list archive at Nabble.com.

2 7

[chrono] this_thread::sleep_for milliseconds
by Michael Powell 05 Sep '13

05 Sep '13

Hello, I am working on a daemon that involves a sleep_for in the main loop, while worker-threads do the "heavier" lifting in the daemon. I have a couple of signals wired up to respond to terminal, kill or other requests, as per daemonization-guidelines. Question for the list, I gather that thread-sleeps are interrupted when these type of signals occur? Which is fine, I don't need to re-sleep, per se, as some examples seem to suggest. But I do guard a flag in a mutex-critical-section and flag whether to stop running the main loop, which then joins the worker threads. Is this about right as far as daemon, thread/sleep, worker thread approaches are concerned? It seems like it to me, but I thought I should run it past the list to see if there are any pearls of wisdom on the subject. Thank you... Regards, Michael Powell

2 1

[units] coulombs to milliamp-hours
by Michael Powell 05 Sep '13

05 Sep '13

Hello, I am looking for a Coulombs to mAh (milliamp-hours) converter. It's conversion is a ratio I think: 1000 / 3600 (A -> mA, seconds -> hours). Haven't checked yet, but does SI include Coulombs? Or for that matter Amperes, where Coulomb = A s, I think. Thank ye. Regards, Michael Powell

2 5

[multi_index] sorted iteration of values
by Mathieu Champlon 05 Sep '13

05 Sep '13

Hello, I'm trying to use Boost.MultiIndex to store my data. The idea is to have a kind of bidirectional multimap (I initially started with Boost.BiMap) which could model : std::multimap< SomeType*, std::set< int > > left; std::multimap< int, SomeType*> right; I'll need to : . insert obviously . remove all ints based on a SomeType* . remove one given (SomeType*,int) . for a given int iterate on all SomeType* . for a given SomeType* iterate in order on all ints What I have so far is : typedef SomeType* First; typedef int Second; struct Value { First first; Second second; }; boost::multi_index::multi_index_container< Value, boost::multi_index::indexed_by< boost::multi_index::ordered_unique< boost::multi_index::composite_key< Value, boost::multi_index::member< Value, First, &Value::first >, boost::multi_index::member< Value, Second, &Value::second > > >, boost::multi_index::ordered_non_unique< boost::multi_index::member< Value, Second, &Value::second > >, boost::multi_index::ordered_non_unique< boost::multi_index::member< Value, First, &Value::first > > > > data; This works, except for the ints iteration based on a given SomeType* because I need them to be sorted, and they're not, e.g. auto range = data.get< 2 >().equal_range( someTypePtr ); for( auto it = range.first; it != range.second; ++it ) ; does not iterate in a sorted order. Is there a way to achieve this without manually sorting the iterated values ? Thank you ! MAT.

2 5