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

Connecting signals2::signal to another signals2::signal: trackable?
by Chris Stankevitz 03 Aug '12

03 Aug '12

class A { boost::signals2::signal<void()> Signal; } class B { boost::signals2::signal<void()> Signal; } boost::shared_ptr<A> pA = boost::make_shared<A>(); boost::shared_ptr pB = boost::make_shared(); === Q1: Is it possible to connect A's signal to B? A1: Yes: void f() { pA->Signal.connect(pB->Signal); pA->Signal(); } === Q2: Will I get a crash if pB is subsequently released? A2: Yes void f() { pA->Signal.connect(pB->Signal); pB.reset(); pA->Signal(); // crash! } === Q3: Is it possible to use signals2::signal::slot_type::track to avoid the crash? A3: [I do not know the answer, please help me here] === Thank you, Chris

3 5

build Boost on OSX with other sysroot
by Kraus Philipp 03 Aug '12

03 Aug '12

Hello, I try to build the Boost 1.50 under OSX (10.6), but I need another sysroot version. Because I need a build with i386 and linking again the /Developer/SDKs/MacOSX10.5.sdk/ Default build again the 10.6 SDK works very well. I have added to the bjam command the flag architecture=x86 and toolset=darwin (--with flags, link, etc), but how can I link the Boost libs to the 10.5 SDK? Thanks Phil

3 2

[fusion] creating fusion-vectors of references
by Oswin Krause 03 Aug '12

03 Aug '12

Hi list, I am new to fusion, so my problem might be really easy to solve. I have a fusion vector which looks a bit like typedef fusion::vector<std::vector<A>,std::vector,std::vector<C> > Tuple; All vectors have the same size and I want from each of these std::vectors one specific element (like the 10th from every vector) and create a fusion::vector<A&,B&,C&> from these elements(my real problem is a bit more complicated, for example one of the vectors might be std::vector<bool>, so the type might be different from an actual reference) My first try was transform: //the Functor which extracts the i-th element class Get { private: std::size_t m_index; public: Get(std::size_t index):m_index(index){} template<typename Sig> struct result; template<typename U> struct result<Get(U&)>{ typedef typename U::reference type; }; template <typename U> typename result<Get(U)&>::type operator()(U& vec) const{ return vec[m_index]; } }; Tuple myTuple(...); fusion::vector<A&,B&,C&> ref = boost::fusion::transform(myTuple,Get(0)); But this doesn't work, because 1. transform only takes myTuple as constant argument. 2. it performs a value-initialization of the references in the constructor, not in the initialization list. Any solution to my problem? It should work for fusion::vector, but a solution which works for all fusion sequences is awarded with bonus points :). If there is no solution for fusion::vector, I would appreciate a solution for another container as well (but no bonus in this case!) Greetings, Oswin

2 4

[boost] [type_erasure] Review ends today Aug 3, 2012
by Lorenzo Caminiti 03 Aug '12

03 Aug '12

Hello all, *** The review of Boost.TypeErasure ends today Aug 3, 2012. If you are planning to submit a review, please do so by the end of today. *** Thank you to all that have participated to the review so far. The review manager, --Lorenzo On Jul 27, 2012 1:41 PM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> wrote: > Hello all, > > After consulting the review wizards and Steven, I am extending > Boost.TypeErasure review of one week, until August 3, 2012. > > Thank you to all that have submitted a review already and I am looking > forward to receiving additional submissions. > > The review manager, > --Lorenzo > On Jul 27, 2012 3:22 AM, "Lorenzo Caminiti" <lorcaminiti(a)gmail.com> > wrote: > >> Hello all, >> >> On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> >> wrote: >> > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti < >> lorcaminiti(a)gmail.com> wrote: >> >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >> >> begins on July 18, 2012 and ends on July 27, 2012. *** >> > >> > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews >> :D *** >> >> *** Boost.TypeErasure review ends today July 27, 2012. If you are >> planning to submit a review, please do so as soon as possible. *** >> >> Thank you to everyone who has commented on the library and submitted a >> review so far! >> >> The review manager, >> --Lorenzo >> P.S. I am considering extending the review until end of day Sunday >> July 29, 2012... I will keep you posted. >> >> > There have been interesting discussions on the library on the ML but I >> > have not received any official review yet :( Especially if you are a >> > user of Boost Any, Function, and Any Iterator, you definitely want to >> > take a look at Type Erasure as it generalizes solutions provided by >> > those other libraries. >> > >> > Thank you. >> > >> > The review manager. >> > --Lorenzo >> > >> >> THE LIBRARY >> >> >> >> C++ provides runtime polymorphism through virtual functions. They are >> >> a very useful feature, but they do have some limitations. >> >> * They are intrusive. In generic programming, we can design an >> >> interface which allows third-party types to be adapted to it. >> >> * They require dynamic memory management. Of course, most of the >> >> problems can be avoided by using an appropriate smart pointer type. >> >> Even so, it still acts like a pointer rather than a value. >> >> * Virtual functions' ability to apply multiple independent concepts to >> >> a single object is limited. >> >> The Boost.TypeErasure library solves these problems allowing us to >> >> mirror static generic programming at runtime. >> >> >> >> Library source: >> >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >> >> >> >> Pre-built documentation: >> >> >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >> >> >> >> You can also download archives with pre-built documentation from: >> >> http://sourceforge.net/projects/steven-watanabe.u/files/ >> >> >> >> YOUR REVIEW >> >> >> >> Please submit a review to the mailing-list by replying to this email >> >> ("[boost] [type_erasure] Review ..." should be in the subject). >> >> >> >> Please state clearly whether you think this library should be accepted >> >> as a Boost library. >> >> >> >> Other questions you may want to consider: >> >> 1. What is your evaluation of the design? >> >> 2. What is your evaluation of the implementation? >> >> 3. What is your evaluation of the documentation? >> >> 4. What is your evaluation of the potential usefulness of the library? >> >> 5. Did you try to use the library? With what compiler? Did you have >> >> any problems? >> >> 6. How much effort did you put into your evaluation? A glance? A >> >> quick reading? In-depth study? >> >> 7. Are you knowledgeable about the problem domain? >> >> >> >> Thanks in advance to all who participate in the review discussion -- >> >> I'm looking forward to it! >> >

1 0

linker error
by Kraus Philipp 03 Aug '12

03 Aug '12

Hello, I have got some problems with linking some Boost libraries (1.50) on OSX The linker shows: boost::detail::sp_counted_impl_p<boost::exception_detail::clone_impl<boost::exception_detail::bad_alloc_> >::~sp_counted_impl_p()in test.o boost::detail::sp_counted_impl_p<boost::exception_detail::clone_impl<boost::exception_detail::bad_exception_> >::~sp_counted_impl_p()in test.o boost::system::error_category::~error_category()in test.o boost::detail::sp_counted_base::~sp_counted_base()in test.o boost::exception_detail::clone_base::~clone_base()in test.o boost::exception_detail::clone_impl<boost::exception_detail::bad_exception_>::clone() constin test.o boost::exception_detail::clone_impl<boost::exception_detail::bad_exception_>::~clone_impl()in test.o boost::system::system_error::~system_error()in test.o boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::thread_resource_error> >::~clone_impl()in test.o boost::thread_exception::~thread_exception()in test.o boost::thread_resource_error::~thread_resource_error()in test.o boost::exception_detail::bad_exception_::~bad_exception_()in test.o and with ASIO "std::basic_streambuf<char, std::char_traits<char> >::pbackfail(int)", referenced from: vtable for boost::asio::basic_streambuf<std::allocator<char> >in twitter.o vtable for boost::iostreams::detail::linked_streambuf<char, std::char_traits<char> >in twitter.o vtable for boost::re_detail::parser_buf<char, std::char_traits<char> >in twitter.o "std::basic_ostream<char, std::char_traits<char> >& std::__ostream_insert<char, std::char_traits<char> >(std::basic_ostream<char, std::char_traits<char> >&, char const*, long)", referenced from I', using boost thread, iostreams, filesystem, exception an aiso. The exception library is linked with the static option, other dynamic. Which is the correct order to solve the dependency error? Can anybody help me to solve this problem? Thanks Phil

3 2

boost::graph subgraph + write_graphviz()
by Chris Cooper 03 Aug '12

03 Aug '12

Hi, I'm trying to output an image showing subgraphs [0] using write_graphviz() in boost 1.48.0. I've tried to modify an example [1] by adding a write_graphviz() call. eg... std::ofstream ofs("out.dot"); const char* names[] = { "A", "B", "C", "D", "E", "F" }; write_graphviz(ofs, G0.m_graph, make_label_writer(names)); This works fine for displaying the underlying graph, but no subgraphs are shown. When I do the following... write_graphviz(ofs, G0, make_label_writer(names)); I get a host of errors including... include/boost/graph/graphviz.hpp:377: error: no matching function for call to ‘get(boost::label_writer<const char**>&, Vertex&)’ I notice a comment in graphviz.hpp [2] 'requires graph_name graph property' so I had a look at the subgraph_properties.cpp example [3]. This seemed to only be showing vertex properties but didn't compile out of the box. Is it possible for someone experienced in boost::graph to post a modified version of [1] that can produce something like image [0], or point me in the right direction? Thanks, Chris [0] http://www.boost.org/doc/libs/1_48_0/libs/graph/doc/figs/subgraph.gif [1] http://www.boost.org/doc/libs/1_48_0/libs/graph/example/subgraph.cpp [2] http://www.boost.org/doc/libs/1_48_0/boost/graph/graphviz.hpp [3] http://www.boost.org/doc/libs/1_48_0/libs/graph/example/subgraph_properties…

2 7

Re: [Boost-users] Using <boost/math/distributions/non_central_t.hpp> gives unexpected error
by Neil Nelson 02 Aug '12

02 Aug '12

gcc-3.8 is referenced on the net in posts early in 2005. Looks like the latest MinGW release http://sourceforge.net/projects/mingw/files/MinGW/Base/gcc/Version4/gcc-4.6… has gcc-4.6. The latest MinGW release could assist in a variety of areas including this one. Neil Nelson

1 0

Using <boost/math/distributions/non_central_t.hpp> gives unexpected error
by Avinash K. Hathiramani 02 Aug '12

02 Aug '12

Hello, I am new to using the Boost libraries and I was very happy to see that there is a non-central t distribution class in Boost (I have not managed to find this anywhere else). Unfortunately I am not able to use this without getting an error. Here is my code: #include <boost/math/distributions/non_central_t.hpp> using namespace std; double nu = 3.0; double delta = 3.0; double x = 3.0; boost::math::non_central_t_distribution<double> nct(delta, nu); double test_pdf = pdf(nct, x); double test_cdf = cdf(nct, x); cout << "Probability density of Student's t is " << test_cdf << endl; cout << "Cumulative probability of Student's t is " << test_cdf << endl; This does not give any results and if I put in an error catch here, I get the following message: "Error in function boost::math::gamma_p_derivative<e>(e, e): numeric overflow". I do not follow what is going wrong and I am able to get results for both the CDF and PDF with the same parameters from MATLAB (and an on-line calculator which I found for this distribution), so I do not think that the parameters are invalid. I would be grateful if anyone can advise me as to whether I am doing anything incorrectly here. I apologise in advance if I have missed anything obvious, or unintentionally broken any of the discussion policies (it is my first time posting on this forum). Thank you in advance for your help. Kind regards, Avinash

3 5

Re: [Boost-users] [boost] [type_erasure] Review ends today July 27, 2012
by Hossein Haeri 02 Aug '12

02 Aug '12

Hi Dave, > 1. Type erasure is Java's only answer for genericity, which is bad for > performance. > > 2. Java does all its type erasure one object at a time, which leads to > the dreaded binary method problem. Well, these, AFAICU, make a distinctive difference. And, the distinction doesn't stop here: For example, Java's type erasure has a nasty effect on overload resolution too. > Steven's library supports something a lot more like Haskell's > implementation of generics. Which is why I suggested calling it "staged typing"/"deferred typing". Cheers, --Hossein

1 0

Announce: Boost 1.50 installer for 32-bit Windows now available
by John Wiegley 01 Aug '12

01 Aug '12

With apologies to the community for not finding the time to release Windows installers for 1.48 and 1.49, we now have an installer for 1.50 available for immediate download: http://www.boostpro.com/download The version installs 32-bit libraries and/or DLLs for the following compilers: Visual C++ 8.0 (Visual Studio 2005) Visual C++ 9.0 (Visual Studio 2008) Visual C++ 10.0 (Visual Studio 2010) We are dropping support for Visual C++ 7.1 as of this time, unless someone wishes to contract us to bring it back. Also, although I have prepared a 64-bit installer, I have not yet found a solution for integrating it with the existing installer. If anyone with NSIS scripting experience would be willing to assist me, we'd be happy to provide a free installer which installs both 32-bit and 64-bit Boost libraries for applicable Windows platforms. Enjoy! -- John Wiegley BoostPro Computing Software Development Training http://www.boostpro.com Clang/LLVM/EDG Compilers C++ Boost

1 1

boost::filesystem question
by Arno 01 Aug '12

01 Aug '12

Hi all, is it possible to find out the Windows short name of a valid Windows path and/or vise versa? We are using Boost 1.42 at the moment. best regards Arno

4 4

[fusion] for_each with indices
by Agustín K-ballo Bergé 01 Aug '12

01 Aug '12

I recently needed to iterate over a fusion sequence, calling a function for each element that depends not only on the element type but on its index (position within the sequence) as well. I didn't find anything readily available to use in conjunction with for_each, so I ended up using fold with the index as state. However, I would like to get the index as a compile time value. What would be the simpler/best way to do this? Creating an iterator adaptor that keeps track of advances to the base iterator (should I be using the iterator_facade extension mechanism)? Or perhaps zipping the sequence with some kind of infinite mpl::vector_c sequence? Agustín K-ballo Bergé.- http://fusionfenix.com

3 3

Pool memory and std::forward_list
by Claude 01 Aug '12

01 Aug '12

Hi! I would create a memory pool for the node of a C++11 forward_list. It is possible use the BOOST pool memory with std::forward_list? -- View this message in context: http://boost.2283326.n4.nabble.com/Pool-memory-and-std-forward-list-tp46338… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Segfault when using date_time
by Sara Siegal 01 Aug '12

01 Aug '12

I attempted to rebuild my Boost installation with nanosecond support for the date-time library. I did so by adding BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG = 1 ; to boost-build.jam and adding <define>BOOST_DATE_TIME_POSIX_TIME_STD_CONFIG to the jamfile in date_time/build. However, when I add this code to my application and compile, it segfaults: boost::posix_time::time_duration time1, time2; time1=boost::posix_time::seconds(3); std::cout << boost::posix_time::to_simple_string(time1) << std::endl; time2=boost::posix_time::nanoseconds(987654321); std::cout << boost::posix_time::to_simple_string(time2) << std::endl; boost::this_thread::sleep(time2); The segfault is at /archive/home/ssiegal/test/include/boost/date_time/posix_time/posix_time_config.hpp:99: (gdb) list 94 { 95 typedef gregorian::date date_type; 96 typedef time_duration time_duration_type; 97 simple_time_rep(date_type d, time_duration_type tod) : 98 day(d), 99 time_of_day(tod) 100 { 101 // make sure we have sane values for date & time 102 if(!day.is_special() && !time_of_day.is_special()){ 103 if(time_of_day >= time_duration_type(24,0,0)) { Anyone else ever see this? Is there anything else I need to do to turn on nanosecond resolution? Thanks very much!

3 2

[boost] [type_erasure] Review ends today July 27, 2012
by Lorenzo Caminiti 01 Aug '12

01 Aug '12

Hello all, On Mon, Jul 23, 2012 at 9:09 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: > On Wed, Jul 18, 2012 at 1:13 AM, Lorenzo Caminiti <lorcaminiti(a)gmail.com> wrote: >> *** The review of Steven Watanabe's proposed Boost.TypeErasure library >> begins on July 18, 2012 and ends on July 27, 2012. *** > > *** Boost.TypeErasure review ends in 5 days. Please submit your reviews :D *** *** Boost.TypeErasure review ends today July 27, 2012. If you are planning to submit a review, please do so as soon as possible. *** Thank you to everyone who has commented on the library and submitted a review so far! The review manager, --Lorenzo P.S. I am considering extending the review until end of day Sunday July 29, 2012... I will keep you posted. > There have been interesting discussions on the library on the ML but I > have not received any official review yet :( Especially if you are a > user of Boost Any, Function, and Any Iterator, you definitely want to > take a look at Type Erasure as it generalizes solutions provided by > those other libraries. > > Thank you. > > The review manager. > --Lorenzo > >> THE LIBRARY >> >> C++ provides runtime polymorphism through virtual functions. They are >> a very useful feature, but they do have some limitations. >> * They are intrusive. In generic programming, we can design an >> interface which allows third-party types to be adapted to it. >> * They require dynamic memory management. Of course, most of the >> problems can be avoided by using an appropriate smart pointer type. >> Even so, it still acts like a pointer rather than a value. >> * Virtual functions' ability to apply multiple independent concepts to >> a single object is limited. >> The Boost.TypeErasure library solves these problems allowing us to >> mirror static generic programming at runtime. >> >> Library source: >> http://svn.boost.org/svn/boost/sandbox/type_erasure/ >> >> Pre-built documentation: >> http://steven_watanabe.users.sourceforge.net/type_erasure/libs/type_erasure/ >> >> You can also download archives with pre-built documentation from: >> http://sourceforge.net/projects/steven-watanabe.u/files/ >> >> YOUR REVIEW >> >> Please submit a review to the mailing-list by replying to this email >> ("[boost] [type_erasure] Review ..." should be in the subject). >> >> Please state clearly whether you think this library should be accepted >> as a Boost library. >> >> Other questions you may want to consider: >> 1. What is your evaluation of the design? >> 2. What is your evaluation of the implementation? >> 3. What is your evaluation of the documentation? >> 4. What is your evaluation of the potential usefulness of the library? >> 5. Did you try to use the library? With what compiler? Did you have >> any problems? >> 6. How much effort did you put into your evaluation? A glance? A >> quick reading? In-depth study? >> 7. Are you knowledgeable about the problem domain? >> >> Thanks in advance to all who participate in the review discussion -- >> I'm looking forward to it!

4 4

[Boost.Move] Conflict between std::move and boost::move (Boost 1.49.0)
by Jonathan Jones 01 Aug '12

01 Aug '12

Hi folks, Consider the following code (which distilled from a real world example): #include <boost/move/move.hpp> #include <boost/optional/optional.hpp> #include <utility> #include <vector> typedef boost::optional<int> data_type; typedef std::vector<data_type> vector_type; vector_type func() { vector_type vv; return move(vv); } If I compile this code using Boost 1.49 on Visual Studio 2010, or on a recent version of g++ (e.g. 4.7.1) which supports some C++11 features, the code fails to compile, complaining about ambiguity between std::move and boost::move. Strangely, the code compiles fine with Apple Clang version 3.1. Is there a way to work around the compilation problem which doesn't involve explicitly qualifying the calls to move? I'd prefer to use argument-dependent-lookup. Removing the includes of boost/move.hpp is not possible. In the real world example, that header is included indirectly. I did notice that if I define the macro BOOST_MOVE_USE_STANDARD_LIBRARY_MOVE, the compilation errors disappear. Is this the correct approach for compilers which support std::move? I find it odd that this macro isn't already defined for such compilers. Thanks in advance! Jon

5 4

accumulators: not copying doubles into the acc set
by MM 01 Aug '12

01 Aug '12

Hello, Having a list of doubles stored somewhere, is there a way not to copy the doubles into the accumulator set and just iterate somehow through the existing data in order to save memory. Imagine I have a std::vector<double> with 10million entries. Then pushing each double to the accumulator set object, then I'd imagine, at one point, the process would hold the 10 million doubles twice. Rds, MM

3 3

about how to install mpi of the boost1.49
by Kazuhide Ota 01 Aug '12

01 Aug '12

Dear all, Hello all, My name is Kazuhide Ota. I tryied to install boost1.49, but I got a problem. When I tried to install it on cygwin, I ran bootstrap.sh and bjam.exe, and I received the following message: <message> warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. MPI is necessary for me, so I added "using mpi : mpic++ ;" to user-config.jam in /boost_1_49_0/tools/build/v2, and I ran bjam.exe again. However, I received the same message. Did I edit the different file? If someone know hot to solve this problem, could you teach me? Best regards, Kazuide Ota

1 0

program_options save config example
by Neil Nelson 01 Aug '12

01 Aug '12

This post goes toward providing a config or log file output of the input to Boost program_options. This was a requested capability but apparently without further work. See the lines under 'config out:' at the end. http://boost.2283326.n4.nabble.com/program-options-save-configuration-td256… The following Boost any page provides methods to convert the any values upon iterating the vm map. http://www.boost.org/doc/libs/1_50_0/doc/html/any/s02.html // program_options_wrapper.hpp // Latest boost program_options: // See http://boost-sandbox.sourceforge.net/doc/html/program_options.html // See http://svn.boost.org/svn/boost/trunk/libs/program_options/example/ #ifndef PROGRAM_OPTIONS_WRAPPER_HPP #define PROGRAM_OPTIONS_WRAPPER_HPP #include <boost/any.hpp> #include <boost/program_options.hpp> #include <string> namespace po = boost::program_options; class program_options_wrapper { public: po::variables_map vm; po::options_description cmd_line; po::options_description config; po::options_description hidden; po::options_description version; po::options_description all; // Singleton static program_options_wrapper& instance() { static program_options_wrapper instance_; return instance_; } bool initialize(int argc, char **argv); private: std::string config_file; // Singleton helpers program_options_wrapper() {} program_options_wrapper(program_options_wrapper const& copy); program_options_wrapper& operator=(program_options_wrapper const& copy); bool is_empty(const boost::any & operand); bool is_int(const boost::any & operand); bool is_double(const boost::any & operand); bool is_char_ptr(const boost::any & operand); bool is_string(const boost::any & operand); // void get_typeid(const boost::any & operand); }; // class program_options_wrapper #endif // #define PROGRAM_OPTIONS_WRAPPER_HPP // program_options_wrapper.cpp #include <boost/any.hpp> #include <boost/program_options.hpp> #include <string> #include <vector> #include <fstream> #include "program_options_wrapper.hpp" namespace po = boost::program_options; bool program_options_wrapper::initialize(int argc, char **argv) { version.add_options() ("version: program_options.cpp", "1.0") ("version: program_options.hpp", "1.0") ; cmd_line.add_options() ("help,h", "produce help message") ("version,v", "list component versions") ("config,c", "configuration file name") ("report,r", "report run options") ("vector,x", boost::program_options::value<std::vector<std::string> >(), "test string vector") ("double,d", boost::program_options::value<double>(), "test double") ; all.add(cmd_line).add(config).add(hidden); // po::store(po::parse_command_line(argc, argv, cmd_line), vm); // po::notify(vm); po::parsed_options parsed = po::command_line_parser(argc, argv).options(cmd_line).allow_unregistered().run(); po::store(parsed, vm); // po::store(po::command_line_parser(argc, argv).options(cmd_line).allow_unregistered().run(), vm); po::notify(vm); if (vm.count("config")) { std::ifstream ifs(config_file.c_str()); if (!ifs) { std::cout << "can not open config file: " << config_file << std::endl; return false; } else { po::store(parse_config_file(ifs, config), vm); po::notify(vm); } } if (vm.count("help")) { std::cout << all; return false; } if (vm.count("version")) { std::cout << version; return false; } if (vm.count("report")) { std::cout << all; std::cout << version << std::endl; std::cout << "command-line:"; for(int j=0;j<argc;j++) std::cout << " " << argv[j]; std::cout << std::endl << std::endl; std::cout << "config out:" << std::endl; for (po::variables_map::iterator it=vm.begin(); it != vm.end(); it++ ) { if (is_empty(it->second.value())) std::cout << "# " << it->first << "=is_empty" << std::endl; if (vm[it->first].defaulted()) std::cout << "# " << it->first << "=is_defaulted" << std::endl; if (is_int(it->second.value())) std::cout << it->first << "=" << vm[it->first].as<int>() << std::endl; else if (is_double(it->second.value())) std::cout << it->first << "=" << vm[it->first].as<double>() << std::endl; else if (is_char_ptr(it->second.value())) std::cout << it->first << "=" << vm[it->first].as<const char *>() << std::endl; else if (is_string(it->second.value())) { std::cout << it->first << "="; std::string temp = vm[it->first].as<std::string>(); if (temp.size()) std::cout << temp << std::endl; else std::cout << "true" << std::endl; } else { // Assumes that the only remainder is vector<string> std::vector<std::string> poVector = vm[it->first].as<std::vector<std::string> >(); for (std::vector<std::string>::iterator vecIt=poVector.begin() ; vecIt != poVector.end(); vecIt++ ) std::cout << it->first << "=" << (*vecIt) << std::endl; } } std::vector<std::string> unrecognized_options = po::collect_unrecognized(parsed.options, po::include_positional); if (unrecognized_options.size()) { std::cout << std::endl << "unrecognized options:"; for (int j=0;j<unrecognized_options.size();j++) std::cout << " " << unrecognized_options[j]; std::cout << std::endl; } std::cout << std::endl; } return true; } bool program_options_wrapper::is_empty(const boost::any & operand) { return operand.empty(); } bool program_options_wrapper::is_int(const boost::any & operand) { return operand.type() == typeid(int); } bool program_options_wrapper::is_double(const boost::any & operand) { return operand.type() == typeid(double); } bool program_options_wrapper::is_char_ptr(const boost::any & operand) { try { boost::any_cast<const char *>(operand); return true; } catch(const boost::bad_any_cast &) { return false; } } bool program_options_wrapper::is_string(const boost::any & operand) { return boost::any_cast<std::string>(&operand); } /* void program_options_wrapper::get_typeid(const boost::any & operand) { std::cout << operand.type().name() << std::endl; } */ // test.cpp /* program_options.o: program_options_wrapper.hpp program_options_wrapper.cpp g++-4.7 -g -c -Wall -std=c++11 program_options_wrapper.cpp -o \ program_options_wrapper.o test: test.cpp program_options_wrapper.o g++-4.7 -Wall -g -std=c++11 test.cpp -o test \ program_options_wrapper.o -lboost_program_options */ #include <boost/program_options.hpp> #include <iostream> #include "program_options_wrapper.hpp" int main(int argc, char **argv) { auto& po_wrap = program_options_wrapper::instance(); po_wrap.version.add_options()("version: build_state_tree.cpp", "1.0"); if (!po_wrap.initialize(argc, argv)) exit(0); return 1; } // test output -h [ --help ] produce help message -v [ --version ] list component versions -c [ --config ] configuration file name -r [ --report ] report run options -x [ --vector ] arg test string vector -d [ --double ] arg test double --version: build_state_tree.cpp 1.0 --version: program_options.cpp 1.0 --version: program_options.hpp 1.0 command-line: ./build_state_tree -r -x str1 -x str2 -d 345.67 -z testing config out: double=345.67 report=true vector=str1 vector=str2 unrecognized options: -z testing Neil Nelson

1 0

[context / coroutine] linker errors
by Szymon Gatner 31 Jul '12

31 Jul '12

I grabbed coroutine lib from http://olk.bplaced.net/boost-coroutine.zip and I am getting linker errors with VC2008 SP1 when trying to compile simplest example from coroutine's documentation: Error 1 error LNK2019: unresolved external symbol _jump_fcontext referenced in function "public: int __thiscall boost::coro::detail::context_base<void __cdecl(void),class boost::ctx::stack_allocator,void,0>::native_start(void)" (?native_start@?$context_base@$$A6AXXZVstack_allocator@ctx@boost@@X$0A@@detail@coro@boost@@QAEHXZ) main_2.obj context Error 2 error LNK2019: unresolved external symbol _make_fcontext referenced in function "public: __thiscall boost::coro::detail::context_base<void __cdecl(void),class boost::ctx::stack_allocator,void,0>::context_base<void __cdecl(void),class boost::ctx::stack_allocator,void,0>(class boost::ctx::stack_allocator const &,unsigned int,enum boost::coro::flag_unwind_t,bool)" (??0?$context_base@$$A6AXXZVstack_allocator@ctx@boost@@X$0A@@detail@coro@boost@@QAE@ABVstack_allocator@ctx@3@IW4flag_unwind_t@23@_N@Z) main_2.obj context btw, old documentation link (http://ok73.ok.funpic.de/boost/libs/context/doc/html/) for boost.context does not work anymore and I remember it had continuation example which is not included in library examples. Any way to get it back? -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

2 1

Re: [Boost-users] Boost 1.49 msm And_ operator
by Kamel Zaarouri, Mr 30 Jul '12

30 Jul '12

Hi, I know this may seem silly but is there an operator that I can use to combine actions in the transition table to same way I can "and" guard conditions? if I have 2 guards, g1 and g2 in the transition table I can write under guard And_<g1,g2> what if I want to execute 2 actions upon a transition, obviously I can't have And_<a1,a2> since actions do not return boolean. Any idea? Thanks. ________________________________________ From: boost-users-bounces(a)lists.boost.org [boost-users-bounces(a)lists.boost.org] on behalf of Christophe Henry [christophe.j.henry(a)googlemail.com] Sent: Wednesday, July 11, 2012 4:17 PM To: boost-users(a)lists.boost.org Subject: Re: [Boost-users] Boost 1.49 msm problems with events > Hi, I am having problems with my transition table and events. Let me > explain the fake design that illustrates the problem: > > I have a state machine (myStateMachine) containing 2 states (s0 and s1) > and 1 substatemachine (subm1). > > the substatemachine subm1 contains an initial state 'sub0' and also s1 > (the same state as in myStateMachine). > > this is the main transition table: > > s0->s1 on event 'ES1' > s0->s2 on event 'ES2' > s0->subm1 on event 'ESUB' > > this is the submachine transition table: > > sub0->s1 on event ES1 > > now, assume that state s1 is using the event that triggered it to extract > some information i.e. > > struct s1 : public msm::front::state<> > { > template <class Event,class FSM> > void on_entry(Event const& evt,FSM& fsm) > { > evt.getEventData(); > } > } > so every event that could transition to s1 needs to implement > getEventData() method. > > ->this is normal! > > now my problem is that ESUB does NOT implement getEventData() but > apparently it should. And I don't get why. > > I am not using ESUB to transition to s1 but I am using ESUB to transition > to subm1 and subm1 contains s1 but I don't access it at that point. > > I hope this is clear. > > Thank you. Hi, this is an unfortunate limitation of msm (for composites), which I have on my list of stuff to solve asap. The problem is that though the event esub is not used to transition to s1, for the compiler it could. Whatever, it's my fault, plus I forgot it in the doc :( The solution is to help the compiler a bit by enabling on_entry with evt.getEventData() only for events having a special property, like your es1. For example: BOOST_MPL_HAS_XXX_TRAIT_DEF(get_event_data) // this event supports getEventData struct es1 { typedef int get_event_data; void getEventData(){...} }; Then use this in your state: struct s1 : public msm::front::state<> { template <class Event,class FSM> typename boost::enable_if<typename has_get_event_data<Event>::type,void>::type on_entry(Event const& evt,FSM& fsm) { evt.getEventData(); } // for events not supporting getEventData like esub template <class Event,class FSM> typename boost::disable_if<typename has_get_event_data<Event>::type,void>::type on_entry(Event const& ,FSM& ) { } }; HTH, Christophe _______________________________________________ Boost-users mailing list Boost-users(a)lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users

2 1

Can I copy/paste Boost source code and compile directly into my application?
by Fred 29 Jul '12

29 Jul '12

Dear Boosters, I would like to use the Boost/regex library in my application, but I don't want my users to have to install Boost. My preference would be to copy a minimal set of Boost .hpp and .cpp files into a sub-directory of my application and then compile and link the boost/regex stuff in the same way as the rest of my application. Note that the regex library is not a header-only library. So, is there a reasonably straight-forward and well-accepted procedure to do this? Apologies if this topic has already been covered, but I can't seem to get a hit. Many thanks, Fred

6 7

Boost Python: add_property and shared_ptr
by Raul Durand 29 Jul '12

29 Jul '12

Hi! I've been using the boost::python library for some time with few problems but now I got stuck. Fortunately I isolated the problem. In the class Domain below I defined a property called solver which returns a shared_ptr<Solver> instance: *namespace bp=boost::python;** **class Solver **{ **public: ** bool _b; ** void func() { _b = true; } **};** **typedef shared_ptr<Solver> Solver_ptr;** ** class Domain **{ **public: ** Solver_ptr solver; ** void set_solver(Solver_ptr s) { solver = s; } **};** **typedef shared_ptr<Domain> Domain_ptr;** ** BOOST_PYTHON_MODULE(test) {** * * bp::class_<Solver, Solver_ptr>("Solver")* * .def("func", &Solver::func)* * ;* * bp::class_<Domain, Domain_ptr>("Domain")* * .def("set_solver" , &Domain::set_solver)* * .add_property("solver" , &Domain::solver)* * ;* *}* The code compiles ok. The problem appears while running in Python: *from test import * **d = Domain() **s = Solver() **d.set_solver(s) # is it ok to do that? **d.solver.func() # this line does not work* With the following error message: *Traceback (most recent call last):* * File "test_test.py", line 5, in <module>* * d.solver.func()* *Boost.Python.ArgumentError: Python argument types in* * Solver.func(Solver)* *did not match C++ signature:* * func(Solver {lvalue})* I suspect that the problem is related with add_property returning a shared_ptr<Solver> aka Solver_ptr. It seems that add_property is returning a *non lvalue* Solver object. I tried applying return value policies with no luck. How can I get Domain::solver with type Solver_ptr in Python as a lvalue ? Thanks! Raul Durand

1 0

[Iterator] swap and iter_swap do not work with zip_iterator
by Benjamin Lindley 28 Jul '12

28 Jul '12

I wanted to use zip_iterator to concurrently sort two arrays by the values in one of them. It didn't work. Most of the values were over-written by one of the pairs. I figured out that there was a problem with the swapping, so I made this small test case. Compiled with GCC 4.6.1 on Ubuntu 11.10 #include <utility> #include <iostream> #include <boost/iterator/zip_iterator.hpp> int main() { std::vector<int> a = { 1, 2 }; std::vector<int> b = { 100, 200 }; auto first = boost::make_zip_iterator( boost::make_tuple(a.begin(), b.begin())); auto last = boost::make_zip_iterator( boost::make_tuple(a.begin() + 1, b.begin() + 1)); std::cout << first->get<0>() << ' ' << last->get<0>() << '\n'; std::cout << first->get<1>() << ' ' << last->get<1>() << "\n\n"; using std::swap; using std::iter_swap; // swap(*first, *last); // doesn't compile iter_swap(first, last); std::cout << first->get<0>() << ' ' << last->get<0>() << '\n'; std::cout << first->get<1>() << ' ' << last->get<1>() << "\n\n"; } Output: 1 2 100 200 2 2 200 200 Expected Output: 1 2 100 200 2 1 200 100 Is this a known problem?

3 3

linking against boost libraries using a binary compatible compiler
by Petros 27 Jul '12

27 Jul '12

Hi, I am working on win7 with vs2010. Occasionally I want to compile with the windows intel compiler (icl, 12.1), whih is to be syntactically and binary fully compatible with the vs2010 (cl10.0). However, due to the “magic” that binds the boost code with the libraries to link against ( btw, where does this “magic” happen?), when I am building with intel, the intel libs are searched for. Building boost with the intel compiler on windows can have its moments, as witnessed by the repeated posts on the web . I would be perfectly happy with linking msvc-compiled boost with the rest of my code compiled with the intel compiler. How can this be done ? Has anyone done it ? (Someone must have thought of this – also saves from two separate builds of the boost libraries ) TVMIA, Petros

1 0

[boost] [fusion] fusion::map doesn't define 'category'
by Steve Lorimer 27 Jul '12

27 Jul '12

I am attempting to create a fusion map which looks like: map< pair<field1, int>, pair<field2, int> > I am then attempting to find out if *field1 *exists in the map using *has_key, *but am getting a compile error: error: no type named ‘category’ in ‘struct boost::fusion::result_of::as_map<boost::fusion::vector2<boost::fusion::pair<field1, int>, boost::fusion::pair<field2, int> > > Can anyone offer insight on what I'm doing wrong? I have a simple example below: #include <iostream> #include <boost/fusion/container.hpp> #include <boost/fusion/sequence.hpp> #include <boost/fusion/mpl.hpp> #include <boost/fusion/include/has_key.hpp> #include <boost/mpl/transform.hpp> namespace fusion = boost::fusion; namespace mpl = boost::mpl; *// given a field, returns a fusion pair of <field, field::type>* template<class field> struct make_pair { typedef typename fusion::result_of::make_pair<field, typename field::type>::type type; }; *// given a sequence of fields, returns a fusion map which maps field -> field::type* template<class fields> struct make_map { typedef typename mpl::transform<fields, make_pair<mpl::_1>>::type pair_sequence; typedef typename fusion::result_of::as_map<pair_sequence> type; }; *// sets boolean value to true if field is in fields* template <class field, class... fields> struct contains_key { typedef typename boost::fusion::vector<fields...> vector; typedef typename make_map<vector>::type map; typedef typename fusion::result_of::has_key<map, field>::type result; static const bool value = result(); }; struct field1 { typedef int type; }; struct field2 { typedef int type; }; int main() { std::cout << contains_key<field1, field1, field2>::value << std::endl; return 0; }

2 2

[boost] [fusion] Find the index of an item in a fusion map
by Steve 27 Jul '12

27 Jul '12

I have a fusion map in a class which I want to initialize with a variadic constructor template<typename... Args> ctor(Args... args) { ..... } I imagine I would create a fusion vector using make_vector and then iterate over the elements of the map and somehow set the value of each map pair to it's corresponding element in the vector. I think that if I could find the index position of a single element in the map, that I could then use for_each to iterate over the pairs, and use the item's index to retrieve the corresponding value from the vector. Can anyone help me with this? Perhaps there is an alternate better way to do this? TIA Steve

1 0

[Serialization and C++11] Using std::unique_ptr with boost::serialization
by berenger.morel＠neutralite.org 26 Jul '12

26 Jul '12

Hello. I am trying to serialize a node of a DP composite. This would probably be straightforward if I used raw pointers, but I am using std::unique_ptr. I am not sure it is possible, since I tried to find the word unique_ptr in my /usr/include/boost directory and found almost nothing (except interprocess and chrono which have been installed for other purposes). So, is there is a way to use serialization on unique_ptr, or is there is a reason to avoid doing this? Note: I have made some tries with using boost::serialization on my objects as if they were raw pointers and it have obviously failed, because expected type seems to be only raw pointer and unique_ptr is not compatible with it.

2 1

[BGL] inv_adjacency_iterator is missing in graph_traits.hpp
by Johan Oudinet 26 Jul '12

26 Jul '12

Hi, I have a bidirectional adjacency list and I want to use the inv_adjacent_vertices method However, the following code does not compile: typedef boost::graph_traits<Graph> Traits; typedef typename Traits::inv_adjacency_iterator inv_adjacency_iterator; inv_adjacency_iterator w, w_end; boost::tie (w, w_end) = inv_adjacent_vertices (v, g_); The problem is that inv_adjacency_iterator is not part of boost::graph_traits :-( Could you tell me how can I use the inv_adjacent_vertices method (i.e., how can I declare an inv_adjacent_iterator)? Thanks. Best regards, P.S.: I tried to use an adjacency_iterator instead but it does not work. -- Johan () ascii ribbon campaign - against html e-mail /\ www.asciiribbon.org - against proprietary attachments

2 2

Boost 1_50 does not get installed
by Panagiotis Foteinos 26 Jul '12

26 Jul '12

Greetings. I invoke ./b2 variant=release and everything seems to be fine. I can see that the thread library is created inside under $SOURCE/bin.v2/libs . Nevertheless, the command ./b2 install does not copy the libraries under /usr/local. It does nothing. All I see is many warnings similar to: **************************** skipped bin.v2/libs/thread/build/gcc-4.4.3/release/link-static for lack of bin.v2/libs/thread/build/gcc-4.4.3/release... **************************** Any ideas? Regards, Panagiotis Foteinos OS: Ubuntu, gcc 4.4.3, 64 bits

2 4

[math/distributions] invalid values for undefined moments
by Thomas Mang 26 Jul '12

26 Jul '12

Hi, According to the documentation, in boost 1-50 non-member functions of moments (e.g. mean, variance) which are not defined for a given distribution shall issue compile-time errors, or throw a domain_error at runtime otherwise. For the Cauchy Distribution, that's what it does. For the t-distribution, that's not what it does - the non-member functions happily return some complete rubbish values for mean and variance (and hence I'd also suppose standard deviation). For kurtosis and skewness it seems to work correctly but are subject to mathematical definitions. I have not tested other non-member functions. Note that there are different definitions floating around as to when a given moment is defined. The k-th moment is always defined if k < v, but in other cases opinions deviate. Wikipedia states it might be infinity under some circumstances - obviously what boost seems to having taken over. In general however I am used to - and my gut feeling the clear majority of people would have this perception; indeed I am not aware of any other source than wikipedia stating these infinity things - that moments are undefined if k >= v (see e.g. Probability and Statistics, DeGroot & Schervish 2002, for a professional textbooks and heaps of other sources). So while the boost output for variance and a t-2 distribution (or alternatively also the kurtosis of a t-4 distribution) might be considered ok by some, I'd guess to most people it would be fairly unexpected? It had been a surprise to me, at least. Code snippet: typedef boost::math::students_t_distribution<double> t_distr; // this is ok std::cout << "mean(t(2)): " << boost::math::mean( t_distr(2) ) << std::endl; // this is NOT ok - first moment not defined for given distribution std::cout << "mean(t(1)): " << boost::math::mean( t_distr(1) ) << std::endl; // this is ok std::cout << "var(t(3)): " << boost::math::variance( t_distr(3) ) << std::endl; // this might be ok or not // depending on point of view, either Inf or undefined std::cout << "var(t(2)): " << boost::math::variance( t_distr(2) ) << std::endl; // this is NOT ok - second moment not defined for the given distribution std::cout << "var(t(1)): " << boost::math::variance( t_distr(1) ) << std::endl; best, Thomas

2 1

Building Boost in Release mode
by VimalMathew＠Eaton.com 25 Jul '12

25 Jul '12

Hi, How do I build Boost in 'Release' mode for VS 10.0? Is this correct: b2 toolset=msvc-10.0 runtime-link=static link=static variant=release threading=multi -- Vimal

2 1

[MPI] all_gather() missing functionality or bug ?
by Thomas Hisch 25 Jul '12

25 Jul '12

Hello list, I discovered that the all_gather function from boost.mp throws an exception, if the local sizes of the to be gathered vector are different: terminate called after throwing an instance of 'terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::mpi::exception> >' what(): MPI_Allgather: MPI_ERR_IN_STATUS: error code in status boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::mpi::exception> >[thisch:14211] *** Process received signal *** I used the following form of the all_gather function: all_gather(comm, myvec.data(), myvec.size(), totalvec) where myvec is a std::vector<double>. As already mentioned the size of myvec can be different on each processor. The documentation [0] says that all_gather supports most uses of the MPI_Allgatherv. Therefore I am not sure if my use of all_gather is unsupported or a just a bug. all_gather works as excpected if myvec.size() is the same on all processors. ATM I use the following workaround: { //temporary all_gather fix: use MPI_Allgatherv vector<int> recvcts(numprocs); vector<int> displs(numprocs); const int nrealcoeffs = N; const int initialcoeffsperrank = nrealcoeffs/numprocs; const int remainder = nrealcoeffs%numprocs; size_t displtmp = 0; for(size_t i=0; i < numprocs; i++){ recvcts[i] = initialcoeffsperrank; if(i < remainder) recvcts[i]++; displs[i] = displtmp; displtmp += recvcts[i]; } allgradient.resize(N); MPI_Allgatherv( myvec.data(), myvec.size(), MPI_DOUBLE, totalvec.data(), recvcts.data(), displs.data(), MPI_DOUBLE, comm); } Regards Thomas [0] http://www.boost.org/doc/libs/1_50_0/doc/html/mpi/tutorial.html#mpi.c_mappi…

2 1

segfault happens when I serialize nested class in apache module
by Hassan Monfared 25 Jul '12

25 Jul '12

Hi all, Serializing simple class "A" in Apache module done without error but when I tried to serialize my complex object like "X" which has a member, type of "A", I got segfault in Apache module. ( this doesn't happen to a executable console application ) ------------------------- here is my code : --------------------- class A { private: friend class boost::serialization::access; // to enable boost "access" class to call private "serialize" method of class "A" template<class ArchT> void serialize(ArchT &ar, unsigned int version) { // method for both serializing and deserializing ar & memA; // (de)serialize member "memA" } std::string memA; // sample member public: A(){} A(std::string pmemA) : memA(pmemA) { } std::string GetMemA() { return memA; } }; class X { private: friend class boost::serialization::access; template<class ArchT> void serialize(ArchT &ar, unsigned int version) { ar & memX; ar & a; } std::string memX; A a; public: X(std::string pmemX, A pa) : memX(pmemX), a(pa) { } X(){} }; ------------------- string st=GetRandomFileName(); ofstream out(st.c_str()); boost::archive::text_oarchive out_r(out); A a("Amem"); X x("Xmem", a); out_r << x; // not works out_r << a; // works! ------------------- here is stack trace from gdb for apache ---------------- Program received signal SIGSEGV, Segmentation fault. 0xb39b846e in ?? () (gdb) backtrace #0 0xb39b846e in ?? () #1 0xb722379e in boost::serialization::typeid_system::extended_type_info_typeid_0::is_less_than(boost::serialization::extended_type_info const&) const () from /tmp/libIRSProWebApacheModule.so #2 0xb7223c61 in std::_Rb_tree<boost::serialization::typeid_system::extended_type_info_typeid_0 const*, boost::serialization::typeid_system::extended_type_info_typeid_0 const*, std::_Identity<boost::serialization::typeid_system::extended_type_info_typeid_0 const*>, boost::serialization::typeid_system::type_compare, std::allocator<boost::serialization::typeid_system::extended_type_info_typeid_0 const*> >::_M_insert_equal(boost::serialization::typeid_system::extended_type_info_typeid_0 const* const&) () from /tmp/libIRSProWebApacheModule.so #3 0xb7223b37 in boost::serialization::typeid_system::extended_type_info_typeid_0::type_register(std::type_info const&) () from /tmp/libIRSProWebApacheModule.so #4 0xb72066d2 in boost::serialization::extended_type_info_typeid<A>::extended_type_info_typeid (this=0xb735a638) at /usr/include/boost/serialization/extended_type_info_typeid.hpp:89 #5 0xb720650d in boost::serialization::detail::singleton_wrapper<boost::serialization::extended_type_info_typeid<A> >::singleton_wrapper (this=0xb735a638) at /usr/include/boost/serialization/singleton.hpp:106 #6 0xb7206572 in boost::serialization::singleton<boost::serialization::extended_type_info_typeid<A> >::get_instance () at /usr/include/boost/serialization/singleton.hpp:128 #7 0xb72064e3 in boost::serialization::singleton<boost::serialization::extended_type_info_typeid<A> >::get_const_instance () at /usr/include/boost/serialization/singleton.hpp:141 #8 0xb720637b in boost::archive::detail::oserializer<boost::archive::text_oarchive, A>::oserializer (this=0xb735a62c) at /usr/include/boost/archive/detail/oserializer.hpp:112 #9 0xb7206253 in boost::serialization::detail::singleton_wrapper<boost::archive::detail::oserializer<boost::archive::text_oarchive, A> >::singleton_wrapper (this=0xb735a62c) at /usr/include/boost/serialization/singleton.hpp:106 #10 0xb72062b8 in boost::serialization::singleton<boost::archive::detail::oserializer<boost::archive::text_oarchive, A> >::get_instance () at /usr/include/boost/serialization/singleton.hpp:128 #11 0xb71fb0ec in __static_initialization_and_destruction_1 (__initialize_p=1, __priority=65535) at /usr/include/boost/serialization/singleton.hpp:149 #12 0xb71fb161 in _GLOBAL__sub_I_IRSProWeb_InputFilter.cc(void) () at ../IRSProWeb_InputFilter.cc:242 #13 0xb7fee7fb in ?? () from /lib/ld-linux.so.2 #14 0xb7fee8e4 in ?? () from /lib/ld-linux.so.2 #15 0xb7ff2819 in ?? () from /lib/ld-linux.so.2 #16 0xb7fee61f in ?? () from /lib/ld-linux.so.2 #17 0xb7ff20c4 in ?? () from /lib/ld-linux.so.2 #18 0xb7d31be9 in ?? () from /lib/i386-linux-gnu/libdl.so.2 #19 0xb7fee61f in ?? () from /lib/ld-linux.so.2 #20 0xb7d3233a in ?? () from /lib/i386-linux-gnu/libdl.so.2 #21 0xb7d31c97 in dlopen () from /lib/i386-linux-gnu/libdl.so.2 #22 0xb7f3d100 in apr_dso_load (res_handle=0xbfffef08, path=0x8140b78 "/tmp/libIRSProWebApacheModule.so", pool=0x8140ab0) at dso/unix/dso.c:139 #23 0xb77587c7 in load_cpp_module (pool=0x8140ab0, server=0x8100ea8, server_rec=0x816dbc0, next=0x8140b50) at apache_handler.cpp:140 #24 0xb7757680 in load_handler (pool=0x8140ab0, server=0x8100ea8, server_rec=0x816dbc0, next=0x8140b50) at mod_cplusplus.c:83 #25 0xb77576d2 in load_handlers (pool=0x8140ab0, server=0x8100ea8, server_rec=0x816dbc0) at mod_cplusplus.c:89 #26 0xb7757737 in cpp_spawn_handlers (p=0x8140ab0, s=0x8100ea8) at mod_cplusplus.c:100 #27 0x0808b748 in ap_run_child_init (pchild=0x8140ab0, s=0x8100ea8) at config.c:166 #28 0x080af138 in child_main (child_num_arg=0) at event.c:2028 #29 0x080af464 in make_child (s=0x8100ea8, slot=0) at event.c:2169 #30 0x080af5ae in startup_children (number_to_start=3) at event.c:2233 #31 0x080afeba in event_run (_pconf=0x80dc0a8, plog=0x813caa0, s=0x8100ea8) at event.c:2561 #32 0x0806fa6d in ap_run_mpm (pconf=0x80dc0a8, plog=0x813caa0, s=0x8100ea8) at mpm_common.c:98 #33 0x08068fc4 in main (argc=2, argv=0xbffff3b4) at main.c:777

1 0

[interprocess] Strange behaviour after push_back in a b::i::vector of b::i::weak_ptr
by Gaetan Gaumer 24 Jul '12

24 Jul '12

Hello Ion a others interprocess guru, I'm currently using an interprocess::vector storing intreprocess::weak_ptr to data. Sometimes after adding a shared_ptr to my vector with push_back, the weak_ptr stored at the end of the vector is not the one I just inserted, but a copy of a previously inserted weak_ptr. For examples the code below : void addData (const SharableDataTypes<Data>::SharedPtrType & PData){ dataWPVector.push_back(PData); if (dataWPVector.rbegin()->lock()->getObjectId() != PData->getObjectId()){ std::cerr << "After pushback in dataWPVector vector last elem Id=" << dataWPVector.rbegin()->lock()->getObjectId() << " added cable Id =" << PData->getObjectId() << std::endl; } } spills the trace : "After pushback in dataWPVector vector last elem Id=50332165 added elem Id =352322053" which should obviously not happen. By adding some traces to the file : boost/interprocess/containers/container/vector.hpp I found that this case only happens during a resizing step when the method priv_range_insert_expand_backwards is used and in one of the 8 cases I labeled "4/8 and NOT do_after" (see http://pastebin.com/bLBwiBia line 41) For easier test, I created a sample code which try to reproduce the problem : http://pastebin.com/rdpZA7CU (Note : I used multiIndex to be the closest to our code). I compiled it with gcc44 (GCC) 4.4.0 20090514 (Red Hat 4.4.0-6) on a 64b Red Hat Enterprise Linux Server release 5.4 server using Boost V1.47 with the command : gcc44 -std=c++0x -m64 -I/path_to_boot/boost_1_47_0/include/ -lrt -lstdc++ testPushBackVector.cc -o testPushBackVector Note that this program does not reproduce the problem, as when it runs, only the priv_range_insert_new_allocation method is called. I don't know how to force the program to use priv_range_insert_expand_backwards to reproduce the problem. So now, the question : Am I doing something wrong or is this a bug ? Thanks for your help, Gaëtan

3 8

Conflict between boost::bind and winsock's bind function
by VimalMathew＠Eaton.com 24 Jul '12

24 Jul '12

Hi, I'm using winsock's bind function in my code. After adding a bunch of header files related to boost for some other added functionality, I'm getting this error: error C2668: 'boost::bind' : ambiguous call to overloaded function 1> c:\boost_1_49_0\boost\bind\bind.hpp(1480): could be 'boost::_bi::bind_t<R,F,L> boost::bind<SOCKET,sockaddr*,unsigned int>(F,A1,A2)' 1> with 1> [ 1> R=boost::_bi::unspecified, 1> F=SOCKET, 1> L=boost::_bi::list2<boost::_bi::value<sockaddr *>,boost::_bi::value<unsigned int>>, 1> A1=sockaddr *, 1> A2=unsigned int 1> ] How do I specify that I want to use winsock's bind function and not boost's? -- Vimal

2 1

Concept check negation
by Alexander Stoyan 24 Jul '12

24 Jul '12

Hi all, Is there any way to negate concept check, so that it'd be possible to assert if a type is NOT DefaultConstructible, etc. ? Thanks in advance. ============================== Never lose heart! Regards, Alexander Stoyan e-mail: alexander.stoyan, you know, at google mail dot com gtalk: alexander.stoyan, you know, at google mail dot com skype: alexander.stoyan <http://alexander-stoyan.blogspot.com/> http://alexander-stoyan.blogspot.com

2 1

Re: [Boost-users] Missing libboost_thread-vc100-mt-s-1_49.lib
by VimalMathew＠Eaton.com 24 Jul '12

24 Jul '12

Anybody? -- Vimal -----Original Message----- From: Mathew, Vimal Sent: Friday, July 20, 2012 2:32 PM To: boost-users(a)lists.boost.org Subject: Missing libboost_thread-vc100-mt-s-1_49.lib Hi, I'm trying to build a project using nmake. When I run nmake I get this error message: " LINK : fatal error LNK1104: cannot open file 'libboost_thread-vc100-mt-s-1_49.lib " Could someone tell me what I'm missing please? Thanks, Vimal

4 10

[move] case study: simple cloning smart pointer
by Krzysztof Czainski 24 Jul '12

24 Jul '12

Hello, In order to learn how to implement move semantics, I decided to write a simple cloning smart pointer (called ptr) with diagnostic information, and an example showing all constructor and assignment use cases I could think of. I wanted the pointer to be convertible (and movable) to pointers to base classes. I've prepared two versions of conversion constructors and assignment operators in ptr. In the first version I tried to write everything like Boost.Move docs for implementing Copyable and Movable classes suggest, and then added the conversion constructors and assignment operators. Then I wrote a second version, using the pass-by-value and swap idiom. Any comments about my attempts here are welcome. Did I get it right in both versions? The attached file swap_idiom.zip contains: ptr.hpp - the deffinition of the ptr class template main.cpp - example for ptr<>, showing all constructor and assignment use cases I could think of 03.txt, 03_by_value.txt, 0x.txt, 0x_by_value.txt - the output I got for both versions of ptr, in two versions of C++: 03 and 0x. For this test I used MinGW-4.5.0. Here's how the ptr<> class looks like (ptr.hpp) (note: {{{this}}} is how I mark code): {{{ extern int ptr_s; // helper for diagnostics template < class T > T* clone_me( T const* p ); template < class T > class ptr { public: explicit ptr( T* p = 0 ) : p_(p) { ++ptr_s; std::cout << "_p "; } // copy ctor ptr( ptr const& b ) : p_( clone_me(b.get()) ) { ++ptr_s; std::cout << "cp "; } // move ctor ptr( BOOST_RV_REF(ptr) b ) : p_( b.release() ) { ++ptr_s; std::cout << "mp "; } }}} So far so good. This is where the hard part comes in - the conversion constructors and assignment operators. First version looks like this: {{{ private: #if !defined(BY_VALUE) BOOST_COPYABLE_AND_MOVABLE(ptr) public: // generalized copy ctor for pointers to derived template < class U > ptr( ptr const& b, typename boost::enable_if< boost::is_convertible<U*,T*> >::type* = 0 ) : p_( clone_me(b.get()) ) { ++ptr_s; std::cout << "Cp "; } // generalized move ctor for pointers to derived template < class U > ptr( BOOST_RV_REF(ptr) b, typename boost::enable_if< boost::is_convertible<U*,T*> >::type* = 0 ) : p_( b.release() ) { ++ptr_s; std::cout << "Mp "; } ptr& operator=( BOOST_COPY_ASSIGN_REF(ptr) b ) { T* tmp = clone_me(b.get()); // this can throw boost::checked_delete(p_); p_ = tmp; return *this; } ptr& operator=( BOOST_RV_REF(ptr) b ) { boost::checked_delete(p_); p_ = b.release(); return *this; } template < class U > typename boost::enable_if< boost::is_convertible<U*,T*>, ptr& >::type operator=( ptr const& b ) { T* tmp = clone_me(b.get()); // this could throw boost::checked_delete(p_); p_ = tmp; return *this; } template < class U > typename boost::enable_if< boost::is_convertible<U*,T*>, ptr& >::type operator=( BOOST_RV_REF(ptr) b ) { boost::checked_delete(p_); p_ = b.release(); return *this; } }}} This was long, and contains some tricky places, like the one commented 'this could throw'. Did I even get it right? I think so, but I'm just beginning to learn about move semantics here ;-) Anyway, next comes the second version: implementing conversion constructors and assignment operators in terms of pass-by-value and swap. Note the use of BOOST_COPYABLE_AND_MOVABLE_ALT macro so that an operator=(ptr&) isn't inserted. {{{ #else // BY_VALUE BOOST_COPYABLE_AND_MOVABLE_ALT(ptr) public: // generalized copy/move constructor implemented by pass-by-value & steal template < class U > ptr( ptr b, typename boost::enable_if< boost::is_convertible<U*,T*> >::type* = 0 ) : p_( b.release() ) { ++ptr_s; std::cout << "Vp "; } // assignment - works for all types convertible to ptr ptr& operator=( ptr b ) { swap(*this,b); return *this; } #endif // BY_VALUE }}} Compared to the first version, this is really simple. I see no tricky parts here. The rest of ptr<> follows: {{{ ~ptr() { boost::checked_delete(p_); ++ptr_s; std::cout << "~p "; } T* get() const { return p_; } T* release() { T* r = p_; p_ = 0; return r; } friend void swap( ptr& a, ptr& b ) { boost::swap(a.p_,b.p_); std::cout << "sp "; } // reset, operator* and -> private: T* p_; }; }}} Writing the conversion constructors and assignment operators in the second version was much simpler. While version 1 contains 6 functions, version 2 contains only 2 functions. But is this always correct, and what is the cost of simplifying things? I tried to answer that question by writing the example (main.cpp). I started by preparing two diagnostic classes: {{{ struct A { static int a, c; A() { ++a; ++c; cout << "_A "; } A( A const& ) { ++a; ++c; cout << "cA "; } virtual ~A() { ++a; --c; cout << "~A "; } }; int A::a = 0; int A::c = 0; struct B : A { static int b, d; B() { ++b; ++d; cout << "_B "; } B( B const& x ) : A(x) { ++b; ++d; cout << "cB "; } ~B() { ++b; --d; cout << "~B "; } }; int B::b = 0; int B::d = 0; ptr<A> make_a() { return ptr<A>( new A ); } ptr make_b() { return ptr( new B ); } }}} Then some machinery for printing and zeroing the static variables incremented/decremented by corresponding constructors/destructors. {{{ void trace( char const* msg ) { cout << endl << boost::format("%34s P:%d A:%d B:%d eA:%d eB:%d") % msg % ptr_s % A::a % B::b % A::c % B::d << endl; ptr_s = 0; A::a = 0; B::b = 0; } #define TRACE( x ) x; trace( #x ); }}} And now main() itself, containing all use cases of ptr<> I could think of: {{{ int main() { { TRACE( ptr<A> z ) TRACE( ptr<A> a( new A ) ) TRACE( ptr b( new B ) ) TRACE( ptr<A> c( new B ) ) TRACE( ptr<A> d( a ) ) TRACE( ptr<A> e( b ) ) TRACE( ptr<A> f( boost::move(a) ) ) TRACE( ptr<A> g( boost::move(b) ) ) TRACE( ptr h( new B ) ) TRACE( ptr<A> i( boost::move(c) ) ) TRACE( ptr<A> j( i ) ) // slice TRACE( ptr<A> x( new A ) ) TRACE( x = f ) TRACE( x = h ) TRACE( x = boost::move(f) ) TRACE( x = boost::move(g) ) TRACE( x = boost::move(h) ) TRACE( x = i ) // slice } trace( "" ); { TRACE( ptr<A> a = make_a() ) TRACE( ptr<A> b = make_b() ) TRACE( ptr<A> c( make_b() ) ) TRACE( a = make_a() ) TRACE( b = make_b() ) } trace( "" ); } }}} And now for the costs. I compiled the attached code with MinGW-4.5.0 in 4 configurations: -std=c++0x disabled/enabled, and version 1/2. I compared the program output to derive the conclusions: C++03: version 1 vs. version 2: - whenever a conversion is needed (about half of the use cases above), version 2 introduces an additional temporary ptr<> object (without a deep copy); in one case it's 2 additional temporary ptr<>s; - the last 4 use cases {{{ ptr<A> b = make_b(); ptr<A> c( make_b() ); a = make_a(); b = make_b(); }}} introduce a deep copy in version 1, while while the deep copy is avoided in version 2. C++0x: version 1. vs. version 2: - whenever a conversion is needed (about half of the use cases above), version 2 introduces an additional temporary ptr<> object (without a deep copy); in one case it's 2 additional temporary ptr<>s; - no unnecessary deep copies are introduced in either version. Version 1: C++03 vs. C++0x: - the last 4 use cases {{{ ptr<A> b = make_b(); ptr<A> c( make_b() ); a = make_a(); b = make_b(); }}} introduce a deep copy in version C++03, while while the deep copy is avoided in C++0x. Version 2: C++03 vs. C++0x: - no difference. General conclusion: 'pass-by-value and swap' idiom is cool ;-) Pros: - better move emulation, - simple implementation. Cons: - additional temporary objects, that are then swapped to the right place. Thanks for staying with me ;-) Regards, Kris

3 6

[serialization - eceptions] Could not catch exceptions
by DaBoneCrack 24 Jul '12

24 Jul '12

Hi, i could not catch boost serialization exceptions. By default BOOST_NO_EXCEPTIONS is defined. All attempts to undefine it has no effect. What i try to do: <code> ... #include <boost/config.hpp> #ifdef BOOST_NO_EXCEPTIONS # undef BOOST_NO_EXCEPTIONS #endif ... more boost serialization headers included .... try { std::ifstream ifs("D:\\tmp.bin", std::ios::binary); boost::archive::binary_iarchive ia(ifs); int iIndex = 0; ia >> BOOST_SERIALIZATION_NVP("A", iIndex); ... } catch(std::exception) { ... } </code> Do i miss something to catch boost serialization exceptions? I am using vs2008. Thx for your help. -- View this message in context: http://boost.2283326.n4.nabble.com/serialization-eceptions-Could-not-catch-… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Error :Boost 1.48.0 with latest IBM compiler
by devika R S 24 Jul '12

24 Jul '12

Hi All, This post is regarding the issue we saw on IBM compiler using BOOST 1.48 version. Here is the sample code . *********************************Example Code************************************* #include <boost/config/warning_disable.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/spirit/include/phoenix_operator.hpp> #include <boost/spirit/home/phoenix/statement/if.hpp> #include <boost/spirit/home/phoenix/bind/bind_function.hpp> #include <iostream> #include <string> namespace client { namespace qi = boost::spirit::qi; namespace ascii = boost::spirit::ascii; namespace phx = boost::phoenix; struct vars_ : qi::symbols<char, double> { vars_() { add("ans" , 0); } } vars; template <typename Iterator> struct parser : qi::grammar<Iterator, double()> { parser() : parser::base_type(function) { using qi::eps; using qi::lit; using qi::_val; using qi::_1; using ascii::char_; using qi::double_; using qi::string; using qi::lexeme; using boost::phoenix::if_; using qi::alpha; using qi::alnum; MAX = lexeme[string("max") | string("MAX")]; //define max symbol MIN = lexeme[string("min") | string("MIN")]; //define min symbol D = lexeme[string("d") | string("D")]; //define distance symbol function = expression [_val = _1] | declaration | assignment | ( MAX >> "(" >> function [_val = _1] >> +(',' >> function [if_(_1 > _val)[_val = _1]]) >> ')') // call : max(function,...) | ( MIN >> "(" >> function [_val = _1] >> +(',' >> function [if_(_1 < _val)[_val = _1]]) >> ')') // call : min(function,...) | ( D >> "(" >> (function >> ',' >> function) >> ')'); // call : d(point1,point2) not implemented yet expression = term [_val = _1] >> *( ('+' >> term [_val += _1]) | ('-' >> term [_val -= _1])); term = factor [_val = _1] >> *( ('*' >> factor [_val *= _1]) | ('/' >> factor [_val /= _1])); factor = double_ [_val = _1] | (vars [_val += _1] ) | '(' >> expression [_val = _1] >> ')' | ('-' >> factor [_val = -_1]) | ('+' >> factor [_val = _1]) | declaration; ; assignment = vars >> '=' >> function; var_decl = lexeme [ qi::raw [ ( alpha >> *( alnum | '_' ) ) - vars ] ] //[ phx::bind(vars.add, _1) ] ; declaration = "var " >> var_decl >> *( ',' >> var_decl ); } qi::rule<Iterator, double()> MAX, MIN, D,expression, term, factor, function, assignment, var_decl, declaration; }; } int main() { typedef std::string::const_iterator iterator_type; typedef client::parser<iterator_type> parser; parser _parser; // Our grammar std::string str; double result; while (std::getline(std::cin, str)) { if (str.empty() || str[0] == 'q' || str[0] == 'Q') break; std::string::const_iterator iter = str.begin(); std::string::const_iterator end = str.end(); bool r = parse(iter, end, _parser, result); if (r && iter == end) { std::cout << "Parsing succeeded\n"; std::cout << "result = " << result << std::endl; } else { std::string rest(iter, end); std::cout << "Parsing failed\n"; } } return 0; } *********************************END************************************************** When we compile this code on IBM with the compiler : IBM XL C/C++ for AIX, V11.1 (5724-X13).Version: 11.01.0000.0009 we end up with below error: xlC -I/usr/include/common/boost -o test2.o -O -c -qnoansialias -qnoro -qchars=signed -q64 -qrtti=all test2.cpp "/usr/include/common/boost/boost/integer_traits.hpp", line 83.56: 1540-0724 (W) The non-type template argument "-1" of type "T" has wrapped. "/usr/include/common/boost/boost/spirit/home/support/terminal.hpp", line 231.13: 1540-0407 (S) The base class "to_nonlazy_arg<const char [4]>" contains a circular reference back to "to_nonlazy_arg<const char [4]>". "/usr/include/boost/boost/spirit/home/support/terminal.hpp", line 288.46: 1540-0700 (I) The previous message was produced while processing "struct boost_1_48_0::spirit::detail::to_nonlazy_arg<const char [4]>". "/usr/include/common/boost/boost/spirit/home/support/terminal.hpp", line 281.16: 1540-0700 (I) The previous message was produced while processing "struct boost_1_48_0::spirit::terminal<struct boost_1_48_0::spirit::tag::char_code<boost_1_48_0::spirit::tag::string,boost_1_48_0::spirit::char_encoding::standard> >::result_helper<0,const char [4],boost_1_48_0::spirit::unused_type,boost_1_48_0::spirit::unused_type>". "/usr/include/common/boost/boost/spirit/home/support/terminal.hpp", line 316.16: 1540-0700 (I) The previous message was produced while processing "struct boost_1_48_0::spirit::terminal<struct boost_1_48_0::spirit::tag::char_code<boost_1_48_0::spirit::tag::string,boost_1_48_0::spirit::char_encoding::standard> >::result<const char [4],boost_1_48_0::spirit::unused_type,boost_1_48_0::spirit::unused_type>". "/usr/include/common/boost/boost/spirit/home/support/terminal.hpp", line 248.12: 1540-0700 (I) The previous message was produced while processing "struct boost_1_48_0::spirit::terminal<boost_1_48_0::spirit::tag::char_code<boost_1_48_0::spirit::tag::string,boost_1_48_0::spirit::char_encoding::standard> >". "/usr/include/common/boost/boost/spirit/home/support/common_terminals.hpp", line 230.1: 1540-0700 (I) The previous message was produced while processing "boost_1_48_0::spirit::standard::string". But this code works absolutely fine on g++ Linux. Is this is a known bug on IBM ?Is any patch available ? Thanks in advance, Abc

1 0

Problems with boost::this_thread::sleep(boost::posix_time::milliseconds(100)) on 64 bit platform.
by Serg V. Gulko 23 Jul '12

23 Jul '12

Hello! I was trying to recompile code which was working perfectly on CentOS 6 32 bit under same version of CentOS but for 64bit. boost version is 1.49.0. Problem is that this_thread::sleep return immediately on 64 bit machine... Only increasing sleep time to 3000 i was able to see real sleep. I saw that many people have same problem but is there a way to easily resolve it? Serg

3 2

[BGL] Encountering "bad lexical cast" exception when reading a class from graphviz file
by Nicholas Mario Wardhana 23 Jul '12

23 Jul '12

Hi all, I am trying to read a graphviz file into my graph implementation. The minimum working code as well as the graphviz file are at the end of this e-mail. The node of the graph is the Vertex struct, which contains a point object (Point p). For Point class, I overload two operators, >> and <<, and operator << was previously used to generate the graphviz file. The operator overloads work well with std::cin and std::cout, but with the code below, I receive an exception: bad lexical cast: source type value could not be interpreted as target . The culprit might be in the << overload. In particular, when reading from a file, the value of iToBool1 is true, whereas iToBool2 is false. That is to say, the variable i might change when inserting the stream data to the point. This does not happen when reading from std::cin, as both variables are true. I convert the i variable, originally an istream, to bool because when the program returns to the calling function, which is lexical_stream_limited_src::shr_using_base_class on line 1616 in lexical_cast.hpp, this functions uses the return value of << operator in a boolean comparison. The value of iToBool2 being false eventually leads to calling BOOST_LCAST_THROW_BAD_CAST on line 1975. I wonder if somebody can tell me what is wrong with my operator overload? I use Boost 1.50 and Visual Studio 2008 on Windows 7. Thanks! Best regards, Nicholas //--------------------Graphviz-------------------- graph G { 1 [Point="1 2 3"]; } //----------------------code---------------------- #include <boost/graph/adjacency_list.hpp> #include <boost/property_map/dynamic_property_map.hpp> #include <boost/graph/graphviz.hpp> #include <iostream> #include <fstream> #include <string> struct Point { float x; float y; float z; inline friend std::istream& operator >> ( std::istream& i, Point& p ) { bool iToBool1 = i; i >> p.x >> p.y >> p.z; bool iToBool2 = i; return i; } inline friend std::ostream& operator << ( std::ostream& o, const Point& p ) { o << p.x << " " << p.y << " " << p.z; return o; } }; struct Vertex { int ID; Point p; }; struct Edge { int ID; }; typedef boost::adjacency_list< boost::listS, boost::vecS, boost::undirectedS, Vertex, // bundled data Edge, // bundled data boost::no_property, // not needed boost::listS> Graph; int main() { // Part 1: input via std::cin Point p; std::cin >> p; Graph graph; // Part 2: input from graphviz boost::dynamic_properties dynamicProperties; dynamicProperties.property("NodeID", boost::get(&Vertex::ID, graph)); dynamicProperties.property("Point", boost::get(&Vertex::p, graph)); dynamicProperties.property("EdgeID", boost::get(&Edge::ID, graph)); std::ifstream file("graph.txt"); try { boost::read_graphviz(file, graph, dynamicProperties, "NodeID"); } catch (std::exception& e) { std::cout << e.what() << std::endl; } return 0; }

2 4

state machine frequence detecting
by Kraus Philipp 23 Jul '12

23 Jul '12

Hello, I need an idea for detecting frequencies. I have got an audio signal and I would check if a sequence of frequences are in the signal eg: I have got this frequencies: 100Hz, 600Hz, 800Hz, so I would create a statemachine that accepts this sequence of frequencies like frequence statemachin st; for each audio sample if signal has st.getFrequence then st.next else st.reset if st.final then accept Frequences and the order of the frequences are stored in a configuration file, so the state machine can have a lot of states. In some cases I can have got something like 100Hz, 600Hz, 800Hz, delay, 100Hz, 600Hz, 800Hz | 1 | | 2 | So the sequence must be accepted if one of the frequence block (1 || 2) is in the final state. I have read the howto about the Boost finale statemachine, but I can not make a decision if the Boost statemaschine is the correct structure to solve this problem. Can anyone help me to discuss the pro / cons for the Boost statemachine in this case? Thanks a lot Phil

2 1

Extracting "friendly" information from boost::exception
by Andreas M. Iwanowski 22 Jul '12

22 Jul '12

Dear boost experts. We are using boost::exception in a project of ours, and are trying to extract some information from an exception to display to the user. For example, diagnostic_information(e) returns this: d:\projects\<project>\ClassName.cpp(376): Throw in function void __thiscall ClassName::CInetExceptionHandler<struct ClassName::BadLoginException>(class CInternetException *) const Dynamic exception type: class boost::exception_detail::clone_impl<struct ClassName::BadLoginException> std::exception::what: Unknown exception [struct tag_implementation_ClassName_SpecificInfo_errstr *] = Error: 12014 Context: 0 Message: The password was not allowed [struct tag_interface_CDataInterface_errstr *] = ClassName reports: Bad FTP login What I want is to extract "Error: 12014 Context: 0 Message: The password was not allowed" or "ClassName reports: Bad FTP login" from that exception. However, these exceptions may be generated in DLLs that the main program know nothing about. To simplify, here is what I do and want ot be happening: 1. Main program calls method in DLL 2. Main program knows this method can throw expections of type boost::exception 3. Main program catches such exception 4. Main program obtains string that is user-friendly from this exception Has anyone acccomplished this or knows how to extract the information from above (ideally not by parsing the string?) Alternatively, could I somehow fill the std::exception::what and then get that information out of boost::exception somehow? Thanks everyone! Mit freundlichen Gr??en / With best regards Andreas Iwanowski - IT Administrator www.awato.de<http://www.awato.de> | namezero(a)afim.info<mailto:namezero@afim.info> T: +49 (0)2133 2969 28 | F: +49 (0)2133 2969 69 awato Software GmbH | Salm Reifferscheidt Allee 37 | D-41540 Dormagen avisor-Support | T: +49 (0)621 6094 043 | F: +49 (0)621 6071 447 [awato Software GmbH] [cid:qrCode-58869986-5cab-4997-b473-f0c11a0058ad21bff0] Gesch?ftsf?hrer: Ursula Iwanowski | HRB: Neuss 7208 | VAT-no.: DE 122796158

2 1

filesystem - test failures
by Robert Ramey 22 Jul '12

22 Jul '12

The boost serialization library tests use boost.filesystem. A number of test scenarios in the serialization library tests suite are really manifestations of failures in the boost filesystem library. a) msvc- 9.0~wm5~stlport5.2 - this combination fails at some level for lack of a file "io.h". b) does filesystem really require RTTI? at least a subset (and maybe more) of the serialization library tests should function in the absense of RTTI but now they all fail since all the tests use filesystem and this in turn depends upon RTTI. Robert Ramey

1 0

code review
by Littlefield, Tyler 22 Jul '12

22 Jul '12

Hello all: I understand this may be a bit unusual, but any help/info would really be appreciated. Basically, here's what the problem is. I am using boost::asio to write a client and server for a game setup I want to work on. They're not communicating with each other, but more importantly, before I get way to far with this, since I am just learning boost::asio and everything else, I'd like to see if there is something I could be doing differently/better to make everything smoother. All the source is stuffed in a zip, and I posted it: http://tds-solutions.net/game.zip Any ideas, comments/suggestions/etc would really be appreciated. I'm also kind of interested in how I might go about tracking down the error where the client is not connecting to the server. On a side note, appologies for formatting errors. I'm blind, so it's not of huge importance to me, but I think I formatted all the code, so it should look ok visually. -- Take care, Ty http://tds-solutions.net The aspen project: a barebones light-weight mud engine: http://code.google.com/p/aspenmud He that will not reason is a bigot; he that cannot reason is a fool; he that dares not reason is a slave.

1 0

[Program Options] Input information as std::string
by Nicholas Yue 22 Jul '12

22 Jul '12

Hi, I have a situation where I would like to parse the command line options not as (int argc, char **argv) template<typename charT> basic_parsed_options< charT > parse_command_line(int argc, const charT *const argv, const options_description &, int style = 0, function1< std::pair< std::string, std::string >, const std::string & > ext = ext_parser()); but as a std::string. The std::string is the equivalent of the command line but obtain either from reading some file or cut and paste. E.g. my input string would be something like "myprog 817382 --lod="lod.cfg" --radius=3.0" With such string as the above, I'd like to know how I should pass it to boost::program_options Regards -- Nicholas Yue Graphics - RenderMan, Visualization, OpenGL, HDF5 Custom Dev - C++ porting, OSX, Linux, Windows Management - Recruitment, career management http://www.proceduralinsight.com/ http://au.linkedin.com/in/nicholasyue

3 2

boost::unordered_map and exceptions disabled
by Marcello Maggioni 22 Jul '12

22 Jul '12

Hello, I'm a user of boost::unordered_map and I always used this container with exceptions disabled (because I never use them and don't want them enabled if possible). I never had problems with that, but now with boost 1.50 and GCC 4.7.1 I get this error while compiling code using unordered_map: In file included from /usr/include/boost/unordered/unordered_map.hpp:17:0, from /usr/include/boost/unordered_map.hpp:16, from /home/hades/Bitral/include/CodeRegion.h:23, from /home/hades/Bitral/src/BitralContext.cpp:20: /usr/include/boost/unordered/detail/allocator_helpers.hpp: In instantiation of 'void boost::unordered::detail::construct_node(Alloc&, T*, const Args&) [with Alloc = std::allocator<boost::unordered::detail::ptr_node<std::pair<const Bitral::ConstantMemoryAddress, Bitral::CodeRegion*> > >; T = boost::unordered::detail::ptr_node<std::pair<const Bitral::ConstantMemoryAddress, Bitral::CodeRegion*> >; Args = boost::unordered::detail::emplace_args3<boost::unordered::piecewise_construct_t, boost::tuples::tuple<Bitral::ConstantMemoryAddress, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type>, boost::tuples::tuple<> >]': /usr/include/boost/unordered/detail/buckets.hpp:75:13: required from 'void boost::unordered::detail::node_constructor<NodeAlloc>::construct_value(const Args&) [with Args = boost::unordered::detail::emplace_args3<boost::unordered::piecewise_construct_t, boost::tuples::tuple<Bitral::ConstantMemoryAddress, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type, boost::tuples::null_type>, boost::tuples::tuple<> >; NodeAlloc = std::allocator<boost::unordered::detail::ptr_node<std::pair<const Bitral::ConstantMemoryAddress, Bitral::CodeRegion*> > >]' /usr/include/boost/unordered/detail/unique.hpp:386:13: required from 'boost::unordered::detail::table_impl<Types>::value_type& boost::unordered::detail::table_impl<Types>::operator[](const key_type&) [with Types = boost::unordered::detail::map<std::allocator<std::pair<const Bitral::ConstantMemoryAddress, Bitral::CodeRegion*> >, Bitral::ConstantMemoryAddress, Bitral::CodeRegion*, boost::hash<Bitral::ConstantMemoryAddress>, std::equal_to<Bitral::ConstantMemoryAddress> >; boost::unordered::detail::table_impl<Types>::value_type = std::pair<const Bitral::ConstantMemoryAddress, Bitral::CodeRegion*>; boost::unordered::detail::table_impl<Types>::key_type = Bitral::ConstantMemoryAddress]' /usr/include/boost/unordered/unordered_map.hpp:1196:26: required from 'boost::unordered::unordered_map<K, T, H, P, A>::mapped_type& boost::unordered::unordered_map<K, T, H, P, A>::operator[](const key_type&) [with K = Bitral::ConstantMemoryAddress; T = Bitral::CodeRegion*; H = boost::hash<Bitral::ConstantMemoryAddress>; P = std::equal_to<Bitral::ConstantMemoryAddress>; A = std::allocator<std::pair<const Bitral::ConstantMemoryAddress, Bitral::CodeRegion*> >; boost::unordered::unordered_map<K, T, H, P, A>::mapped_type = Bitral::CodeRegion*; boost::unordered::unordered_map<K, T, H, P, A>::key_type = Bitral::ConstantMemoryAddress]' /home/hades/Bitral/src/BitralContext.cpp:30:31: required from here /usr/include/boost/unordered/detail/allocator_helpers.hpp:643:11: error: exception handling disabled, use -fexceptions to enable The strange thing is that compiling the code with CLANG 3.1 and exceptions explicitly disabled works fine. There is a way to make it work with exceptions disabled and G++? Thanks Marcello

2 1

[type_traits] defining my own trait
by Brian Budge 21 Jul '12

21 Jul '12

Hi all - I am hoping to define my own type trait is_memcpyable. I'm trying to start off simple: template <typename T> struct is_memcpyable { static const bool value = boost::has_trivial_assign<T>::value; }; Then when I encounter types in my code that are safe to memcpy, but don't have a trivial assignment operator I can specialize the trait. I'm having trouble with inheritance and composition. I'm hoping someone can help. Here's a complete code sample: /***START OF SAMPLE***/ #include <Eigen/Dense> #include <iostream> template <typename T> struct is_memcpyable { static const bool value = boost::has_trivial_assign<T>::value; }; namespace boost { template<> struct has_trivial_assign<Eigen::Vector3f> : public true_type {}; } struct foo : public Eigen::Vector3f { foo() {} }; struct bar { bar(int i) : m_vec(float(i), float(i), float(i)) {} Eigen::Vector3f m_vec; }; int main(int argc, char **args) { std::cerr << "memcpyable int: " << is_memcpyable<int>::value << std::endl; std::cerr << "memcpyable v3f: " << is_memcpyable<Eigen::Vector3f>::value << std::endl; std::cerr << "memcpyable bar: " << is_memcpyable<bar>::value << std::endl; std::cerr << "memcpyable foo: " << is_memcpyable<foo>::value << std::endl; std::cerr << "trivial assign int: " << boost::has_trivial_assign<int>::value << std::endl; std::cerr << "trivial assign v3f: " << boost::has_trivial_assign<Eigen::Vector3f>::value << std::endl; std::cerr << "trivial assign bar: " << boost::has_trivial_assign<bar>::value << std::endl; std::cerr << "trivial assign foo: " << boost::has_trivial_assign<foo>::value << std::endl; return 0; } /***END OF SAMPLE***/ The Eigen library is set up to do nifty expression template goodness all over the place, which means that they implement operator = for the types in the library. However, once a value is assigned, the storage is fixed (at least for the Dense matrix types). The data layout is fixed, and internal storage is a small array of builtin types. What I would like to happen is that all 8 print statements should be true; however, the ones for bar and foo are false. I can explicitly set their type traits, but this quickly gets out of hand. I guess the real question is this: is there a way to define is_memcpyable so that the value is true if a class does not define operator=, and all of it's members or inherited types are also memcpyable? Thanks for any help. Brian

3 4

Missing libboost_thread-vc100-mt-s-1_49.lib
by VimalMathew＠Eaton.com 20 Jul '12

20 Jul '12

Hi, I'm trying to build a project using nmake. When I run nmake I get this error message: " LINK : fatal error LNK1104: cannot open file 'libboost_thread-vc100-mt-s-1_49.lib " Could someone tell me what I'm missing please? Thanks, Vimal

1 0

How to force a compile failure if a template parameter isn't floating-point
by Paul A. Bristow 20 Jul '12

20 Jul '12

I have some functions that I want to ensure (with a compile failure - because it means a logical mistake) that they are not instantiated if the template parameter is not floating point type. In effect, #error Type Not floating point! template <typename FPT> std::string f(FPT v) { ... } At present I have added a run-time check, but doesn't prevent compilation (and instantiation). if (boost::is_floating_point<FPT>::value; == false) { assert fail or something and/or return " "Type Not floating point!"; } I don't see how enable_if can help either. I can't find BOOST_CONCEPT_ASSERT((boost::FloatingPoint<FPT>)); or boost::function_requires< boost::Integer<FPT> >(); Suggestions welcome :-) Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

5 7

[ASIO] Patch to support ATM sockets
by Casimiro, Daniel C CIV NUWC NWPT 20 Jul '12

20 Jul '12

Hi, These classes and examples add basic ATM support to ASIO. It works with MS visual studio 2010 (Windows XP) and gcc 4.1.2 (Linux CentOS 5.8), but it isn't always pretty. I only implemented and tested PVC's. ~Dan --------------------------- // stdafx.h : include file for standard system include files, // or project specific include files that are used frequently, but // are changed infrequently // #ifndef BOOST_STDAFX_HEAD #define BOOST_STDAFX_HEAD #ifdef _WIN32 #include "targetver.h" #define WIN32_LEAN_AND_MEAN // Exclude rarely-used stuff from Windows headers #endif #ifdef HAVE_ASIO_ATM // I forward declare my version of boost::asio::detail::socket_ops::bind so that // gcc 4.1.2 picks it up and uses it. // Otherwise, gcc doesn't consider my version; I'm not sure why. #include <boost/variant/variant_fwd.hpp> namespace boost { namespace system { class error_code; } } namespace boost { namespace asio { namespace atm { namespace detail { struct atmpvc_endpoint_type; struct atmsvc_endpoint_type; } } } } namespace boost { namespace asio { namespace detail { namespace socket_ops { int bind(int s, const boost::variant<boost::asio::atm::detail::atmpvc_endpoint_type, boost::asio::atm::detail::atmsvc_endpoint_type>* addr, size_t addrlen, boost::system::error_code& ec); } } } } #endif #include <boost/asio.hpp> #endif // BOOST_STDAFX_HEAD // Example echo server with ATM sockets // async_atm_echo_server.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <cstdlib> #include <iostream> #include <string> #include <boost/bind.hpp> #include <boost/asio.hpp> #include "boost/asio/atm/aal.hpp" using namespace boost::asio::atm; class server { public: server(boost::asio::io_service& io_service, const std::string &a) : io_service_(io_service) , socket_(io_service, aal::endpoint(address::from_string(a), qos::ubr_settings(1024u))) , data_() { socket_.async_receive( boost::asio::buffer(data_, max_length), boost::bind(&server::handle_receive_from, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } void handle_receive_from(const boost::system::error_code& error, size_t bytes_recvd) { if (!error && bytes_recvd > 0) { socket_.async_send( boost::asio::buffer(data_, bytes_recvd), boost::bind(&server::handle_send_to, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } else { socket_.async_receive( boost::asio::buffer(data_, max_length), boost::bind(&server::handle_receive_from, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } } void handle_send_to(const boost::system::error_code& /*error*/, size_t /*bytes_sent*/) { socket_.async_receive( boost::asio::buffer(data_, max_length), boost::bind(&server::handle_receive_from, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } private: boost::asio::io_service& io_service_; aal::socket socket_; enum { max_length = 1024 }; char data_[max_length]; }; int main(int argc, char** argv) { try { if (argc != 2) { std::cerr << "Usage: async_atm_echo_server <address>\n"; return 1; } boost::asio::io_service io_service; server s(io_service, argv[1]); io_service.run(); } catch (const std::exception& e) { std::cerr << "Exception: " << e.what() << "\n"; } return 0; } // Example echo client with ATM sockets // blocking_atm_echo_client.cpp : Defines the entry point for the console application. // #include "stdafx.h" #include <cstdlib> #include <cstring> #include <iostream> #include <boost/asio.hpp> #include "boost/asio/atm/aal.hpp" using namespace boost::asio::atm; enum { max_length = 1024 }; int main(int argc, char** argv) { try { if (argc != 2) { std::cerr << "Usage: blocking_atm_echo_client <address>\n"; return 1; } boost::asio::io_service io_service; aal::socket s(io_service, aal::endpoint(address_pvc::from_string(argv[1]), qos::ubr_settings(1024u))); using namespace std; // for strlen std::cout << "Enter message: "; char request[max_length]; std::cin.getline(request, max_length); size_t request_length = strlen(request); s.send(boost::asio::buffer(request, request_length)); char reply[max_length]; size_t reply_length = s.receive(boost::asio::buffer(reply, max_length)); std::cout << "Reply is: "; std::cout.write(reply, reply_length); std::cout << "\n"; } catch (const std::exception& e) { std::cerr << "Exception: " << e.what() << "\n"; } return 0; } /// \file boost/asio/atm/aal.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode support for Boost ASIO #ifndef BOOST_ASIO_ATM_AAL_HEAD #define BOOST_ASIO_ATM_AAL_HEAD #ifdef HAVE_ASIO_ATM #include <boost/asio.hpp> #include <boost/variant.hpp> #include "basic_endpoint.hpp" namespace boost { namespace asio { using boost::asio::basic_raw_socket; namespace atm { /// \brief ATM Adaptation Layer template <class Implementation> class basic_aal { public: typedef Implementation implementation_type; /// The type of a ATM endpoint. typedef basic_endpoint<basic_aal> endpoint; static basic_aal aal5_pvc() { return basic_aal(implementation_type::aal5_protocol(), implementation_type::pvc_family()); } static basic_aal aal5_svc() { return basic_aal(implementation_type::aal5_protocol(), implementation_type::svc_family()); } /// Obtain an identifier for the type of the protocol. int type() const { // windows only support SOCK_RAW // The Linux examples use SOCK_DGRAM; is there a difference at application // level for AAL5 sockets? Can Linux use SOCK_RAW? return implementation_type::socket_type(); } /// Obtain an identifier for the protocol. int protocol() const { return protocol_; } /// Obtain an identifier for the protocol family. int family() const { return family_; } /// The ATM/AAL socket type. typedef basic_raw_socket<basic_aal> socket; /// The ATM/AAL resolver type. //typedef basic_resolver<atm> resolver; /// Compare two protocols for equality. friend bool operator==(const basic_aal& p1, const basic_aal& p2) { return p1.protocol_ == p2.protocol_ && p1.family_ == p2.family_ ; } /// Compare two protocols for inequality. friend bool operator!=(const basic_aal& p1, const basic_aal& p2) { return p1.protocol_ != p2.protocol_ || p1.family_ != p2.family_ ; } private: // Construct with a specific protocol. explicit basic_aal(const int protocol, const int family) : protocol_(protocol) , family_(family) { } int protocol_; int family_; }; // class basic_aal #if defined BOOST_WINDOWS || defined(__CYGWIN__) struct windows_atm { static int aal5_protocol() { return ATMPROTO_AAL5; } static int socket_type() { return SOCK_RAW; } static int pvc_family() { return AF_ATM; } static int svc_family() { return AF_ATM; } /// is this legal? //typedef template <class Protocol> basic_raw_socket socket_template; }; // windows_atm typedef basic_aal<windows_atm> aal; #else struct bsd_atm { static int aal5_protocol() { return 0; } static int socket_type() { return SOCK_RAW; } static int pvc_family() { return AF_ATMPVC; } static int svc_family() { return AF_ATMSVC; } /// is this legal? //typedef template <class Protocol> basic_raw_socket socket_template; }; // bsd_atm typedef basic_aal<bsd_atm> aal; #endif } // namespace atm } // namespace asio } // namespace boost #endif // HAVE_ASIO_ATM #endif // BOOST_ASIO_ATM_AAL_HEAD /// \file boost/asio/atm/address.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode address for Boost ASIO #ifndef BOOST_ASIO_ATM_ADDRESS_HEAD #define BOOST_ASIO_ATM_ADDRESS_HEAD #include <string> #include <boost/asio.hpp> #include "address_pvc.hpp" #include "address_svc.hpp" namespace boost { namespace asio { namespace atm { using boost::system::error_code; class address { public: address() : type_(pvc) , pvc_address_() , svc_address_() { } address(const address_pvc &pvc_address) : type_(pvc) , pvc_address_(pvc_address) , svc_address_() { } address(const address_svc &svc_address) : type_(svc) , pvc_address_() , svc_address_(svc_address) { } address(const address &other) : type_(other.type_) , pvc_address_(other.pvc_address_) , svc_address_(other.svc_address_) { } bool is_pvc() const { return type_ == pvc; } bool is_svc() const { return type_ == svc; } const address_pvc& to_pvc() const { return pvc_address_; } const address_svc& to_svc() const { return svc_address_; } std::string to_string() const { if (is_pvc()) { return pvc_address_.to_string(); } return svc_address_.to_string(); } std::string to_string(error_code &error) const { if (is_pvc()) { return pvc_address_.to_string(error); } return svc_address_.to_string(error); } static address from_string(const char * str) { error_code error; const address addr = from_string(str, error); boost::asio::detail::throw_error(error); return addr; } static address from_string(const char * str, error_code &error) { const address_pvc pvc_address = address_pvc::from_string(str, error); if (!error) { return address(pvc_address); } const address_svc svc_address = address_svc::from_string(str, error); if (!error) { return address(svc_address); } return address(); } static address from_string(const std::string &str) { return from_string(str.c_str()); } static address from_string(const std::string &str, error_code &error) { return from_string(str.c_str(), error); } /// Compare two addresses for equality. friend bool operator==(const address& a1, const address& a2) { if (a1.type_ != a2.type_) { return false; } if (a1.type_ == pvc) { return a1.pvc_address_ == a2.pvc_address_; } return a1.svc_address_ == a2.svc_address_; } /// Compare two addresses for inequality. friend bool operator!=(const address& a1, const address& a2) { return !(a1 == a2); } /// Compare addresses for ordering. friend bool operator<(const address& a1, const address& a2) { if (a1.type_ < a2.type_) { return true; } if (a1.type_ > a2.type_) { return false; } if (a1.type_ == pvc) { return a1.pvc_address_ < a2.pvc_address_; } return a1.svc_address_ < a2.svc_address_; } /// Compare addresses for ordering. friend bool operator>(const address& a1, const address& a2) { return a2 < a1; } /// Compare addresses for ordering. friend bool operator<=(const address& a1, const address& a2) { return !(a2 < a1); } /// Compare addresses for ordering. friend bool operator>=(const address& a1, const address& a2) { return !(a1 < a2); } private: enum { svc, pvc } type_; address_pvc pvc_address_; address_svc svc_address_; }; // class address #if !defined(BOOST_NO_IOSTREAM) /// Output an address as a string. /** * Used to output a human-readable string for a specified address. * * @param os The output stream to which the string will be written. * * @param addr The address to be written. * * @return The output stream. * * @relates boost::asio::atm::address_pvc */ template <typename Elem, typename Traits> std::basic_ostream<Elem, Traits>& operator<<( std::basic_ostream<Elem, Traits>& os, const address& addr); #endif // !defined(BOOST_NO_IOSTREAM) } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_ADDRESS_HEAD /// \file boost/asio/atm/address_pvc.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode PVC address for Boost ASIO #ifndef BOOST_ASIO_ATM_ADDRESS_PVC_HEAD #define BOOST_ASIO_ATM_ADDRESS_PVC_HEAD #include <string> #include <vector> #include <sstream> #include <boost/asio.hpp> #include <boost/algorithm/string.hpp> #include "detail/socket_types.hpp" #include "detail/socket_ops.hpp" namespace boost { namespace asio { namespace atm { using boost::system::error_code; class address_pvc { public: address_pvc() : addr_() { detail::socket_ops::initialize(addr_); } address_pvc(const address_pvc &other) : addr_(other.addr_) { } address_pvc(const detail::atmpvc_addr_type &a) : addr_(a) { } address_pvc(const unsigned long vpi, const unsigned long vci) : addr_() { detail::socket_ops::initialize(addr_); set_vpi(vpi); set_vci(vci); } unsigned long itf() const { return detail::socket_ops::itf(addr_); } void set_itf(const unsigned long i) { return detail::socket_ops::set_itf(i, addr_); } unsigned long vpi() const { return detail::socket_ops::vpi(addr_); } void set_vpi(const unsigned long v) { return detail::socket_ops::set_vpi(v, addr_); } unsigned long vci() const { return detail::socket_ops::vci(addr_); } void set_vci(const unsigned long v) { return detail::socket_ops::set_vci(v, addr_); } const detail::atmpvc_addr_type* data() const { return &addr_; } std::string to_string() const { error_code error; const std::string str = to_string(error); boost::asio::detail::throw_error(error); return str; } std::string to_string(error_code &error) const { std::ostringstream strm; strm << itf() << "." << vpi() << "." << vci(); return strm.str(); } static address_pvc from_string(const char *str) { error_code error; const address_pvc addr = from_string(str, error); boost::asio::detail::throw_error(error); return addr; } static address_pvc from_string(const char *str, error_code &error) { return from_string(std::string(str), error); } static address_pvc from_string(const std::string &str) { return from_string(str.c_str()); } static address_pvc from_string(const std::string &str, error_code &error) { typedef std::vector<std::string> container; address_pvc addr; container tokens; boost::split(tokens, str, boost::is_any_of(".")); if (tokens.empty()) { tokens.push_back(str); } container::const_reverse_iterator i = tokens.rbegin(); // Read the VCI first std::istringstream vci_strm(*i); unsigned long vci; if (!(vci_strm >> vci)) { error = boost::asio::error::invalid_argument; return addr; } addr.set_vci(vci); advance(i, 1); if (i == tokens.rend()) { return addr; } // Read the VPI std::istringstream vpi_strm(*i); unsigned long vpi; if (!(vpi_strm >> vpi)) { error = boost::asio::error::invalid_argument; return addr; } addr.set_vpi(vpi); advance(i, 1); if (i == tokens.rend()) { return addr; } // Read the ITF std::istringstream itf_strm(*i); unsigned long itf; if (!(itf_strm >> itf)) { error = boost::asio::error::invalid_argument; return addr; } addr.set_itf(itf); advance(i, 1); if (i != tokens.rend()) { error = boost::asio::error::invalid_argument; } return addr; } /// Compare two addresses for equality. friend bool operator==(const address_pvc& a1, const address_pvc& a2) { return a1.itf() == a2.itf() && a1.vpi() == a2.vpi() && a2.vci() == a2.vci() ; } /// Compare two address_pvces for inequality. friend bool operator!=(const address_pvc& a1, const address_pvc& a2) { return !(a1 == a2); } /// Compare address_pvces for ordering. friend bool operator<(const address_pvc& a1, const address_pvc& a2) { if (a1.itf() < a2.itf()) { return true; } if (a1.itf() > a2.itf()) { return false; } if (a1.vpi() < a2.vpi()) { return true; } if (a1.vpi() > a2.vpi()) { return false; } return a1.vci() < a2.vci(); } /// Compare address_pvces for ordering. friend bool operator>(const address_pvc& a1, const address_pvc& a2) { return a2 < a1; } /// Compare address_pvces for ordering. friend bool operator<=(const address_pvc& a1, const address_pvc& a2) { return !(a2 < a1); } /// Compare address_pvces for ordering. friend bool operator>=(const address_pvc& a1, const address_pvc& a2) { return !(a1 < a2); } private: detail::atmpvc_addr_type addr_; }; // class address_pvc #if !defined(BOOST_NO_IOSTREAM) /// Output an address as a string. /** * Used to output a human-readable string for a specified address. * * @param os The output stream to which the string will be written. * * @param addr The address to be written. * * @return The output stream. * * @relates boost::asio::atm::address_pvc */ template <typename Elem, typename Traits> std::basic_ostream<Elem, Traits>& operator<<( std::basic_ostream<Elem, Traits>& os, const address_pvc& addr); #endif // !defined(BOOST_NO_IOSTREAM) } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_ADDRESS_PVC_HEAD /// \file boost/asio/atm/address_svc.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode SVC address for Boost ASIO #ifndef BOOST_ASIO_ATM_ADDRESS_SVC_HEAD #define BOOST_ASIO_ATM_ADDRESS_SVC_HEAD #include <string> #include <boost/asio.hpp> #include "detail/socket_types.hpp" namespace boost { namespace asio { namespace atm { using boost::system::error_code; class address_svc { public: address_svc() : addr_() { } address_svc(const detail::atmsvc_addr_type& a) : addr_(a) { } address_svc(const address_svc &other) : addr_(other.addr_) { } const detail::atmsvc_addr_type* data() const { return &addr_; } std::string to_string() const { error_code error; const std::string str = to_string(error); boost::asio::detail::throw_error(error); return str; } std::string to_string(error_code &error) const { return ""; } static address_svc from_string(const char *str) { error_code error; const address_svc addr = from_string(str, error); boost::asio::detail::throw_error(error); return addr; } static address_svc from_string(const char *str, error_code &error) { address_svc addr; return addr; } static address_svc from_string(const std::string &str) { return from_string(str.c_str()); } static address_svc from_string(const std::string &str, error_code &error) { return from_string(str.c_str(), error); } /// Compare two addresses for equality. friend bool operator==(const address_svc& a1, const address_svc& a2) { return false; } /// Compare two address_svces for inequality. friend bool operator!=(const address_svc& a1, const address_svc& a2) { return !(a1 == a2); } /// Compare address_svces for ordering. friend bool operator<(const address_svc& a1, const address_svc& a2) { return false; } /// Compare address_svces for ordering. friend bool operator>(const address_svc& a1, const address_svc& a2) { return a2 < a1; } /// Compare address_svces for ordering. friend bool operator<=(const address_svc& a1, const address_svc& a2) { return !(a2 < a1); } /// Compare address_svces for ordering. friend bool operator>=(const address_svc& a1, const address_svc& a2) { return !(a1 < a2); } private: detail::atmsvc_addr_type addr_; }; // class address_svc #if !defined(BOOST_NO_IOSTREAM) /// Output an address as a string. /** * Used to output a human-readable string for a specified address. * * @param os The output stream to which the string will be written. * * @param addr The address to be written. * * @return The output stream. * * @relates boost::asio::atm::address_svc */ template <typename Elem, typename Traits> std::basic_ostream<Elem, Traits>& operator<<( std::basic_ostream<Elem, Traits>& os, const address_svc& addr); #endif // !defined(BOOST_NO_IOSTREAM) } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_ADDRESS_SVC_HEAD /// \file boost/asio/atm/basic_endpoint.hpp /// UNCLASSIFIED /// \brief Endpoint for ATM sockets #ifndef BOOST_ASIO_ATM_BASIC_ENDPOINT_HEAD #define BOOST_ASIO_ATM_BASIC_ENDPOINT_HEAD #include <boost/asio.hpp> #include "address.hpp" #include "qos.hpp" #include "detail/endpoint.hpp" namespace boost { namespace asio { namespace atm { template <typename AsynchronousTransferModeProtocol> class basic_endpoint { public: /// The protocol type associated with the endpoint. typedef AsynchronousTransferModeProtocol protocol_type; /// The type of the endpoint structure. This type is dependent on the /// underlying implementation of the socket layer. typedef boost::asio::atm::detail::endpoint endpoint_impl; typedef endpoint_impl::data_type data_type; /// Default constructor. basic_endpoint() : impl_() { } /// Construct an endpoint using an ATM address. This /// constructor may be used for accepting connections on a specific interface /// or for making a connection to a remote endpoint. basic_endpoint(const boost::asio::atm::address& addr) : impl_(addr) { } /// Construct an endpoint using an ATM address and Quality Of Service settings. This /// constructor may be used for accepting connections on a specific interface /// or for making a connection to a remote endpoint. basic_endpoint(const boost::asio::atm::address& addr, const qos::settings &qos) : impl_(addr, qos) { } /// Copy constructor. basic_endpoint(const basic_endpoint& other) : impl_(other.impl_) { } #if defined(BOOST_ASIO_HAS_MOVE) /// Move constructor. basic_endpoint(basic_endpoint&& other) : impl_(other.impl_) { } #endif // defined(BOOST_ASIO_HAS_MOVE) /// Assign from another endpoint. basic_endpoint& operator=(const basic_endpoint& other) { impl_ = other.impl_; return *this; } #if defined(BOOST_ASIO_HAS_MOVE) /// Move-assign from another endpoint. basic_endpoint& operator=(basic_endpoint&& other) { impl_ = other.impl_; return *this; } #endif // defined(BOOST_ASIO_HAS_MOVE) /// The protocol associated with the endpoint. protocol_type protocol() const { if (is_svc()) { return AsynchronousTransferModeProtocol::aal5_svc(); } return AsynchronousTransferModeProtocol::aal5_pvc(); } bool is_pvc() const { return impl_.is_pvc(); } bool is_svc() const { return impl_.is_svc(); } /// Get the underlying endpoint in the native type. data_type* data() { return impl_.data(); } /// Get the underlying endpoint in the native type. const data_type* data() const { return impl_.data(); } /// Get the underlying size of the endpoint in the native type. std::size_t size() const { return impl_.size(); } /// Set the underlying size of the endpoint in the native type. void resize(std::size_t new_size) { return impl_.resize(new_size); } /// Get the capacity of the endpoint in the native type. std::size_t capacity() const { return impl_.capacity(); } /// Get the IP address associated with the endpoint. const boost::asio::atm::address address() const { return impl_.address(); } /// Set the IP address associated with the endpoint. void address(const boost::asio::atm::address& addr) { impl_.address(addr); } /// Compare two endpoints for equality. friend bool operator==(const basic_endpoint<AsynchronousTransferModeProtocol>& e1, const basic_endpoint<AsynchronousTransferModeProtocol>& e2) { return e1.impl_ == e2.impl_; } /// Compare two endpoints for inequality. friend bool operator!=(const basic_endpoint<AsynchronousTransferModeProtocol>& e1, const basic_endpoint<AsynchronousTransferModeProtocol>& e2) { return !(e1 == e2); } /// Compare endpoints for ordering. friend bool operator<(const basic_endpoint<AsynchronousTransferModeProtocol>& e1, const basic_endpoint<AsynchronousTransferModeProtocol>& e2) { return e1.impl_ < e2.impl_; } /// Compare endpoints for ordering. friend bool operator>(const basic_endpoint<AsynchronousTransferModeProtocol>& e1, const basic_endpoint<AsynchronousTransferModeProtocol>& e2) { return e2.impl_ < e1.impl_; } /// Compare endpoints for ordering. friend bool operator<=(const basic_endpoint<AsynchronousTransferModeProtocol>& e1, const basic_endpoint<AsynchronousTransferModeProtocol>& e2) { return !(e2 < e1); } /// Compare endpoints for ordering. friend bool operator>=(const basic_endpoint<AsynchronousTransferModeProtocol>& e1, const basic_endpoint<AsynchronousTransferModeProtocol>& e2) { return !(e1 < e2); } private: // The underlying ATM endpoint. endpoint_impl impl_; }; // class basic_endpoint #if !defined(BOOST_NO_IOSTREAM) /// Output an endpoint as a string. /** * Used to output a human-readable string for a specified endpoint. * * @param os The output stream to which the string will be written. * * @param endpoint The endpoint to be written. * * @return The output stream. * * @relates boost::asio::atm::basic_endpoint */ template <typename Elem, typename Traits, typename AsynchronousTransferModeProtocol> std::basic_ostream<Elem, Traits>& operator<<( std::basic_ostream<Elem, Traits>& os, const basic_endpoint<AsynchronousTransferModeProtocol>& endpoint); #endif // !defined(BOOST_NO_IOSTREAM) } // namespace atm } // namespace asio } // namespace boost #include "basic_endpoint.ipp" #endif // BOOST_ASIO_ATM_BASIC_ENDPOINT_HEAD /// \file boost/asio/atm/basic_endpoint.ipp /// UNCLASSIFIED #ifndef BOOST_ASIO_ATM_BASIC_ENDPOINT_IMPL #define BOOST_ASIO_ATM_BASIC_ENDPOINT_IMPL #include "address.hpp" namespace boost { namespace asio { namespace atm { template <typename Elem, typename Traits> std::basic_ostream<Elem, Traits>& operator<<(std::basic_ostream<Elem, Traits>& os, const address_pvc& addr) { if (os) { os << addr.to_string(); } return os; } template <typename Elem, typename Traits> std::basic_ostream<Elem, Traits>& operator<<(std::basic_ostream<Elem, Traits>& os, const address& addr) { if (os) { os << addr.to_string(); } return os; } #if !defined(BOOST_NO_IOSTREAM) template <typename Elem, typename Traits, typename AsynchronousTransferModeProtocol> std::basic_ostream<Elem, Traits>& operator<<( std::basic_ostream<Elem, Traits>& os, const basic_endpoint<AsynchronousTransferModeProtocol>& endpoint) { if (os) { os << endpoint.address(); } return os; } #endif // !defined(BOOST_NO_IOSTREAM) } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_BASIC_ENDPOINT_IMPL /// \file boost/asio/atm/qos.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode QOS for Boost ASIO #ifndef BOOST_ASIO_ATM_QOS_HEAD #define BOOST_ASIO_ATM_QOS_HEAD #include <boost/variant.hpp> #include "detail/socket_types.hpp" namespace boost { namespace asio { namespace atm { namespace qos { struct do_not_use_qos { do_not_use_qos() { } }; struct ubr_settings { unsigned long peak_cell_rate; ubr_settings() : peak_cell_rate(0u) { } ubr_settings(const unsigned long r) : peak_cell_rate(r) { } }; struct cbr_settings { unsigned long peak_cell_rate; cbr_settings() : peak_cell_rate(0u) { } }; struct vbr_settings { unsigned long peak_cell_rate; unsigned long substainable_cell_rate; unsigned long max_burst_size; vbr_settings() : peak_cell_rate(0u), substainable_cell_rate(0u), max_burst_size(0u) { } }; struct abr_settings { unsigned long peak_cell_rate; unsigned long minimum_cell_rate; unsigned long allowed_cell_rate; unsigned long initial_cell_rate; unsigned long rate_increase_factor; unsigned long rate_decrease_factor; unsigned long cut_off_decrease_factor; abr_settings() : peak_cell_rate(0u) , minimum_cell_rate(0u) , allowed_cell_rate(0u) , initial_cell_rate(0u) , rate_increase_factor(0u) , rate_decrease_factor(0u) , cut_off_decrease_factor(0u) { } }; typedef boost::variant<do_not_use_qos, ubr_settings, cbr_settings, vbr_settings, abr_settings> settings; } // namespace qos } // namespace atm } // namespace asio } // namespace boost #include "detail/qos.hpp" #endif // BOOST_ASIO_ATM_QOS_HEAD /// \file boost/asio/atm/detail/endpoint.hpp /// UNCLASSIFIED /// \brief Endpoint for ATM sockets #ifndef BOOST_ASIO_ATM_DETAIL_ENDPOINT_HEAD #define BOOST_ASIO_ATM_DETAIL_ENDPOINT_HEAD #include <boost/asio.hpp> #include <boost/variant.hpp> #include "boost/asio/atm/address.hpp" #include "boost/asio/atm/detail/socket_types.hpp" #include "boost/asio/atm/qos.hpp" namespace boost { namespace asio { namespace atm { namespace detail { class endpoint_data_size_visitor : public boost::static_visitor<std::size_t> { public: std::size_t operator()(const atmpvc_endpoint_type& params) const { return sizeof(atmpvc_endpoint_type); } std::size_t operator()(const atmsvc_endpoint_type &ep) const { return sizeof(atmsvc_endpoint_type); } }; // class endpoint_data_size_visitor class endpoint_address_visitor : public boost::static_visitor<boost::asio::atm::address> { public: boost::asio::atm::address operator()(const atmpvc_endpoint_type& ep) const { return boost::asio::atm::address_pvc(ep.native_connection_id()); } boost::asio::atm::address operator()(const atmsvc_endpoint_type &ep) const { return boost::asio::atm::address_svc(ep.native_connection_id()); } }; // class endpoint_data_size_visitor class endpoint { public: typedef boost::asio::atm::detail::atm_endpoint_type data_type; endpoint() : data_() , qos_() { } /// \todo Add QOS parameters to this constructor endpoint(const boost::asio::atm::address& addr, const qos::settings &qos = qos::do_not_use_qos()) : data_() , qos_(qos) { address(addr); } bool is_pvc() const { return boost::get<atmpvc_endpoint_type*>(&data_) != NULL; } bool is_svc() const { return boost::get<atmsvc_endpoint_type*>(&data_) != NULL; } /// Get the underlying endpoint in the native type. data_type* data() { return &data_; } /// Get the underlying endpoint in the native type. const data_type* data() const { return &data_; } std::size_t size() const { return boost::apply_visitor(endpoint_data_size_visitor(), data_); } void resize(const std::size_t new_size) { if (new_size > sizeof(data_type)) { boost::system::error_code ec(boost::asio::error::invalid_argument); boost::asio::detail::throw_error(ec); } } std::size_t capacity() const { return sizeof(data_type); } boost::asio::atm::address address() const { return boost::apply_visitor(endpoint_address_visitor(), data_); } void address(const boost::asio::atm::address& addr) { if (addr.is_pvc()) { const address_pvc my_pvc_addr = addr.to_pvc(); atmpvc_endpoint_type my_data; boost::apply_visitor(boost::asio::atm::qos::detail::pvc_visitor(my_data), qos_); my_data.assign(*my_pvc_addr.data()); data_ = my_data; } } friend bool operator==(const endpoint& e1, const endpoint& e2) { return e1.address() == e2.address(); } /// Compare endpoints for ordering. friend bool operator<(const endpoint& e1, const endpoint& e2) { return e1.address() < e2.address(); } private: data_type data_; qos::settings qos_; }; // class endpoint } // namespace detail } // namespace atm } // namespace asio } // namespace boost #include "boost/asio/atm/detail/impl/endpoint.ipp" #endif // BOOST_ASIO_ATM_DETAIL_ENDPOINT_HEAD /// \file boost/asio/atm/detail/qos.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode QOS details for Boost ASIO #ifndef BOOST_ASIO_ATM_DETAIL_QOS_HEAD #define BOOST_ASIO_ATM_DETAIL_QOS_HEAD namespace boost { namespace asio { namespace atm { namespace qos { namespace detail { class pvc_visitor : public boost::static_visitor<> { public: pvc_visitor(boost::asio::atm::detail::atmpvc_endpoint_type &p) : boost::static_visitor<>() , data(p) { } void operator()(const do_not_use_qos &) const; void operator()(const ubr_settings &ubr) const; void operator()(const cbr_settings &cbr) const; void operator()(const vbr_settings &vbr) const; void operator()(const abr_settings &abr) const; private: boost::asio::atm::detail::atmpvc_endpoint_type& data; }; } // namespace detail } // namespace qos } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_DETAIL_QOS_HEAD #include "boost/asio/atm/detail/impl/qos.ipp" /// \file boost/asio/atm/detail/socket_ops.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode socket operations for Boost ASIO #ifndef BOOST_ASIO_ATM_DETAIL_SOCKET_OPS_HEAD #define BOOST_ASIO_ATM_DETAIL_SOCKET_OPS_HEAD #include <boost/variant.hpp> #include <boost/asio.hpp> #include <boost/exception/all.hpp> #include "boost/asio/atm/detail/socket_types.hpp" namespace boost { namespace asio { namespace atm { namespace detail { namespace socket_ops { #if defined(BOOST_WINDOWS) || defined(__CYGWIN__) inline void initialize(atmpvc_addr_type& addr) { memset(&addr, 0, sizeof(atmpvc_addr_type)); } inline void set_itf(const unsigned long itf, atmpvc_addr_type& addr) { addr.DeviceNumber = itf; } inline unsigned long itf(const atmpvc_addr_type& addr) { return addr.DeviceNumber; } inline void set_vci(const unsigned long vci, atmpvc_addr_type& addr) { addr.VCI = vci; } inline unsigned long vci(const atmpvc_addr_type& addr) { return addr.VCI; } inline void set_vpi(const unsigned long vpi, atmpvc_addr_type& addr) { addr.VPI = vpi; } inline unsigned long vpi(const atmpvc_addr_type& addr) { return addr.VPI; } #else // ! (BOOST_WINDOWS || __CYGWIN__) inline void initialize(atmpvc_addr_type& addr) { memset(&addr, 0, sizeof(atmpvc_addr_type)); addr.sap_family = AF_ATMPVC; } inline void set_itf(const unsigned long itf, atmpvc_addr_type& addr) { addr.sap_addr.itf = itf; } inline unsigned long itf(const atmpvc_addr_type& addr) { return addr.sap_addr.itf; } inline void set_vci(const unsigned long vci, atmpvc_addr_type& addr) { addr.sap_addr.vci = vci; } inline unsigned long vci(const atmpvc_addr_type& addr) { return addr.sap_addr.vci; } inline void set_vpi(const unsigned long vpi, atmpvc_addr_type& addr) { addr.sap_addr.vpi = vpi; } inline unsigned long vpi(const atmpvc_addr_type& addr) { return addr.sap_addr.vpi; } #endif // BOOST_WINDOWS || __CYGWIN__ } // namespace socket_ops class bind_endpoint_visitor : public boost::static_visitor<int> { public: bind_endpoint_visitor(const boost::asio::detail::socket_type s, boost::system::error_code &ec) : socket_(s) , ec_(ec) { } /// Set the VCI/VPI pair for a permament virtual circuit (PVC) int operator()(const atmpvc_endpoint_type& params) const; int operator()(const atmsvc_endpoint_type& params) const; private: boost::asio::detail::socket_type socket_; boost::system::error_code& ec_; }; // class bind_endpoint_visitor } // namespace detail } // namespace atm } // namespace asio } // namespace boost namespace boost { namespace asio { namespace detail { namespace socket_ops { BOOST_ASIO_DECL int bind(socket_type s, const boost::asio::atm::detail::atm_endpoint_type* addr, std::size_t addrlen, boost::system::error_code& ec) { return boost::apply_visitor(boost::asio::atm::detail::bind_endpoint_visitor(s, ec), *addr); } } // namespace socket_ops } // namespace detail } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_DETAIL_SOCKET_OPS_HEAD /// \file boost/asio/atm/detail/socket_option.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode socket options for Boost ASIO #ifndef BOOST_ASIO_ATM_DETAIL_SOCKET_OPTION_HEAD #define BOOST_ASIO_ATM_DETAIL_SOCKET_OPTION_HEAD #include <boost/asio.hpp> namespace boost { namespace asio { namespace atm { namespace detail { namespace socket_option { class qos { public: template <typename Protocol> int level(const Protocol& protocol) const { } template <typename Protocol> int name(const Protocol& protocol) const { } template <typename Protocol> void* data(const Protocol& protocol) { } template <typename Protocol> const void* data(const Protocol& protocol) const { } template <typename Protocol> std::size_t size(const Protocol& protocol) const { } template <typename Protocol> void resize(const Protocol& protocol, std::size_t s) { } private: }; // class qos } // namespace socket_option } // namespace detail } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_DETAIL_SOCKET_OPTION_HEAD /// \file boost/asio/atm/detail/socket_types.hpp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode socket types for Boost ASIO #ifndef BOOST_ASIO_ATM_DETAIL_SOCKET_TYPES_HEAD #define BOOST_ASIO_ATM_DETAIL_SOCKET_TYPES_HEAD #include <string> #include <boost/asio.hpp> #include <boost/variant.hpp> #if defined HAVE_ATM_H extern "C" { # include <atm.h> } #elif defined HAVE_SYS_NETATM_ATM_H # include <sys/netatm/atm.h> #elif defined _WIN32 # include <ws2atm.h> #else # error There is no ATM header to include #endif namespace boost { namespace asio { namespace atm { namespace detail { #if defined(BOOST_WINDOWS) || defined(__CYGWIN__) typedef sockaddr_atm atmsvc_addr_type; typedef ATM_CONNECTION_ID atmpvc_addr_type; /// \note Wrap the ATM_PVC_PARAMS so that I have a place to default construct it. struct atmpvc_endpoint_type { ATM_PVC_PARAMS native_; atmpvc_endpoint_type() : native_() { // Initialize Qos Settings with default values : UBR without specified Qos native_.PvcQos.ReceivingFlowspec.TokenRate = QOS_NOT_SPECIFIED; native_.PvcQos.ReceivingFlowspec.TokenBucketSize = QOS_NOT_SPECIFIED; native_.PvcQos.ReceivingFlowspec.PeakBandwidth = QOS_NOT_SPECIFIED; native_.PvcQos.ReceivingFlowspec.Latency = QOS_NOT_SPECIFIED; native_.PvcQos.ReceivingFlowspec.DelayVariation = QOS_NOT_SPECIFIED; native_.PvcQos.ReceivingFlowspec.ServiceType = SERVICETYPE_BESTEFFORT; native_.PvcQos.ReceivingFlowspec.MaxSduSize = QOS_NOT_SPECIFIED; native_.PvcQos.ReceivingFlowspec.MinimumPolicedSize = QOS_NOT_SPECIFIED; native_.PvcQos.SendingFlowspec.TokenRate = QOS_NOT_SPECIFIED; native_.PvcQos.SendingFlowspec.TokenBucketSize = QOS_NOT_SPECIFIED; native_.PvcQos.SendingFlowspec.PeakBandwidth = QOS_NOT_SPECIFIED; native_.PvcQos.SendingFlowspec.Latency = QOS_NOT_SPECIFIED; native_.PvcQos.SendingFlowspec.DelayVariation = QOS_NOT_SPECIFIED; native_.PvcQos.SendingFlowspec.ServiceType = SERVICETYPE_BESTEFFORT; native_.PvcQos.SendingFlowspec.MaxSduSize = QOS_NOT_SPECIFIED; native_.PvcQos.SendingFlowspec.MinimumPolicedSize = QOS_NOT_SPECIFIED; } const ATM_PVC_PARAMS &native() const { return native_; } const ATM_CONNECTION_ID &native_connection_id() const { return native_.PvcConnectionId; } void assign(const ATM_CONNECTION_ID &i) { native_.PvcConnectionId = i; } }; struct atmsvc_endpoint_type { sockaddr_atm native_; atmsvc_endpoint_type() : native_() { } const sockaddr_atm &native() const { return native_; } const sockaddr_atm &native_connection_id() const { return native_; } void assign(const sockaddr_atm &i) { native_ = i; } }; #else typedef sockaddr_atmsvc atmsvc_addr_type; typedef sockaddr_atmpvc atmpvc_addr_type; typedef atm_qos atm_qos_type; struct atmpvc_endpoint_type { atmpvc_addr_type addr; atm_qos_type qos; atmpvc_endpoint_type() : addr() , qos() { qos.aal = ATM_AAL5; } const atmpvc_addr_type &native() const { return addr; } const atmpvc_addr_type &native_connection_id() const { return addr; } void assign(const atmpvc_addr_type &a) { addr = a; } }; struct atmsvc_endpoint_type { atmsvc_addr_type addr; atm_qos_type qos; const atmsvc_addr_type &native() const { return addr; } const atmsvc_addr_type &native_connection_id() const { return addr; } void assign(const atmsvc_addr_type &a) { addr = a; } }; #endif // BOOST_WINDOWS || __CYGWIN__ typedef boost::variant<atmpvc_endpoint_type, atmsvc_endpoint_type> atm_endpoint_type; } // namespace detail } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_DETAIL_SOCKET_TYPES_HEAD /// \file boost/asio/atm/detail/impl/endpoint.ipp /// UNCLASSIFIED /// \brief Endpoint for ATM sockets #ifndef BOOST_ASIO_ATM_DETAIL_ENDPOINT_IPP #define BOOST_ASIO_ATM_DETAIL_ENDPOINT_IPP namespace boost { namespace asio { namespace atm { namespace detail { #if defined(BOOST_WINDOWS) || defined(__CYGWIN__) int bind_endpoint_visitor::operator()(const atmpvc_endpoint_type& params) const { using boost::asio::detail::socket_ops::error_wrapper; DWORD out_bytes; /// \todo What gets placed in out_bytes? return error_wrapper(WSAIoctl(socket_, SIO_ASSOCIATE_PVC, (LPVOID) &params.native(), sizeof(ATM_PVC_PARAMS), NULL, 0, &out_bytes, NULL, NULL), ec_); } int bind_endpoint_visitor::operator()(const atmsvc_endpoint_type& params) const { ec_ = boost::asio::error::invalid_argument; return -1; } #else // ! (BOOST_WINDOWS || __CYGWIN__) int bind_endpoint_visitor::operator()(const atmpvc_endpoint_type& params) const { // I am not convinced that this is the best place to set the ATM QOS // options, but it makes the implementation consistent with Windows. // Also, it makes the socket constructors that accept an endpoint work. // I probably need an equivalent for "connect" and "listen." boost::asio::detail::socket_ops::state_type my_state; if (const int result = boost::asio::detail::socket_ops::setsockopt(socket_, my_state, SOL_ATM, SO_ATMQOS, &params.qos, sizeof(params.qos), ec_)) { return result; } return boost::asio::detail::socket_ops::bind(socket_, (struct sockaddr *) &params.addr, sizeof(params.addr), ec_); } int bind_endpoint_visitor::operator()(const atmsvc_endpoint_type& params) const { ec_ = boost::asio::error::invalid_argument; return -1; } #endif // end defined(BOOST_WINDOWS) || defined(__CYGWIN__) } // namespace detail } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_DETAIL_ENDPOINT_IPP /// \file boost/asio/atm/detail/impl/qos.ipp /// UNCLASSIFIED /// \brief Asynchronous Transfer Mode QOS implementation #ifndef BOOST_ASIO_ATM_QOS_IPP #define BOOST_ASIO_ATM_QOS_IPP namespace boost { namespace asio { namespace atm { namespace qos { namespace detail { #if defined BOOST_WINDOWS || __CYGWIN__ void pvc_visitor::operator()(const do_not_use_qos &) const { } void pvc_visitor::operator()(const ubr_settings &ubr) const { data.native_.PvcQos.SendingFlowspec.PeakBandwidth = ubr.peak_cell_rate * 48u; } void pvc_visitor::operator()(const cbr_settings &cbr) const { data.native_.PvcQos.SendingFlowspec.ServiceType = SERVICETYPE_GUARANTEED; data.native_.PvcQos.ReceivingFlowspec.ServiceType = SERVICETYPE_GUARANTEED; data.native_.PvcQos.SendingFlowspec.PeakBandwidth = cbr.peak_cell_rate * 48u; } void pvc_visitor::operator()(const vbr_settings &vbr) const { data.native_.PvcQos.SendingFlowspec.ServiceType = SERVICETYPE_CONTROLLEDLOAD; data.native_.PvcQos.ReceivingFlowspec.ServiceType = SERVICETYPE_CONTROLLEDLOAD; data.native_.PvcQos.SendingFlowspec.PeakBandwidth = vbr.peak_cell_rate * 48u; data.native_.PvcQos.SendingFlowspec.TokenRate = vbr.substainable_cell_rate * 48u; data.native_.PvcQos.SendingFlowspec.TokenBucketSize = vbr.max_burst_size * 48u; } void pvc_visitor::operator()(const abr_settings &abr) const { } #else void pvc_visitor::operator()(const do_not_use_qos &) const { data.qos.txtp.traffic_class = ATM_NONE; data.qos.txtp.traffic_class = ATM_NONE; } void pvc_visitor::operator()(const ubr_settings &ubr) const { data.qos.txtp.traffic_class = ATM_UBR; data.qos.rxtp.traffic_class = ATM_UBR; data.qos.rxtp.max_sdu = ubr.peak_cell_rate; data.qos.txtp.max_pcr = ubr.peak_cell_rate; } void pvc_visitor::operator()(const cbr_settings &cbr) const { data.qos.txtp.traffic_class = ATM_CBR; data.qos.rxtp.traffic_class = ATM_CBR; //data.qos.txtp.ServiceType = SERVICETYPE_GUARANTEED; //data.native.qos.rxtp.ServiceType = SERVICETYPE_GUARANTEED; data.qos.txtp.max_pcr = cbr.peak_cell_rate; } void pvc_visitor::operator()(const vbr_settings &vbr) const { data.qos.txtp.traffic_class = ATM_VBR; data.qos.rxtp.traffic_class = ATM_VBR; //data.qos.txtp.ServiceType = SERVICETYPE_CONTROLLEDLOAD; //data.qos.rxtp.ServiceType = SERVICETYPE_CONTROLLEDLOAD; data.qos.txtp.max_pcr = vbr.peak_cell_rate; //data.qos.txtp.TokenRate = vbr.substainable_cell_rate; //data.qos.txtp.TokenBucketSize = vbr.max_burst_size; } void pvc_visitor::operator()(const abr_settings &abr) const { data.qos.txtp.traffic_class = ATM_ABR; data.qos.rxtp.traffic_class = ATM_ABR; } #endif } // namespace detail } // namespace qos } // namespace atm } // namespace asio } // namespace boost #endif // BOOST_ASIO_ATM_QOS_IPP

1 0

problem with boost parallel graph dijkstra_shortest_paths
by areslp 20 Jul '12

20 Jul '12

I want to use the parallel version of dijkstra_shortest_paths, here is my code, it works very well with the sequential version of BGL, but can not be compiled with parallel BGL. typedef boost::adjacency_list < boost::vecS, boost::vecS, boost::undirectedS, boost::no_property, boost::property < boost::edge_weight_t, double > > graph_t; typedef boost::graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef boost::graph_traits < graph_t >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Edge; template <class Vertex> struct target_visitor : public default_dijkstra_visitor { target_visitor(vector<bool>* vec,int total) : vec_(vec),num_(0),total_(total),examined_(0) { } template <class Graph> void examine_vertex(Vertex v, Graph& g) { examined_++; if ((*vec_)[v]) { //visited, set false to prevent multi visit (*vec_)[v]=false; num_++; //cout<<"v:"<<v<<",total:"<<total_<<",num:"<<num_<<",examined_:"<<examined_<<endl; } if (total_==num_) { //cout<<"OK. break, Total point size is:"<<vec_->size()<<",examined_ point size is:"<<examined_<<endl; //all vertex in v have been found throw std::exception(); } } private: vector<bool>* vec_; int num_; int total_; int examined_; }; template <class Vertex> target_visitor<Vertex> target_visit(vector<bool>* u,int total) { return target_visitor<Vertex>(u,total); } void BaseFilter::getShortestPathInNRing(int source,int num,std::vector<bool>& tar,std::vector<vertex_descriptor>& p,std::vector<double>& d){ vertex_descriptor sou = vertex(source, g_); assert(num_vertices(g_)==mesh_->m_vecVertex.size()); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g_); property_map<graph_t, vertex_index_t>::type indexmap = get(vertex_index, g_); try { dijkstra_shortest_paths(g_, sou, &p[0], &d[0], weightmap, indexmap, std::less<double>(), closed_plus<double>(), (std::numeric_limits<double>::max)(), 0, target_visitor<vertex_descriptor>(&tar,num)); //dijkstra_shortest_paths(g_, sou, predecessor_map(&p[0]).distance_map(&d[0])); } catch (std::exception e) { } } The compile errors are: Error 11 error C2664: 'boost::put' : cannot convert parameter 2 from 'boost::detail::parallel::global_descriptor<LocalDescriptor>' to 'ptrdiff_t' C:\boost_1_49_0\boost_1_49_0\boost\graph\distributed\crauser_et_al_shortest_paths.hpp 584 Error 12 error C2664: 'boost::put' : cannot convert parameter 2 from 'boost::detail::parallel::global_descriptor<LocalDescriptor>' to 'ptrdiff_t' C:\boost_1_49_0\boost_1_49_0\boost\graph\distributed\crauser_et_al_shortest_paths.hpp 585 Error 13 error C2664: 'boost::put' : cannot convert parameter 2 from 'boost::detail::parallel::global_descriptor<LocalDescriptor>' to 'ptrdiff_t' C:\boost_1_49_0\boost_1_49_0\boost\graph\distributed\crauser_et_al_shortest_paths.hpp 587 -- Best Regards Areslp

2 1

Can anybody help to check my Boost code?
by JIA Pei 19 Jul '12

19 Jul '12

Hi, all: My environment: Ubuntu 12.04 + libboost1.48-dev ( 1.48.0-3(precise) ) My code patch: > bool VO_IO::ScanDirectory( const path &dir_path, > const string &file_extension, > vector<string>& files) > { > if ( !exists( dir_path ) ) > { > return false; > } > directory_iterator end_itr; > for ( directory_iterator itr(dir_path); itr != end_itr; ++itr ) > { > if ( is_directory(itr->status()) ) > ------ 1 > { > VO_IO::ScanDirectory(itr->path(), file_extension, files); > ------ 2 > } > else if ( extension( itr->path() ) == file_extension ) > ------ 3 > { > files.push_back( itr->path().string() ); > ------ 4 > } > } > return true; > } I got multiple warning/error messages at the above 4 lines: line 1 > a) Invalid arguments ' > Candidates are: > bool is_directory(const boost::filesystem3::path &, > boost::system::error_code &) > bool is_directory(boost::filesystem3::file_status) > bool is_directory(const boost::filesystem3::path &) > ' > b) Method 'status' could not be resolved line 2 > a) Invalid arguments ' > Candidates are: > bool ScanDirectory(const boost::filesystem3::path &, const > std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, > std::vector<std::basic_string<char,std::char_traits<char>,std::allocator<char>>,std::allocator<std::basic_string<char,std::char_traits<char>,std::allocator<char>>>> > &) > ' > b) Method 'path' could not be resolved line 3 > a) Invalid arguments ' > Candidates are: > std::basic_string<char,std::char_traits<char>,std::allocator<char>> > extension(const boost::filesystem3::path &) > ' > b) Method 'path' could not be resolved line 4 > a) Invalid arguments ' > Candidates are: > void push_back(const > std::basic_string<char,std::char_traits<char>,std::allocator<char>> &) > b) Method 'path' could not be resolved > c) Method 'string' could not be resolved It seems filesystem v3 conflicts with original fliesystem? Anyway, I just don't want to see those red alerts in Eclipse IDE. Can anybody give me a hand? Cheers Pei -- Pei JIA Email: jp4work(a)gmail.com cell: +1 604-362-5816 Welcome to Vision Open http://www.visionopen.com

2 2

[Boost.Exception] A couple of unspotted areas
by Alexander Mingalev 19 Jul '12

19 Jul '12

Hi, I'm trying to use Boost.Exception library and I have some issues here. 1. How to build exception hierarchy correctly? According to examples I wrote: #include <iostream> #include <boost/exception/all.hpp> struct Error1 : virtual public std::exception, virtual public boost::exception { Error1(const char* msg) : std::exception(msg) {} }; struct Error2 : virtual public Error1 { Error2(const char* msg) : Error1(msg) {} }; ... std::cout << Error2("zzz").what() << std::endl; I've got "Unknown exception" instead of "zzz" 2. Strange behavior of boost::enable_error_info Look at this example: #include <iostream> #include <boost/exception/all.hpp> typedef boost::error_info<struct Tag1_, int> Tag1; typedef boost::error_info<struct Tag2_, int> Tag2; void f1(); void f2(); int main() { try { f1(); } catch (const std::exception& e) { std::cout << boost::diagnostic_information(e) << std::endl; } return 0; } void f1() { try { f2(); } catch (const std::exception& e) { throw boost::enable_error_info(e) << Tag1(1); } } void f2() { throw boost::enable_error_info(std::runtime_error("f2 exception")) << Tag2(2) ; } It prints: Throw location unknown (consider using BOOST_THROW_EXCEPTION) Dynamic exception type: boost::exception_detail::error_info_injector<std::exception> std::exception::what: std::exception [Tag1_*] = 1 Where is Tag2 data? Looks like enable_error_info erases all previous accumulated infos. Besides, type of exception is reported as "std::exception", not "std::runtime_error"

3 2

Extracting a boost::function from a boost::signals2::signal
by Chris Stankevitz 19 Jul '12

19 Jul '12

Hello, I would like to create an "Interceptor" class that can generically receive a void-returning signal with n arguments (as something like a boost::function<void()>) and, at runtime, decide whether the signal will be delivered to the final slot. Or perhaps even deliver the signal at some later time. Psuedocode might look like this: class Interceptor { template<class Signal> void Connect(Signal& signal, const Signal::slot_type& slot) { signal.connect_generic(slot, bind(&Interceptor::Dispatch, this, _1)); } void Dispatch(const boost::function<void()>& Function) { if (DispatchNow()) { Function(); } else if (DispatchLater()) { DispatchLater.push_back(Function); } } }; Is such a thing possible? Thank you, Chris

1 0

[BJam] managing including order
by Marc-Antoine ARNAUD 19 Jul '12

19 Jul '12

Hi, I'm currently tring to use including ordering into BJam files. I have 2 libraries - boostHack (header only library) defined by: alias boostHack : # no sources : # no build requirements : # no default build : <include>. ; and - libSupport defined with: project : requirements <include>$(BOOST_HACK)&&$(BOOST_LIBS) <include>include <link>static : usage-requirements <include>include <include>../../tuttle/src : build-dir $(BUILD)/openFX/Support ; lib Support : # which using boost system library [ glob-tree *.cpp ] : /boost//system/<link>static ; like it mentionned here http://www.boost.org/doc/libs/1_36_0/doc/html/bbv2/faq.html, headers are included with alphabetical order, and I try to change order with <include>$(BOOST_HACK)&&$(BOOST_LIBS). But with using the boost system library, it include the BOOST_ROOT directory before the BoostHack header library. In the command, I found: -I"/datas/mrn/dev/TuttleOFX/3rdParty/boost" -I"/datas/mrn/dev/TuttleOFX/libraries/boostHack" -I"/datas/mrn/dev/TuttleOFX/3rdParty/boost" and I want: -I"/datas/mrn/dev/TuttleOFX/libraries/boostHack" -I"/datas/mrn/dev/TuttleOFX/3rdParty/boost" Can someone know how to change this including order between include directory and library dependencies ? -- Marc-Antoine* *ARNAUD Software Engineer Mikros Image - Digital Post-Production for Video and Film www.mikrosimage.eu

1 0

Starting with boost
by Ronny Herzog 19 Jul '12

19 Jul '12

Dear all, I want to start using boost and tried the steps provided in http://www.boost.org/doc/libs/1_43_0/more/getting_started/windows.html. <http://www.boost.org/doc/libs/1_43_0/more/getting_started/windows.html#auto…> My system is Windows 7 with MS VC 2008 and I would like to use boost from the command line. I run bootstrap.bat and bjam.exe to build all libraries. However, when I want to compile the example file (http://www.boost.org/doc/libs/1_43_0/more/getting_started/windows.html#link…) which uses the 'regex' library it does not find it. Command: c:\Users\Duke\My_Projects\boost_python>cl /EHsc /I c:\boost_1_50_0 testBoost.cpp /link /LIBPATH:C:\boost_1_50_0\libs\ Microsoft (R) 32-bit C/C++ Optimizing Compiler Version 15.00.21022.08 for 80x86 Copyright (C) Microsoft Corporation. All rights reserved. testBoost.cpp Microsoft (R) Incremental Linker Version 9.00.21022.08 Copyright (C) Microsoft Corporation. All rights reserved. /out:testBoost.exe /LIBPATH:C:\boost_1_50_0\libs\ testBoost.obj LINK : fatal error LNK1104: cannot open file 'libboost_regex-vc90-mt-s-1_50.lib' c:\Users\Duke\My_Projects\boost_python> Why does it not find the library? Do I have to set a variable for the library path for MSVC 2008? How? Any help is very much appreciated! Thanks, Ronny

3 3

Parsing a Windows/DOS file path with Spirit
by Yves Dolce 19 Jul '12

19 Jul '12

I've started learning Spirit a couple of days ago and I'd like to know if anyone already implemented a parser for a Windows file path. A local one with a drive letter, not a general UNC. If so, can you share it? That would help me quite a lot to go past the number/xml related examples in the tutorials. Thanks.

1 0

Build Boost 1.50 on Windows XP for MSVS2008
by Boost lzw 19 Jul '12

19 Jul '12

Hi there, I am wondering if anyone here have built 1.50 on Windows XP for MSVS2008 and can kindly share what exact commands in command line that I should use to manaully build everything from the sorce for use with MSVS2008. I have downloaded boost 1.50 and placed it under "C:\Program Files\boost_1_50_0\" folder and can modify the folder when building. I read here that someone tried something like: cd "C:\Program Files\boost_1_50_0\" bootstrap.bat bjam.exe but I could not find "bjam.exe". I also suspect the building process might not be so simple. Thanks in advance for your help. Robert

5 11

Distributed breadth first search MPI_Unpack runtime error
by Clara Moore 18 Jul '12

18 Jul '12

Hi, I'm having a runtime error that I can't seem to figure out how to fix. When I create and breadth first search a graph with 1,000,000 vertices my code works fine, but if I create and breadth first search a graph with 2,000,000 vertices then I get an MPI_Unpack runtime error. From a stack trace I believe that the code is failing on a call to synchronize the first time that the queue is checked for being empty within the breadth first search code. Can anyone tell me what is wrong in my code please? I'm using version 1.48.0 if that helps any. My code is: #include <boost/graph/use_mpi.hpp> #include <boost/mpi/environment.hpp> #include <boost/mpi/communicator.hpp> #include <boost/graph/distributed/concepts.hpp> #include <boost/graph/adj_list_serialize.hpp> #include <boost/graph/distributed/mpi_process_group.hpp> #include <boost/graph/distributed/adjacency_list.hpp> #include <boost/random/linear_congruential.hpp> #include <boost/graph/distributed/breadth_first_search.hpp> #include <boost/graph/rmat_graph_generator.hpp> using namespace boost; using namespace graph; using namespace distributed; int main(int argc, char* argv[]) { mpi::environment env(argc, argv); mpi::communicator world; int verts = 20; if(argc > 1){ verts = atoi(argv[1]); } int edgs = 12*verts; if(argc > 2){ edgs = atoi(argv[2]); } typedef adjacency_list<listS, distributedS<mpi_process_group, vecS>, undirectedS> Graph; minstd_rand gen_rmat; typedef rmat_iterator<minstd_rand, Graph> RMATgen; Graph g(RMATgen(gen_rmat, verts, 12*verts, 0.33, 0.15, 0.49, 0.03), RMATgen(), verts); world.barrier(); synchronize(g.process_group()); world.barrier(); breadth_first_search(g, vertex(0, g), visitor(bfs_visitor<null_visitor>())); world.barrier(); return 0; } And the runtime error I get is: terminate called after throwing an instance of 'boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::mph::exception> >' what(): MPI_Unpack: MPI_ERR_ARG: invalid argument of some other kind

1 0

boost numeric bindings - lartg
by Peter Man 18 Jul '12

18 Jul '12

Hi, I'm using the numeric bindings library, and am trying to generate a plane rotation. I've done this using the blas::rotg function, but was hoping to try out the more accurate lapack::lartg function. However, I cannot find this function. Is this missing from the library or have I just not looked hard enough? Thanks in advance! Peter

2 1

Re: [Boost-users] filesystem directory_iterator run-time error during construction after upgrading to OSX Lion
by Thibaut LEPAGE 18 Jul '12

18 Jul '12

Hello, I have a program using a directory_iterator which worked well until yesterday (Mac OSX Lion, g++ version 4.2 and boost version 1.49). Then I upgraded g++ to 4.7 and now the program produces a runtime error "pointer being freed was not allocated" when trying to create the directory_iterator. Thibaut Lepage

1 0

How to make is_arithmetic true for a UDT
by Paul A. Bristow 17 Jul '12

17 Jul '12

I am facing the need to get my User Defined Type to return true from boost::is_arithmetic (This is to meet a check for autoprefixing in Boost.Units) There was some discussion on this issue before, http://lists.boost.org/boost-users/2007/10/31538.php but I am not clear if it reached a satisfactory conclusion. (Nor that I fully understand what is being proposed). A cut-down example is a Trivial UDT that does exactly same as double. (My actual example has template parameter for floating-point type of two members, a value and an uncertainty, and others). Suggestions? Paul -- - Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

3 6

[Phoenix] for_each calling push_back for stl containers
by Ryan 17 Jul '12

17 Jul '12

Hello, In upgrading from boost 1.39 to 1.47 I changed my use of the Phoenix library (which was within Spirit) to the stand alone Phoenix library. This caused my below code to stop working. /**** Code Start ***/ static boost::char_separator<char> seperator(":"); boost::tokenizer< boost::char_separator<char> > tokens(s, seperator); //s is a passed in std::string std::vector<std::string> string_tokens; namespace phx = boost::phoenix; //This line fails to compile now. std::for_each(tokens.begin(), tokens.end(), phx::bind(&std::vector<std::string>::push_back, &string_tokens, phx::arg_names::arg1)); /**** Code Stop ***/ This lead me to three questions. 1. What changed about phoenix bind that caused this not to work any more? 2. I tried using the lazy version of push_back to bypass the bind issue. In the documentation there are not any examples of multiple algorithm and container methods calling each other to show how the arguments of one method is passed to another. std::for_each(tokens.begin(), tokens.end(), phx::push_back(&string_tokens, phx::arg_names::arg1)); This compiles but nothing is placed into string_tokens. So I'm assuming the argument from for_each isn't being passed to push_back. What needs to changed in this method call? 3. Can that entire line of question 2 be replaced with the lazy version of the method calls or does the outer most call need to be a non-lazy method? phx::for_each(phx::arg_names::arg1, phx::push_back(phx::arg_names::arg2, phx::arg_names::arg3))(tokens, string_tokens, ???); If the entire line can be a lazy version then how would I map for_each to push_back for arg3? Any help for these three questions would really be appreciated. Ryan

5 23

How to deal with the exception " End of File"
by mcheng 17 Jul '12

17 Jul '12

Hi all: I have check the thread which was talking about "end of file" problem. I have the same issue and I have no idea about when the socket be closed by program. The author said that he fixed the bug after debugging finally but he didn't show the way to solve the problem and where was the bug is~ Can some body give me some hint about it ? Thanks Cheer~ Cheng Mo Beijing Jaeger Communication Electronic Technology Co., Ltd. Addr: Floor2B Dingjun Plaza No.75 Suzhou Street, 100080, Beijing, China Mail: mcheng(a)pbicn.com

2 1

[context] Release date?
by Szymon Gatner 17 Jul '12

17 Jul '12

Hey, boost.context has been accepted quite some time ago, is there any eta on when it is going be officially part of boost? asio (for async task running) + context (as a coroutine/continuation) == pure win -- Szymon Gatner The Lordz Games Studio www.thelordzgamesstudio.com

3 6

compile asio against static boost libs
by Sergiy Nazarenko 17 Jul '12

17 Jul '12

Hi all! I would like to compile my project against static libraries If I compile my project in following manner: c++ -I/usr/local/include/boost/1.49.0/ -c -o azio.o azio.cpp c++ -L/usr/local/lib64/boost/1.49.0/ azio.o -lboost_system -o bin/azio It is OK. But if I use static libraries: c++ -I/usr/local/include/boost/1.49.0/ -c -o azio.o azio.cpp c++ -L/usr/local/lib64/boost/1.49.0/ azio.o /usr/local/lib64/boost/1.49.0/libboost_system.a -o bin/azio I have got error: azio.o: In function `boost::asio::detail::posix_tss_ptr_create(unsigned int&)': azio.cpp:(.text._ZN5boost4asio6detail20posix_tss_ptr_createERj[boost::asio::detail::posix_tss_ptr_create(unsigned int&)]+0x19): undefined reference to `pthread_key_create' azio.o: In function `boost::asio::detail::posix_thread::~posix_thread()': ........ ........ boost::asio::detail::task_io_service::thread_info>::context>::operator=(boost::asio::detail::call_stack<boost::asio::detail::task_io_service, boost::asio::detail::task_io_service::thread_info>::context*)]+0x20): undefined reference to `pthread_setspecific' collect2: ld returned 1 exit status I used strings to know where is function pthread_key_create. I found in libboost_thread.so. Next my step was: c++ -L/usr/local/lib64/boost/1.49.0/ azio.o /usr/local/lib64/boost/1.49.0/libboost_system.a /usr/local/lib64/boost/1.49.0/libboost_thread.a -o bin/azio I've try out to mix up places libraries and object file c++ .. azio.o libboost_system.a libboost_thread.a -o bin/azio c++ .. libboost_system.a libboost_thread.a azio.o -o bin/azio c++ .. libboost_thread.a azio.o libboost_system.a -o bin/azio But error is still. Thanx, Sergiy

3 4

[boost] conversion review report
by Gordon Woodhull 16 Jul '12

16 Jul '12

Hi Vicente, all, Profuse apologies for the long delay in writing this report. Cheers, Gordon Report on Boost Conversion Library Review, August 20-29, 2011. I want to thank Vicente Botet Escriba for submitting the Conversion library for review and for his general good nature in receiving criticism and alternate designs. The Conversion library presents a general framework for plugging in conversion operations between arbitrary types, providing a consistent interface for type-to-type conversions. The library is unfortunately rejected. During the review, there were two votes for acceptance and two against, and some interesting conversation from about a dozen participants. The major reason the library can't be accepted in its current form is that there was near consensus that there is no universal conversion domain, especially when the source or destination type might be a string. Much of the review focused on possible One Definition Rule (ODR) violations, which are a consequence of having a universal customization point using template specializations or function overloads. Many solutions were offered, which will make up the second part of this report, "How to Avoid Universality." I. Concerns about the library Conversions Are Not Generic? While some reviewers didn't see the need for a generic conversion library (and I was a little surprised at the vehemence of their opinions), I don't see this in itself as a reason to reject the library. The library's stated purpose is to provide a common interface for general type <-> type conversions, like lexical_cast does for string <-> type conversions. However, it was interesting that seemingly no one could come up with applications of truly generic conversion, although Jeffrey Lee Hellrung and Antony Polukhin alluded to their existence. Also, some reviewers pointed out that you often need to choose what kind of conversion to do, and a generic library can get in the way here. Strings are the most obvious example: if you are converting from a string representing a binary value it would not work to use a decimal converter. Antony Polukhin pointed out a more subtle example: "lexical_cast<char>(1) and numeric_cast<char>(1) will produce different output." Jeff Hellrung summed this point up nicely: "I think it's certainly possible for different clients using the same generic component to want different conversion implementations for a given pair of types, and that point, Boost.Conversion's universally-defined conversion implementations become useless. One wants the conversion operation to be parametrized as well as the types involved in the conversion." Multi-Client Specialization Concerns Leaving aside possible ODR violations, which we'll return to in Part II, some reviewers questioned the scalability of using template specialization and overloads when many clients (i.e. independent headers) may be customizing the behavior. Vladimir Batov claimed that a system which allows partial specializations on both Source and Target can't be made to work generally. Jeroen Habraken said SFINAE/enable_if "does make code fragile". I'm not clear if these conversations were resolved (or resolvable ;). Non-Generic Solutions Some reviewers objected that conversions should just be defined within individual libraries, but of course this begs the question (as came up recently on the ML between DateTime and Chrono), "which library should house the conversions?" Others (such as Phil Endecott) thought that simple c-style functions such as rgb_to_cmyk() were more explicit and direct. Why is this so complex? Kevlin Henney, initially excited about a general solution to the problem which lexical_cast first set out, commented on the documentation: "Based on casual reading, it feels a little more complex and requires a higher-entry level of knowledge than would be appropriate for many of the people who actually need this functionality." II. How to Avoid Universality One of the positive results of this review was a small catalog of alternatives to a universal customization point involving template specialization or overloaded functions. a. Avoid the Problem In the strictest sense, any library which allows either kind of universal customization can be prone to ODR violations. But many reviewers particularly thought that a customization point involving two UDTs was especially dangerous. To his credit, Vicente was very up-front about the limitations of his design, and attempted to formulate rules for how the library could be used safely. In the documentation, he suggests (IIUC) that header-only libraries could use generic conversions as long as they don't define them, or define them as long as they don't use them. http://tinyurl.com/cmbgyfk b. Inherited tags John Bytheway suggested a tag-dispatch system where conversions are tagged with their source library, and any library which depends on conversions from two libraries would define a tag which inherits from the tags of both libraries. Thus ODR violations are avoided at the expense of having to specify an extra tag (effectively a sort of global conversion domain). http://lists.boost.org/Archives/boost/2011/08/184836.php c. Conversion Domains and Overloaded Function Objects Going on the consensus that there is no universal conversion domain, your humble review manager suggested a metaprogramming solution that defines conversion domain objects which combine a set of conversions within an object. http://lists.boost.org/Archives/boost/2011/08/185259.php A more general solution would be to create an overloaded polymorphic function object, much like a polymorphic-source version of Lorenzo Caminiti's OverloadedFunction library (http://tinyurl.com/72nolyj) However, I have been warned (by Daveed Vandevoorde) that the rules for function overloading are too dangerously complicated to implement in a metaprogram. d. Boost.Dispatch Matthias Gaunard announced that he is working on a library particularly to "solve the problem of specializing a function template for a category of types with best-match selection." http://lists.boost.org/Archives/boost/2011/08/185286.php e. Abuse of Unnamed Namespaces Emil Dotchevski suggested that "It might be possible to abuse unnamed namespaces to avoid violating ODR". I'm not clear if this was a serious suggestion as it wasn't spelled out. :) f. GIL's solution (?) Christian Henning wrote: "GIL has such functionality. I like their way of structuring conversion." However, I was not able to find a description of this mechanism for the report. Thanks to everyone who participated in the review! _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [Boost-users] testing archive version of boost::serialize
by Sam Appleton 16 Jul '12

16 Jul '12

Hi Robert Thanks for replying. I realize perhaps I was not clear or do not fully understand your answer. I was not really looking for ways to test my archive class. Let's say I know I have an archive file that's been generated by my archival class, but it has an indeterminate version that may or may not be compatible with the present version. In order for me to determine the embedded version of the archive, the only way I know of is to just attempt to deserialize (I do this using (archive-stream) >> (object) ; ) and seeing if a version incompatability is flagged. However, is there any way to determine just from an open archive stream what the version number of the embedded stream or classes implied by the stream contains? Sam >Check the documentation section Reference/Archive Class Reference/Testing > >This explains how you can submit your archive class to the exhaustive >series of tests that all the "built-in" archives are subjected to. It does >take a while to run the tests. And then it makes even more time to >get your custom archive to pass all the tests. But you will be >rewarded with something you should be able to depend upon. > >Robert Ramey -- -- Sam Appleton CEO, Ausdia Inc. o: (408) 914 2704 x801 f: (408) 914 2704 c: (650) 242 2908 Email sam(a)ausdia.com Skype samsappleton

2 1

[1.50.0] PDF documentation available
by John Maddock 15 Jul '12

15 Jul '12

With apologies for being so late with these.... The PDF build of Boost's documentation for 1.50 is available from the usual SF site: https://sourceforge.net/projects/boost/files/boost-docs/1.50/ John.

2 1

testing archive version of boost::serialize
by Sam Appleton 14 Jul '12

14 Jul '12

Is there any way to "test" the version of a boost serialization archive. I know that we can always just attempt to deserialize and catch the generated exception, but is there any way to just test the version of the archive before attempting deserialization? Best Sam Appleton

2 1

aiso signal handling, daemon shutdown
by Kraus Philipp 13 Jul '12

13 Jul '12

Hello, I try to create a working example for a daemon with http://www.boost.org/doc/libs/1_50_0/doc/html/boost_asio/overview/signals.h… I have created a program like: static bool run = true; void handler( const boost::system::error_code& error, int signal_number) { if (!error) { run = false; std::cout << "signal" << std::endl; } } and the main with int main(..) { boost::asio::io_service io_service; boost::asio::signal_set signals(io_service, SIGINT, SIGTERM); signals.async_wait(handler); while (run) { boost::this_thread::yield(); } } The program runs, but if I do "kill pid" the program does not stop or shows the message. I would like to create a small daemon which runs some threads and can stop with the normal stop signal and can reload the configuration on reload. Can anyone help me to create a working example first !? Thanks a lot Phil

2 2

mult_array view question
by Petros 13 Jul '12

13 Jul '12

Hi, I have the following question: The documentation describes how to obtain an array view for a small number of dimensions by repeated application of the [] operator of boost::indices. Is there a way to do it in a single call, bypassing the C-type notation? Say, I have a five dimensional multi_array (ma, henceforth) and want to get a slice in one dimension. Is there a call to do this ? I am looking for a generic answer. TIA, Petros PS: was hoping that the ranges_ field of extent_gen could do the trick, since all the info is there - I know it’s in the detail namespace which practically means private/subject-to-change but had no better idea.

1 0

What algorithms for solving the Shortest Paths problem are implemented in BOOST?
by Alex Sadovsky 13 Jul '12

13 Jul '12

I know, Dijkstra's and the Bellman-Ford one are. Is Dial's? http://dl.acm.org/citation.cfm?id=363610 Thanks, Al

2 1

Review Wizard Status Report for July 2012
by Ronald Garcia 13 Jul '12

13 Jul '12

============================================== Review Wizard Status Report for July 2012 ============================================== News ==== 1. Multiprecision Arithmetic Reviewed 2. Boost 1.50.0 Released. New Libraries: 1) Algorithm 2) Functional/OverloadedFunction 3) LocalFunction 4) Utility/IdentityType Open Issues =========== The following libraries have been reviewed and await reports from their review managers: * Conversion - reviewed August 2011; review manager: Gordon Woodhull. * Predef - reviewed February 2012; review manager: Joel Falcou. * Multiprecision - reviewed June 2012; review manager: Jeffrey Hellrung The following libraries have been accepted to Boost, but have not yet been submitted to SVN: * Constrained Value - accepted September 2010; author: Robert Kawulak. * GIL.IO - accepted January 2011; author: Christian Henning. The following libraries have been accepted and submitted to SVN, but have not yet appeared in a release: * Atomic - accepted July 2011; author Helge Bahmann. * Type Traits Introspection - accepted August 2011; author: Edward Diener. * Lockfree - accepted August 2011; author: Tim Blechmann. * Context - accepted January 2012; author: Oliver Kowalke. The following libraries have been accepted provisionally to Boost, but have not been submitted for mini-review and full acceptance: * Endian - accepted provisionally November 2011; author: Beman Dawes. * Log - accepted provisionally March 2010; author: Andrey Semashev. General Announcements ===================== As always, we need experienced review managers. Please take a look at the list of libraries in need of managers and check out their descriptions. In general review managers are active boost participants, including library contributors, infrastructure contributors, and other mailing list participants with a substantial track record of constructive participation. If you can serve as review manager for any of them, email Ron Garcia or John Phillips, "rxg at cs dot cmu dot edu" and "phillips at pacific dot mps dot ohio-state dot edu" respectively. We are also suffering from a lack of reviewers. While we all understand time pressures and the need to complete paying work, the strength of Boost is based on the detailed and informed reviews submitted by you. If you are interested in reviewing a library but won't have time during the review period, you can always prepare your review ahead of time. No rule says you can only work on a review during the review period. A link to this report will be posted to www.boost.org. If you would like us to make any modifications or additions to this report before we do that, please email Ron or John. The review schedule is an unordered list of the libraries awaiting review. As such, any library on the schedule can be reviewed once the developer is ready, a review manager has been secured, and the manager, developer, and wizards agree on a date to schedule the review. Review Schedule =============== * Join (M) * Pimpl (M) * Sorting (M) * Quaternions, Vectors, Matrices (M) * Variadic Macro Data (M) * Block Pointer (M) * Singularity (M) * Extended Complex Numbers (M) * Metaparse (M) * Polygon: Voronoi Extensions * Coroutine * Type Erasure * Range Extensions * Contract * Nowide (M) * ODEint (M) ``(M)`` marks libraries that need review managers. -------------------- Join ---- :Author: Yigong Liu :Review Manager: Needed :Download: http://channel.sourceforge.net/ :Description: Join is an asynchronous, message based C++ concurrency library based on join calculus. It is applicable both to multi-threaded applications and to the orchestration of asynchronous, event-based applications. It follows Comega's design and implementation and builds with Boost facilities. It provides a high level concurrency API with asynchronous methods, synchronous methods, and chords which are "join-patterns" defining the synchronization, asynchrony, and concurrency. Pimpl ----- :Author: Vladimir Batov :Review Manager: Needed :Download: https://github.com/boost-vault/Miscellaneous/blob/master/Pimpl.zip :Description: The Pimpl idiom is a simple yet robust technique to minimize coupling via the separation of interface and implementation and then implementation hiding. This library provides a convenient yet flexible and generic deployment technique for the Pimpl idiom. It's seemingly complete and broadly applicable, yet minimal, simple and pleasant to use. Sorting ------- :Author: Steven Ross :Review Manager: Needed :Download: https://github.com/boost-vault/Sorting :Description: A grouping of 3 templated hybrid radix/comparison-based sorting algorithms that provide superior worst-case and average-case performance to std::sort: integer_sort, which sorts fixed-size data types that support a rightshift (default of >>) and a comparison (default of <) operator. float_sort, which sorts standard floating-point numbers by safely casting them to integers. string_sort, which sorts variable-length data types, and is optimized for 8-bit character strings. All 3 algorithms have O(n(k/s + s)) runtime where k is the number of bits in the data type and s is a constant, and limited memory overhead (in the kB for realistic inputs). In testing, integer_sort varies from 35% faster to 2X as fast as std::sort, depending on processor, compiler optimizations, and data distribution. float_sort is roughly 70% faster than std::sort. string_sort is roughly 2X as fast as std::sort. Quaternions, Vectors, Matrices ------------------------------ :Author: Emil Dotchevski :Review Manager: Needed :Download: http://www.revergestudios.com/boost-qvm/ :Description: QVM defines a set of generic functions and operator overloads for working with quaternions, vectors and matrices of static size. The library also defines vector and matrix data types, however it allows users to introduce their own types by specializing the q_traits, v_traits and m_traits templates. Variadic Macro Data ------------------- :Author: Edward Diener :Review Manager: Needed :Download: `Boost Sandbox <http://svn.boost.org/svn/boost/sandbox/variadic_macro_data/>`__ :Description: This library adds support and functionality for variadic macros to Boost as well as integrating variadic macros with the Boost PP library without changing the latter library in any way. Block Pointer ------------- :Author: Phil Bouchard :Review Manager: Needed :Download: https://svn.boost.org/svn/boost/sandbox/block_ptr/ :Description: Deterministic memory manager of constant complexity capable of handling cyclic collections. Singularity ----------- :Author: Ben Robinson :Review Manager: Needed :Download: https://github.com/cppmaven/Singularity :Description: The Singularity Design Pattern allows you to restrict any class to a single instance. Unlike the infamous Singleton, Singularity gives you direct control over the lifetime of the object, does not require you to grant global access to the object, nor does it limit you to the default constructor for that object. Extended Complex Numbers ------------------------ :Author: Matthieu Schaller :Review Manager: Needed :Download: http://code.google.com/p/cpp-imaginary-numbers/ :Description: The library is an extension of the std::complex class addressing two issues: 1. The standard does not guaranty the behaviour of the complex class if instantiated with types other than float/double/long double. 2. Some calculation where pure imaginary numbers (i.e. multiples of sqrt(-1)) appear are unnecessarily slowed down due to the lack of support for these numbers. The code I submit contains two interleaved classes boost::complex and boost::imaginary which can be instantiated with any type T provided T overloads the usual arithmetic operators and some basic (real) mathematical functions depending on which complex function will be used. It is thus an extended version of Thorsten Ottosen's n1869 proposal (http://www.open-std.org/JTC1/SC22/WG21/docs/papers/2005/n1869.html) Metaparse --------- :Author: Abel Sinkovics :Review Manager: Needed :Download: http://abel.web.elte.hu/metaparse/metaparse.zip :Description: Metaparse is a library for constructing parsers parsing at compile-time based on template metaprogramming. The parsers built with the library take boost::mpl::strings as input and can produce - types - objects (types with public static members) - callable C++ functions (types with public static method) - template metafunction classes as output (based on the input being parsed). On compilers supporting constexpr the library provides the following syntactic sugar for writing the input of the parsers: BOOST_STRING("this is a string") The library can be used for implementing DSLs in C++, including DSLs making C++ template metaprogramming easier (see examples). Polygon: Voronoi Extensions --------------------------- :Author: Andril Sydorchuk :Review Manager: Lucanus Simonson :Download: http://svn.boost.org/svn/boost/sandbox/gtl/ :Description: This library extends Boost.Polygon with the following features: - Robust and efficient implementation of the sweepline algorithm that allows to construct Voronoi diagram, Delaunay triangulation and medial axis of a set of points and line segments. - Coordinates of the output geometries are computed within the 64 machine epsilon relative error (6 mantissa bits). - Voronoi diagram data structure that allows efficient traversal and data association with the output Voronoi graph. - No 3rd party dependencies (e.g. GMP, MPFR), all the required multiple precision types are implemented as part of the library. - The input and output coordinate type domains are configurable via coordinate type traits, thus allowing to compute coordinates of the Voronoi vertices within any required precision. - The full construction of the Voronoi diagram of 100 000 points takes only 0.27 seconds (see benchmarks). Coroutine --------- :Author: Oliver Kowalke :Review Manager: Hartmut Kaiser :Download: http://gitorious.org/boost-dev/boost-dev/archive-tarball/coroutine :Description: This library is an implementation of coroutines and generators using Boost.Context. Type Erasure ------------ :Author: Steven Watanabe :Review Manager: Lorenzo Caminiti :Download: http://sourceforge.net/projects/steven-watanabe.u/files/ :Description: The TypeErasure library is a generalization of boost::any and boost::function. It allows easy composition of arbitrary type erased operators. Range Extensions ---------------- :Author: Akira Takahashi :Review Manager: Neil Groves :Download: https://github.com/faithandbrave/OvenToBoost :Description: This project adds some features of the Oven Range Library to Boost.Range. Features: - Additional Range Adaptors (taken, taken_while, dropped, dropped_while, elements, elements_key, memoized, outdirected) - Extensions for using Lambda (regular function, regular operator) - Infinite Range (iteration function) - and additional range utilities. Contract -------- :Author: Lorenzo Caminiti :Review Manager: Dave Abrahams :Download: http://sourceforge.net/projects/contractpp/files/latest/download :Description: This library implements Contract Programming for the C++ programming language (see the end of this email). In addition, the library implements virtual specifiers (final, override, and new, see C++11), concept checking, and named parameters. This library is implemented for the C++03 standard and it does not require C++11. Nowide ------ :Author: Artyom Beilis :Review Manager: Needed :Download: http://cppcms.com/files/nowide/ :Description: This library makes cross platform Unicode aware programming easier. It provides an implementation of standard C and C++ library functions, such that their inputs are UTF-8 aware on Windows without requiring to use Wide API. ODEint ------ :Author: Karsten Ahnert and Mario Mulansky :Review Manager: Needed :Download: https://github.com/headmyshoulder/odeint-v2 :Description: odeint provides routines for numerically solving Ordinary Differential Equations, a task heavily required when approaching scientific problems numerically. In odeint we have implemented the most common algorithms in a modern, generic way which provides several advantages over existing implementations. The main focus of odeint is to separate algorithms from the underlying basic computation unit. This allows for example to easily use the power of modern GPUs via CUDA or OpenCL to speed up computational heavy simulations. Libraries under development =========================== See http://svn.boost.org/trac/boost/wiki/LibrariesUnderConstruction for a current listing of libraries under development.

1 0

eos_portable_archive for 1.49
by Paul Harris 13 Jul '12

13 Jul '12

Hi all, Does anyone know if eos_portable_archive is still actively used and maintained? It doesn't compile with boost 1.49, and before I try to fix it up, I was wondering if anyone else has fixed it up. cheers Paul

7 11

[1.48] interprocess consumes 100% on 32bit Windows systems
by Bogdan Slusarczyk 13 Jul '12

13 Jul '12

Hi All, I found such problem: N+1 (where N is number of cpu cores) processes with interprocess syncing use 100% cpu on 32 bit Windows system. Cause of bug: https://svn.boost.org/trac/boost/changeset/74110 void sched_yield() -{ Sleep(1); } +{ + if(!SwitchToThread()){ + Sleep(1); + } Test case: #include <windows.h> #include <iostream> int main() { int i = 0; while( true ) { if ( !SwitchToThread() ) { std::cout << "sleep" << i++ << std::endl; Sleep(1); } } } On 32 bit windows system running this in N+1 separate processes will stop printing and use 100% CPU. On 64 bit system for any number of processes printing will not stop. Kind regards, Bogdan

1 0

const native arrays at compile time
by Hicham Mouline 12 Jul '12

12 Jul '12

Hello, I have a number of questions, some of which are boost specific. 1. const std::string cols[] = { "col1", "col2", "col3" }; Is the const native array cols completely a compile-time construct or are std::string objects constructed at runtime? I would guess the latter? 2. const char const* cols[] = { "col1", "col2", "col3" }; This on the other hand would be pure compile time? 3. struct S1 { const char const* cols[] = { "col1", "col2", "col3" }; }; struct S2 { const char const* cols[] = { "colx", "coly", "coly" }; }; template <typename T> /// T is either S1 or S2 struct S { const char const* col1s[] = { "othercol", /// elements of T::cols }; }; Is there a way to build col1s at compile time? MM

3 2

boost any_range
by tolik levchik 12 Jul '12

12 Jul '12

Is it possible the commented below condition. With regular ranges i make as many 'base()' calls as may adaptors i had applied. Obviously it's impossible with any_range. So what should i do ? #include <map> #define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #include <boost/range/adaptors.hpp> #include <boost/range/algorithm.hpp> #include <boost/range/numeric.hpp> #include <boost/bind.hpp> #include <boost/range/any_range.hpp> struct foo{ int x, y; }; inline bool is_valid(int x){ return x > 0;} int main() { using namespace boost::adaptors; using boost::bind; typedef std::map<char, foo> map_t; typedef const int type; typedef boost::any_range< type, boost::forward_traversal_tag, typename boost::add_reference<type>::type, std::ptrdiff_t > forward_range_t; map_t m; forward_range_t rng = m | map_values | transformed(bind(&foo::x, _1)); // note: don't compile without BOOST_RANGE_ENABLE_CONCEPT_ASSERT defined as 0 forward_range_t::const_iterator found = boost::find_if(rng, is_valid); // found == boost::end(m); how to do it right ? }

2 1

serialization with templates
by Unger, Jörg F. 12 Jul '12

12 Jul '12

I'm trying to serialize a template class with multiple template parameters. In the header file, I declare something like template <int T1, int T2> class Node { private: std::array<double,T1> first; std::array<double,T2> second; } BOOST_CLASS_EXPORT_KEY(Node<1,1>) In a separate file, I would use the BOOST_CLASS_EXPORT_IMPLEMENT macro. However, when I'm using the BOOST_CLASS_EXPORT_KEY with a class that has more than one template parameter (as in the example above), I get an error message Error: macro "BOOST_CLASS_EXPORT_KEY" passed 2 arguments, but takes just 1 I'm using gcc 4.7.1 with boost 50 Any ideas, how to solve that problem? Jörg F.

3 2

Is there any interest in getting pseudo random number generation using preprocessor at compile time into the Preprocessor library?
by Alexander Stoyan 12 Jul '12

12 Jul '12

The complete code, approach and efficiency proofs I described in my blog: http://alexander-stoyan.blogspot.com/2012/07/getting-pseudo-random-numbers-a t.html Need your opinion regarding the relevance and the approach correctness of the feature. Thank you in advance.

1 0

[StateChart] Accessing machine and state members from within state constructor
by Andre Puschmann 12 Jul '12

12 Jul '12

Hello, I'd like to outsource some common functionality into a base state which needs to access some member variables from the state machine or from its direct context. I've managed to do exactly this in the constructor of the inherited class but not inside the constructor of the base class. I believe I am missing some bits here. Thanks in advance -Andre Code: #include <boost/statechart/event.hpp> #include <boost/statechart/state_machine.hpp> #include <boost/statechart/state.hpp> #include <boost/statechart/simple_state.hpp> #include <boost/statechart/transition.hpp> #include <boost/statechart/custom_reaction.hpp> #include <iostream> namespace sc = boost::statechart; // event definition struct EvReset : sc::event< EvReset > {}; // forward definition struct Active; // starting state struct State1; // define FSM struct TestFsm : sc::state_machine< TestFsm, Active > { TestFsm() { std::cout << "Start TestFsm.\n"; fsmValue = 0; std::cout << "value: " << fsmValue << std::endl; } ~TestFsm() { std::cout << "Shut down TestFsm.\n"; } public: int fsmValue; }; struct Active : sc::state< Active, TestFsm, State1 > { Active(my_context ctx) : my_base( ctx ) { std::cout << "Start Active state!\n"; outermost_context().fsmValue++; stateValue = 0; std::cout << "value: " << outermost_context().fsmValue << std::endl; } ~Active() { std::cout << "Leave and desctruct Active state!\n"; } public: int stateValue; typedef sc::transition< EvReset, Active > reactions; }; template< class MostDerived, class Context > struct StateBase : sc::state< MostDerived, Context> { typedef sc::state< MostDerived, Context> base_type; typedef typename base_type::my_context my_context; typedef StateBase my_base; StateBase( my_context ctx ) : base_type( ctx ) { std::cout << "StateBase cst" << std::endl; // critical section outermost_context().fsmValue++; // access member of FSM (outermost context) ctx().stateValue++; // access member in direct context } }; struct State1 : StateBase< State1, Active > { State1(my_context ctx) : my_base( ctx ) { std::cout << "State1 cst" << std::endl; outermost_context().fsmValue++; std::cout << "value: " << outermost_context().fsmValue << std::endl; }; ~State1() {}; }; int main() { TestFsm myFSM; myFSM.initiate(); return 0; }

3 4

compilation problem and a couple of boost::variant questions
by Petros 12 Jul '12

12 Jul '12

Hi, I am trying to write some operator that multiplies two variants, each one containing a vector a zero and a unit, where I am trying to use the fact that I know the outcome for multiplying by 0 or by 1. The code (very bare bones) below describes how this is done, by: _ defining dummy structures of Variant-1, 2 _ defining a class that contains the instruction for multiplication _ defining a class (derived from variant) that contains possible outcomes of the multiplication _ defining the operator (only a few of the possible outcomes are shown) Compiling with msvc2010 (intel has similar issues) on win7: First here is the code: #include <boost/variant.hpp> using boost::variant; struct Zero1{ double operator[]( const size_t i ) const { return 0L ; } }; struct One1{ double operator[]( const size_t i ) const { return 1L ; } }; struct Zero2{ double operator[]( const size_t i ) const { return 0L ; } }; struct One2{ double operator[]( const size_t i ) const { return 1L ; } }; struct Vector1{ double operator[]( const size_t i ) const {return double( i ) ; } }; struct Vector2{ double operator[]( const size_t i ) const {return double( 2*i ) ; } }; struct subscript_operator:public boost::static_visitor<double>{ const size_t i_; subscript_operator( const size_t i ):i_(i){} template<typename _v> double operator()( _v const & v ) const { return v[i] ; } }; template <typename _V, typename _Z, typename _U> class VariantT :public variant< _V, _Z, _U > { public: typedef typename _Z zero_type ; typedef typename _U unit_type ; typedef typename VariantT<_V, _Z, _U> self_type ; typedef typename variant< _V, _Z, _U > variant_type ; template < typename _V> explicit VariantT( _V const & v ) :variant_type(v) {} VariantT() {} VariantT( self_type const & v ) :variant_type(static_cast<const variant_type&>(v)) {} template < typename _V> VariantT & operator = ( _V const & v ) { *static_cast<variant_type*>(this) = static_cast<const variant_type&>(v); return(*this); } VariantT & operator = ( self_type const & v ) { *static_cast<variant_type*>(this) = v; return(*this); } double operator[]( const size_t i ) const { boost::apply_visitor( subscript_operator(i) , *this ) ; } bool isZero() const { return which() == 1 ; } bool isUnit() const { return which() == 2 ; } private: }; template < typename _V1, typename _V2 > class MultVarVar{ public: MultVarVar( _V1 const & v1, _V2 const & v2 ) :v1_(v1),v2_(v2) {} ~MultVarVar() {} typedef typename _V1::zero_type zero_type ; typedef typename _V1::unit_type unit_type ; double operator[]( const size_t i ) const { return boost::apply_visitor ( elementwise_visitor( i ), v1, v2 ) ; } private: _V1 const & v1_ ; _V2 const & v2_ ; struct elementwise_visitor : public boost::static_visitor< double > { const size_t & i_; public: elementwise_visitor( const size_t & i ) :i_(i) {} template <typename _V1, typename _V2 > double operator()( _V1 const & v1, _V2 const & v2) const { return v1[i_] * v2[i_] ; } }; }; template < typename _V1, typename _V2 > class MultVarVarResult :public variant<typename MultVarVar<_V1, _V2>, typename MultVarVar<_V1,_V2>::zero_type, typename MultVarVar<_V1,_V2>::unit_type, _V1, _V2 > { public: typedef typename variant< typename MultVarVar<_V1, _V2 > , typename MultVarVar<_V1,_V2>::zero_type, typename MultVarVar<_V1,_V2>::unit_type, _V1, _V2 > variant_type; typedef typename MultVarVarResult<_V1, _V2> self_type ; typedef typename _V1::zero_type zero_type ; typedef typename _V1::unit_type unit_type ; template<typename _V> /*explicit*/ MultVarVarResult( _V const & v ) :variant_type(v) {} MultVarVarResult( self_type const & v ) :variant_type(static_cast<const variant_type&>(v)) {} template < typename _V> MultVarVarResult & operator = ( _V const & v ) { *static_cast<variant_type*>(this) = static_cast<const variant_type&>(v); return(*this); } MultVarVarResult & operator = ( self_type const & v ) { *static_cast<variant_type*>(this) = v; return(*this); } double operator[]( const size_t i ) const { boost::apply_visitor( subscript_operator(i), *this ) ; } private: }; template <typename _V1, typename _V2> MultVarVarResult<_V1, _V2> operator * ( _V1 const & v1, _V2 const & v2 ) { if ( v1.isZero() || v2.isZero() ) return MultVarVarResult<_V1, _V2>( typename MultVarVar<_V1,_V2>::zero_type() ) ; if ( v1.isUnit() ) return MultVarVarResult<_V1, _V2>( v2 ); if ( v2.isUnit() ) return v1 ; else return MultVarVarResult<_V1, _V2>( MultVarVar<_V1, _V2>( v1, v2 ) ) ; } typedef VariantT< Vector1, Zero1, One1 > Variant1; typedef VariantT< Vector2, Zero2, One2 > Variant2; int main(){ Variant1 v1; v1 = Zero1() ; Variant2 v2; v2 = One2() ; auto x = v1 * v2 ; return x[0] == double(0) ; } And here is one of the errors : boost_1_49_0\boost\variant\variant.hpp(1399): error C2666: 'boost::variant<T0_,T1,T2,T3,T4>::convert_construct' : 2 overloads have similar conversions 1> with 1> [ 1> T0_=MultVarVar<Variant1,Variant2>, 1> T1=Zero1, 1> T2=One1, 1> T3=Variant1, 1> T4=Variant2 1> ] 1> c:\_petros\_otc\ext\boost_1_49_0\boost\variant\variant.hpp(1384): could be 'void boost::variant<T0_,T1,T2,T3,T4>::convert_construct<_V,_Z,_U,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_,boost::detail::variant::void_>(const boost::variant<_V,T1,T2> &,long)' 1> with 1> [ 1> T0_=MultVarVar<Variant1,Variant2>, 1> T1=Zero1, 1> T2=One1, 1> T3=Variant1, 1> T4=Variant2, 1> _V=Vector1, 1> _Z=Zero1, 1> _U=One1 1> ] 1> c:\_petros\_otc\ext\boost_1_49_0\boost\variant\variant.hpp(1315): or 'void boost::variant<T0_,T1,T2,T3,T4>::convert_construct<const T>(T &,int,boost::mpl::false_)' 1> with 1> [ 1> T0_=MultVarVar<Variant1,Variant2>, 1> T1=Zero1, 1> T2=One1, 1> T3=Variant1, 1> T4=Variant2, 1> T=Variant1 1> ] 1> while trying to match the argument list '(const Variant1, long)' 1> c:\_petros\_otc\tests\variant\variant\main.cpp(120) : see reference to function template instantiation 'boost::variant<T0_,T1,T2,T3,T4>::variant<_V>(const T &)' being compiled 1> with 1> [ 1> T0_=MultVarVar<Variant1,Variant2>, 1> T1=Zero1, 1> T2=One1, 1> T3=Variant1, 1> T4=Variant2, 1> _V=Variant1, 1> T=Variant1 1> ] 1> c:\_petros\_otc\tests\variant\variant\main.cpp(151) : see reference to function template instantiation 'MultVarVarResult<_V1,_V2>::MultVarVarResult<_V1>(const _V &)' being compiled 1> with 1> [ 1> _V1=Variant1, 1> _V2=Variant2, 1> _V=Variant1 1> ] 1> Any help on this will be greatly appreciated! And the questions: What happens if a variant contains two identical template arguments ? when I create a (variant) object from one of the two identicals, how does it know which template argument I need ? Do I have to write the same code for the specialization of identical _V1 and _V2? Also, am I correct to assume that all this syntax ( element-wise static_visitor’s etc) will be optimized away at a release build ? TVMIA Petros

3 10

Boost 1.49 Locale Conversion failed
by NtVisigoth 12 Jul '12

12 Jul '12

Hello, everyone! I have already answred here: http://lists.boost.org/boost-users/2012/07/75097.php But previous latter badly typed. When using boost::locale with the russian language of the string in UTF-8 encoding I get an error while getting the locale. An exception with the message e.what(): "Conversion failed" is thrown My code is not very different from that in the examples: #define TR(S) boost::locale::translate(S).str() const std::string strDefaultLangId( "en" ); int main( int argc, char * argv[] ) { using namespace std; using namespace boost::locale; int exitCode = EXIT_SUCCESS; try { generator gen; gen.add_messages_path("g:\\source\\boost_locale\\languages\\"); gen.add_messages_domain("messages"); std::string language( argc == 2 ? argv[1] : strDefaultLangId.c_str() ); std::locale loc = gen( language ); locale::global( loc ); std::wstring s = TR(L"hello world"); wcout << s << endl; } catch( exception& e ) { cout << "Error : " << e.what() << endl; exitCode = EXIT_FAILURE; } catch( ... ) { cout << "Unknown error" << endl; exitCode = EXIT_FAILURE; } return exitCode; } The path to the file with the russian language: "g:\source\boost_locale\languages\ru\LC_MESSAGES\messages.mo" What could be wrong? * Is it necessary to use the backends? * Is it yet necessary to call imbue on the stream? But I'd like avoid it because I am going to write the log using glog. Compillers : Microsoft Visual Studio 2008 and 2010 Boost version : 1.49

4 7

Dealing with resistance to Boost
by hano botha 12 Jul '12

12 Jul '12

I am trying to get my organisation to use Boost. I have managed to get it included in source control and we have permission to use it in our unit testing. The main objection to using it in our production code is that it could be a potential security risk. I suggested that we restrict the usage of boost to the template\ headers only libraries. I don't see how the templates in boost can cause more of a security risk than what we have currently with the STL. My question is: How is vulnerabilities in the library dealt with? How is new vulnerabilities communicated to the user's community? I would also like to know historically, how many and how often were vulnerabilities discovered? Any good references would be great. Thanks,

3 2

boost range question
by tolik levchik 12 Jul '12

12 Jul '12

Why min_element give me errors without BOOST_RANGE_ENABLE_CONCEPT_ASSERT defined 0? Is it uses only for make error messages more readable? Is it safe to define it to 0? #include <vector> //#define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #include <boost/range.hpp> #include <boost/range/adaptors.hpp> #include <boost/range/algorithm.hpp> #include <boost/range/numeric.hpp> #include <boost/bind.hpp> struct foo{ int x; }; int main() { using namespace boost::adaptors; using boost::bind; std::vector<foo> vec; auto rng = vec | transformed(bind(&foo::x, _1)); boost::accumulate(rng, 0); // ok boost::min_element(rng); // error }

2 1

Re: [Boost-users] Boost 1.49 msm problems with events
by Kamel Zaarouri, Mr 11 Jul '12

11 Jul '12

Hi, I am having problems with my transition table and events. Let me explain the fake design that illustrates the problem: I have a state machine (myStateMachine) containing 2 states (s0 and s1) and 1 substatemachine (subm1). the substatemachine subm1 contains an initial state 'sub0' and also s1 (the same state as in myStateMachine). this is the main transition table: s0->s1 on event 'ES1' s0->s2 on event 'ES2' s0->subm1 on event 'ESUB' this is the submachine transition table: sub0->s1 on event ES1 now, assume that state s1 is using the event that triggered it to extract some information i.e. struct s1 : public msm::front::state<> { template <class Event,class FSM> void on_entry(Event const& evt,FSM& fsm) { evt.getEventData(); } } so every event that could transition to s1 needs to implement getEventData() method. ->this is normal! now my problem is that ESUB does NOT implement getEventData() but apparently it should. And I don't get why. I am not using ESUB to transition to s1 but I am using ESUB to transition to subm1 and subm1 contains s1 but I don't access it at that point. I hope this is clear. Thank you.

3 2

[asio] asynchronous reading/writing to the tcp stream
by Ovanes Markarian 11 Jul '12

11 Jul '12

Hello *, I go through the ASIO docs, but somehow do not get if I can implement the following scenario: In one thread I would like to send lot's of commands to the server via a tcp connection. In the other thread I would like to start reading the commands being already handled and returned by the server. The commands are parsed by Spirit.QI. My idea was to use a tcp::iostream asynchronously so that I just pass the begin iterator to the output stream to QI and receive parsed data. If there is no output from the server the iterator should block and wait for it. This is a producer-consumer problem, but I would like to solve it with tcp::iostream and without explicit synchronization on my side. Is it possible? If yes, than how? I understand that I can introduce some storage, read bytes to it and notify my hand-crafter iterator, that there is some data that can be read again, but is there a better approach? Thanks, Ovanes

4 6

boost::bind overloaded operators
by tolik levchik 11 Jul '12

11 Jul '12

Hello, i have some questions: 1) Why min_element give me errors without BOOST_RANGE_ENABLE_CONCEPT_ASSERT defined 0? Is it uses only for make error messages more readable? Is it safe to define it to 0? #include <vector> //#define BOOST_RANGE_ENABLE_CONCEPT_ASSERT 0 #include <boost/range.hpp> #include <boost/range/adaptors.hpp> #include <boost/range/algorithm.hpp> #include <boost/range/numeric.hpp> #include <boost/bind.hpp> struct foo{ int x; }; int main() { using namespace boost::adaptors; using boost::bind; std::vector<foo> vec; auto rng = vec | transformed(bind(&foo::x, _1)); boost::accumulate(rng, 0); // ok boost::min_element(rng); // error } 2) Why only logical operators overloaded for boost::bind and arithmetic one are not? Is it safe to define it manually with BOOST_BIND_OPERATOR?

2 1

Using c++11 features in clang
by Marshall Clow 11 Jul '12

11 Jul '12

In response to a some questions on the boost-users list (and boost bug reports), I wrote up this: http://marshall.calepin.co/llvmclang-and-standard-libraries-on-mac-os-x.html I don't know if this should be a FAQ entry for Boost, or for clang. Suggestions/comments/edits welcome. -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

5 5

Windows 8/Windows Server 2012 compatibility
by Eli Zakashansky 11 Jul '12

11 Jul '12

Hi, Does anyone knows/tested boost compatibility with Windows 8/Windows Server 2012 ? I am currently using Boost 1.39.0, it works very well on prior versions of windows. Should Windows 8 be different ? did anyone faced compatibility issues ? Thanks in advance, Eli Zakashansky.

2 1

Re: [Boost-users] boost::log & Visual Studio 2010 - problem with advanced event log backend
by Don 10 Jul '12

10 Jul '12

Konrad, I don't think the author of boost::log watches this mailing list. You might find more help at the boost-log sourceforge forum: http://sourceforge.net/projects/boost-log/forums/forum/710022. For what it's worth, I found using boost::log to be challenging, because there were lots of API changes between version 1 and 2, the API continues to change, and the documentation has not always kept up with the changes. Furthermore as the author makes changes he uses the current boost sandbox -- boost::log does not always build with the current released version of boost. If you already have a home-grown logging system in place, I'd question whether it is worth the effort to change. Don -------- Original Message -------- Subject: [Boost-users] boost::log & Visual Studio 2010 - problem with advanced event log backend. From: Konrad Rybacki <konrad.rybacki(a)gmail.com> To: boost-users(a)lists.boost.org Date: Tue, 10 Jul 2012 16:57:22 +0200 > Hi All, > > I am trying to introduce boost::log into one of projects I am working > on. The application already does some logging to the trace file and > additionaly uses Windows Event Log to post messages. What I am going > to do is to replace the existing logging framework with boost::log. >

1 0

boost::log & Visual Studio 2010 - problem with advanced event log backend.
by Konrad Rybacki 10 Jul '12

10 Jul '12

Hi All, I am trying to introduce boost::log into one of projects I am working on. The application already does some logging to the trace file and additionaly uses Windows Event Log to post messages. What I am going to do is to replace the existing logging framework with boost::log. Being frank - these are my first attempts at boost at all. I am following exactly the steps from the examples section of the documentation. I have written the following code: boost::shared_ptr< sinks::event_log_backend > backend( new sinks::event_log_backend(( keywords::message_file = "<path to library>.dll", keywords::log_name = "My Application", keywords::log_source = "My Source" )) ); sinks::event_log::event_composer composer( sinks::event_log::direct_event_id_mapping<int>("EventId") ); composer[MY_APPLICATION_SESSION_CREATION_FAILURE] % fmt::message(); backend->set_event_composer(composer); boost::shared_ptr<sinks::synchronous_sink< sinks::event_log_backend>> sink( new sinks::synchronous_sink< sinks::event_log_backend >(backend) ); sink->set_filter( (flt::attr<SeverityLevel>("Severity") == info || flt::attr<SeverityLevel>("Severity") == warning || flt::attr<SeverityLevel>("Severity") == error || flt::attr<SeverityLevel>("Severity") == fatal) && flt::has_attr<int>("EventId") ); sinks::event_log::custom_event_type_mapping<SeverityLevel> mapping("Severity"); mapping[trace] = sinks::event_log::info; mapping[debug] = sinks::event_log::info; mapping[info] = sinks::event_log::info; mapping[warning] = sinks::event_log::warning; mapping[error] = sinks::event_log::error; mapping[fatal] = sinks::event_log::error; sink->locked_backend()->set_event_type_mapper(mapping); logging::core::get()->add_sink(sink); I am building the code with Visual Studio 2010. Unfortunately I get the following error: 1>F:\boost\boost\boost/function/function_template.hpp(153): error C2064: term does not evaluate to a function taking 3 arguments 1> class does not define an 'operator()' or a user defined conversion operator to a pointer-to-function or reference-to-function that takes appropriate number of arguments 1> F:\boost\boost\boost/function/function_template.hpp(147) : while compiling class template member function 'void boost::detail::function::void_function_obj_invoker3<FunctionObj,R,T0,T1,T2>::invoke(boost::detail::function::function_buffer &,T0,T1,T2)' 1> with 1> [ 1> FunctionObj=boost::log_mt_nt5::formatters::fmt_message<char>, 1> R=void, 1> T0=std::basic_ostream<char,std::char_traits<char>> &, 1> T1=const boost::log_mt_nt5::basic_attribute_values_view<char> &, 1> T2=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> & 1> ] 1> F:\boost\boost\boost/function/function_template.hpp(907) : see reference to class template instantiation 'boost::detail::function::void_function_obj_invoker3<FunctionObj,R,T0,T1,T2>' being compiled 1> with 1> [ 1> FunctionObj=boost::log_mt_nt5::formatters::fmt_message<char>, 1> R=void, 1> T0=std::basic_ostream<char,std::char_traits<char>> &, 1> T1=const boost::log_mt_nt5::basic_attribute_values_view<char> &, 1> T2=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> & 1> ] 1> F:\boost\boost\boost/function/function_template.hpp(722) : see reference to function template instantiation 'void boost::function3<R,T0,T1,T2>::assign_to<Functor>(Functor)' being compiled 1> with 1> [ 1> R=void, 1> T0=std::basic_ostream<char,std::char_traits<char>> &, 1> T1=const boost::log_mt_nt5::basic_attribute_values_view<char> &, 1> T2=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, 1> Functor=boost::log_mt_nt5::formatters::fmt_message<char> 1> ] 1> F:\boost\boost\boost/log/sinks/event_log_backend.hpp(678) : see reference to function template instantiation 'boost::function3<R,T0,T1,T2>::function3<FormatterT>(Functor,int)' being compiled 1> with 1> [ 1> R=void, 1> T0=std::basic_ostream<char,std::char_traits<char>> &, 1> T1=const boost::log_mt_nt5::basic_attribute_values_view<char> &, 1> T2=const std::basic_string<char,std::char_traits<char>,std::allocator<char>> &, 1> FormatterT=boost::log_mt_nt5::formatters::fmt_message<char>, 1> Functor=boost::log_mt_nt5::formatters::fmt_message<char> 1> ] 1> LoggingFacility.cpp(111) : see reference to function template instantiation 'boost::log_mt_nt5::sinks::event_log::basic_event_composer<CharT>::event_map_reference &boost::log_mt_nt5::sinks::event_log::basic_event_composer<CharT>::event_map_reference::operator %<boost::log_mt_nt5::formatters::fmt_message<CharT>>(const FormatterT &)' being compiled 1> with 1> [ 1> CharT=char, 1> FormatterT=boost::log_mt_nt5::formatters::fmt_message<char> 1> ] The problem seems to be caused by the following expression: composer[MY_APPLICATION_SESSION_CREATION_FAILURE] % fmt::message(); Other backends work flawlessly. Event log files (.h/.mc/.dll) are OK too. Any help? Regards, Konrad Rybacki.

1 0

boost compilation error on MSVS 2010
by NtVisigoth 10 Jul '12

10 Jul '12

Hello everybody. I have tried to compile boost-libraries and I have trouble with compileation. Try number #1: g:\Projects\boost_1_50_0>bootstrap.bat 1>stdout.txt 2> stderr.txt g:\Projects\boost_1_50_0\tools\build\v2\engine> stdout.txt: Building Boost.Build engine stderr.txt: \Microsoft was unexpected at this time. bootstrap.log: Setting environment for using Microsoft Visual Studio 2010 x86 tools. Try number #2: g:\Projects\boost_1_50_0>bootstrap.bat toolset=msvc 1>stdout.txt 2>stderr.txt g:\Projects\boost_1_50_0> stdout.txt: Building Boost.Build engine Failed to build Boost.Build engine. Please consult bootstrap.log for furter diagnostics. You can try to obtain a prebuilt binary from http://sf.net/project/showfiles.php?group_id=7586&package_id=72941 Also, you can file an issue at http://svn.boost.org Please attach bootstrap.log in that case. stderr.txt: - this file is empty bootstrap.txt: ### ### "Unknown toolset: toolset" ### ### You can specify the toolset as the argument, i.e.: ### .\build.bat msvc ### ### Toolsets supported by this script are: borland, como, gcc, gcc-nocygwin, ### intel-win32, metrowerks, mingw, msvc, vc7, vc8, vc9, vc10, vc11 ### What can I do?

2 2

[Foreach] tweaked for speed -- a kludge worth refining?
by Paul Tuinenga 10 Jul '12

10 Jul '12

I admire the tight machine code BOOST_FOREACH teases compilers into generating. So what could be my problem? More speed! I have a situation with gathering floating-point data that may be of such low interest it's not worth pursuing for the library. In any case, I have my work-around (described below) that gets the job done. In this case, the need to accumulate: 1) using vectors of indices into another data vector (very NUMA) i.e. data[index] 2) there is always at least one index 3) majority of cases are two indices 4) but there may be several indices Obviously, it is best to go ahead and immediately process the (guaranteed) first index. This hides the cost of increment and loop-test in the latency of data fetch, even from L1 cache. But BOOST_FOREACH does not do that. So I hacked the macro. Works great! Creates the tightest machine code, boosting 2-element cases to the hardware limit (SSE/AVX instructions). Yes, there is the curly braces thing -- "crude but effective" is all I'm claiming. I'm sure there are better ways to alter the macro and/or use model; I'm interested to hear about that. - paul Example use: double accum = 0; ORG_BOOST_FOREACH(unsigned i, index) accum += data[i]; double temp, accum = 0; MOD_BOOST_FOREACH(unsigned i, index, temp = data[i]) accum += temp; temp = data[i]; } accum += temp; /////////////////////////////////////////////////////////////////////////////////////////////////////////////////// #define ORG_BOOST_FOREACH(VAR, COL) \ BOOST_FOREACH_PREAMBLE() \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_col) = BOOST_FOREACH_CONTAIN(COL)) \ {} \ else if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_cur) = BOOST_FOREACH_BEGIN(COL)) \ {} \ else if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_end) = BOOST_FOREACH_END(COL)) \ {} \ else \ for (bool BOOST_FOREACH_ID(_foreach_continue) = true; \ BOOST_FOREACH_ID(_foreach_continue) && !BOOST_FOREACH_DONE(COL); \ BOOST_FOREACH_ID(_foreach_continue) ? BOOST_FOREACH_NEXT(COL) : (void)0) \ if (boost::foreach_detail_::set_false(BOOST_FOREACH_ID(_foreach_continue))) \ {} \ else \ for (VAR = BOOST_FOREACH_DEREF(COL); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true) #define MOD_BOOST_FOREACH(VAR, COL, TMP) \ BOOST_FOREACH_PREAMBLE() \ if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_col) = BOOST_FOREACH_CONTAIN(COL)) \ {} \ else if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_cur) = BOOST_FOREACH_BEGIN(COL)) \ {} \ else if (boost::foreach_detail_::auto_any_t BOOST_FOREACH_ID(_foreach_end) = BOOST_FOREACH_END(COL)) \ {} \ else if (bool BOOST_FOREACH_ID(_foreach_continue) = false) \ {} \ else \ { \ /* some kind of BOOST-MPL "assert" here (debug only) to insure there is one item at least */ \ for (VAR = BOOST_FOREACH_DEREF(COL); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true) \ TMP; \ for (BOOST_FOREACH_ID(_foreach_continue) ? BOOST_FOREACH_NEXT(COL) : (void)0; \ BOOST_FOREACH_ID(_foreach_continue) && !BOOST_FOREACH_DONE(COL); \ BOOST_FOREACH_ID(_foreach_continue) ? BOOST_FOREACH_NEXT(COL) : (void)0) \ if (boost::foreach_detail_::set_false(BOOST_FOREACH_ID(_foreach_continue))) \ {} \ else \ for (VAR = BOOST_FOREACH_DEREF(COL); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true) ///////////////////////////////////////////////////////////////////////////////////////////////////////////////////

1 0

chaining ouput iterator to input iterator
by MM 09 Jul '12

09 Jul '12

Hi, I have a function that transforms a serie of numbers into another serie: template <typename InputIterator, typename OutputIterator> void transform( InputIterator begin, InputIterator end, OutputIterator out ) { } and a 2nd function that calculates the standard deviation of a sample template <typename InputIterator > double stdev( InputIterator begin, InputIterator end) { } Is there a way to chain these existing functions in order to get the std dev of the transformed serie, without storing the intermediate numbers? Maybe with the help of some lazy iterator, or some lazy function? MM

4 10

[Multi Index] Random Access Index C2247 Compile Error
by Steve Hibbert 09 Jul '12

09 Jul '12

Igor, thanks for getting back to me. Very good suggestion. I was trying to gain 'direct random access' to the items in the container by using the bracket operator on the MIC object, as you would do on a vector... "m_micOrders[index]". This is how example 10 in the Boost documentation shows the usage, using a text block stored in a MIC called tc, and using tc[pos] to access the pos'th element. After a review of the MIC source code and a bit of thinking, I have tried first getting a reference to the random access index, and then using the bracket operator on the reference to the index like this (where the random index is the seventh defined index in my case)... OrderMIC::nth_index<6>::type& index6 = m_micOrders.get<6>(); spOrder = index6[ index ]; It seems a general rule with MIC's is that you should never call any member functions on anything other than a reference to one of the indices. So, thanks very much for your help, and I am off and running again, much obliged. Steve

2 1

[Multi Index] Random Access Index C2247 Compile Error
by Steve Hibbert 09 Jul '12

09 Jul '12

Thanks very much to Steven Watanabe for getting back to me regarding my lower_bound/upper_bound question - I will take a look at equal_range() as suggested. I have been reading around and found the random_access index. This is useful to me to find any random item in my multi_index container. I am having a problem compiling though, I get error c2247 when I try to use the square bracket operator [] to access a randomly indexed item. The error message says that this is an inheritance issue with the protected status of the operator... c:\program files\microsoft visual studio\myprojects\xmltest\xmltest\xmltestapp.cpp(899) : error C2247: 'boost::multi_index::detail::random_access_index<SuperMeta,TagList>::operator []' not accessible because 'boost::multi_index::detail::ordered_index<KeyFromValue,Compare,SuperMeta,TagList,Category>' uses 'protected' to inherit from 'boost::multi_index::detail::random_access_index<SuperMeta,TagList>' I have based my code on example 10 in the Multi Index Documentation source examples. I can see that Daniel Bradburn had the same problem, detailed in a post dated April 6th 2010. Joaquin M Lopez Munoz responded, asking for a little test project to demonstrate, but there I can find no resolution to his (and, thus, my) question. I have also tried using the "#define BOOST_NO_MEMBER_TEMPLATE_FRIENDS" line, but no joy. For now, I can work around by either hacking the protected state to public or iterating the container to a random point. I have updated Boost to 1_50 and created an isolated test case in a small project to replicate the issue. I am using Visual Studio 9 on Windows Vista. Thanks in advance for any help with this. Steve

2 2