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

Boost Lexer
by Jerry Jeremiah 04 Oct '10

04 Oct '10

On the review schedule page ( http://www.boost.org/community/review_schedule.html ) there is a link to download the Boost Lexer library: http://boost-consulting.com/vault/index.php? action=downloadfile&filename=boost.lexer.zip&directory=Strings%20-%20Text% 20Processing But when I click it it takes me to a directory in the Boost Vault that doesn't contain anything that is obviously this library. Is there someplace else to get it? Jerry

3 2

[spirit][qi] Iteration / string iterator
by alfC 03 Oct '10

03 Oct '10

can anybody explain to me why this example from the Spirit.Qi manual works http://www.boost.org/doc/libs/1_44_0/libs/spirit/example/qi/complex_number.… and when I try to use the string iterators directly I get a horrific compiler error? Something to do with string iterators being pointers or something? std::string s = "(2, 3)"; // < line added to example bool r = phrase_parse(s.begin(), s.end(), //< only line changed in the example was (first, last) // Begin grammar ( '(' >> double_[ref(rN) = _1] >> -(',' >> double_[ref(iN) = _1]) >> ')' | double_[ref(rN) = _1] ), // End grammar space); Thank you Alfredo error message below: complex_number.cpp: In function 'bool client::parse_complex(Iterator, Iterator, std::complex<double>&) [with Iterator = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >]': complex_number.cpp:81: instantiated from here complex_number.cpp:51: error: no matching function for call to 'phrase_parse(__gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, const boost::proto::exprns_::expr<boost::proto::tag::bitwise_or, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l>, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>&, const boost::proto::exprns_::expr<boost::proto::tag::negate, boost::proto::argsns_::list1<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l>, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>&>, 1l>&>, 2l>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l> >, 2l>&, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>, const boost::spirit::ascii::space_type&)' /g/g91/correaa/usr/include/boost/spirit/home/qi/parse.hpp:62: note: candidates are: bool boost::spirit::qi::phrase_parse(Iterator&, Iterator, const Expr&, const Skipper&, boost::spirit::qi::skip_flag::enum_t) [with Iterator = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, Expr = boost::proto::exprns_::expr<boost::proto::tag::bitwise_or, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l>, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>&, const boost::proto::exprns_::expr<boost::proto::tag::negate, boost::proto::argsns_::list1<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l>, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>&>, 1l>&>, 2l>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l> >, 2l>&, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>, Skipper = boost::spirit::ascii::space_type] /g/g91/correaa/usr/include/boost/spirit/home/qi/detail/parse_auto.hpp: 164: note: bool boost::spirit::qi::phrase_parse(Iterator&, Iterator, Expr&, const Skipper&, boost::spirit::qi::skip_flag::enum_t) [with Iterator = __gnu_cxx::__normal_iterator<char*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, Expr = const boost::proto::exprns_::expr<boost::proto::tag::bitwise_or, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l>, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>&, const boost::proto::exprns_::expr<boost::proto::tag::negate, boost::proto::argsns_::list1<const boost::proto::exprns_::expr<boost::proto::tag::shift_right, boost::proto::argsns_::list2<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l>, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>&>, 1l>&>, 2l>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const char&>, 0l> >, 2l>&, const boost::proto::exprns_::expr<boost::proto::tag::subscript, boost::proto::argsns_::list2<const boost::spirit::terminal<boost::spirit::tag::double_>&, boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<const boost::phoenix::actor<boost::phoenix::composite<boost::phoenix::assign_eval, boost::fusion::vector<boost::phoenix::reference<double>, boost::spirit::argument<0>, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_, boost::fusion::void_> > >&>, 0l> >, 2l>&>, 2l>, Skipper = boost::spirit::ascii::space_type]

3 6

[Boost.Units] radians and degrees
by Diederick C. Niehorster 03 Oct '10

03 Oct '10

Dear List, I use VS2010. I have just ventured into Boost.Units as me and my colleagues frequently make errors in our code by mixing up degrees and radians (function takes one but we supply it the other). In some cases a degree representation makes sense, in other the radian representation. Basically, I want to use radian and degree quantities and use implicit conversions to freely interchange between the two (say a user supplies degrees to a function whose declaration asks for radians, or vice versa, things should simply be converted on the fly so that the function has the input it expects and its output is not wrong). I have no need for the SI system or anything else. I am however having some trouble understanding something that must be rather basic. Consider the following code: ---- #include <boost/units/quantity.hpp> #include <boost/units/systems/si/plane_angle.hpp> #include <boost/units/systems/angle/degrees.hpp> int main(int argc, char* argv[]) { boost::units::quantity<boost::units::si::plane_angle> r(.38*boost::units::si::radian); boost::units::quantity<boost::units::si::plane_angle> d(6*boost::units::degree::degree); r = 2.*d; d = 6*boost::units::degree::degree; d = 2.*r; return 1; } ---- The declaration of d works just fine, but assigning exactly the same to d two lines below does not, giving me a compilation error where the crux is "error C2338: (is_implicitly_convertible<Unit2,unit_type>::value == true)". I am thinking that the problem here is that boost::units::degree::degree is not part of the SI system, but of the system defined in boost/units/systems/angle/degrees.hpp. However, why does the declaration initialization two lines above work fine? In any case, for my usage case, should I simply build a minimal system with one dimension, plane_angle, define radian (most stuff does happen in radian, so guess it would cut down on conversions) as the base unit and supply degree as well? How would I then supply degree? All the examples define other units (such as feet instead of meters) in seperate systems using make_system, wouldn't that lead to the problems I observe above? Maybe a very stupid question, but I haven't quite wrapped my head around this: how do I then represent a value in degrees, or is this irrelevant? Any pointers much appreciated! Looking forward to understanding this better. Best and thanks! Dee

4 4

[asio] Howto bind *client* to a specific port?
by for-gmane 02 Oct '10

02 Oct '10

A NewbieQ: From a client app I want to connect to a server app on a remote host (say port 6666). A requirement is that the client shall be bound to a defined port (say port 5555). How to do this in asio? Does the client need to use an acceptor? (ok, this maybe sounds non-sensical, but who knows... :-)

2 3

[BGL] SPPRC formulation
by Adam Spargo 02 Oct '10

02 Oct '10

Hi, I would like to use the r_c_shortest_paths algorithm. My constraint is that given pairs of vertices i, j (each i have a single mate j) must have a distance between them which is consistent with a given distribution. I am looking for the path which is most consistent with this distribution. Does anybody have any experience of formulating such a constraint in BGL? The second problem is that I am currently modelling the problem with an undirected graph. The edges could be viewed as bi-directional, but only due to the double stranded nature of DNA. Once I have started on a path I just choose the label which is consistent with the direction I am going, but the graph is essentially undirected, you can always go in either direction down an edge. Could an undirected graph be used with this algorithm or must I use a directed graph? I have tried to ask this question before, hopefully this time I have phrased it better - plus I am actually ready to code it now. As always, any advice gratefully received. Adam. -- Dr Adam Spargo High Performance Assembly Group email: aws(a)sanger.ac.uk Wellcome Trust Sanger Institute Tel: +44 (0)1223 834244 x7728 Hinxton, Cambridge CB10 1SA Fax: +44 (0)1223 494919 -- The Wellcome Trust Sanger Institute is operated by Genome Research Limited, a charity registered in England with number 1021457 and a company registered in England with number 2742969, whose registered office is 215 Euston Road, London, NW1 2BE.

2 5

Re: [Boost-users] [serialization] boost::serialization adds huge amounts of exports to resultant Windows PE file
by Chris Yuen 02 Oct '10

02 Oct '10

Rober Ramey wrote: > If you want to be really helpful you could do the following: > On your own machine run library_test.sh for the serialization library > for each of the three compilers in release mode and send me the results. > For those compilers which pass, we'll tweak the force_include file > accomodate this new information. I would love to help, but any pointers on how to run it? I tried library_test.bat and library_test.sh and failed: > cd D:\Lib\boost\libs\serialization\test > ..\..\..\tools\regression\src\library_test.bat 'process_jam_log' is not recognized as an internal or external command, operable program or batch file. 'library_status' is not recognized as an internal or external command, operable program or batch file. $ uname CYGWIN_NT-6.1-WOW64 $ pwd /cygdrive/d/Lib/boost/libs/serialization/test $ ../../../tools/regression/src/library_test.sh toolset=msvc ../../../tools/regression/src/library_test.sh: line 17: process_jam_log: command not found ../../../tools/regression/src/library_test.sh: line 18: library_status: command not found Best regards, Chris Yuen

2 1

CreateProcess
by gast128 02 Oct '10

02 Oct '10

Hello all, I was asking if there is CreateProcess like functionailty in Boost. In our application we lock files, and spawn a process (thru _spawn). However it seems that m$ implemented in this way that handles are inherited by child process. This means that the child process is also getting the handle of the locked file, preventing the main application to write to this locked file. So I was wondering if there is a portable c++ way to create prcoesses. Otheriwse we have to write it ourselves and spying the sources of m$ it seems that parsing the commandline is not trivial.

5 5

boost serialize - stack overflow for large problems
by "Jörg F. Unger" 01 Oct '10

01 Oct '10

I have implemented the serialization routine for a rather complex structure with many nested classes. The serialization seems to work for small examples, however, for bigger data sets, I get a stack overflow error. If I increase the stack size from 8MB to 20MB, the examples seems to work. However, I'd like to optimize the code the way that I do not need to increase the stack size (especially, since not all users can do that themselves) So here are my questions: 1. Why is the required stack size different for different data sets different. The structure of the datasets is identical, only the number of data sets differs - so why is the recursive level different? The only thing I can imagine is, that I have a class (container) with a vector of objects. Each object stores a pointer to the container class. Is it possible that once serialization in the container class starts, that there is a recursive serialization pattern? This seems to be support by the fact that the objects in the container class are not serialized in the same way as they are stored in the container. class container { std::vector<object*> myObjects; }; class object { const container* myContainer; } 2. How can I try to decrease the required stack size for the serialization routines and is there a way to estimate the required stack size for a specific problem a priori, so that I can throw an exception with an error message manually instead of having a segmentation fault. Thanks for any suggestions JFU

6 9

boost for embedded systems?
by Jeff Graham 01 Oct '10

01 Oct '10

Hello, I have a Texas Instruments OMAP3 EVM board with an ARMv7 processor and a DSP, running Linux with kernel 2.6.32 and cross compiling with CodeSourcery's gnu g++ 4.3.3. I would like to know if any of boost is usable on this platform? I am most interested in the threading, bind, signals, and asio. I finally found the following page, and although it shows the compiler and hints at the platform, it is not obvious about an OMAP/DaVinci processor... http://www.boost.org/development/tests/release/developer/summary.html Any info is appreciated. Thanks, JEG

2 1

[gil] New IO release
by Christian Henning 01 Oct '10

01 Oct '10

Hi there, a new gil IO extension is ready for download. Here is the link: http://code.google.com/p/gil-contributions/downloads/detail?name=boost_revi… This is the final version that will be used for the boost review. Could someone try to build documentation on Linux? Thanks to all people that have helped me out. Regards, Christian

1 0