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

[Program Options] terminate parsing after first positional argument
by Stuart Pook 22 Jan '13

22 Jan '13

Hello, How can I tell Boost Program Options to stop parsing the arguments as soon as it finds a positional argument? I'd like to be able to parse the argument list "-v chmod -R -v 600 foo" as having one argument for my program (-v) and the rest as a std::vector of std::string (including the -v). In the attached program I have tried 2 different approaches. The first uses multitoken with the arguments "--command date -u -v", it fails because "-u" isn't known. The second uses collect_unrecognized with "chmod -R -v 600", it doesn't work because -v is interpreted by boost and doesn't end up in the vector. As someone said back in 2005, perhaps I'm trying to write xargs: http://thread.gmane.org/gmane.comp.lib.boost.user/9529/focus=9641 I know that I can ask my users to write a.out -v -- chmod -R -v 600 foo but I don't want to do that. I want them to write "a.out -v chmod -R -v 600 foo". The first positional argument should should tell boost to stop processing. Another slightly different question. If I have a multitoken option that takes doubles how can I get it to accept negative values? If I give my program "--floats 1 8 -4 6" where --floats starts a multitoken option that accepts double, I get an exception saying that "-4" is an unknown option. thanks Stuart This is what my test program gives me with boost 1.50: argv: dd --command date -u -v unrecognised option '-u' Allowed options: -v [ --verbose ] verbose --command arg command to run 2nd try argv: dd chmod -R -v 600 I'm verbose v: chmod -R 600 3rd try argv: dd --floats 1 8 -4 6 unrecognised option '-4' Allowed options: -v [ --verbose ] verbose -f [ --floats ] arg numbers and my program (formatted to fit in 80 characters) #include <boost/program_options.hpp> #include <boost/range/algorithm.hpp> #include <boost/program_options/parsers.hpp> #include <boost/program_options/options_description.hpp> #include <iostream> namespace po = boost::program_options; #define nelements(a) (sizeof (a) / sizeof (a)[0]) void print(char const * * b, char const * * e) { std::cout << "argv: "; std::copy(b, e, std::ostream_iterator<char const *>(std::cout, " ")); std::cout << std::endl; } int main(int argc, char ** argv) { { bool verbose; std::vector<std::string> command; po::options_description desc("Allowed options"); desc.add_options() ("verbose,v", po::bool_switch(&verbose)->default_value(false), "verbose") ("command", po::value<std::vector<std::string> >(&command) ->multitoken(), "command to run") ; char const * args[] = { "dd", "--command", "date", "-u", "-v", 0 }; print(args, args + nelements(args) - 1); po::variables_map vm; try { po::store(po::command_line_parser(nelements(args) - 1, args) .options(desc).run(), vm); po::notify(vm); if (verbose) std::cout << "I'm verbose\n"; std::cout << "command: "; boost::copy(command, std::ostream_iterator<std::string>(std::cout, " ")); std::cout << std::endl; } catch (boost::program_options::unknown_option & x) { std::cerr << x.what() << "\n" << desc << "\n"; } } std::cout << "2nd try\n"; { bool verbose; po::options_description desc("Allowed options"); desc.add_options() ("verbose,v", po::bool_switch(&verbose)->default_value(false), "verbose") ; char const * args[] = { "dd", "chmod", "-R", "-v", "600", 0 }; print(args, args + nelements(args) - 1); po::variables_map vm; po::parsed_options parsed = po::command_line_parser(nelements(args) - 1, args). options(desc).allow_unregistered().run(); try { po::store(parsed, vm); } catch (boost::program_options::unknown_option & x) { std::cerr << x.what() << "\n" << desc << "\n"; exit(2); } po::notify(vm); if (verbose) std::cout << "I'm verbose\n"; std::cout << "v: "; std::vector<std::string> v = po::collect_unrecognized( parsed.options, po::include_positional); boost::copy(v, std::ostream_iterator<std::string>(std::cout, " ")); std::cout << std::endl; } std::cout << "3rd try\n"; { bool verbose; std::vector<double> f; po::options_description all("Allowed options"); all.add_options() ("verbose,v", po::bool_switch(&verbose)->default_value(false), "verbose") ("floats,f", po::value<std::vector<double> >(&f)->multitoken(), "numbers") ; char const * args[] = { "dd", "--floats", "1", "8", "-4", "6", 0 }; print(args, args + nelements(args) - 1); po::variables_map vm; try { po::store(po::command_line_parser(nelements(args) - 1, args) .options(all).run(), vm); po::notify(vm); if (verbose) std::cout << "I'm verbose\n"; std::cout << "floats: "; boost::copy(f, std::ostream_iterator<double>(std::cout, " ")); std::cout << std::endl; } catch (boost::program_options::unknown_option & x) { std::cerr << x.what() << "\n" << all << "\n"; } } }

6 16

[units] Missing quantity operator++, operator%
by Nathan Crookston 25 Oct '12

25 Oct '12

All, I'm in the process of switching my homegrown units system over to boost units. Some operators which I'm missing are the modulus and the pre and post increment operators. Looking through the archives I note an original review[1] which mentioned the absence of those operators. One response claimed that quantity<si::length, int> t = 5. ...; t++; was nonsensical as writing 5 m + 1, and the reviewer eventually agreed, citing possible confusion if the quantity type converted the initializer. Matthias Schabel seemed to respond favorably: 'I debated this for a while - the only problem is that there will be some value types with heterogeneous operator+ / operator- for which q + 1 is not the same type as q, but I guess that it is just OK for it to just give a compile error in those cases.' And Steven Watanabe said 'Will do.' I haven't found anything regarding the modulus operator. My question is, would a patch adding those operators be accepted? Thanks, Nate [1] http://lists.boost.org/Archives/boost/2007/03/119001.php

3 4

Asio and ZeroMQ
by Matthias Vallentin 11 Oct '12

11 Oct '12

A while ago, Maciej Gajewski started an effort to use Asio to observe a ZeroMQ socket [1]. Based on his code, I put together a thin library that wraps the implementation details. Since other have requested a working example, here it is now at github: https://github.com/mavam/bmq Any feedback is highly appreciated. A basic usage example looks like this: #include <boost/asio/io_service.hpp> #include <bmq.h> int main() { boost::asio::io_service io; bmq::context ctx(1); bmq::component c(ctx, io); auto sink = c.add_sink(ZMQ_PAIR, "inproc://x"); c.subscribe(sink, [](bmq::message&& msg) { std::string str(static_cast<char*>(msg.data()), msg.size()); std::cout << str << std::endl; }); auto source = c.add_source(ZMQ_PAIR, "inproc://x"); bmq::message msg(const_cast<char*>("foo"), 3, nullptr); source->send(msg); // Execute message handler. io.poll(); return 0; } At this point, the library is really thin and only provides very rudimentary wrapping of ZeroMQ. In the future, I plan to extend it in order to facilitate applications that build on message-passing. The dataflow abstraction I envision is essentially a directed graph, where nodes represent components and edges communication links. 0mq provides the edges and the Asio handles asynchronous event processing at the component level. The motiviation is that this model lends itself well for scaling out distributed systems over large clusters. Matthias [1] http://permalink.gmane.org/gmane.network.zeromq.devel/9538

4 4

[Sandbox - endian] Why is endian still in sandbox?
by Nathaniel J Fries 07 Oct '12

07 Oct '12

A fairly novel (at least when put up against more intricate labours like asio, filesystem, and their like) project which appears to be finished and would be a very useful companion to existing libraries sits in the sandbox. Is there a reason for this?

3 3

[BGL] vecS for vertex container and vertex index adjustments
by Sergey Mitsyn 03 Oct '12

03 Oct '12

Hi all, I know that while using vecS for vertices one has no vertex iterator stability upon removing vertices. But I have a question if there exists something like vertex _index_ stability. The documentation says that indices for vertices are automatically adjusted so that they are still in contiguous range, but it is not specified how it is done. Is it okay to assume that if a vertex with an index I is removed, then vertices with indices < I have their indices unchanged, while vertices with indices > I have their indices decreased by one? The actual problem is removing all vertices meeting some condition. Is the following code ok? // traverse all vertices and remove those for which predicate // condition_to_remove_vertex returns true. // graph is adjacency_list<.., vecS, ...> vertex_iterator vi = vertices(graph).first, vi_end = vertices(graph).second; while (vi != vi_end) { if (condition_to_remove_vertex(vi, graph)) { vertices_size_type end_index = vertex_index[*vi_end] , vi_index = vertex_index[*vi]; remove_vertex_f(*vi, graph); // vi and vi_end are invalid --end_index; vi = vertices(graph).first + vi_index; vi_end = vertices(graph).first + end_index; // now vi and vi_end are valid again } else ++vi; } This way seems to be more effective than to start iteration again every time a vertex is removed. ------------ Sergey Mitsyn.

3 14

[Range] insert algorithm fails if target is a map
by Robert Jones 11 Sep '12

11 Sep '12

The title says it all really. The failure occurs because the insert algorithm expects the container to provide a 3-arg insert of the form container.insert( position, begin, end ); whereas map's, multimap's and set's insert method only takes two arguments... map.insert( begin, end ); Is this limitation by design? It would be easy to provide specialisations for maps, mmaps and sets, but that would not be a completely general solution. - Rob.

3 3

filesystem directory_iterator run-time error during construction after upgrading to OSX Lion
by Martin Searancke 04 Sep '12

04 Sep '12

I have just upgraded my Mac to Lion and code that worked fine under snow leopard is giving me a run-time exception when constructing a directory_iterator. The error I am getting is "malloc: pointer being freed was not allocated" The line in question that raises this error is: for ( directory_iterator itr( my_path ); itr != end_itr; ++itr ) taken directly from the example and working fine under windows. This is version 1.49 installed with MacPorts. Is this a known problem? I found some vague references to a similar problem in an earlier version of boost but no solution. I have confirmed that I only have 1 copy of the headers and libs on the system and in the correct path. The date stamp on the files matches the last time I did a macports update so this should be the matching library for the header. Please note that I am a real novice to Mac development and have only just started porting code from windows for less than a month. Thanks in advance, Martin

3 2

[Graph] compilation error under Windows but not under Linux
by Gaël de Chalendar 29 Aug '12

29 Aug '12

Hello, I have a compilation error under Windows (Visual C++ 2008) with a code that works well under Linux (gcc 4.6.1 and before). The compilation error is: =========== /FsaAccess16.tcc(833) : error C2784: 'std::pair<graph_traits<G>::in_edge_iterator,graph_traits<G>::in_edge_iterator> boost::in_edges(graph_traits<G>::vertex_descriptor,const boost::subgraph<Graph> &)'ÿ: impossible de d‚duire l'argument modŠle pour 'const boost::subgraph<Graph> &' … partir de 'FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType' C:\PROGRA~1\boost\BOOST_~1\boost/graph/subgraph.hpp(432)ÿ: voir la d‚claration de 'boost::in_edges' Z: \Projets\MoteurMultimedia\mm_common\src\common/FsaAccess/FsaAccess16.tcc(778)ÿ: lors de la compilation de la fonction membre '<Inconnu>' de la classe <Inconnu> z: \projets\moteurmultimedia\mm_common\src\common\fsaaccess\FsaAccessReader16.h(118)ÿ: voir la r‚f‚rence … l'instanciation de la classe modŠle 'FrCeaLic2m::Common::FsaAccess::FsaAccess16<graphType>' en cours de compilation with [ graphType=FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType ] z: \projets\moteurmultimedia\mm_common\src\common\fsaaccess\FsaAccessSpare16.h(35)ÿ: voir la r‚f‚rence … l'instanciation de la classe modŠle 'FrCeaLic2m::Common::FsaAccess::FsaAccessReader16<graphType>' en cours de compilation with [ graphType=FrCeaLic2m::Common::FsaAccess::selected_graph_types16::spareGraphType ] =========== The line that does not compile is boost::tie(iei,ie_end) = boost::in_edges(commonTarget,m_graph); The function being compiled is declared like that: template <typename graphType > std::pair< const typename boost::graph_traits<graphType>::vertex_descriptor, bool > FsaAccess16<graphType>::findEquivalentInRegister( dicoVertexType tempState ){ ... And here graphType, the type of m_graph is spareGraphType defined by: struct selected_graph_types16 { ... typedef boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, dicoVertexCountProperty> spareGraphType; ... This is a cmake based project that I compile using qtcreator. I'm a Linux developer and I'm a little bit lost with VC outputs and tools under Windows... Regards, Gaêl -- Gael de Chalendar CEA LIST Centre de Fontenay-aux-Roses Laboratoire Vision et Ingénierie des Contenus (Vision and Content Engineering Laboratory) Bat. 38-2 ; 18, rue du Panorama ; BP 6 92265 Fontenay aux Roses Cedex ; France Tél.:01.46.54.80.18 ; Fax.:01.46.54.75.80 Email : Gael.D.O.T.de-Chalendar.A(a)T.cea.D.O.T.fr

2 2

Re: [Boost-users] asio HTTP Server 3 example memory leak
by admin＠thefireflyproject.us 25 Aug '12

25 Aug '12

2 1

[thread_group] How to limit the number of simultaneous threads
by Olivier Tournaire 09 Aug '12

09 Aug '12

Hi all, I would like to add some multithreading in my application. Suppose I have a set of m tasks to do, and I want to limit the number of simultaneous threads to n. I have really no idea on how to do this and would like to have some hints. Could you help me? Regards

4 5