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

Boost version meaning
by vicente.botet 25 Nov '08

25 Nov '08

Hi, I would like to know what is the meaning of the 3 numbers on the Boost version X.Y.Z. When X changes, i.e. when we could have a Boost version 2.0.0 Which number means a complete rewriten? Which number means an incompatible evolution? Which number means new functions? Which number means major bugs corrections? Which number means only minor bugs corrections? Is this written somewhere? If we were to version individual Boost libraries which will be the apropiated schema? Should all the libraries follow the same schema? What do you think of? X: complete rewriten or incompatible evolution Y: new functions or major bugs corrections Z: minor bugs corrections Thanks, Vicente

3 2

Maintenace Guidelines wiki page
by vicente.botet 25 Nov '08

25 Nov '08

Hi, I have started the Maintenace Guidelines wiki page. You can access it directly https://svn.boost.org/trac/boost/wiki/Guidelines/MaintenanceGuidelines or via https://svn.boost.org/trac/boost/wiki Guidelines * Maintenance Guidelines There page need to be completed and surely reworked but this is an starting point. Please be free to improve the page directly or post your comments or suggestions to this list. Hopping this goes on the right direction, Vicente

3 6

Boost 1.37.0 and Borland C++ Builder 5 (compiler version 5.5/5.5.1)
by Marcin Kurek 24 Nov '08

24 Nov '08

Hello, I'm upgrading project which was originally developed using Borland C++ Builder 5. I need to do some parsing, so I thought I'd use Boost Regex. However, building regex with Borland C++ 5.5 (and 5.5.1) is an issue. There is no bcb5.mak included, so I use bjam: C:\boost_1_37_0\libs\regex\bjam --toolset=borland-5.5 (I tried --toolset=borland also) When I hit enter the only things I get are compiler errors... borland.compile.c++ ..\..\..\bin.v2\libs\regex\build\borland-5.5.1\debug\posix_a pi.obj ..\..\..\libs\regex\src\..\src\posix_api.cpp: Error E2404 ..\..\..\boost/regex/v4/basic_regex.hpp 195: Dependent type qualifie r 'c_regex_traits<char>' has no member type named 'string_type' in function __st dcall regcompA(regex_tA *,const char *,int) (...) Error E2228 ..\..\..\boost/regex/v4/basic_regex.hpp 346: Too many error or warni ng messages in function __stdcall regcompA(regex_tA *,const char *,int) *** 6 errors in Compile *** "bcc32.exe" -j5 -g255 -q -c -P -Ve -Vx -a8 -b- -v -Od -tWC -tWR -tWC -tWD -W M- -DBOOST_ALL_NO_LIB=1 -DBOOST_REGEX_DYN_LINK=1 -I"..\..\.." -I"C:\Program File s\Borland\CBuilder5/include/" -o"..\..\..\bin.v2\libs\regex\build\borland-5.5.1\ debug\posix_api.obj" "..\..\..\libs\regex\src\..\src\posix_api.cpp" Is there anybody who forced BCC 5.5/5.5.1 to play with Boost/Regex? Thanks, Marcin

2 1

Problem building Boost 1.37.0 on AIX using XL C/C++ v9.0.0.7
by Scott P. Smith (Atlanta) 24 Nov '08

24 Nov '08

I have successfully built the bjam tool, however when I attempt to build boost I get the following errors: "libs/math/build/../src/tr1/cbrt.cpp", line 11.39: 1540-0403 (S) "cbrt(double)" is already defined. "libs/math/build/../src/tr1/copysign.cpp", line 13.39: 1540-0403 (S) "copysign(double, double)" is already defined. It looks like the TR1 implementation that comes with xlC v9 is clashing with the implementation in boost. Is there a way to tell the bjam that the compiler supports TR1? I did not see such an option in the bjam help output. Thanks, Scott ________________________________ This message may contain confidential information and is intended for specific recipients unless explicitly noted otherwise. If you have reason to believe you are not an intended recipient of this message, please delete it and notify the sender. This message may not represent the opinion of IntercontinentalExchange, Inc. (ICE), its subsidiaries or affiliates, and does not constitute a contract or guarantee. Unencrypted electronic mail is not secure and the recipient of this message is expected to provide safeguards from viruses and pursue alternate means of communication where privacy or a binding message is desired.

1 0

Re: [Boost-users] boost test with assert()
by Hicham Mouline 24 Nov '08

24 Nov '08

Hmm. Sadly, RemoveSimulation() does other things that SimulationId knows nothing about ... > ----- Original Message ----- > From: "Gennadiy Rozental" <rogeeff(a)gmail.com> > To: boost-users(a)lists.boost.org > Subject: Re: [Boost-users] boost test with assert() > Date: Fri, 21 Nov 2008 23:45:59 +0000 (UTC) > Hicham Mouline <hicham <at> mouline.org> writes: > > > Possibly, there is a nicer/cleaner way to test this? > > Possible there is a nicer way to design this? Why not just call > RemoveSimulation > from SimulationId destructor? > > Gennadiy

3 5

[boost::asio]about boost::asio::async_read_until
by Ken zhang 24 Nov '08

24 Nov '08

Hi Dear all I want use async_read_until for read stream from socket until EOF,but I can't compile code below. code: boost::asio::async_read_until(socket_, stream_buffer_,boost::asio::transfer_all(), boost::bind(&http_connection::handle_read_response, this, boost::asio::placeholders::error,boost::asio::placeholders::bytes_transferred)); stream_buffer is instance of boost::asio::streambuf I got the error like: d:\development\boost_1_36_0\boost\asio\impl\read_until.ipp(953) : error C2664: "bool boost::asio::detail::transfer_all_t::operator ()<iterator>(const Error &,size_t)":Can't convert paramerater 2 from "iterator" to "size_t" with [ Error=iterator ] d:\development\tcphttpbridge\httpconnection.cpp(75):参见对正在编译的函数模板实例化"void boost::asio::async_read_until<boost::asio::ip::tcp::socket,std::allocator<_Ty>,boost::asio::detail::transfer_all_t,boost::_bi::bind_t<R,F,L>>(AsyncReadStream &,boost::asio::basic_streambuf<> &,MatchCondition,ReadHandler,void *)"的引用 with [ _Ty=char, R=void, F=boost::_mfi::mf2<void,http_connection,const boost::system::error_code &,size_t>, L=boost::_bi::list3<boost::_bi::value<http_connection *>,boost::arg<1>,boost::arg<2>>, AsyncReadStream=boost::asio::ip::tcp::socket, MatchCondition=boost::asio::detail::transfer_all_t, ReadHandler=boost::_bi::bind_t<void,boost::_mfi::mf2<void,http_connection,const boost::system::error_code &,size_t>,boost::_bi::list3<boost::_bi::value<http_connection *>,boost::arg<1>,boost::arg<2>>> ] -- Best Regards, Ken

2 5

Re: [Boost-users] Boost.Asio, An invalid argument was supplied.
by stefys 24 Nov '08

24 Nov '08

You were right, my apologies. Apparently, the problem was lying in preparing the acceptor to wait for clients. I was doing .bind() on it, but I was forgetting to do .listen(). Best regards, Steven

2 1

[multiindex] Why not to add B+Tree index to multiIndex?
by fgmailbox 24 Nov '08

24 Nov '08

we can use multiindex as a memory db,but the multiindex only support hash index and Order index(RB TREE),why not to add b+ Tree Index to multiindex to make it much faster . 2008-11-20 fgmailbox

5 5

[Preprocessor] Auitomatic switch generation for template class instanciation
by Olivier Tournaire 24 Nov '08

24 Nov '08

Hi all, I am currently completly lost with boost::preprocessor. I am trying to automatically generate a switch ... case structure with this lib and I cannot figure how I can do what I want. Here is the problem. I have a class templated over 2 parameters (in reality, more ...). At run time, I need to choose a specific instanciation for a user given values. An example : class MyDataEnergy { // ... }; class AnotherDataEnergy { // ... }; class MyPriorEnergy { // ... }; class AnotherPriorEnergy { // ... }; template <typename DataEnergyType , typename PriorEnergyType> class MyModel : public DataEnergyType , public PriorEnergyType { // ... }; Now, somewhere in the code, a user specifies which energies to use, and I have to instanciate MyModel with those energies: // ... int priorType = ValueComingFromSomewhere(); int dataType = AnotherValueComingFromSomewhere(); switch(priorType) { case 0: switch(dataType) { case 0: { MyModel<MyPriorEnergy,MyDataEnergy> aModel; aModel.SetInput(...); aModel.Optimize(...); } break; case 1: { MyModel<MyPriorEnergy,AnotherDataEnergy> aModel; aModel.SetInput(...); aModel.Optimize(...); } break; default: break; } case 1: switch(dataType) { case 0: { MyModel<MyPriorEnergy,MyDataEnergy> aModel; aModel.SetInput(...); aModel.Optimize(...); } break; case 1: { MyModel<MyPriorEnergy,AnotherDataEnergy> aModel; aModel.SetInput(...); aModel.Optimize(...); } break; default: break; } default: break; } I would like to know if there is a way to automate the above switch generation. As I have 5 templates, and not only 2, this will really helps ... I tried using BOOST_PP_SEQ_FOR_EACH but did not came to a result. Then, there is a lot of duplication in the above code. Am I doing the right way ? Hope you could help, Best regards, Olivier -- Dr. Olivier Tournaire Chargé de recherches MATIS - Institut Géographique National 73, Ave de Paris 94165 St Mandé cedex, France tel: (+33) 1 43 98 80 00 - 71 25 fax: (+33) 1 43 98 85 81

2 3

[Proto] POD expression can't be used in std::vector
by Joel Falcou 23 Nov '08

23 Nov '08

I have a expression who use BOOST_PROTO_EXTEND to be used as a POD type and I have a class inheriting from this expression to build a terminal class. When I build a std::vector of this terminal class using vector(size_t n) constructor I got the following error : /usr/include/c++/4.3.2/bits/stl_uninitialized.h:192: erreur: no matching function for call to ‘_Construct(const nt2::cmplx_expr<boost::proto::exprns_::expr<boost::proto::tag::address_of, boost::proto::argsns_::list1<nt2::cmplx_expr<boost::proto::exprns_::expr<boost::proto::tag::terminal, boost::proto::argsns_::term<std::pair<float, float> >, 0l> >&>, 1l> >, const nt2::cmplx<float>&)’ And same for _Destruct() Seems & is used on the expression instead of the terminal class (a bit like the cout bug we found earlier). Is it a proto bug or a std bug ? -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

4 14

Re: [Boost-users] [boost] Maintenace Guidelines wiki page
by vicente.botet 23 Nov '08

23 Nov '08

----- Original Message ----- From: "Robert Ramey" <ramey(a)rrsd.com> To: <boost(a)lists.boost.org> Cc: <boost-users(a)lists.boost.org> Sent: Saturday, November 22, 2008 11:28 PM Subject: Re: [boost] [Boost-users] Maintenace Guidelines wiki page > > vicente.botet wrote: >> ----- Original Message ----- >> From: "Robert Ramey" <ramey(a)rrsd.com> >> To: <boost-users(a)lists.boost.org> >> Cc: <boost(a)lists.boost.org> >> Sent: Saturday, November 22, 2008 9:19 PM >> Subject: Re: [Boost-users] Maintenace Guidelines wiki page >> I really think that *we can* achieve this goal. > > I would say 'we COULD' achieve this goal - if there was a > true desire to do so. You don't belive that things COULD change? >>> Your "Maintainence Guidlines" presume a consensus >>> about what should be acceptable practice where no >>> such consensus actually exists. >> >> Which acceptable practice are you referring to for which there is no >> consensus? > > My view is that it is good practice to consider > breaking an interface should be considered a bug. Does your view accepts that exceptionally a well documented breaking change with a reasoable deprecated period could not be considered a bug? > The responses to the posting cited above, indicate > to me that there is no consensus to support > this view point. You are right, there was no consensus at all respect to this point. May be we can reach a consensus in other points that can make Boost more backward compatible if not completly backward compatible. Do you think that the deprecation of a feature should be considered as a bug? If not how long should a reasonable period be for you? <snip> ... >> Please could you participate in the elaboration of this guidelines, > > Basically, the guidelines are fine Thanks. > The guidelines for authors should be separated from those > for users. Yes, I could add an index by author, user, RM. Why not. > For users, "don't use "using" " could be part of a larger list > of suggestions for getting the most benefit from the libraries. I'm sure that you have think about it already. Could you share with us some of these suggestions? Thanks, Vicente

2 4

enable_if on operator type()
by Joel Falcou 23 Nov '08

23 Nov '08

How can I set up SFINAE using enable_if on method like struct foo { template<class T> operator T() { return T(1); } }; I want the operator T() to be ther only if T is arithemtic for example. TIA -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

3 3

Boost.Asio, An invalid argument was supplied.
by stefys 23 Nov '08

23 Nov '08

Hello. I am trying to write a simple server, and I am using an asynchronous acceptor to get clients: acceptor.async_accept(crtclient->getSocket(), boost::bind(&Server::gotClient, this, boost::asio::placeholders::error)); As soon as this is executed, my Server::gotClient gets called with ec.message()="An invalid argument was supplied." Apparently the problem is that I am supplying an invalid socket with crtClient->getSocket(), but I can't understand how can this be. crtClient is a boost::shared_ptr<Client>. class Client { ... public: Client (boost::asio::io_service &ioserv, Server &server) : socket_(ioserv), ... {} ... boost::asio::ip::tcp::socket &getSocket () { return socket_; } ... private: boost::asio::ip::tcp::socket socket_; ... }; What could be wrong? Am I constructing socket incorrectly with socket_(ioserv)? Because if I construct it with socket_(ioserv, boost::asio::ip::tcp::v4()), I get the error "Already open" in ec.message(), rather than "An invalid argument was supplied".

2 1

[Property Tree] Compilation issue with Boost 1.37.0 Beta 1 issue
by Johan Råde 23 Nov '08

23 Nov '08

The property tree version in the trunk works with Boost 1.36 but not with 1.37 Beta 1. When I compile the following code istream is; ptree pt; read_xml(is, pt); with MSVS 9.0 I get the following error: 3>C:\Boost\include\boost-1_37\boost/iterator/iterator_adaptor.hpp(230) : error C2027: use of undefined type 'boost::STATIC_ASSERTION_FAILURE<x>' 3> with 3> [ 3> x=false 3> ] 3> C:\Boost\include\boost-1_37\boost/iterator/iterator_adaptor.hpp(335) : see reference to function template instantiation 'void boost::detail::iterator_adaptor_assert_traversal<boost::forward_traversal_tag,boost::random_access_traversal_tag>(void)' being compiled 3> C:\Boost\include\boost-1_37\boost/iterator/iterator_adaptor.hpp(334) : while compiling class template member function 'void boost::iterator_adaptor<Derived,Base,Value,Traversal>::advance(__w64 int)' 3> with 3> [ 3> Derived=boost::spirit::position_iterator<std::_Vector_const_iterator<Ch,std::allocator<char>>>, 3> Base=std::_Vector_const_iterator<Ch,std::allocator<char>>, 3> Value=const char, 3> Traversal=boost::forward_traversal_tag 3> ] 3> C:\Boost\include\boost-1_37\boost/spirit/home/classic/iterator/position_iterator.hpp(156) : see reference to class template instantiation 'boost::iterator_adaptor<Derived,Base,Value,Traversal>' being compiled 3> with 3> [ 3> Derived=boost::spirit::position_iterator<std::_Vector_const_iterator<Ch,std::allocator<char>>>, 3> Base=std::_Vector_const_iterator<Ch,std::allocator<char>>, 3> Value=const char, 3> Traversal=boost::forward_traversal_tag 3> ] 3> C:\Program Files\Boost\Unofficial\boost/property_tree/detail/xml_parser_read_spirit.hpp(709) : see reference to class template instantiation 'boost::spirit::position_iterator<ForwardIteratorT>' being compiled 3> with 3> [ 3> ForwardIteratorT=std::_Vector_const_iterator<Ch,std::allocator<char>> 3> ] 3> C:\Program Files\Boost\Unofficial\boost/property_tree/xml_parser.hpp(45) : see reference to function template instantiation 'void boost::property_tree::xml_parser::read_xml_internal<Ptree>(std::basic_istream<_Elem,_Traits> &,Ptree &,int,const std::string &)' being compiled 3> with 3> [ 3> Ptree=boost::property_tree::ptree, 3> _Elem=char, 3> _Traits=std::char_traits<char> 3> ] 3> .\GeneAuxParser.cpp(33) : see reference to function template instantiation 'void boost::property_tree::xml_parser::read_xml<boost::property_tree::ptree>(std::basic_istream<_Elem,_Traits> &,Ptree &,int)' being compiled 3> with 3> [ 3> _Elem=char, 3> _Traits=std::char_traits<char>, 3> Ptree=boost::property_tree::ptree 3> ] --Johan Råde

2 3

Re: [Boost-users] [boost] Maintenace Guidelines wiki page
by Vicente Botet 23 Nov '08

23 Nov '08

----- Original Message ----- From: "Henrik Sundberg" <storangen(a)gmail.com> To: <boost(a)lists.boost.org> Sent: Sunday, November 23, 2008 3:13 PM Subject: Re: [boost] [Boost-users] Maintenace Guidelines wiki page > > On Sun, Nov 23, 2008 at 2:37 PM, vicente.botet <vicente.botet(a)wanadoo.fr> wrote: >> Do you know if the author can change himself the permision on his own SVN files? > > Subversion is not meant to be used that way, as I understand it. Locks > would give the effect you describe, but they aren't meant to be used > for this. Oh, as a last resort he could change the permission in its own SVN copy. <snip> > I think you say that files that has been copied to tags, shall not be > edited in trunk. That seems like hindering development. I see no real > difference between bugs/changes in test code and bugs/changes in C++ > code. Ok, I see now your concern. Of course if there is a bug on the test file it must be modified, but it is a good practice to let them unchanged when there is no bug in. >> I hope that it is clear that I don't want to impose any rule to the authors, release manager or users. Guidelines that are used could incite other to use them. If some of the guidelines seems no useful at all, I have no problem to remove them from this Maintenance Guidelines. > > I think you're doing a very good thing by writing this guideline. I > believe in guidelines too. I actually believe in some rules as well. Me too.

1 0

Patch for push_relabel_max_flow
by Tim Keitt 23 Nov '08

23 Nov '08

I am working with custom graph classes in the Graph library. These classes construct out edge iterators on the fly. This caused problems with push_relabel_max_flow as it uses repeated calls to out_edges to retrieve the end iterator. I've modified the code to store iterator pairs, rather than repeatedly call out_edges. Here's the diff: 124c124 < current(num_vertices(g_), out_edges(*vertices(g_).first, g_).second), --- > current(num_vertices(g_), out_edges(*vertices(g_).first, g_)), 152c152 < current[u] = out_edges(u, g).first; --- > current[u] = out_edges(u, g); 243c243 < current[v] = out_edges(v, g).first; --- > current[v] = out_edges(v, g); 265c265 < for (ai = current[u], ai_end = out_edges(u, g).second; --- > for (ai = current[u].first, ai_end = current[u].second; 294c294 < current[u] = ai; --- > current[u].first = ai; 353c353 < current[u] = min_edge_iter; --- > current[u].first = min_edge_iter; 447c447 < current[u] = out_edges(u, g).first; --- > current[u] = out_edges(u, g); 458,459c458,459 < for (; current[u] != out_edges(u, g).second; ++current[u]) { < edge_descriptor a = *current[u]; --- > for (; current[u].first != current[u].second; ++current[u].first) { > edge_descriptor a = *current[u].first; 472c472 < delta = min BOOST_PREVENT_MACRO_SUBSTITUTION(delta, residual_capacity[*current[v]]); --- > delta = min BOOST_PREVENT_MACRO_SUBSTITUTION(delta, residual_capacity[*current[v].first]); 476c476 < v = target(*current[v], g); --- > v = target(*current[v].first, g); 481c481 < a = *current[v]; --- > a = *current[v].first; 491,492c491,492 < for (v = target(*current[u], g); v != u; v = target(a, g)){ < a = *current[v]; --- > for (v = target(*current[u].first, g); v != u; v = target(a, g)){ > a = *current[v].first; 495c495 < color[target(*current[v], g)] = ColorTraits::white(); --- > color[target(*current[v].first, g)] = ColorTraits::white(); 502c502 < ++current[u]; --- > ++current[u].first; 509c509 < if (current[u] == out_edges(u, g).second) { --- > if (current[u].first == current[u].second) { 524c524 < ++current[u]; --- > ++current[u].first; 635c635 < std::vector< out_edge_iterator > current; --- > std::vector< std::pair<out_edge_iterator, out_edge_iterator> > current; -- Timothy H. Keitt http://www.keittlab.org/

1 0

Random: Using random generators with runtime parameters
by Hans Mull 23 Nov '08

23 Nov '08

Hi! How can I use random generators with multiple parameters such as linear_congruential with parameters that are only known at runtime? Thanks in advance, Hans

3 4

MultiPassInputIterator concept
by Tim Keitt 22 Nov '08

22 Nov '08

I have a question about the requirements of the MultiPassInputIterator concept as used in the Boost Graph Library. Does the ++first_iter == ++second_iter requirement hold across calls to out_edges(vertex, g)? Or put another way, does out_edges always have to return an iterator with same ordering of returned edges? The difference is between: graph_traits<graph>::out_edge_iterator i = out_edges(vertex, g); graph_traits<graph>::out_edge_iterator j = i; ++i == ++j; // clearly required, but sufficient? and graph_traits<graph>::out_edge_iterator i = out_edges(vertex, g); graph_traits<graph>::out_edge_iterator j = out_edges(vertex, g); ++i == ++j; // also required? Strangely enough, I have an application where the second case is (currently) not guaranteed (its a custom graph class where the out_edge_iterator is constructed on-the-fly). THK -- Timothy H. Keitt http://www.keittlab.org/

3 2

[Regex] subexpressions
by Carsten Witzel 22 Nov '08

22 Nov '08

Hi, I'm using the Regex library for the first time with Visual Studio 2008. I've created a simple win32 console project, which works fine. The code is ------------------------------------- const char *pattern = "^(\\w*)\\s*=\\s*(\\w*).*"; const char *text = "Key = Value; Comment"; boost::regex re(pattern); boost::cmatch match; std::cout << pattern << std::endl; std::cout << text << std::endl; if (regex_match(text, match, re)) { std::cout << "--> " << match.size() << std::endl; for (int i = 0; i < match.size(); ++i) { std::cout << i << ": " << match[i] << std::endl; } } ------------------------------------- And the output is as expected: -------------------------------------- ^(\w*)\s*=\s*(\w*).* Key = Value; Comment --> 3 0: Key = Value; Comment 1: Key 2: Value -------------------------------------- However, I've tried to use the same code with the C/C++-API of a commercial software, and here I get the following output: -------------------------------------- ^(\w*)\s*=\s*(\w*).* Key = Value; Comment --> 3 - 0: Key = Value; Comment - 1: Key = Value; Comment - 2: Value; Comment -------------------------------------- Does anybody have an idea what's wrong here? Unfortunately, I'm not allowed to post any header files, so I need some hints where to look for a solution by myself. Thanks for any help! Regards Carsten Witzel

5 11

Boost.Function and Boost.Bind
by Yang Zhang 22 Nov '08

22 Nov '08

I have the following simple test case: #include <boost/bind.hpp> #include <boost/function.hpp> #include <iostream> using namespace boost; using namespace std; void show(int x) { cout << x << endl; } void twice(function0<void> f) { f(); f(); } int main() { // This works... function<void()> f = bind(show, 0); bind(twice, f)(); // ...but this does not compile. // bind(twice, bind(show, 0))(); return 0; } When uncommenting the problematic line and attempting to build, I get: $ g++ -Wall -o boost_function{,.cc} /opt/armed/include/boost/bind.hpp: In member function ‘void boost::_bi::list1<A1>::operator()(boost::_bi::type<void>, F&, A&, int) [with F = void (*)(boost::function0<void, std::allocator<boost::function_base> >), A = boost::_bi::list0, A1 = boost::_bi::bind_t<void, void (*)(int), boost::_bi::list1<boost::_bi::value<int> > >]’: /opt/armed/include/boost/bind/bind_template.hpp:20: instantiated from ‘typename boost::_bi::result_traits<R, F>::type boost::_bi::bind_t<R, F, L>::operator()() [with R = void, F = void (*)(boost::function0<void, std::allocator<boost::function_base> >), L = boost::_bi::list1<boost::_bi::bind_t<void, void (*)(int), boost::_bi::list1<boost::_bi::value<int> > > >]’ boost_function.cc:13: instantiated from here /opt/armed/include/boost/bind.hpp:232: error: conversion from ‘void’ to non-scalar type ‘boost::function0<void, std::allocator<boost::function_base> >’ requested Why can't I put the two on the same line? (I also tried using template<typename T> void twice(T f) { f(); f() }, but that didn't work either.) Thanks in advance for any tips. -- Yang Zhang http://www.mit.edu/~y_z/

4 5

[regex] segfault from construction
by Andrew Troschinetz 22 Nov '08

22 Nov '08

Hello all, I've got what I suspect is a relatively unique problem that's resulting in a segfault whenever I try to construct a boost::regex. First some machine information: Red Hat Enterprise Linux Server release 5.1 (Tikanga) Linux 2.6.18-53.el5, SMP, x86_64 gcc 4.1.2 20070626 (Red Hat 4.1.2-14) boost 1.33.1-10 Here's a small example that shows the problem: #include <boost/algorithm/string/regex.hpp> #include <iostream> #include <string> using namespace std; int main() { string input ("test test1 test2 test3"); string pattern ("\\btest\\b"); erase_regex (input, boost::regex (pattern)); cout << input << endl; // expecting " test1 test2 test3" return 0; } Compile flags (and this is getting to the heart of the problem, I think): -g -m32 -malign-double -O3 -Wall -lboost_regex Put all the above together in a bag, shake it up, and you get this segfault: 0x08066beb in boost::re_detail::basic_regex_parser<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::parse_extended (this=0xffde311c) at /usr/include/boost/regex/v4/basic_regex_parser.hpp:235 235 switch*this->m_traits.syntax_type(*m_position)) (gdb) print m_position $1 = 0x0 (gdb) bt #0 0x08066beb in boost::re_detail::basic_regex_parser<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::parse_extended at /usr/include/boost/regex/v4/basic_regex_parser.hpp:235 #1 0xf7f9e364 in boost ::re_detail::basic_regex_parser<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::parse () from /usr/lib/libboost_regex.so.2 #2 0xf7fa0eba in boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::do_assign () from /usr/lib/ libboost_regex.so.2 #3 0x08050789 in main () at /usr/include/boost/regex/v4/ basic_regex.hpp:254 So the immediate culprit is a dereferencing-null problem. Interestingly, the problem goes away at -O, -O1, and -O2. Or -O3 but without -malign-double. I was wondering if this is a known problem, and if anyone else who's hand is forced to compile with -malign-double has seen this problem and been able to work around it? -- Andrew Troschinetz Applied Research Laboratories

4 4

Boost.Test with a static library
by Moritz Beber 22 Nov '08

22 Nov '08

Hello everyone, after prying for any hints in the documentation and reading frustrating mails in the archives for a while now, I get the feeling that this is a very confusing topic. My aim is to use a static library of boost.test because I need to compile it a lot and the waiting time when using the header is just frustrating. So I added to the "Jamfile.v2" in "libs/test/build" under "requirements" the following line: <define>BOOST_TEST_ALTERNATIVE_INIT_API=1 Then I used boost.build and apart from a few warnings like: ./boost/test/detail/config.hpp:85:1: warning: "BOOST_TEST_ALTERNATIVE_INIT_API" redefined <command-line>: warning: this is the location of the previous definition everything seemed alright. So I'm assuming I now have a static library with this macro defined so it should use the alternative initialiser. Then I tried the following code, which I mostly copied from the documentation, except for adding two macros: #define BOOST_TEST_NO_LIB #define BOOST_TEST_ALTERNATIVE_INIT_API #define BOOST_TEST_MODULE example #include <boost/test/unit_test.hpp> BOOST_AUTO_TEST_SUITE( test_suite1 ) BOOST_AUTO_TEST_CASE( test_case1 ) { BOOST_WARN( sizeof(int) < 4 ); } BOOST_AUTO_TEST_CASE( test_case2 ) { BOOST_REQUIRE_EQUAL( 1, 2 ); BOOST_FAIL( "Should never reach this line" ); } BOOST_AUTO_TEST_SUITE_END() BOOST_AUTO_TEST_SUITE( test_suite2 ) BOOST_AUTO_TEST_CASE( test_case3 ) { BOOST_CHECK( true ); } BOOST_AUTO_TEST_CASE( test_case4 ) { BOOST_CHECK( false ); } BOOST_AUTO_TEST_SUITE_END() When I try to compile, however, I get the following error: /home/engineer/libs/boost/lib/libboost_unit_test_framework-gcc43-mt-1_37.a(unit_test_main.o): In function `main': unit_test_main.cpp:(.text+0x2229): undefined reference to `init_unit_test()' collect2: ld returned 1 exit status Which I thought the macro BOOST_TEST_MODULE would take care of. I also tried using the BOOST_TEST_MAIN and took out the BOOST_TEST_NO_LIB. Nothing made a change to the compiler error. Can anyone help? Or give me a link to some proper documentation of how to resolve this issue? Thanks, Moritz

3 5

Boost.Statechart and Simulink
by Derek Ditch 22 Nov '08

22 Nov '08

I was wondering if there were any known issues with compiling using Matlab's mex compiler (which in turn uses and links with gcc) and using Boost.Statechart. When I implemented my statechart, I tested it using a separate main() file and it works 100%. When I compile using mex into a Matlab MEX file, I seem to lose the functionality of the event triggers. I've tried several things to figure out what is happening, but all I can ascertain is that if I use the iterators state_begin() and state_end() to access all internal states, the loop never executes. I tried to dereference state_begin(), but got a segfault. My initial approach was to use the state_downcast<>(), but this didn't work in SImulink either. My final suspicion was that it had something to do with the extern "C" business, but admittedly, I don't understand the effects of this statement other than how the symbol appears in the library (i.e. avoiding mangling). I get this same behavior on OS X 10.5 w/ gcc 4.0.1 as well as on Linux x86_64 with gcc 4.2.4. If anyone wants to have my Simulink model to test, I could send that as well. I've attached the following files: ctrl_machine.[ch]pp - My state machine implementation/declaration. main.cpp - My test program air_controller.cpp - The C++ SFunction implementation used in Simulink. mex uses the following compilation steps with gcc/g++ -> g++-4.2 -c -I/opt/matlab/extern/include -I/opt/matlab/simulink/include -DMATLAB_MEX_FILE -ansi -D_GNU_SOURCE -fPIC -fno-omit-frame-pointer -pthread -DMX_COMPAT_32 -O -DNDEBUG "ctrl_machine.cpp" -> g++-4.2 -c -I/opt/matlab/extern/include -I/opt/matlab/simulink/include -DMATLAB_MEX_FILE -ansi -D_GNU_SOURCE -fPIC -fno-omit-frame-pointer -pthread -DMX_COMPAT_32 -O -DNDEBUG "air_controller.cpp" -> gcc-4.2 -c -I/opt/matlab/extern/include -I/opt/matlab/simulink/include -DMATLAB_MEX_FILE -ansi -D_GNU_SOURCE -fexceptions -fPIC -fno-omit-frame-pointer -pthread -DMX_COMPAT_32 -O -DNDEBUG "/opt/matlab/extern/src/mexversion.c" -> g++-4.2 -O -pthread -shared -Wl,--version-script,/opt/matlab/extern/lib/glnxa64/mexFunction.map -Wl,--no-undefined -o "ctrl_machine.mexa64" ctrl_machine.o air_controller.o mexversion.o -Wl,-rpath-link,/opt/matlab/bin/glnxa64 -L/opt/matlab/bin/glnxa64 -lmx -lmex -lmat -lm -lm ----- Thanks, Derek Ditch

2 2

Re: [Boost-users] boost test with assert()
by Hicham Mouline 21 Nov '08

21 Nov '08

Hello, Any ideas re this issue? Can the assert from <cassert> be caught somehow? Regards,

3 6

std::vector and default constructor
by peter_foelsche＠agilent.com 21 Nov '08

21 Nov '08

It would be helpful to have something like std::vector which allows one to pass some argument which is in turn passed to the constructor of every element so that not the default constructor is being called. This would be helpful for e.g. objects located in memory created by memory mapped files. Peter "The first point (using an init() function in preference to a constructor) is bogus. Using constructors and exception handling is a more general and systematic way of dealing with resource acquisition and initialization errors. This style is a relic of pre-exception C++." -- Stroustrup

2 3

[test] new g++ compilation warnings on trunk
by Robert Mecklenburg 21 Nov '08

21 Nov '08

Compiling against the boost trunk I'm getting hundreds of these: g++ -Wall -Wextra -Wno-missing-braces -g -ftrapv -DBOOST_1_36_0 -Iboost-1_37 -MMD -MP -DUSE_TRAPV -c -o src/test/BlobTest.o src/test/BlobTest.cpp boost/test/floating_point_comparison.hpp:224: warning: 'boost::test_tools::<unnamed>::check_is_close' defined but not used boost/test/floating_point_comparison.hpp:246: warning: 'boost::test_tools::<unnamed>::check_is_small' defined but not used Any chance we can fix this? If you need a tester for g++ 4.2.3, I can do it. Thanks, -- Robert

5 5

[Test] Compilation problem
by Greg Ravikovich 21 Nov '08

21 Nov '08

Hello, I'm using boost 1.37 and have the following problem: A blank cpp file containing only: #include <boost/test/test_case_template.hpp> fails to compile on vc9. However a blank cpp containing: #include <boost/test/unit_test.hpp> #include <boost/test/test_case_template.hpp> compiles fine. A file containing #include <boost/test/test_case_template.hpp> #include <boost/test/unit_test.hpp> won't compile as well. Is this intentional? Or is there a missing include directive inside test_case_template? Thanks, Greg

2 1

boost test with assert()
by Hicham Mouline 21 Nov '08

21 Nov '08

Hello, I use this test class: class SimulationIdTest { public: static void TestDestructorAfterAddRemoveSimulation(); static void TestDestructorAfterAddRemoveContractSimulation(); static void AddTests(boost::unit_test::test_suite* suite); }; TestDestructorxxx() are written so that the code inside, indirectly, throws an assert(false) (not my code) I would like to test that indeed, it does throw the assert(false). void SimulationIdTest::AddTests(boost::unit_test::test_suite* suite) { suite->add(BOOST_TEST_CASE(TestDestructorAfterAddRemoveSimulation), 1); } I tried the above by saying there would be 1 failure, however the test suite stops on that failure ( the assert(false) ), even the second argument of suite->add is 1. Is there a solution to this case? Regards,

2 1

tweaking the review process (was: signals2 review results)
by Stjepan Rajko 21 Nov '08

21 Nov '08

Hi Paul, On Fri, Nov 21, 2008 at 1:00 AM, Paul Baxter <pauljbaxter(a)hotmail.com> wrote: > On Thu, Nov 20, 2008 at 11:40 PM, vicente.botet <vicente.botet(a)wanadoo.fr> wrote: >> I would like to make some suggestion to improve the review management: > > <valid points snipped> > > Whilst I understand your points, unlike our day job, people do have other > more pressing commitments and, for many, the extensive effort given to > reviewing boost libraries is time given in an ad-hoc manner. > > Whilst it is good to have the timetable and a specific method for submitting > reviews, I don't think we need to go further and be more regimented. The > existing flexibility is a positive part of the process, IMHO. I also tend to prefer flexibility when people are volunteering their time. > > [ I do have problems with some libraries actually getting to the point of > review before interest, maturity of interface or implementation are right, > but that doesn't apply here and has been covered in previous discussions.] > I think I was guilty of this / have been bit by this myself. Anyway, there are two things that I think can help here: * requiring a certain number of committed reviewers before scheduling a review * the review manager being more active in examining the library before the actual review About the latter - in both reviews I managed, there was a number of issues (e.g., documentation shortfalls) that came up during the review that I, as review manager, could have discussed privately with the author beforehand had I done a more thorough review of the library. These issues could have been fixed before a review was scheduled, and the reviews could have been more focused on other issues. The review process page states: "The Review Manager... Checks the submission to make sure it really is complete enough to warrant formal review. See the Boost Library Requirements and Guidelines. If necessary, work with the submitter to verify the code compiles and runs correctly on several compilers and platforms." Well, in both cases I had examined the library, tried it on several compilers, read the docs, glanced at the implementation, etc. But it wasn't a thorough review. I think, had I actually gone through the reviewer's list of questions and wrote a full review, it would have given the authors some idea of possible areas that can be improved before the review (being careful not to react prematurely in possibly contentious areas where the opinion of just one person is not enough). Doing something like this would require additional effort from the review manager, but I think it would result in a much better review (and one where it is possibly easier to make a decision because there are fewer remaining problems). Best, Stjepan

2 2

error LNK2019: :assertion_failed wrt boost::detail::basic_timed_mutex::lock
by Joseph A. Marks 21 Nov '08

21 Nov '08

Hi! Could anyone please help me out with the following error? : error LNK2019: unresolved external symbol "void __cdecl boost::assertion_failed(char const *,char const *,char const *,long)" (?assertion_failed@boost@@YAXPBD00J@Z) referenced in function "public: void __thiscall boost::detail::basic_timed_mutex::lock(void)" (?lock@basic_timed_mutex@detail@boost@@QAEXXZ) Thanks in Advance! Joseph A. Marks PHONE: 612-788-9658 e-mail: josephamarks(a)yahoo.com

1 0

tweaking the review process (was: signals2 review results)
by Stjepan Rajko 21 Nov '08

21 Nov '08

On Fri, Nov 21, 2008 at 2:06 AM, Robert Jones <robertgbjones(a)gmail.com> wrote: > On Fri, Nov 21, 2008 at 6:40 AM, vicente.botet <vicente.botet(a)wanadoo.fr> > wrote: >> >> * I had notice only at the end of the the review that the review tokes >> place on two mailing lists (devel ans user). Maybe this is usaual on Boost >> reviews but I was not aware. It will be more transaparent if all the reviews >> were posted to the same mailing list, maybe a specific one should be >> created. >> > > A specific maillist for reviews strikes me as an excellent idea. In Joels' > review > of his Phoenix 2.0 library there were some outstanding contributions from > people I don't see posting very often, but who apparently feel moved to do > important stuff like reviewing. These comments did much to give me some > historical context, and understanding of structure, alternatives and > implementation > decisions. These will inevitably be lost in the general background noise of > on going developments, and it would be nice to have a clear place for these > review comments. > Perhaps it would be sufficient to *strongly stress* that any post related to the ongoing review should have [review] in the subject line? (although that doesn't address the problem of having the review on both the dev and user lists...) Stjepan

1 0

asio: i/o cancellation under Linux/ARM broken?
by Stefan Sichler 21 Nov '08

21 Nov '08

Hello, I'm developing a major application using asio that is ported to Windows x86/ia64, Linux x86 and Linux on an ARM processor. It seems i/o cancellation is broken on Linux/ARM, which is a major problem for me. I added a small test case below for demonstration. On Windows, the test case will work correctly, running the loop 10 times. On Linux, it will hang after the first loop pass. Please help! (boost 1.37, Debian Linux 2.6.27) Regards, Stefan Sichler >> code follows: #ifdef WIN32 #define BOOST_ASIO_ENABLE_CANCELIO #endif #include <iostream> #include <boost/asio.hpp> using namespace std; using namespace boost::asio; using namespace boost::asio::ip; // boost asio cancellation testcase bool g_io_completed= false; void completionHandler(const boost::system::error_code& err, size_t bt) { cout<<"completed err="<<err<<" bt="<<bt<<endl; g_io_completed= true; } int main(int argc, char* argv[]) { io_service ios; udp::socket sock(ios); sock.open(udp::v4()); sock.bind(udp::endpoint()); cout<<"note: if this test hangs, the cancel test failed!"<<endl; char buf[64]; for (int i=0; i<10; ++i) { cout<<"loop start i="<<i<<endl; g_io_completed= false; sock.async_receive(buffer(buf),completionHandler); for (int t=0; t<1000; ++t) // spend some time.... ios.poll(); sock.cancel(); while (!g_io_completed) // wait for completion handler ios.poll(); cout<<"loop end i="<<i<<endl; } cout<<"cancel test completed successfully!"<<endl; return 0; }

1 0

[boost users] [signal] problem solved
by Oliver Kania 21 Nov '08

21 Nov '08

Hello ! Please forget my previous mail about getting a NULL connection. Best regards, Oliver

1 0

[lambda] Can't see the wood for the trees"
by Robert Jones 21 Nov '08

21 Nov '08

I have a little code snippet... #include <iostream> #include "boost/range.hpp" #include "boost/function.hpp" #include "boost/lambda/lambda.hpp" int main( ) { using namespace boost::lambda; typedef int block[2][4]; boost::function< int(boost::range_value< block >::type) > third = _1[2]; block values = {{0,1,2,3},{4,5,6,7}}; std::for_each(boost::begin(values), boost::end(values), std::cout << third << "\n" ); } which I want to print the third element of each row of values. I can see that what I've written is not quite right, since the compiler quite reasonably complains that it doesn't kknow how to print a function object, but I can't seem to write the correct incantation! The error message, if it helps is... $ g++ -o junk.exe junk.cpp junk.cpp: In copy constructor `std::basic_ios<char, std::char_traits<char> >::basic_ios(const std::basic_ios<char, std:: char_traits<char> >&)': /usr/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/ios_base.h:781: error: `std::ios_base::ios_base(const std::ios_base&) ' is private junk.cpp:17: error: within this context junk.cpp: In function `int main()': junk.cpp:17: error: initializing argument 3 of `_Function std::for_each(_InputIterator, _InputIterator, _Function) [wi th _InputIterator = int (*)[4], _Function = std::basic_ostream<char, std::char_traits<char> >]' /usr/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/stl_algo.h: In function `_Function std::for_each(_InputIterator, _Inp utIterator, _Function) [with _InputIterator = int (*)[4], _Function = std::basic_ostream<char, std::char_traits<char> >] ': junk.cpp:17: instantiated from here /usr/lib/gcc/i686-pc-cygwin/3.4.4/include/c++/bits/stl_algo.h:158: error: no match for call to `(std::basic_ostream<char , std::char_traits<char> >) (int[4])' Thank Folks! - Rob.

1 0

[boost-users][signal] When can a connection become NULL ?
by Oliver Kania 21 Nov '08

21 Nov '08

Hello, I have the problem of a connection becoming invalid (being set to NULL) even though none of the things mentioned in the signals documentation happens: Signal/slot disconnections occur when any of these conditions occur: - The connection is explicitly disconnected via the connection's disconnectmethod directly, or indirectly via the signal's disconnect method or scoped_connection's destructor. - A trackable object bound to the slot is destroyed. - The signal is destroyed. Is anyone aware of other conditions under which a connection could become NULL ? Here is a code snippet: ----------------------------------------------------------------- boost::signal<int(vtkLookupTable*)> m_signal; boost::signals::connection m_connection; .... CScalarBarLayerGeometry* l_receive = cast_poly<CScalarBarLayerGeometry*>(p_layer->GetGeometry()) m_connection = m_signal.connect(boost::bind(&CScalarBarLayerGeometry::SetLookupTable,l_receive, _1)); ------------------------------------------------------------------- The first time I invoke m_connection.connected() it returns true. The second time it returns false and the connection is NULL. Any help would be appreciated. Best regards, Oliver

1 0

[multiindex] Why not to add B+Tree index to multiIndex?
by fgmailbox 21 Nov '08

21 Nov '08

2008-11-21 fgmailbox 发件人： fgmailbox 发送时间： 2008-11-21 11:41:59 收件人： 49259BE6.8010704; joaquin 抄送：主题： Re: [Boost-users] [multiindex] Why not to add B+Tree index to multiIndex? To: "boost-users(a)lists.boost.org" <boost-users(a)lists.boost.org> Message-ID: <49259BE6.8010704(a)tid.es> Content-Type: text/plain; charset=GB2312 fgmailbox escribi??: > we can use multiindex as a memory db,but the multiindex only support > hash index and Order index(RB TREE),why not to add b+ Tree Index to > multiindex to make it much faster . I'm no expert in B+ trees, but I understand that these structures are more effective than regular binary trees when secondary storage (i.e. hard disk) is used, which is not the case for an in-memory container like multi_index_container. Have you any reference on the performance of B+ trees in in-memory scenarios? Joaqu??n M L??pez Mun~oz Telef??nica, Investigaci??n y Desarrollo Hi joaquin: I found b+ Tree code in a GNU Database Source Code of [firebird] Database code BePlusTree< > template class In [tree.h],your can find this source code in http://sourceforge.net template < typename Value, typename Key = Value, typename Allocator = MallocAllocator, typename KeyOfValue = DefaultKeyValue<Value>, typename Cmp = DefaultComparator<Key>, int LeafCount = LEAF_PAGE_SIZE / sizeof(Value), nt NodeCount = NODE_PAGE_SIZE / sizeof(void*) > class BePlusTree {....} the Allocator can be a memory allocator or a disk file allocator,so this template can use as a memory database index ,and I have use the template to test BePlusTree and stl::set to test performance, the BePlusTree is faster than set in the condition of large scale data query. 2008-11-21 fgmailbox

2 1

[signals2][review] signals2 review results
by Stjepan Rajko 21 Nov '08

21 Nov '08

** signals2 review results ** I am pleased to announce that the signals2 library by Frank Mori Hess is accepted into boost, pending some conditions outlined below are met. I would like to thank the author for his work on this library, and for his very responsive participation in the review. I would also like to thank Franz Alt, Jean-Cristophe Benoist, Vicente Botet, Fabio Fracassi, Johan Råde, Ravikiran Rajagopal, Andrew Webber, and Jesse Williamson for submitting reviews, and Terry Golubiewski, Michael Marcin, and Hansjörg for additional comments regarding the library. There were 5 votes cast for the acceptance of this library, and 3 against accepting the library at this time. The reviewers that were against immediate inclusion of signals2 suggested that the library should be accepted when several stated problems are addressed adequately. Overall, the library was regarded as a much needed thread-safe successor of Boost.Signals. Those that have tried switching from Boost.Signals to signals2 have found the switch rather painless (at least in the cases that don't involve the Boost.Signals trackable interface), and some reported using signals2 and/or its previous versions in production code. Some additional improvements that were mentioned are an automatic connection management system based on shared_ptr, and a change of namespace (which avoids problems with QT). Additionally, many requests were made for improvements in the documentation, as well as some improvements in thread-related testing and some possible changes to the interface. Frank has addressed many of the issues in the review, and in many cases offered concrete steps to address the problems. Following is an overview of the most prominent issues that were raised. These issues must be addressed before this library is included in the trunk and subsequent releases: ** Boost.Signals -> signals2 transition ** There needs to be a concrete plan of migration from the current version of Boost.Signals to signals2. The almost-decided-on route is to have both Boost.Signals and signals2 co-exist in Boost for a few releases, with Boost.Signals getting deprecated. From reading the reviews, it looks like no one has a problem with this, so it seems like it's just a matter of an agreement between the library maintainers that gets posted in the documentation / on the lists. The bigger part of the problem is to make sure that users of Boost.Signals can transition to signals2 as easily as possible. Given the reports so far, this process is indeed easy, with the biggest exception being the removal of the trackable interface in signals2 (which was removed because it is not thread-safe). Frank has indicated that he will put it back into the library and make it available for single-threaded signals as a way to ease porting for Boost.Signals users, which sounds like a great step. My biggest concern here is that the signals2 interface is "gotten right" (with respect to compatibility with Boost.Signals) by the time it is included in Boost, so that porting is both easy and a fixed target. Given how easy people have found porting their code so far, it looks like restoring the trackable interface might is all that is needed. I would discourage any further breaking changes to the interface (one thing mentioned was dropping some of the template parameters), but I also recognize the opportunity to improve the interface in response to the review. Any signals2 interface changes that significantly break compatibility with Boost.Signals should be considered very carefully (even if Boost.Signals will stay on for a while), and if possible, counterbalanced by a compatibility layer put in to ease the transition for Boost.Signals users. ** Documentation ** Pretty much all reviewers noted the documentation as lacking with regard to thread-safety aspects of signals2 and other added functionality. Frank has clarified many of the questions that came up during the review, and outlined a plan of integrating the requested information into the documentation. Specific items are outlined in my notes at the end of this mail. ** Tests ** Some reviewers also noted a lack of tests for thread-related functionality. I agree that whatever can be reasonably tested should be tested. Frank has suggested he will try to adapt some of the Boost.Thread tests where adequate. As stated, the above issues should be addressed before moving the signals2 library to the boost trunk. I don't anticipate significant problems because: * the trackable interface has already been brought into signals2 at one point in the past * all documentation related questions have been clarified during the review, and Frank's suggestions for updating the documentation were agreeable * Boost.Thread tests should provide some insight into how signals2 thread-safety could be more thoroughly tested. Also, several reports have been made of signals2 already being successfully used in production settings, which speaks to its reliability. I strongly suggest that Frank make an announcement when the changes are completed, so that those interested can make sure that their concerns have been adequately addressed. Given Frank's record as a very responsive maintainer of this library in the past, and his commitment towards the peer-review process (he insisted on having this library reviewed even though it could have technically been included with Doug Gregor's approval as an upgrade to Boost.Signals), and considering that one of the reviewers has already offered to review changes to the library, I anticipate that a de facto mini-review of the library will happen at that point even though I am not requiring one formally. Finally, below are some notes on suggested changes I extracted while reading through all of the reviews. Square brackets contain initials of some of the reviewers that mentioned the issue, and double curly braces my personal comments. This is by no means a record of everything that has been mentioned, but perhaps the author will find it useful while making the post-review changes. To be clear, the below changes are not required for the inclusion of signals2 into the boost trunk, except as they pertain to the required changes outlined above. -- Implementation -- ---- * source code could be formatted more clearly [FA] * address efficiency problems where signals2 is significantly slower than signals [FA] {{ while efficiency is important, and ideally signals2 efficiency for single-threaded use cases converges to that of Boost.Signals, this is one area where improvements can painlessly continue to happen after the integration of signals2 into the trunk (as long as they don't require interface changes), so I don't consider this a priority at this point }} * clean macro names used with Boost.Preprocessor [VB] -- Interface -- ---- * portable syntax - either establish that the syntax works (and on what compilers) or consider deprecating [JW] * use Boost.Parameter for signal template parameters due to so the user doesn't have to specify default template parameters. [VB][FA] {{ if there are any arguments against changing the signal class template to use Boost.Parameter directly, you could still provide a metafunction that uses Boost.Parameter to provide the signal type. This would allow, e.g.: signal_type<void(int, int), mutex_type<signals2::mutex> >::type my_signal; }} * use template parameters such as single_threaded or multi_threaded instead of the mutex type. [vb] {{ it should be possible to allow the Mutex parameter to be either a mutex class or a special (or policy) type that maps to a particular mutex }} {{ this suggestion was given in conjunction to a proposal for allowing external locking mechanisms, but it seems like external locking should be possible with what the library already offers - perhaps an example of this would be useful }} -- Documentation -- * update code examples in tutorial to contain fixes already present in the package [JW] {{ if you aren't already, consider using the quickbook import facility to keep the compiled code snippets and docs in sync }} * FAQ should be mentioned earlier / information in the FAQ should be more visible [JW][VB] * while the Beginner/Intermediate/Advanced designations have been found useful [FA], the tutorial has also been found readable beginning to end without much use for the designations [JW] * clarify call ordering between grouped / ungrouped slots [JW] * clarify optional_last_value [JW] [AW] * clarify the way slot::track works [VB][JW] {{ the documentation says we "pass the shared_ptr to the slot via its slot::track method before connecting", but the clarification given to Jesse Williamson also explains that the *pointer* held by shared_ptr is passed to the slot_type constructor. This seems easy to trip over - some syntactic sugar that avoids using the shared_ptr twice in the expression in two different ways might be helpful }} * offer / point to some documentation on, and provide an example for postconstructible / predestructable / deconstruct_ptr. [FA][AW][VB][FF] * document / provide example for extended_slot_type [FA] [FF] * expand the documentation of various mutexes that can be used and their properties [VB] also in regards with co-use with Boost.Thread [FF] {{ I can find the mutexes explained in the reference documentation, but an overview at the tutorial level would be nice }} * expand discussion on thread-safety: ** how exactly is signals2 thread-safe? [JB][RR] ** explain behavior in various threading circumstances [JB] * mention the benefits of the new connection management based on shared_ptr over old trackable interface (e.g., allowing non-intrusive use with 3rd party classes) [FF] * consider making the portable syntax examples less prominent [FF] -- Testing -- * add multi-threading tests [JB] * include performance tests [VB] Again, thanks and congratulations to Frank Mori Hess, and thanks to all of the reviewers. Kind regards, Stjepan

5 5

Boost range changes [1.37.0]
by Tomas Puverle 20 Nov '08

20 Nov '08

I just upgraded from Boost 1.33.1 to 1.37.0 and have found a breaking change in Boost.Range. Previously, iterator_range::empty() would do the following: bool empty() const { if( singular ) return true; return m_Begin == m_End; } and similarly for size(). In the new release, instead of the test, there is an assertion, which is now breaking my code. Why (and when?) was this change introduced? This make Boost Range much in generic code, such as template<class Range> void foo(const Range & r_) { if (r_.empty()) {...} } The code is frequently called with containers and ranges and works beautifully. However, a common pattern is to call the function with a default constructed (empty range). This now crashes. The only way to test for validity AFAICS is to call is_singular(), unfortunately, this breaks when the function is called with containers. This, IMHO, was an unfortunate decision. Any suggestions anyone? Thanks, Tom

6 10

boost::function & threads
by James Sutherland 20 Nov '08

20 Nov '08

I just ran intel's thread checker on a code I am developing using boost::thread and boost::function. It issued some error notifications arising from "function_template.hpp" The following is for boost 1.36.0: Memory read at "function_template.hpp":770 conflicts with a prior memory write at "function_template.hpp":414 (flow dependence) Memory read at "function_template.hpp":288 conflicts with a prior memory write at "function_template.hpp":414 (flow dependence) Memory read at "function_template.hpp":289 conflicts with a prior memory write at "function_template.hpp":414 (flow dependence) I really don't understand the internals of boost::function, so I have no idea whether this is a legitimate error, or if intel's thread checker is confused... James

2 2

[asio] Can I call socket.close() in different thread?
by Wang Yun 20 Nov '08

20 Nov '08

Hi I use a thread pool to run one io_service instance, after a socket connected to a server, I want to call _socket.close() to close it. But I don't know how to do this in thread safe way. In the document, socket class is "Shared objects: Unsafe", becase I use thread pool, so I don't know which thread will call close on the socket. What should I do? Thanks, Wang Yun

1 0

[array] with variable size
by Hicham Mouline 20 Nov '08

20 Nov '08

Hello, I have a third-party library that gives me a number N of doubles, then expects from me a double* to an array where it will set N elements This would have happen many times and N is variable, so I wish not to reallocate the array each time. I know however N is maxed at some value Nmax like 50. I thought of using a array<double, Nmax> that would be allocated once, then perhaps have a wrapper around it so that only N elements of it can be accessed. This seems to be a usual idiom, are there ready implementations? Regards,

5 7

Re: [Boost-users] Boost range changes [1.37.0]
by Tomas Puverle 20 Nov '08

20 Nov '08

> template<class T> > bool is_singular_or_empty(const T& t) { return(t.empty()); } > template<class T> > bool is_singular_or_empty(const iterator_range<T>& t) { > return(t.is_singular() || t._empty()); } Hey Steven, That was my initial approach, too. >From a library designer point of view, the reason why I was reluctant about the above is that it breaks the range contract (begin, end, empty,...) and forces my users to be aware of the idiosyncrasies of a particular range implementation. >From an implementation point of view, unfortunately, you seem to have got caught out by the same problem as me - is_singular() is only useful in debug builds. It always returns false in release builds and hence the above won't work. Worse, it will break silently, as t.empty() will end up comparing invalid iterators in release. I am sure you can see how this would be very hard to find and debug. This also illustrates my other big issue with having functions which work differently in different builds. Kind regards, Tom

1 0

boost build
by df.trash 20 Nov '08

20 Nov '08

I want to build the Filesystem Library on Windows so that it statically links to my code at runtime. I use the following statement on the command line to invoke bjam: bjam release --with-filesystem --toolset=msvc-7.1 link=static This builds only 1 library: libboost_filesystem-vc80-mt-1_36.lib It does not build the System Library which Filesystem depends on. I'm very much new to the Boost paradigm. Why can I not build the System Library statically? Do I really need the System Library and its error handling features? Will the Filesystem Library need the System Library or is the System Library just an option to handle errors and not essential at runtime?

2 1

Big ints library?
by Lang Stefan 20 Nov '08

20 Nov '08

Hello, I was wondering whether there is a library for algorithms working on very big natural numbers, i. e. bigger than any available standard int type. Does the boost library have one? I did check the documentation, but if there is one I haven't looked in the right places. Thanks in advance, even if the answer is no! Stefan

2 1

multiply dynamic_bitset
by Markus Raab 20 Nov '08

20 Nov '08

How can I multiply two dynamic_bitset? Thank you Markus Raab

2 2

Too many (11053) warnings- lead to extremely slow compile times
by Raj Prasan 20 Nov '08

20 Nov '08

I get 11053 warnings after I have included boost serialization in my Mixed project - Native + Managed .NET code.. and the compile time has become 9.5 minutes after this. Previously it was I think 8-10 times faster... Warning level is set to 2 only. Default was 3 or 4.. I use VS 2008.. on WinXPsp2 *some example Warnings.* ===================== Warning 1 warning C4099: 'boost::static_warning_impl<false>::STATIC_WARNING' : type name first seen using 'struct' now seen using 'class' f:\GoodWorking\Boost\boost\serialization\export.hpp 135 Warning 3 warning C4835: 'boost::serialization::extended_type_info_typeid<BaseItem> `private: static boost::serialization::extended_type_info_typeid<BaseItem> & __cdecl boost::serialization::singleton<boost::serialization::extended_type_info_typeid<BaseItem> >::get_instance(void)'::`2'::t' : the initializer for exported data will not be run until managed code is first executed in the host assembly f:\GoodWorking\Boost\boost\serialization\singleton.hpp 104 *----------------------- > Warning 3 is shown for many other classes which extend BaseItem* <------------------- Warning 33 warning C4835: 'instance' : the initializer for exported data will not be run until managed code is first executed in the host assembly f:\Rajavanya\GoodWorking\Boost\boost\serialization\singleton.hpp 121 Warning 47 warning C4835: 'boost::archive::detail::pointer_oserializer<boost::archive::text_oarchive,BaseItem> `private: static boost::archive::detail::pointer_oserializer<boost::archive::text_oarchive,BaseItem> & __cdecl boost::serialization::singleton<boost::archive::detail::pointer_oserializer<boost::archive::text_oarchive,BaseItem> >::get_instance(void)'::`2'::t' : the initializer for exported data will not be run until managed code is first executed in the host assembly f:\GoodWorking\Boost\boost\serialization\singleton.hpp 104 Warning 9033 warning C4835: 'boost::serialization::extended_type_info_typeid<std::map<int,BaseItem *,std::less<int>,std::allocator<std::pair<int const ,BaseItem *> > > > `private: static boost::serialization::extended_type_info_typeid<std::map<int,BaseItem *,std::less<int>,std::allocator<std::pair<int const ,BaseItem *> > > > & __cdecl boost::serialization::singleton<boost::serialization::extended_type_info_typeid<std::map<int,BaseItem *,std::less<int>,std::allocator<std::pair<int const ,BaseItem *> > > > >::get_instance(void)'::`2'::t' : the initializer for exported data will not be run until managed code is first executed in the host assembly f:\GoodWorking\Boost\boost\serialization\singleton.hpp 104 Warning 9136 warning C4835: 'boost::archive::detail::pointer_iserializer<boost::archive::text_iarchive,RCadApp> `private: static boost::archive::detail::pointer_iserializer<boost::archive::text_iarchive,RCadApp> & __cdecl boost::serialization::singleton<boost::archive::detail::pointer_iserializer<boost::archive::text_iarchive,RCadApp> >::get_instance(void)'::`2'::t' : the initializer for exported data will not be run until managed code is first executed in the host assembly f:\GoodWorking\Boost\boost\serialization\singleton.hpp 104 Warning 11038 warning C4835: 'boost::archive::detail::oserializer<boost::archive::text_oarchive,std::pair<int const ,BaseItem *> > `private: static boost::archive::detail::oserializer<boost::archive::text_oarchive,std::pair<int const ,BaseItem *> > & __cdecl boost::serialization::singleton<boost::archive::detail::oserializer<boost::archive::text_oarchive,std::pair<int const ,BaseItem *> > >::get_instance(void)'::`2'::t' : the initializer for exported data will not be run until managed code is first executed in the host assembly f:\GoodWorking\Boost\boost\serialization\singleton.hpp 104 Warning 11052 warning C4835: 'boost::archive::detail::pointer_iserializer<boost::archive::text_iarchive,Vector> `private: static boost::archive::detail::pointer_iserializer<boost::archive::text_iarchive,Vector> & __cdecl boost::serialization::singleton<boost::archive::detail::pointer_iserializer<boost::archive::text_iarchive,Vector> >::get_instance(void)'::`2'::t' : the initializer for exported data will not be run until managed code is first executed in the host assembly f:\GoodWorking\Boost\boost\serialization\singleton.hpp 104 Please give me some suggestions please... -- With best Regards Rajavanya S Twitter me @ https://twitter.com/quakeboy I Blog @ http://www.techtola.com Call me @ 9916-90-93-92 ---------------------------------------------------------------------------------------------- "True love is knowing a person's faults, And loving them even more for them."

1 0

Re: [Boost-users] Boost range changes [1.37.0]
by Dave Handley 20 Nov '08

20 Nov '08

Please see comments inline: "Tomas Puverle" <Tomas.Puverle(a)morganstanley.com> wrote in message news:loom.20081120T001601-724@post.gmane.org... > Thorsten, > > Thanks for the reply. See comments inline. > >> The change has happened long ago. It was a design mistake to try to make >> a range of singular iterators valid since it adds overhead also for >> those that don't need it. > > When you say "overhead", are you speaking of size or speed? > Was this overhead demonstrated by some particular use case? > Does this mean you may be also removing the "singular" flag at some point? > Is there a supported way of constructing valid empty ranges? I can't see that > there's a way to do it. I'm also not sure about the overhead issue here. Checking a single bool inside size and/or empty strikes me as a trivial matter - no more complex than many things in the standard library or elsewhere in boost. <snip> > > IMHO, this is obfuscated. There is a difference between an empty range and a > range which is optional. In line with the std containers, I would argue that a > default constructed range should be empty. I have to agree with this premise. In line with a lot of proxy or container type objects I would expect a default constructed object to do something sensible. I wouldn't expect, for example, a boost.shared_ptr to default construct to an object that asserts when you check it for NULL. This change appears to be quite a severe change in functionality. <snip> > In any case, I've enjoyed using your library. I found it so useful I've built > four other libraries, which are mostly based on passing data around through > Boost.Ranges. I just wish that all of my code wasn't broken now that > I've upgraded. > This is a point on which I feel I have to amplify. I've been using Boost for quite a long time now, and been through numerous upgrades, many of which I've managed the upgrade at work. Breaking changes are always the thing that hurts the most during an upgrade. Especially now that boost has gone to an accelerated release cycle where we see such regular new releases. I'm sure that many users of Boost like myself don't get to upgrade to every release, so moving to a new release involves jumping through 2 or 3 releases. Breaking changes in this context are very painful. As a library writer myself, where I am forced to do a breaking change, I always try and make it something that will break on compile - otherwise my users cannot be confident in doing a library upgrade without a very extensive testing schedule - quite often this results in users simply not upgrading. With this particular change, I feel even more strongly. Assertions in library code can often be a bad thing. If the users of the library are not explicitly aware of a change that takes out a check and replaces it with an assertion, then you get applications which can either abort unexpectedly (if not built with NDEBUG) or worse still just do something different in a silent fail. This is just downright dangerous. Personally, I would strongly support backing out of a change like this. However, if Thorsten strongly disagrees, I would at least recommend as a compromise position to introduce a define along the lines of BOOST_NO_ASSERT (or maybe BOOST_RANGE_NO_ASSERT) that gets rid of the assertion and does something sensible instead. The only times I like to see assertions in libraries are: firstly, states which should be impossible to get into and are therefore testing for either corruption or a problem in the library; or secondly, occasions where you are going to crash anyway if you continue - for example if after the assertion you are about to dereference a NULL or uninitialised pointer. Things which are common states that systems using the library could get into should do something sensible - at worst throw an exception, and at best return a sensible answer. Please reconsider this change - I have yet to upgrade to 1.33.7 yet, and knowing this type of change is present there makes me highly reluctant to go ahead with an upgrade. I'm not sure (just covering the post from Steven) that going through an entire codebase and changing calls to empty with calls to a new template function "is_empty_or_singular" is really a palatable solution. Boost provides a fantastically useful set of libraries - they have certainly significantly changed the way I code in C++; but breaking changes should always be very carefully thought about, they have a nasty habit of leaving people isolated in old versions of boost, and also have a habit of driving people away from using boost. Regards Dave

1 0

non nullable smart pointers
by Brendan Miller 19 Nov '08

19 Nov '08

I've been interested in non nullable smart pointers for a while. I noticed a thread I wanted to check if anyone was still interested in doing it: http://lists.boost.org/Archives/boost/2008/04/135616.php This seems like a worthwhile activity. Null is a legacy element from C that essentially breaks type safety. C++ added references as a way of moving people away from null, but T& obj style references have a number of problems: 1. They have value semantics, which is just plain annoying considering they are *called* references. 2. They use obj.member notation instead of obj->member. 1 is just not usually desireable, and 2 means that there's no way to write a "smart reference" that uses ref.member notation. With that in mind what would a nonnullable pointer be named? I've seen one implemented as a "checked_ptr", but that's a mouthful and doesn't account for the fact that several variations on memory management scheme are needed. I'm thinking: ref<T> myObject; // for a non-nullable pointer with no special memeory management scoped_ref<T> myObject; // for scoped_ptr style memory mangement shared_ref<T> myObject; // you get the idea. I'm also aware of a number of problems with the shared_ptr implementation, specifically that it creates a second allocation for the counter (the counted body problem), and that it always does synchronization, which might have performance overhead for single threaded code (someone else might know more about that than me). It migth be nice to start fresh on these designs now that some perspective has been gained. For the counted body problem I was thinking of creating a make_shared_ref that would create an object and counter adjacent to each other (just put them in the same struct). I put together some proof of concept tempaltes a whie ago and having make_shared_ref<T> behave exactly like new T was somewhat problematic due to overloading issues. Also, you'd need to keep around an extra function pointer in the counter object to delete the struct all together or delete the object seperate object and counter (if they are non-adjacent) and I"m not sure about how that would stack up performance wise. Brendan

3 8

[serialization] dynamically allocated objects and reset_object_address
by Joaquin M Lopez Munoz 19 Nov '08

19 Nov '08

Hello, Consider a tracked type T which is only serialized through T pointers: under these circumnstances, when loading a T* Boost.Serialization automatically allocates a T object for the pointer to refer to. I've found out that these dynamically allocated objects cannot be moved by using reset_object_address: this member function simply ignores them. Would it be possible that reset_object_address also took care of these objects or is there any limitation I'm not aware of? FWIW, this is not an academic question but has raised in connection with some serialization code I'm writing. Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 4

date_time: offset warning
by Hicham Mouline 19 Nov '08

19 Nov '08

https://svn.boost.org/trac/boost/changeset/47957 I see that this was fixed 4months ago. It isn't fixed in 1.37 though... meaning offset is not commented out... Regards,

1 0

v_array survival
by Chaman Singh Verma 19 Nov '08

19 Nov '08

Hello, I have one old software which is using v_array, but I don't see v_array in the latest Boost distribution ? Is this class defunct now and should I replace it by vector or something else ? csv

2 3

[Regex]: Warnings for unicode regex includes
by Roland Bock 19 Nov '08

19 Nov '08

Hi, when compiling the following code <snip> #include <boost/regex.hpp> #include <boost/regex/icu.hpp> int main() { return 0; } </snip> with g++ -Wall -Wextra, a bunch of warnings are produced, see below. The first two seem trivial to solve, but I don't know about the third. Is there a workaround to get rid of the warnings (other than to turn of the -Wall and -Wextra) and/or should I file a bug report? System information: Ubuntu 8.04, 64bit gcc 4.2.4 boost 1.36 Regards, Roland PS: Here are the warnings I get: g++ -Wall -Wextra test.cpp -c -I ~/include/ In file included from /home/rbock/include/boost/regex/icu.hpp:1015, from test.cpp:2: /home/rbock/include/boost/regex/v4/u32regex_token_iterator.hpp:286: warning: unused parameter ‘submatch’ /home/rbock/include/boost/regex/v4/u32regex_token_iterator.hpp:348: warning: unused parameter ‘submatch’ /home/rbock/include/boost/regex/v4/perl_matcher.hpp: In function ‘bool boost::re_detail::can_start(charT, const unsigned char*, unsigned char) [with charT = unsigned int]’: /home/rbock/include/boost/regex/v4/perl_matcher_common.hpp:787: instantiated from ‘bool boost::re_detail::perl_matcher<BidiIterator, Allocator, traits>::find_restart_any() [with BidiIterator = boost::u16_to_u32_iterator<const UChar*, unsigned int>, Allocator = std::allocator<boost::sub_match<boost::u16_to_u32_iterator<const UChar*, unsigned int> > >, traits = boost::icu_regex_traits]’ /home/rbock/include/boost/regex/v4/perl_matcher_common.hpp:245: instantiated from ‘bool boost::re_detail::perl_matcher<BidiIterator, Allocator, traits>::find_imp() [with BidiIterator = boost::u16_to_u32_iterator<const UChar*, unsigned int>, Allocator = std::allocator<boost::sub_match<boost::u16_to_u32_iterator<const UChar*, unsigned int> > >, traits = boost::icu_regex_traits]’ /home/rbock/include/boost/regex/v4/perl_matcher_common.hpp:229: instantiated from ‘bool boost::re_detail::perl_matcher<BidiIterator, Allocator, traits>::find() [with BidiIterator = boost::u16_to_u32_iterator<const UChar*, unsigned int>, Allocator = std::allocator<boost::sub_match<boost::u16_to_u32_iterator<const UChar*, unsigned int> > >, traits = boost::icu_regex_traits]’ /home/rbock/include/boost/regex/v4/regex_search.hpp:56: instantiated from ‘bool boost::regex_search(BidiIterator, BidiIterator, boost::match_results<BidiIterator, Allocator>&, const boost::basic_regex<charT, traits>&, boost::regex_constants::match_flag_type, BidiIterator) [with BidiIterator = boost::u16_to_u32_iterator<const UChar*, unsigned int>, Allocator = std::allocator<boost::sub_match<boost::u16_to_u32_iterator<const UChar*, unsigned int> > >, charT = int, traits = boost::icu_regex_traits]’ /home/rbock/include/boost/regex/v4/regex_iterator.hpp:75: instantiated from ‘bool boost::regex_iterator_implementation<BidirectionalIterator, charT, traits>::next() [with BidirectionalIterator = boost::u16_to_u32_iterator<const UChar*, unsigned int>, charT = int, traits = boost::icu_regex_traits]’ /home/rbock/include/boost/regex/v4/regex_iterator.hpp:142: instantiated from ‘boost::regex_iterator<BidirectionalIterator, charT, traits>& boost::regex_iterator<BidirectionalIterator, charT, traits>::operator++() [with BidirectionalIterator = boost::u16_to_u32_iterator<const UChar*, unsigned int>, charT = int, traits = boost::icu_regex_traits]’ /home/rbock/include/boost/regex/icu.hpp:847: instantiated from ‘OutputIterator boost::re_detail::do_regex_replace(OutputIterator, const std::pair<I1, I1>&, const boost::u32regex&, const std::pair<I2, I2>&, boost::regex_constants::match_flag_type) [with OutputIterator = boost::utf16_output_iterator<boost::re_detail::unicode_string_out_iterator>, I1 = boost::u16_to_u32_iterator<const UChar*, unsigned int>, I2 = boost::u16_to_u32_iterator<const UChar*, unsigned int>]’ /home/rbock/include/boost/regex/icu.hpp:1008: instantiated from here /home/rbock/include/boost/regex/v4/perl_matcher.hpp:46: warning: comparison of unsigned expression < 0 is always false

2 3

Remind me
by Dominik Steenken 19 Nov '08

19 Nov '08

Hi, i am currently trying to implement something very simple: i have some network code (using boost/asio) which waits for data on a tcp connection (tcp::socket). Now i want this waiting operation to have a timeout. I did not find timeout capability in boost/asio so i tried to implement a timer class using boost/thread. Now there are two problems: a) the boost::thread object representing the thread that should be interrupted after a given time is not necessarily available. i looked at the namespace this_thread but found no possibility to gain access to a reference to the current thread. b) the interrupt() method only works when the interrupted thread is at one of the predefined interruption points. In my example however, that thread is held up in a boost/asio method. I suppose i could resolve b) by using asynchronous receives but that would take some serious restructuring and problem a) would still remain. What i really want is just a timeout version of the synchronous receive in boost/asio. Any ideas? Dominik

3 4

Re: [Boost-users] timeconv.inl
by Dan Smithers 19 Nov '08

19 Nov '08

> Date: Mon, 17 Nov 2008 09:10:46 +0100 > From: Daniel Kr?gler <dsp(a)bdal.de> > Subject: Re: [Boost-users] timeconv.inl > To: boost-users(a)lists.boost.org > Message-ID: <gfr8u6$vgg$1(a)ger.gmane.org> > Content-Type: text/plain; charset=ISO-8859-1; format=flowed > > Dan Smithers wrote: >> > I am porting some inherited code to MSVS 2008 >> > This is also bringing along an upgrade from boost 1.32 to a newer >> > version (probably 1.37). >> > >> > I have found a thread wrapper class in the code that uses time_to >> > directly. This is defined in lib/thread/src/timeconv.inl and doesn't >> > look like its meant to be used directly. > > I agree with the last assertion. I'm not sure that I correctly > understand with "I have found a thread wrapper class in the code that > uses time_to directly"?! In which code or in which wrapper class? In the inherited code. > >> > The original code base has timeconv.inl in the boost include directory. >> > >> > Was timeconv.inl moved at some point in the past? >> > >> > Is this as bad as I think it is? > > I don't see the (bad) point - timeconv.inl was already part of > the implementation of boost 1.32, so it's existence or it's precise > location shouldn't influence your code [Note that the helper functions > are simply wrapped into an unnamed namespace w/o further surrounding > namespace]. > > It's now located in duplicated form in lib/thread/src/win32 > and lib/thread/src/pthread. Whether this is intended, I don't know, > but it also shouldn't harm. Thanks, I looked around a bit more, and found that the example code used the same code as in timeconv and that I was making exactly the same set of calls to achieve the same result. It just doesn't seem right to be including directly from the src directory. In the code base I have inherited, timeconv.inl is in the include directory and appears to be for public use.

1 0

Re: [Boost-users] rint, the interval library and Visual Studio 2008
by Stephan Puchegger 19 Nov '08

19 Nov '08

> #if BOOST_MSVC < 1400 > extern "C" { double rint(double); } > #else > inline double rint(double x) > { > _asm FLD [x] ; > _asm FRNDINT ; > //_asm RET ; > } > #endif > > In msvc_rounding_control.hpp. > > HTH, John. Thanks John, that helped a lot and is by far more elegant than my solution (simply add a rint implementation to my project). Perhaps your solution should be included in the next boost version. Best regards & thanks Stephan

1 0

[threads] contention for MSCRT's_pRawDllMain hook in static library
by Evan Burkitt 19 Nov '08

19 Nov '08

I'm using VS2005 to compile a DLL that links with the MFC DLL and also the static Boost threads library. I've upgraded from Boost v1.34.1 to v1.37 and now the threads library's use of MSCRT's _pRawDllMain hook interferes with MFC's use of the hook to point to its _RawDllMain export. I've come up with a workaround of a library that exports _pRawDllMain and links to _RawDllMain in the MFC DLL and an export I've added to the threads library that calls its dll_callback() function. I just can't get the MS linker to cooperate. If I put my library ahead of the threads library in the command line the linker complains of a multiply-defined symbol. If I put the threads library ahead of my library the linker uses the threads library _pRawDllMain export and ignores mine. Only if I remove the _pRawDllMain export from the threads library entirely does the linker use mine. I would like to leave the _pRawDllMain export in the threads library so that it will still work in my library's absence but I can't figure out what makes it so attractive to the linker. I realize this isn't, strictly speaking, a Boost issue, but the problem arose because of a change to Boost and I know there are a lot of smart people here. :)> -evan

2 2

Shortest path feasibility code
by paul 19 Nov '08

19 Nov '08

Hi, Is there any public domain code that implements shortest path feasibility or negative cycle detection? Thanks, Paul

4 3

Cross platform library for reading/writing configuration files?
by Jeff Dunlap 19 Nov '08

19 Nov '08

I've used Windows specific functions for reading/writing configuration (INI) files in my application and would like to know if there is a cross platform library available that is recommended. I searched the boost libs for something and there are libs of course that can achieve this with some programming, but I'd like to know if there is something (boost or other library) with specific functionality to handle reading/writing INI files. Example: [General] Language=Français [Strings] String00001=Version String00002=Etes vous sûr ? String00003=Voulez-vous continuer ? Thank you very much

8 8

Re: [Boost-users] [iostreams?] Working with files larger than
by Ioannis Mademlis 18 Nov '08

18 Nov '08

Raindog wrote: > To my surprise, the implementation of the STL shipped with VC9 does not > support files larger than 4GB. I was pretty surprised and couldn't find > anything on the web to the contrary. So I was wondering if boost has any > hidden libraries that might assist in solving my problem. > > Thanks. If you are interested in manipulating really big files maybe you will find the hdf5 library handy. http://www.hdfgroup.org/HDF5/ For a short introduction http://www.hdfgroup.org/HDF5/doc/TechNotes/BigDataSmMach.html Cheers Ioannis

1 0

Writing dicom images
by David J. Paribello 18 Nov '08

18 Nov '08

Hello, I am new to Boost. I work in the medical imaging field and am looking for a set of functions and/or libraries in c++ that can be used to write raw (pixel) data to dicom images. I am also fairly new to c++ as well as dicom images. Is there a separate dicom header library? I have implemented much of what I need to do in Matlab using dicomwrite and want to mimic that function in c++. Does something similar to that exist? Thanks David ------------------------------- David Paribello - B. Eng., M. Eng. Robarts Research Institute Imaging Research Laboratories

4 3

[iostreams?] Working with files larger than 4gb.
by Raindog 18 Nov '08

18 Nov '08

To my surprise, the implementation of the STL shipped with VC9 does not support files larger than 4GB. I was pretty surprised and couldn't find anything on the web to the contrary. So I was wondering if boost has any hidden libraries that might assist in solving my problem. Thanks.

3 3

[asio]Can I call socket.close() in different thread?
by Wang Yun 18 Nov '08

18 Nov '08

Hi I use a thread pool to run one io_service instance, after a socket connected to a server, I want to call _socket.close() to close it. But I don't know how to do this in thread safe way. In the document, socket class is "Shared objects: Unsafe", becase I use thread pool, so I don't know which thread will call close on the socket. What should I do? Thanks, Wang Yun

1 0

[BGL] boost::detail::error_property_not_found issue
by M. Siebeneicher 18 Nov '08

18 Nov '08

Hi boost users, at first some pieces of code: class EdgeProperties { public: cPose m_pose; PosePrecision m_precisionPose; }; class VertexContainer { public: VertexID m_idVertex; //!< ID of the container VertexID m_idParent; //!< ID of the parent container unsigned int m_nDepth; //!< Depth of vertex in the tree }; typedef adjacency_list< vecS , vecS , bidirectionalS , VertexContainer , EdgeProperties > BGLGraph; void traverse(BGLGraph& graphIn, const IDMapper& idMapperIn) { // Get the index map typedef property_map<BGLGraph, VertexID VertexContainer::*>::type IndexMap; IndexMap im = get(&VertexContainer::m_idVertex, graphIn); // The source vertex BGLVertexDescriptor startDescriptor; idMapperIn.mapIDs(this->getStartID(), startDescriptor); std::vector<BGLVertexDescriptor> p(num_vertices(graphIn)); p[get(im, startDescriptor)] = startDescriptor; //p[startDescriptor] = startDescriptor; breadth_first_search( graphIn , startDescriptor , vertex_index_map(im).visitor(make_bfs_visitor(record_predecessors(&p[0], boost::on_tree_edge()))) ); . . . } Compiling my whole code that contains the above one gives me the following error/warning: ----------------------------------------------------------------------------------------------------------- ph_visitor_t,boost::bgl_named_params<IndexMap,boost::vertex_index_t,boost::no_property>::self>,boost::graph_visitor_t>::type>::result<boost::bfs_visitor<>>::type ] d:\FAS_SIM\SDKs\boost_1_35_0\boost\graph\breadth_first_search.hpp(256): Siehe Verweis auf Instanziierung der kompilierten Funktionsvorlage 'void boost::detail::bfs_dispatch<boost::detail::error_property_not_found>::apply<VertexListGraph,boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self>(VertexListGraph &,boost::graph_traits<G>::vertex_descriptor,const boost::bgl_named_params<boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self> &,boost::detail::error_property_not_found)' with [ VertexListGraph=de::audi::scenetree::BGLGraph, Visitors=boost::predecessor_recorder<std::allocator<std::_Vbase>::value_type *__w64 ,boost::on_tree_edge>, T=IndexMap, Tag=boost::vertex_index_t, Base=boost::no_property, G=de::audi::scenetree::BGLGraph ] d:\Sources\SceneTreeLib\test_src\de\audi\scenetree\visitor\DepthTestVisitor.cpp(48): Siehe Verweis auf Instanziierung der kompilierten Funktionsvorlage 'void boost::breadth_first_search<de::audi::scenetree::BGLGraph,boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self>(const VertexListGraph &,boost::graph_traits<G>::vertex_descriptor,const boost::bgl_named_params<boost::bfs_visitor<Visitors>,boost::graph_visitor_t,boost::bgl_named_params<T,Tag,Base>::self> &)' with [ Visitors=boost::predecessor_recorder<std::allocator<std::_Vbase>::value_type *__w64 ,boost::on_tree_edge>, T=IndexMap, Tag=boost::vertex_index_t, Base=boost::no_property, VertexListGraph=de::audi::scenetree::BGLGraph, G=de::audi::scenetree::BGLGraph ] ----------------------------------------------------------------------------------------------------------- Does anybody know what this means? greetz, Manuel -- Der GMX SmartSurfer hilft bis zu 70% Ihrer Onlinekosten zu sparen! Ideal für Modem und ISDN: http://www.gmx.net/de/go/smartsurfer

3 2

Building sandbox library (chrono)
by Niklas Angare 18 Nov '08

18 Nov '08

I can't figure out how to build chrono. Here's what I did: svn co http://svn.boost.org/svn/boost/trunk boost svn co -N http://svn.boost.org/svn/boost/sandbox boost-sandbox svn co http://svn.boost.org/svn/boost/sandbox/chrono boost-sandbox/chrono cd boost ./configure cd ../boost-sandbox/chrono/libs/chrono/test ../../../../../boost/tools/jam/src/bin.qnxntox86/bjam I get: error: Could not find parent for project at '../../../..' error: Did not find Jamfile.jam or Jamroot.jam in any parent directory. I have no clue how to create a Jamroot.jam if that's what I need to do. -- Regards Niklas Angare

1 0

vsprints in boost
by Simon Pickles 18 Nov '08

18 Nov '08

A simple question... Does boost offer a version of vsprintf? Simon

2 2

Re: [Boost-users] Speed up bjam
by Simon Pickles 18 Nov '08

18 Nov '08

Is there a quicker alternative? Trouble is I've only just got to grips with jam files! ------------------------------------------------------------------------ Seconded. I once tried using bjam to build on an even slower machine, and never tried it again. > > ------------------------------------------------------------------------ > > Subject: > Speed up bjam > From: > Simon Pickles <sipickles(a)hotmail.com> > Date: > Tue, 18 Nov 2008 13:35:03 +0000 > To: > boost-users(a)lists.boost.org > > To: > boost-users(a)lists.boost.org > > > Hi, > > Is there any way to make bjam only scan files for changes in the > current working directory, rather than the whole boost installation? I > hoped this would speed up the bjam build process. Everytime I do a > build I get, for example: > > ...patience... > ...patience... > ...found 2982 targets... > ...updating 6 targets... > > Wouldn't be quicker if it wasn't checking 3000 files each build? its a > very slow machine you see! 900 MHZ! > > Thanks > > Simon >

2 1

[Boost Graph Library] Example fails with dynamic allocated array?
by r89 18 Nov '08

18 Nov '08

Hi all, The following code is from http://www.boost.org/doc/libs/1_37_0/libs/graph/example/dijkstra-example.cpp and it works fine on my computer. However, if I change int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1, 1 }; to int *weights = new int[9]; and, similarly, change the edge_array to Edge *edge_array = new Edge[9]; (followed by assigning the weights and edges of course), then the results are different than the original code. Can anyone see why they are different? The reason I need to dynamically allocate, is because I don't know the number of nodes and edges at compile time. Please provide suggestions, thanks a lot! (Code below comes from http://www.boost.org/doc/libs/1_37_0/libs/graph/example/dijkstra-example.cpp) typedef adjacency_list < listS, vecS, directedS, no_property, property < edge_weight_t, int > > graph_t; typedef graph_traits < graph_t >::vertex_descriptor vertex_descriptor; typedef graph_traits < graph_t >::edge_descriptor edge_descriptor; typedef std::pair<int, int> Edge; const int num_nodes = 5; enum nodes { A, B, C, D, E }; char name[] = "ABCDE"; Edge edge_array[] = { Edge(A, C), Edge(B, B), Edge(B, D), Edge(B, E), Edge(C, B), Edge(C, D), Edge(D, E), Edge(E, A), Edge(E, B) }; int weights[] = { 1, 2, 1, 2, 7, 3, 1, 1, 1 }; int num_arcs = sizeof(edge_array) / sizeof(Edge); graph_t g(edge_array, edge_array + num_arcs, weights, num_nodes); property_map<graph_t, edge_weight_t>::type weightmap = get(edge_weight, g); std::vector<vertex_descriptor> p(num_vertices(g)); std::vector<int> d(num_vertices(g)); vertex_descriptor s = vertex(A, g); dijkstra_shortest_paths(g, s, predecessor_map(&p[0]).distance_map(&d[0])); -- View this message in context: http://www.nabble.com/-Boost-Graph-Library--Example-fails-with-dynamic-allo… Sent from the Boost - Users mailing list archive at Nabble.com.

3 2

Up-casting shared_ptr
by david.weber＠l-3com.com 18 Nov '08

18 Nov '08

We're using smart pointers, and due to the way that they are created, we wish to hide the functionality behind a static create() function for each class. That way, the callers only need call create() and they have a smart_pointer to a new object, without having to worry too much about implementation details. So, this has been working fine, until I tried doing some polymorphism. Basically, we have a smart pointer to a base class, where the derived class is chosen at run time, (based on what the caller wants to do). The base class is pure virtual, so we don't know, (or care to know) how the child class implements its functionality. The following code illustrates what I'm trying to do: #include <iostream> #include <boost/shared_ptr.hpp> // Base class class base { public: typedef boost::shared_ptr<base> SharedPtr; ~base(){}; virtual void foo(){ std::cout << "base" << std::endl;}; static SharedPtr create(){ return SharedPtr(new base); }; protected: base(){}; }; // Derived class class d1 : base { public: typedef boost::shared_ptr<d1> SharedPtr; ~d1(){}; void foo() {std::cout << "derived 1" << std::endl;}; static SharedPtr create() { return SharedPtr(new d1); }; protected: d1(){}; }; int main() { base::SharedPtr bsp; d1::SharedPtr d1sp = d1::create(); d1sp->foo(); // This is producing the error. I want to upcast my d1::SharedPtr to a // base::SharedPtr, so that it can be stored, and the reference count // is still intact bsp = boost::static_pointer_cast<base>(d1sp); } And here is the error that I'm getting (from Visual Studio 2003) c:\Program Files\boost\boost_1_35_0\boost\shared_ptr.hpp(222) : error C2243: 'static_cast' : conversion from 'd1 *const' to 'boost::shared_ptr<T>::element_type * with [T=base]' exists, but is inaccessible; c:\Program Files\boost\boost_1_35_0\boost\shared_ptr.hpp(513) : see reference to function template instantiation 'boost::shared_ptr<T>::shared_ptr<d1>(const boost::shared_ptr<d1> &,boost::detail::static_cast_tag) with [T=base]' being compiled; c:\Documents and Settings\td26134\Desktop\trunk1\main.cpp(54) : see reference to function template instantiation 'boost::shared_ptr<T> boost::static_pointer_cast<base,d1>(const boost::shared_ptr<d1> &) with [T=base]' being compiled Thanks.. --dw

2 2

[spirit2] Trivial parser crashes
by sm4 18 Nov '08

18 Nov '08

Hello, Playing with spirit-2 (boost 1.36 release) I got the following code to ASSERT when compiled on Visual Studio 2008/SP1. Any ideas what's wrong? ---------------------------------------------------------- #include #include #include #include #include #include #include #include #include using namespace boost::spirit; using namespace boost::spirit::qi; using namespace boost::spirit::ascii; using namespace boost::spirit::arg_names; namespace phoenix = boost::phoenix; using phoenix::at_c; struct key_val { std::string key; std::string value; }; BOOST_FUSION_ADAPT_STRUCT( key_val, (std::string, key) (std::string, value) ) template struct my_grammar : grammar { my_grammar() : my_grammar::base_type(start) { quoted_string %= lexeme['"' >> +(char_ - '"') >> '"']; key %= quoted_string; value %= quoted_string; start = key [at_c<0>(_val) = _1] >> ':' >> value [at_c<1>(_val) = _1] ; } rule key; rule quoted_string; rule value; rule start; }; int main() { typedef std::string::const_iterator citerator; std::string str = "\"x\": \"25\" "; citerator iter = str.begin(); citerator end = str.end(); my_grammar my_parser; key_val kv; phrase_parse(iter, end, my_parser, kv, space); // ASSERTs return 0; } -------------------------------------------------------------------------- thanks -- View this message in context: http://www.nabble.com/-spirit2--Trivial-parser-crashes-tp19624910p19624910.… Sent from the Boost - Users mailing list archive at Nabble.com.

5 9

rint, the interval library and Visual Studio 2008
by Stephan Puchegger 18 Nov '08

18 Nov '08

Dear group members! I am currently using the interval library and the following linker errors pop up: error LNK2028: unresolved token (0A000596) "extern "C" double __cdecl rint(double)" (?rint@@$$J0YANN@Z) referenced in function "public: static double __cdecl boost::numeric::interval_lib::detail::x86_rounding::to_int(double const &)" (?to_int@x86_rounding@detail@interval_lib@numeric@boost@@$$FSANABN@Z) Internal.obj Docs.Evaluation error LNK2019: unresolved external symbol "extern "C" double __cdecl rint(double)" (?rint@@$$J0YANN@Z) referenced in function "public: static double __cdecl boost::numeric::interval_lib::detail::x86_rounding::to_int(double const &)" (?to_int@x86_rounding@detail@interval_lib@numeric@boost@@$$FSANABN@Z) Internal.obj Docs.Evaluation rint does not show up in the MSDN documentation. This seems to be another example of Microsofts C99 compliance problems if I am not mistaken. I found a bug in the bug-database (#446: Bugs: MSVC support (closed: Wont Fix)) but when I try to view the bugreport all I get is a "Trac detected an internal error: TypeError: a float is required". Guillaume Melquiond seems to have posted a workaround in https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1246358&group_… but I cannot view this either, because this artifact is private and can be viewed only be groupmembers of a certain group (no idea which one). Would it not be a solution to simply add an rint implementation to the interval library? Best regards Stephan -- Stephan Puchegger Dynamics of Condensed Systems Faculty of Physics University of Vienna Strudlhofgasse 4, A-1090 Vienna Tel: ++43 (0) 1 4277 51352 Email: stephan.puchegger(a)univie.ac.at

2 1

Re: [Boost-users] Problem compiling with CodeGear Borland 2007
by Philip Ogunbona 18 Nov '08

18 Nov '08

Thanks to David (siliconman) and Nicola Musatti. Your posts are very helpful in understanding and resolving the problem. bcbboost is a great site, well done Nicola. Regards, Philip Ogunbona

1 0

Speed up bjam
by Simon Pickles 18 Nov '08

18 Nov '08

Hi, Is there any way to make bjam only scan files for changes in the current working directory, rather than the whole boost installation? I hoped this would speed up the bjam build process. Everytime I do a build I get, for example: ...patience... ...patience... ...found 2982 targets... ...updating 6 targets... Wouldn't be quicker if it wasn't checking 3000 files each build? its a very slow machine you see! 900 MHZ! Thanks Simon -- Linux Counter: User# 424693 -- Linux Counter: User# 424693

2 1

[Program Options] Multi-char option alias
by Uli Köhler 18 Nov '08

18 Nov '08

Hi everyone, is there a way to declare an alias for an options with more than one character, for example: options_description desc("Allowed options") desc.addOptions() ("disable-header,dh", "Disable") ; I'm using Boost 1.37.0 on Linux x64 and when I try to run the program it displays: "-d [ --disable-header ] Disable" The character 'd' is otherwise used (and 'h' is also not available) Do you know how to tell program_options to use a multi-character alias? Thanks in advance

1 0

Two issues - An error I think due to some invalid pointer and another speed problem.
by Raj Prasan 18 Nov '08

18 Nov '08

this is my second post. first I had a problem of a crash during startup and later changed my entry point and solved it. I got help from this list. Thanks a lot for that again.. This time I need some ways to debug it. Or a direct solution if possible. Please help this n00b folks. Scenario.. A AutoCAD like program. OpengL based.. Windows XP SP2 Code : C++ Mixed (native + managed.NET) /w CLR VS 2008, no MFC My code is pretty complex with a lot of classes, STL lists, maps pointers of the same objects in lists in different places. Issue 1 Moreover after adding the serialization library, the compile time has heavily increased. And the full system slows down. When compiling the task manager shows around 500 mb usage for the compilation process. I had a really lot of warning generated.. I mean more than 300 maybe or more. So I just disabled them in the settings. Compile Time - 7 mins 44 secs Link Time - 1 min 30 secs Total - 9 mins 14 secs Code is hardly 6000 to 10000 lines.. Can anyone guide me or give me links to articles that can help me.. Issue 2 Later I had this SEHException.. then I had to add try catch and found it raised unregistered class exception, so I fixed it adding BOOST_CLASS_EXPORT() below each class declaration... I still had some problems of redefinition, so I simply removed serialization from some classes and fixed that. Later I got some void cast exception, I still commented some more serialization code. Now It runs fine and gets me an file when I serialize immediately after initialization. After that when I create some lines/circles etc, and then serialize It gives me another error... BREAKS at xtree header - Call Stack > New Rapid Vision.exe!std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::_Orphan_ptr(std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> > & _Cont={...}, std::_Tree_nod<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::_Node * _Ptr=0x00000000) Line 1376 + 0x5 bytes C++ New Rapid Vision.exe!std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::clear() Line 971 C++ New Rapid Vision.exe!std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::erase(std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::const_iterator _First={address=0x0578d980 class_id={...} object_id={...} }, std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::const_iterator _Last={address=0xcdcdcdcd class_id={...} object_id={...} }) Line 938 C++ New Rapid Vision.exe!std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::_Tidy() Line 1421 + 0x77 bytes C++ New Rapid Vision.exe!std::_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >::~_Tree<std::_Tset_traits<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject>,0> >() Line 541 C++ New Rapid Vision.exe!std::set<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject> >::~set<boost::archive::detail::basic_oarchive_impl::aobject,std::less<boost::archive::detail::basic_oarchive_impl::aobject>,std::allocator<boost::archive::detail::basic_oarchive_impl::aobject> >() + 0xf bytes C++ New Rapid Vision.exe!boost::archive::detail::basic_oarchive_impl::~basic_oarchive_impl() + 0x59 bytes C++ New Rapid Vision.exe!boost::archive::detail::basic_oarchive_impl::`scalar deleting destructor'() + 0xf bytes C++ New Rapid Vision.exe!boost::archive::detail::basic_oarchive::~basic_oarchive() Line 407 + 0x1f bytes C++ [Managed to Native Transition] New Rapid Vision.exe!<Module>.boost.archive.detail.common_oarchive<boost::archive::text_oarchive>.{dtor}() + 0x18 bytes New Rapid Vision.exe!boost::archive::basic_text_oarchive<boost::archive::text_oarchive>::~basic_text_oarchive<boost::archive::text_oarchive>() Line 126 + 0xe bytes C++ New Rapid Vision.exe!boost::archive::text_oarchive_impl<boost::archive::text_oarchive>::~text_oarchive_impl<boost::archive::text_oarchive>() Line 71 + 0x12 bytes C++ New Rapid Vision.exe!boost::archive::text_oarchive::~text_oarchive() Line 88 + 0xe bytes C++ New Rapid Vision.exe!RCadApp::savetofile() Line 210 + 0x9 bytes C++ New Rapid Vision.exe!RCadApp::changeHandler(RCadApp::HANDLERLIST = 3) Line 661 C++ New Rapid Vision.exe!ToolStripButtonSettings::DrawTools(System::Object^ o = 0x021d29e8, System::Windows::Forms::MouseEventArgs^ e = 0x02279a28) Line 258 C++ System.Windows.Forms.dll!System.Windows.Forms.ToolStripItem.RaiseMouseEvent(object key, System.Windows.Forms.MouseEventArgs e) + 0x4a bytes System.Windows.Forms.dll!System.Windows.Forms.ToolStripItem.HandleMouseDown(System.Windows.Forms.MouseEventArgs e) + 0xbb bytes System.Windows.Forms.dll!System.Windows.Forms.ToolStripItem.FireEventInteractive(System.EventArgs e, System.Windows.Forms.ToolStripItemEventType met) + 0x9e bytes System.Windows.Forms.dll!System.Windows.Forms.ToolStripItem.FireEvent(System.EventArgs e, System.Windows.Forms.ToolStripItemEventType met) + 0x122 bytes System.Windows.Forms.dll!System.Windows.Forms.ToolStrip.OnMouseDown(System.Windows.Forms.MouseEventArgs mea) + 0x111 bytes System.Windows.Forms.dll!System.Windows.Forms.Control.WmMouseDown(ref System.Windows.Forms.Message m, System.Windows.Forms.MouseButtons button, int clicks) + 0xf1 bytes System.Windows.Forms.dll!System.Windows.Forms.Control.WndProc(ref System.Windows.Forms.Message m) + 0x4d3 bytes System.Windows.Forms.dll!System.Windows.Forms.ScrollableControl.WndProc(ref System.Windows.Forms.Message m) + 0x45 bytes System.Windows.Forms.dll!System.Windows.Forms.ToolStrip.WndProc(ref System.Windows.Forms.Message m = {msg=0x203 (WM_LBUTTONDBLCLK) hwnd=0x170362 wparam=0x1 lparam=0x4c000a result=0x0}) + 0x71 bytes System.Windows.Forms.dll!System.Windows.Forms.Control.ControlNativeWindow.OnMessage(ref System.Windows.Forms.Message m) + 0xd bytes System.Windows.Forms.dll!System.Windows.Forms.Control.ControlNativeWindow.WndProc(ref System.Windows.Forms.Message m) + 0x36 bytes System.Windows.Forms.dll!System.Windows.Forms.NativeWindow.DebuggableCallback(System.IntPtr hWnd, int msg = 515, System.IntPtr wparam, System.IntPtr lparam) + 0x57 bytes [Native to Managed Transition] user32.dll!7e418734() [Frames below may be incorrect and/or missing, no symbols loaded for user32.dll] user32.dll!7e418816() user32.dll!7e4189cd() [Managed to Native Transition] System.Windows.Forms.dll!System.Windows.Forms.Application.ComponentManager.System.Windows.Forms.UnsafeNativeMethods.IMsoComponentManager.FPushMessageLoop(int dwComponentID, int reason = -1, int pvLoopData = 0) + 0x2f1 bytes System.Windows.Forms.dll!System.Windows.Forms.Application.ThreadContext.RunMessageLoopInner(int reason = -1, System.Windows.Forms.ApplicationContext context = {System.Windows.Forms.ApplicationContext}) + 0x17d bytes System.Windows.Forms.dll!System.Windows.Forms.Application.ThreadContext.RunMessageLoop(int reason, System.Windows.Forms.ApplicationContext context) + 0x53 bytes System.Windows.Forms.dll!System.Windows.Forms.Application.Run(System.Windows.Forms.Form mainForm) + 0x2e bytes New Rapid Vision.exe!main(array<System::String^> ^ args = {Length=0}) Line 18 C++ New Rapid Vision.exe!mainCRTStartupStrArray(array<System::String^> ^ arguments = {Length=0}) Line 309 + 0x9 bytes C++ mscoree.dll!7900b1b3() kernel32.dll!7c816fd7() -- With best Regards Quakeboy

1 0

Problem compiling with CodeGear Borland 2007
by Philip Ogunbona 18 Nov '08

18 Nov '08

Dear Boost users: I have been successful in using boost under gcc 4.3. (running Linux FC9). I wanted to try compiling under Windows environment - Borland C++ 2007. A simple program using "boost/numerics/ublas/vector.hpp" will not compile. I got errors like: [BCC32 Error] is_reference.hpp(46) E2135 Reference cannot be declared 'const' or 'volatile' etc. I have looked at the header file "is_reference.hpp" to see if I could make something out of the line 46. It turns to be a "workaround" for BORLAND compiler. There is a comment to the effect "theses are illegal specializations: cv-qualifies applied to references have no effect according to [8.3.2p1], C++ Builder requires them though it treats cv-qualified reference as distinct types ..." I would like to know if any has been successful in using Borland compiler with boost library based codes. Regards, Philip Ogunbona

3 2

thread linking strangeness
by James Sutherland 18 Nov '08

18 Nov '08

I am observing strange things while linking boost::thread on a linux system with gcc 3.4.6. If I link an app with -L[path to boost.thread] -lboost_thread-gcc34-mt then it links fine. If I link with [path to boost.thread]/libboost_thread-gcc34-mt-1_36.a then I get linker errors with unresolved externals to things like: pthread_mutexattr_init pthread_detach pthread_getspecific I suspect it has to do with dynamic vs. static libraries. I have two flavors built: libboost_thread-gcc34-mt-1_36.so.1.36.0 libboost_signals-gcc34-mt-1_36.a So I suspect that in the first case I am getting a dll while in the second case the static link fails for some reason. Any suggestions/ tips to get the static link to work?

2 1

Boost Serialization with Template classes
by A L 18 Nov '08

18 Nov '08

Hi I'd like to ask how can I get my template classes to work with boost class versioning? Since BOOST_CLASS_VERSION does not work for template classes. thanks Al

1 0

[BGL] Edmund Karps works with long, but does not with doubles
by Matthias Teich 17 Nov '08

17 Nov '08

Hello, I have some problems with the max-flow algorithms in the boost graph library. The only algorithm that worked for me was edmund karps, but only when I use long or int values as edge capacities. Here is my graph: typedef adjacency_list<listS, vecS, bidirectionalS, Node, Edge> Graph; typedef graph_traits<Graph> Traits; typedef Traits::vertex_iterator vertex_iter; typedef graph_traits<Graph>::edge_iterator edge_iter; typedef property_map<Graph, default_color_type Node::*>::type ColorMap; typedef property_map<Graph, int Edge::*>::type CapacityMap; typedef property_map<Graph, Graph::edge_descriptor Edge::*>::type ReverseEdgeMap; typedef property_map<Graph, Graph::edge_descriptor Node::*>::type PredecessorMap; typedef property_map<Graph, CapacityMap::value_type Node::*>::type DistanceMap; typedef property_map<Graph, long Node::*>::type IndexMap; struct Edge { CapacityMap::value_type capacity; CapacityMap::value_type residual_capacity; Graph::edge_descriptor reverse; }; struct Node { Mesh::FaceHandle faceHandle; CapacityMap::value_type distance; long index; Traits::edge_descriptor predecessor; boost::default_color_type color; }; Before calling edmund karps I add an edge with zero capacity to each existing edge and set the reverse edges. It would be very nice if anyone could give me a hint why this does not work. The push relabel and the kolmogorov algorithm always return 0 as result :( Best Regards, Matthias -- View this message in context: http://www.nabble.com/-BGL--Edmund-Karps-works-with-long%2C-but-does-not-wi… Sent from the Boost - Users mailing list archive at Nabble.com.

2 1

MSVC++ linker asking for boost_regex even though not using it
by Sharad Mittal 17 Nov '08

17 Nov '08

I have been compiling my program with boost_thread, boost_date_time and boost_system on mingw till now. Now I am trying to compile the same program on VC++ (9.0) and it is asking for libboost_regex-vc90-mt-sgd-1_36.lib . Is that normal? I have not used boost::regex in my code at all. Thanks, Sharad

2 1

tokenizer and R package
by Vidhu Choudhary 17 Nov '08

17 Nov '08

Hi Thank you all . With your help now I could install boost on windows I making a R package which contains c src code which uses tokenizer.hpp I made the package and tried to install it in Linux. I could install the package by successfully making the .so file When I tried the same in windows it showed error : bed2vector.C:13:31: boost/tokenizer.hpp: No such file or directory. While making the .dll R is using gcc to compile the files. Some how the boost libraries were not linked to gcc. And I dont know how to do it in windows from command line. If anyone could suggest it will be a great help --Vidhu

1 0

[Proto] Detecting if a tag is a proto type or not
by Joel Falcou 17 Nov '08

17 Nov '08

I want to do some dispatching based on the fatc that my binary_expr tag is one of predefined proto tag or not. What kind of internal properties of proto tags can I try to use to perform this discrimination ? Thanks in advance

2 3

Some problems about GIL
by blp330 17 Nov '08

17 Nov '08

Hi, 1. Does any one know how to crop a image using GIL? 2. The IO extension seems not support to serialize a image binary data to memory, how to do that using GIL? (read png -> do some stuffs... -> write png to char* buffer not file.) 3. Is there any one good performance image comparison algorithm to compare two images by GIL? I am using ImageMagick to do that now. It try to compute Mean Absolute Error for two images, how this can be done by GIL? Thanks for your answer, I am try to adopt my old ImageMagick's code to GIL, I like elegant design of GIL but I am a newbie. Thanks for you patient to answer my questions. :) -- View this message in context: http://www.nabble.com/Some-problems-about-GIL-tp20526156p20526156.html Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

--layout=system in user-config.jam?
by Raymond Wan 17 Nov '08

17 Nov '08

Hi all, In a recent post (a few weeks ago), someone asked if it is possible to remove the compiler name/version from the library name. i.e., libboost_math_c99-gcc43-mt-1_37.so --> libboost_math_c99-mt.so Someone replied that adding "--layout=system" to bjam would do the trick and indeed, that worked. When compiling Boost, I was wondering if it is possible to add this parameter to the user-config.jam file, rather than editting the Makefile directly? If so, what would be the syntax to do this? Somewhere, I read that user-config.jam "define[s] available toolsets" -- I guess this parameter is not a toolset, so it is not possible? The reason I am asking is rather silly -- but just that editting the Makefile is slightly more error-prone than sending a user-config.jam to someone (or backing it up myself for later use) since the Makefile could change based on what configure outputs. Thank you! Ray

2 2

[Proto] Strange behavior with semantic action and custom tag function
by Joel Falcou 16 Nov '08

16 Nov '08

I'm stuck on some problem that may en dup silly. I have a DSL defined by the following grammar : struct dimen_grammar : bp::or_< ////////////////////////////////////////////////////////////////////////// // Terminals are dimensional values or integral values ////////////////////////////////////////////////////////////////////////// bp::or_< bp::terminal< dimensions<bp::_,bp::_> > , integer_grammar > ////////////////////////////////////////////////////////////////////////// // dimen can be added together or scaled by an integer // or shifted left or right by an integer ////////////////////////////////////////////////////////////////////////// ,bp::or_< bp::plus<dimen_grammar,dimen_grammar> ,bp::multiplies<dimen_grammar,integer_grammar> ,bp::multiplies<integer_grammar,dimen_grammar> ,bp::shift_left<dimen_grammar,integer_grammar> ,bp::shift_right<dimen_grammar,integer_grammar> > > {}; I've defined a proper callable_context that take care of my special terminals and built a terminal class. At this point, everythign works perfect : i can build expressions and evaluate them. Now I add a grammar with semantic action that helps me computes an aspect of those expression : struct dimen_size : bp::or_< ////////////////////////////////////////////////////////////////////////// // dimensionnal values terminal contains its own size value ////////////////////////////////////////////////////////////////////////// bp::when< bp::terminal< dimensions<bp::_,bp::_> > , dimension_of< bp::_value>() > ////////////////////////////////////////////////////////////////////////// // integral values has a size of 1 ////////////////////////////////////////////////////////////////////////// , bp::when<integer_grammar, bm::size_t<1>()> ////////////////////////////////////////////////////////////////////////// // size(d1+d2) = max(size(d1),size(d2)) ////////////////////////////////////////////////////////////////////////// , bp::when< bp::plus<dimen_grammar,dimen_grammar> , bm::max<dimen_size(bp::_left),dimen_size(bp::_right)>() > ////////////////////////////////////////////////////////////////////////// // size(d1*i) = size(d1) ////////////////////////////////////////////////////////////////////////// , bp::when< bp::multiplies<dimen_grammar,integer_grammar> , dimen_size(bp::_left) > ////////////////////////////////////////////////////////////////////////// // size(i*d2) = size(d2) ////////////////////////////////////////////////////////////////////////// , bp::when< bp::multiplies<integer_grammar,dimen_grammar> , dimen_size(bp::_right) > ////////////////////////////////////////////////////////////////////////// // size(d1<<i) = size(d1) ////////////////////////////////////////////////////////////////////////// , bp::when< bp::shift_left<dimen_grammar,integer_grammar> , dimen_size(bp::_left) > ////////////////////////////////////////////////////////////////////////// // size(d1>>i) = size(d1) ////////////////////////////////////////////////////////////////////////// , bp::when< bp::shift_right<dimen_grammar,integer_grammar> , dimen_size(bp::_left) > ////////////////////////////////////////////////////////////////////////// // Other returns 0 ////////////////////////////////////////////////////////////////////////// , bp::when<bp::_, bm::size_t<0>()> > {}; This works. If I remove the bp::when<bp::_, bm::size_t<0>()>, it fails to compile when I try to use a hand-overloaded operator<< for displaying expression values on standard output. So, is there anything I missed (like deactivating operator<< in the grammar somehow ?) ? Other question : When defining custom tag to build new function, why does the make_expr tempalte doesn't do check on its argument to see if it's match the grammar of the domain it's bound to use ? Seems I'm forced to add additional layer of SFINAE to prevent those function to get called on w/e types. Thanks in advance for help -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 6

[asio] Header ordering problems
by Robert Ramey 16 Nov '08

16 Nov '08

#include <boost/date_time/posix_time/posix_time.hpp> #include <boost/asio.hpp> produces the error message at compile time: 1>c:\boost_1_37_0\boost\asio\detail\socket_types.hpp(27) : fatal error C1189: #error : WinSock.h has already been included while #include <boost/asio.hpp> #include <boost/date_time/posix_time/posix_time.hpp> does not. Same problem occurs when including any of the headers in boost/thread/... Robert Ramey

2 1

About boost::asio
by Ken zhang 16 Nov '08

16 Nov '08

Hi Dear all I want to handle socket close event in my connection, but I can't found mothed in ip::tcp::socket,How can I handle close event for socket? Thanks -- Best Regards, Yours Kennir

2 3

library name for boost 1.36
by Alain Leblanc 16 Nov '08

16 Nov '08

Hi, I just built boost 1.36 for the mac and all the library names have xgcc40 inserted in the middle, such as libboost_iostreams-xgcc40-mt-1_36.dylib. It breaks my makefiles that contain the option " -lboost_iostreams". Is there a reason for the xgcc40 in this version and not the others, and is there a way to instruct bjam not to include it in the filename. Thank, s

4 5

[iostreams] How to overload the flush on a outpou stream
by vicente.botet 16 Nov '08

16 Nov '08

Hi, I want to to take a specific action when I flush an output stream. Can Boost.Iostreams be of any use? Thanks is advanve, Vicente

1 0

get_posix_category in boost 1.36
by Daniel França 16 Nov '08

16 Nov '08

Hi people, I got an error of undefined get_posix_category in Boost 1.36, I found this article: http://blog.cplusplus-soup.com/2008/11/boost-c-library-patches-1360.htmlthat tell me that there's no get_posix_category on Boost 1.36: *Boost.System's Missing 'get_posix_category'* In Boost 1.36.0, Boost.System's get_posix_category function had been removed. For strict backwards compatibility, it has to be put in to let older versions of libraries that use the function to link properly. This has been submitted as issue (with patches attached) That's why I cant compile the asynchronous TCP Server example, I tried to get the patch but itsn't online anymore, anyone know how can I solve that? Best Regards, -- Daniel C. França Tecnosapiens: http://tecnosapiens.wordpress.com 24Quadros: http://24quadros.wordpress.com

1 0

[phoenix] adding const to member_variable bind
by Christian Henning 16 Nov '08

16 Nov '08

Hi there, the following code doesn't compile since I'm iterating over a constant vector of points. struct point { double _prob; double _x; }; void test( const std::vector< point >& d ) { double sum_prob = std::accumulate( d.begin() , d.end() , 0.0 , arg1 + bind( &point::_prob, arg2 ) ); } int _tmain(int argc, _TCHAR* argv[]) { std::vector< point > d; test( d ); return 0; } My question is how can I convert or cast the "&point::_prob" into a const reference? I tried several ways but they all don't work. The only thing that worked was to add const getter function in my point structure. Like this: struct point { point( double prob, double x ) : _prob( prob ), _x( x ) {} const double& prob() const { return _prob; } double _prob; double _x; }; Thanks, Christian

3 10

tokenizer
by Vidhu Choudhary 16 Nov '08

16 Nov '08

Hi I am using tokenizer from boost. On my windows machine I want to install tokenizer only. Can you please suggest how can I do that Thank you Vidhu

6 8

Boost conformance to standard c++0x libraries statement
by vicente.botet 15 Nov '08

15 Nov '08

Hi, There are a lot of Boost libraries already included in the C++ Standards Committee's Library Technical Report (TR1). More Boost libraries are proposed for the upcoming TR2. As all these libraries do not conform completly to the standard for different raisons: the compliler do not support some feautres of the C++0x, the emulation seems to complex or any other justification. I think that it will help the users to have a clear statement, library by library, of which features the library conform to or not. This statement should contain the library feature(class, typedef, constants, functions, ...), dependencies on other C++0x features, whether it conforms on C++0x compilers supporting the needed compiler features, if it use some workaround on other compilers and finaly for the non conformant features why the library do not conforms. It will be also useful to state which features on the library are not on the standard. I have prepared as an example a table for the Boost.Thread library (limited tothread and this thread API). Anthony the informations on these tables could be wrong. Attached boost_thread_conformance.qbk and boost_thread_conformance.html Any comments and ideas are welcome. HTH, Vicente

1 0

Simple threading question (I hope)
by Alec Munro 15 Nov '08

15 Nov '08

Hi List, I'm fairly new to multithreading, especially in C++. Things seem generally straightforward when using boost::thread, but there was one question I had. I have a mutex that I use to control access to a data processing object. Whenever I receive new data, I attempt to lock the mutex, and process it. However, I think it's possible that I might receive several data packets while I'm processing, and it's important that these packets are processed in order. So I suppose my question is, when a mutex is unlocked, how is it determined which thread gets to lock it next? Thanks, Alec Munro --------------------------------------------------------------------- This transmission (including any attachments) may contain confidential information, privileged material (including material protected by the solicitor-client or other applicable privileges), or constitute non-public information. Any use of this information by anyone other than the intended recipient is prohibited. If you have received this transmission in error, please immediately reply to the sender and delete this information from your system. Use, dissemination, distribution, or reproduction of this transmission by unintended recipients is not authorized and may be unlawful.

4 6

[swap] boost::swap roadmap?
by JOAQUIN M. LOPEZ MUÑOZ 15 Nov '08

15 Nov '08

Hello, Is Boost.Swap going to make it into Boost 1.38? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 2

Re: [Boost-users] Boost Static Linking Woes
by Brian Dawn 15 Nov '08

15 Nov '08

Alright, I recompiled boost with runtime-link=static but I got the same error. >> After doing this, I guess there is some "magic" preprocessor define you need to specify in your project, so the boost config header becomes aware of what boost variant you are using... I have looked for some sort of preprocessor definition for static builds, but I couldn't seem to find any. Does anyone happen to know what this is/could be? >> I believe the only exception to this is Boost.Python, but that has special requirements that make static linking much more tricky I believe. I actually am linking to Boost.Python, and Boost.Filesystem (both really nice libraries). However I probably should have said earlier, but I receive 2 "Mixing a dll boost library with a static runtime is a really bad idea..." errors. I assume 1 is for python and the other for filesystem? Any help is appreciated, I really need these to be statically linked. Thanks everyone! -Brian.

2 2

Regex - Reading CSV files like MS Excel does
by Jeff Dunlap 14 Nov '08

14 Nov '08

The expression regex e(",") handles files in a clean format such as: field 1,field 2,field 3 I would like to read some CSV files where there may be fields that contain a comma (enclosed in ""): 1999,Smith, Mike, "Smith, Mike", 55 1999,Doe, Jane, "Doe, Jane", 45 And if possible, I would like to handle commas and quotes within the field: 1999,Doe, Jane, "Doe, Jane "Happy Gurl"", 45 Can someone help me with this please? Thank you very much

4 5

Using threads without RTTI enabled
by Rick Meier 14 Nov '08

14 Nov '08

Is there some way to use threads without needing rtti? To be more specific it looks like threads.hpp includes function_base.hpp and lexical_cast.hpp. Both of these files reference typeid. Is there something I can do to get around this? Thanks Rick M

1 0

[Proto] Functions returning an expression
by Joel Falcou 14 Nov '08

14 Nov '08

I have a DSL defined in proto. What's the best wayt o build functions that returns an expression made of this DSl elements. Like let's say the vec_expr class support+-*/ operators I want to write ??? f( vec_expr<W> const& a, vec_expr<Y> const& b) { return (a+b)/(a-b); } How can I easily (aka no nested make_expr call) build the return type ? TIA -- ___________________________________________ Joel Falcou - Assistant Professor PARALL Team - LRI - Universite Paris Sud XI Tel : (+33)1 69 15 66 35

2 4

Always have posting & responding to messages here
by Jeff Dunlap 14 Nov '08

14 Nov '08

First, I would like to thank the kind individuals who have helped me in the past--I can never thank anyone because I simply cannot respond to messages. This web interface never seems to show up to date information so messages that I post via the web interface do not appear on the web interface for some weird reason, no matter if I choose the refresh dropdown option or go to the home page and navigate to this group. I am able to see current messages via outlook express, but cannot post using it unfortunately. Is this just the way this works or are there other options available for posting/reading? Thanks in Advance

2 2

Re: [Boost-users] boost signals2 review
by Stjepan Rajko 14 Nov '08

14 Nov '08

Thank you, Andy, for the review. Stjepan On Mon, Nov 10, 2008 at 9:18 AM, Andrew Webber <andy(a)aligature.com> wrote: > For this review, I have focused on the usability and documentation of the > new signals2 library. I haven't really probed into the implementation and > so I'm assuming that the code is adequate and mostly bug free. > > In general, I think that this library should be accepted as a boost > library. Other than a few questions and annoyances, I think the library is > an extremely welcome addition to the boost libraries. > > I think that the interface changes required to guarantee thread safety are > understandable. I've seen some discussion on the mailing list about > retaining the trackable interface for backwards compatibility. While I > understand the desire to keep the changes required by switching to signals2 > to a minimum, I think signals2 provides a clean break. I understand > boost::signals is going to be maintained for the time being. This way, if > people don't want to change, they don't need to for the time being. If they > want thread safe signals, they should switch to the new library, its new > techniques and its clean interface. > > Here are my specific comments: > * Why the change to boost::optional for signal return values. Maybe I > missed a discussion about the motivation on the mailling list, but this is > an interface change that appears to be unnecessary. > > * I would like to see examples provided to explain the use of > postconstructable, predestructable, and deconstruct_ptr. I think a concrete > example might clear up some people's confusion over when it's appropriate to > use these. > > * I'd also like to see a concrete example shown of switching out the mutex > class used. I think three examples would be best: built-in, dummy_mutex, > and boost::mutex. > > * I'm not very happy about the tendancy of the slot disconnect exceptions > to show up in Visual Studio output. For instance, I built a test program > where several tracked objects were destroyed from different threads, based > on a random timer, while the slot was being invoked over and over. The > program worked well except for a great deal of repeated output like the > following: > > First-chance exception at 0x7c812a5b in SignalsTest.exe: Microsoft C++ > exception: > boost::exception_detail::clone_impl<boost::exception_detail::error_info_injector<boost::bad_weak_ptr> >> at memory location 0x0012dc0c.. > First-chance exception at 0x7c812a5b in SignalsTest.exe: Microsoft C++ > exception: boost::signals2::expired_slot at memory location 0x0012df58.. > > > I did several experiments with this library on Microsoft Visual Studio > 2005. I did not encounter any bugs or problems during my testing. I have a > decent amount of experience in this problem domain. In the past, I have > implemented a (limited) thread safe wrapper around the boost::signals > library. The signals2 library would very effectively replace my wrapper. I > spent a couple of hours on my evaluation, I would consider it moderately > in-depth without evaluating the signals2 implementation. > > Best, > Andy Webber > >

3 2