- Boost - lists.preview.boost.org

[mp_int] new release
by Kevin Sopp 21 Oct '08

21 Oct '08

Hi all, I made a new release of my multiprecision integer library with the following changes: - improved documentation - serialization support - bugfixes - improved benchmark tool - prime generation has been reworked - probably some other things which I forgot I believe it's pretty much ready for review now. The mp_int reference section is slightly lacking in a few places, but other than that I think it's pretty solid. I have a few things in mind for the future of this library: - improved division and squaring algorithms according to the papers on my disk. - an implementation of an mp_int proxy type that acts on preallocated memory, but does not manage memory itself. This can then be used to improve the runtime of several algorithms. - expression template support There is pregenerated html documentation under libs/mp_math/doc/html/ http://www.boostpro.com/vault/index.php?action=downloadfile&filename=mp_mat… Kevin Sopp

9 27

[doc]Traduction of the documentation
by Alp Mestan 21 Oct '08

21 Oct '08

Hi, The French most active and visited developer community, Developpez.com, would like to know if you were okay to do the traduction of Boost's doc, because it's a problem for many of our visitors that the doc is only readable in English. Would you be okay ? Best regards. -- Alp Mestan --- http://blog.mestan.fr/ --- http://alp.developpez.com/ --- In charge of the Qt, Algorithms and Artificial Intelligence sections on Developpez

9 12

[1.37.0] pre-beta snapshot available
by Beman Dawes 21 Oct '08

21 Oct '08

The boost-posix and boost-windows snapshots of what will become the 1.37.0 beta are available. See http://boost.cowic.de/rc/ It would be helpful to get confirmation that these look OK. Past snapshots, betas, and release had been built on a Windows system, but 1.37.0 is being built on a Linux system to try to avoid doc build problems that plague the Windows variant. As always, separate svn exports are done, requesting the appropriate line endings, but I'd still like more eyeballs on this to make sure all is well. I'd specifically like confirmation from Eric and Daniel that the built docs look OK. If all is well, I'll build the beta tomorrow. In the meantime, no branches/release commits, please. Thanks, --Beman

4 10

[1.37.0] Jamroot changeset 48493 by Jurko not merged into branches/release?
by Beman Dawes 21 Oct '08

21 Oct '08

http://svn.boost.org/trac/boost/changeset/48493 was not merged into branches/release. The comment reads: Minor stylistic changes made to the main Boost library Jamroot file. Corrected several comments. Made searching for header files not search through .svn folders. I'm going to do this merge. In the future, please merge such changes into release rather than relying on the release managers to pick them up. Thanks, --Beman PS: Who is Jerko?

3 4

[regex] [1.35]Problem with IPV6 validation windows XP
by Gopal_Haldar＠McAfee.com 21 Oct '08

21 Oct '08

Please can you send me the proper regular expression which will accept only all different type of valid IPv6 IP. Regards Gopal -----Original Message----- From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Monday, October 20, 2008 6:10 PM To: boost(a)lists.boost.org Subject: Re: [boost] [regex] [1.35]Problem with IPV6 validation windows XP Gopal_Haldar(a)McAfee.com wrote: >> Please let me know is it possible through boost or not. Apologies, I missed that message. >> passing any IPV6 IP >> But it is failed to validate ::ffff:12.12.12.12 format... >> Please see my code... >> >> bool IsValidIPv6String(wstring ipv6address) { wsmatch what; >> >> wregex >> expression(L"^((([0-9A-Fa-f]{1,4}:){7}[0-9A-Fa-f]{1,4})|(([0-9A-Fa-f] >> {1, >> 4}:){6}:[0-9A-Fa-f]{1,4})|(([0-9A-Fa-f]{1,4}:){5}:([0-9A-Fa-f]{1,4}:) >> ?[0 >> -9A-Fa-f]{1,4})|(([0-9A-Fa-f]{1,4}:){4}:([0-9A-Fa-f]{1,4}:){0,2}[0-9A >> -Fa >> -f]{1,4})|(([0-9A-Fa-f]{1,4}:){3}:([0-9A-Fa-f]{1,4}:){0,3}[0-9A-Fa-f] >> {1, >> 4})|(([0-9A-Fa-f]{1,4}:){2}:([0-9A-Fa-f]{1,4}:){0,4}[0-9A-Fa-f]{1,4}) >> |(( >> [0-9A-Fa-f]{1,4}:){6}((\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2})) >> \b) >> \\.){3}(\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b))|(([0-9A-Fa >> -f] >> {1,4}:){0,5}:((\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b)\\.){ >> 3}( >> \b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b))|(::([0-9A-Fa-f]{1,4}: >> ){0,5}((\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b)\\.){3}(\b(( >> 25[ >> 0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b))|([0-9A-Fa-f]{1,4}::([0-9A >> -Fa >> -f]{1,4}:){0,5}[0-9A-Fa-f]{1,4})|(::([0-9A-Fa-f]{1,4}:){0,6}[0-9A-Fa- >> f]{ 1,4})|(([0-9A-Fa-f]{1,4}:){1,7}:))$"); I don't see how any of the alternatives in that regular expression can match the string you give: the only alternative that could possibly match appears to be the "|(::([0-9A-Fa-f]{1,4}:){0,6}[0-9A-Fa-f]{1,4})" part, but that can't match because your string uses "." as a separator between numbers, where as the expression only works with ":" as a separator. Which part of the regex did you expect should match? Also did you intend the \b's to be literal bell characters, or \\b's and hense regular expression operators (word boundaries)? HTH, John. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

[threadpool] v9 - some fixes -> 64bit Linux issue
by Oliver Kowalke 21 Oct '08

21 Oct '08

Hello, version v9 of boost.threeadpool is uploaded to boost.vault. I could test boost.threadpool on following platforms: working: Linux 2.6.23, 32 bit, gcc-4.2.4, Dual Pentium III (host os) Windows XP Prof., 32 bit, msvc-9.0, Core2Duo (guest os) OpenSolaris/Nexenta, 64 bit, gcc-4.2.1, Core2Duo (guest os) FreeBSD-7.0 (requires additonal option in kernel ->semaphores), 64bit, gcc-4.2.1, Core2Duo (guest os) not working: Linux 2.6.23, 64 bit, gcc-4.3. , Core2Duo (host os) -> segmentation fault Xp, OpenSolaris, Freebsd are virtualized (KVM) on Linux. The segmentation fault on Linux x86-64 semas to be related to the 4th argument of ::makecontext. In the code I pass the this-pointer of fiber_impl_wrapper. Does somebody have a solution for this issue? regards, Oliver -- GMX startet ShortView.de. Hier findest Du Leute mit Deinen Interessen! Jetzt dabei sein: http://www.shortview.de/wasistshortview.php?mc=sv_ext_mf@gmx

1 0

[serialization] RPC, IDL, XDR
by remi.chateauneu＠gmx.de 20 Oct '08

20 Oct '08

Is there an attempt to use boost::serialization and Sun's XDR routines to make remote procedure calls with C++ objects? IDL allows only to serialize plain C variables but it might be possible to wrap elegantly low-level XDR calls. Something like that: /// This wraps an XDR pointer into a pseudo-archive. struct xdr_archive { XDR * _xdr_ptr ; xdr_archive( XDR * xp ) : _xrd_ptr(xp) {}; bool_t operator & ( int & i ) { return xdr_int( _xdr_ptr, & i ); }; bool_t operator & ( float & f ) { return xdr_float( _xdr_ptr, & f ); }; ... } The advantage of this is that, if a class has a boost::serialization-compliant 'serialize' method, it becomes easily usable with RPC. For example: /// Sample structure/ struct MyStruct { int _i ; float _f ; template<class Archive > void /serialize( ///Archive & ar, const unsigned int version) { ar & _i; ar & _f; } friend void xdr( XDR * xp, MyStruct * sp ) { s->serialize( xdr_archive( xp ), 0 ); }; }; Although not losing the boolean return value of xdr functions is not straightforward (exceptions or a data member in xdr_archive ?), I would like to know whether it makes sense to use 'serialization' this way. The advantage would be: No need to use an IDL compiler such as rpcgen, less code maintenance, usability of XDR for C++ objects (not just C).

1 0

Re: [boost] [cryptography] concept
by Kasra Nassiri(Math & ComSci) 20 Oct '08

20 Oct '08

Hi Sebastian, > Asymmetric ciphers. I have little expertise in asymmetric ciphers, on the other hand, I need exponentiation functions for most of them, so I guess this needs to wait for the boost.mp_int and/or etc. I fact you might want to help me on that. > Also, I think cipher streams should be implemented at the stream buffer (or > boost.iostream filter) level. I am not entirely familiar with the boost.iostream interface could you elaborate more on that, please? kasra __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

1 0

[Boost.Config] Stlport patch for Sun compilers on Linux
by K. Noel Belcourt 20 Oct '08

20 Oct '08

Hi, I've attached a patch to fix this error with the sun compilers on Linux. http://tinyurl.com/6o4fxg I'm not well versed with the subtleties of Stlport (there may be better ways to code this). The patch merely avoids defining macro BOOST_NO_EXCEPTION_STD_NAMESPACE as the Stlport bundled with the Sun compilers on Linux seems to correctly put all type_info into the std namespace. The Sun compilers on Solaris still require this macro definition. I've tested that this fixes the type_info error with sun-5.9 on Linux and that it doesn't break the Sun tests on Solaris, okay to commit? -- Noel

4 12

[filesystem]Extracting path as string from wpath
by Johan Torp 20 Oct '08

20 Oct '08

How do convert a boost::filesystem::wpath to a known encoding in the native filesystem's path representation? Specifically I want to convert a boost::filesystem::wpath to a third party string (CFString from Carbon). In order to do that I must know the encoding of wpath.string() or wpath.external_file_string() on Mac, which is "implementation defined". Interfacing boost::filesystem::wpath with 3rd party APIs seems like common problem. Best Regards, Johan Torp www.johantorp.com -- View this message in context: http://www.nabble.com/-filesystem-Extracting-path-as-string-from-wpath-tp20… Sent from the Boost - Dev mailing list archive at Nabble.com.

5 9

[serialization] In-memory archive?
by Ling Li 20 Oct '08

20 Oct '08

Is there an easy way to serialize into a in-memory archive so that an object can be, say, transferred over a network? Of course one can use a disk file as the intermediate step but having some in-memory archive should help here. Actually, as a related question, is there a way to serialize into and deserialize from some map-like in-memory archive? Just to illustrate the idea better, say we have a Point class. class Point { double m_x, m_y; public: Point(double x, double y): m_x(x), m_y(y) {} }; We can use the constructor Point(1.0, 2.0) to get an object. But how about if we want to construct a Point object from a std::map that has "x => 1.0; y=> 2.0" as its key-value pairs? I guess my example is too simple so that deserializing from a map is not necessary. But consider deserializing from a database, where one natural way to present the information is not a long binary string but a list of key-value pairs. Or consider a generic factory that takes in such a map and gives out a constructed object. Note that a map usually doesn't keep entries in order so this may add extra burden to the serializing code. Please let me know if what I am looking for is too crazy. Any input is appreciated.

4 6

Re: [boost] [regex] [1.35]Problem with IPV6 validation windows XP
by Gopal_Haldar＠McAfee.com 20 Oct '08

20 Oct '08

I am waiting for reply. Please let me know is it possible through boost or not. -----Original Message----- From: Haldar, Gopal Sent: Thursday, October 16, 2008 4:01 PM To: 'boost(a)lists.boost.org' Subject: [boost] [regex] [1.35]Problem with IPV6 validation windows XP passing any IPV6 IP But it is failed to validate ::ffff:12.12.12.12 format... Please see my code... bool IsValidIPv6String(wstring ipv6address) { wsmatch what; wregex expression(L"^((([0-9A-Fa-f]{1,4}:){7}[0-9A-Fa-f]{1,4})|(([0-9A-Fa-f]{1, 4}:){6}:[0-9A-Fa-f]{1,4})|(([0-9A-Fa-f]{1,4}:){5}:([0-9A-Fa-f]{1,4}:)?[0 -9A-Fa-f]{1,4})|(([0-9A-Fa-f]{1,4}:){4}:([0-9A-Fa-f]{1,4}:){0,2}[0-9A-Fa -f]{1,4})|(([0-9A-Fa-f]{1,4}:){3}:([0-9A-Fa-f]{1,4}:){0,3}[0-9A-Fa-f]{1, 4})|(([0-9A-Fa-f]{1,4}:){2}:([0-9A-Fa-f]{1,4}:){0,4}[0-9A-Fa-f]{1,4})|(( [0-9A-Fa-f]{1,4}:){6}((\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b) \\.){3}(\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b))|(([0-9A-Fa-f] {1,4}:){0,5}:((\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b)\\.){3}( \b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b))|(::([0-9A-Fa-f]{1,4}: ){0,5}((\b((25[0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b)\\.){3}(\b((25[ 0-5])|(1\\d{2})|(2[0-4]\\d)|(\\d{1,2}))\b))|([0-9A-Fa-f]{1,4}::([0-9A-Fa -f]{1,4}:){0,5}[0-9A-Fa-f]{1,4})|(::([0-9A-Fa-f]{1,4}:){0,6}[0-9A-Fa-f]{ 1,4})|(([0-9A-Fa-f]{1,4}:){1,7}:))$"); if(regex_match(ipv6address, what, expression)) { // what[0] contains the whole string // what[1] contains the response code // what[2] contains the separator character // what[3] contains the text message. //if(msg) // msg->assign(what[3].first, what[3].second); return true; } return false; } -----Original Message----- From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] On Behalf Of John Maddock Sent: Thursday, October 16, 2008 2:30 PM To: boost(a)lists.boost.org Subject: Re: [boost] [regex] [1.35]Problem with IPV6 validation windows XP Gopal_Haldar(a)McAfee.com wrote: >>> Hi >>> I am using the regex library for checking the IPV6 validation. >>> Same expression I am using for javascript regular expression >>> verification. >>> But for IP format ::ffff:12.12.12.12 javascript regex api returing >>> valid IP and boost regex_match method returning invalid IP(Windows >>> XP). >>> Please help me to identify the problem. You're going to have to provide much more information: The exact regular expression used, The string you're matching against, and if possible the code you're using. Thanks, John. _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

Re: [boost] thread build on solaris
by Edward Peschko 20 Oct '08

20 Oct '08

Eric, I don't want to be a hair-splitter, but I do think this message does belong in gcc - it's a question of functionality, and how easy to use gcc is. I am trying to move to gcc-4 for its technical improvements, but I'm finding that it seems to be far less forgiving than gcc-3. This is having the unfortunate side effect that a lot of packages that used to compile perfectly fine with gcc-3 are no longer doing so with gcc-4. IMO it should be flexible enough to 'do the right thing' when it can. >From the point of the user, it makes it far more user friendly than otherwise. Is there a flag, environmental variable, or some switch that I can use to make gcc-4 have the older, looser behaviour? (ie: to be backwards compatible with the large volume of code I compile and maintain). Here's another example I'm finding: Constructs of the form extern enum vtype iftovt_tab[]; are now failing with forgiving error: array type has incomplete element type This would be fine if it was code that I controlled - but the matter of fact is that this code is in /usr/include/sys/mode.h, which comes bundled with solaris 10, and the upshot is that I'm going to have to somehow hack solaris headers in order to make gcc-4.3.2 be able to compile perl-5.10.0. Which is just plain wrong. Ed On Sun, Oct 19, 2008 at 2:06 AM, Eric Botcazou <ebotcazou(a)libertysurf.fr> wrote: > [This is not appropriate for gcc@, please use gcc-help@] > >> That worked (thanks) but exactly why did it work? Shouldn't gcc be >> smart enough to realize that it is working either with a c++ file or >> linking to a c++ library? > > gcc is the C compiler, use g++ when you're compiling C++, gfortran when you're > compiling Fortran and so on. > > -- > Eric Botcazou >

2 1

[shared_ptr][repost] Ticket 2126 status?
by Andrey Semashev 20 Oct '08

20 Oct '08

Sorry to reiterate, but I think this issue is rather critical and it would be very nice to have it solved in the upcoming release. Peter, have you reviewed the patch I attached? I also attached it to the ticket. Peter Dimov wrote: > > Andrey Semashev: > > >> >> Is the ticket 2126: >> >> >> >> http://svn.boost.org/trac/boost/ticket/2126 >> >> >> >> actually fixed in trunk? The ticket is still open, but my code that uses >> >> enable_shared_from_this and make_shared runs fine on trunk. > > > > Interesting. No, I don't believe that trunk is OK. The constructor > > support just masks the problem. Try for example the following test: I tried to dig the code here and there. It seems like calling sp_accept_owner for the constructed object would settle the problem. I modified make_shared.hpp accordingly and tried your test on Linux (GCC 4.3), and it passed without errors. I also tried the make_shared_test.cpp test and it also passed. Please, find the patch attached. Is it valid?

3 2

[threadpool] new version with fork/join semantics (context swaps)
by k-oli＠gmx.de 19 Oct '08

19 Oct '08

Hi, I've uploaded a new version of threadpool (v8). It supports fibers (context swapping). Recursiv algorithms will now not block (see example below) -> you could recursivly calculate fibonacci number with one thread. I could verify that fiber-support works on Win XP Prof. (virtualized on Linux) with msvc 9.0 and OpenSolaris/Nexenta (also virtualized) with gcc-4.0. I get segmentation fault if I run the code on Linux (kernel 2.6.26) with gcc-4.3: #0 0x000000000041009b in boost::_bi::list1<boost::_bi::value<boost::tp::detail::pool_with_fibers<boost::tp::unbounded_channel<boost::tp::fifo> >::worker::wimpl::fiber_wrapper*> >::operator()<boost::_mfi::mf0<void, boost::tp::detail::pool_with_fibers<boost::tp::unbounded_channel<boost::tp::fifo> >::worker::wimpl::fiber_wrapper>, boost::_bi::list0> (this=0xffffffffd4000c28, f=@0xffffffffd4000c18, a=@0x7f81d400535f) at /opt/boost/include/boost-1_36/boost/bind.hpp:232 #1 0x00000000004100f4 in boost::_bi::bind_t<void, boost::_mfi::mf0<void, boost::tp::detail::pool_with_fibers<boost::tp::unbounded_channel<boost::tp::fifo> >::worker::wimpl::fiber_wrapper>, boost::_bi::list1<boost::_bi::value<boost::tp::detail::pool_with_fibers<boost::tp::unbounded_channel<boost::tp::fifo> >::worker::wimpl::fiber_wrapper*> > >::operator() (this=0xffffffffd4000c18) at /opt/boost/include/boost-1_36/boost/bind/bind_template.hpp:20 #2 0x0000000000416c34 in boost::tp::detail::wrapp_functor<boost::tp::detail::fiber_impl_wrapper<boost::_bi::bind_t<void, boost::_mfi::mf0<void, boost::tp::detail::pool_with_fibers<boost::tp::unbounded_channel<boost::tp::fifo> >::worker::wimpl::fiber_wrapper>, boost::_bi::list1<boost::_bi::value<boost::tp::detail::pool_with_fibers<boost::tp::unbounded_channel<boost::tp::fifo> >::worker::wimpl::fiber_wrapper*> > > > > ( vp=0xffffffffd4000c10) at /home/graemer/Projekte/thread_pool/src/boost/tp/detail/fiber_impl_posix.hpp:29 #3 0x00007f81da2cd7e0 in ?? () from /lib/libc.so.6 #4 0x0000000000000000 in ?? () I hope you can help me to fix this error (maybe it's raised by a design bug). regards, Oliver example: #include <iostream> #include <cstdlib> #include <stdexcept> #include <vector> #include <boost/bind.hpp> #include <boost/date_time/posix_time/posix_time.hpp> #include <boost/interprocess/detail/atomic.hpp> #include <boost/future/future.hpp> #include <boost/ref.hpp> #include "boost/tp/fifo.hpp" #include "boost/tp/pool.hpp" #include "boost/tp/poolsize.hpp" #include "boost/tp/support.hpp" #include "boost/tp/stacksize.hpp" #include "boost/tp/unbounded_channel.hpp" namespace pt = boost::posix_time; namespace tp = boost::tp; typedef tp::pool< tp::unbounded_channel< tp::fifo >, tp::with_fibers > pool_type; class fib { private: pool_type & pool_; int offset_; volatile boost::uint32_t & i_; int seq_( int n) { if ( n <= 1) return n; else return seq_( n - 2) + seq_( n - 1); } int par_( int n) { if ( n <= offset_) return seq_( n); else { tp::task< int > t1( pool_.submit( boost::bind( & fib::par_, boost::ref( * this), n - 1) ) ); tp::task< int > t2( pool_.submit( boost::bind( & fib::par_, boost::ref( * this), n - 2) ) ); return t1.get() + t2.get(); // dos not block if task is not ready } } public: fib( pool_type & pool, int offset, volatile boost::uint32_t & i) : pool_( pool), offset_( offset), i_( i) {} int execute( int n) { boost::interprocess::detail::atomic_inc32( & i_); int result( par_( n) ); printf("%d: fibonacci of %d == %d\n", i_, n, result); return result; } }; int main( int argc, char *argv[]) { try { pool_type pool( tp::poolsize( 2) ); boost::uint32_t i( 0); fib f( pool, 1, i); for( int i = 0; i<100;++i) { tp::task< int > t1( pool.submit( boost::bind( & fib::execute, boost::ref( f), 3) ) ); } pool.shutdown(); } catch ( boost::thread_interrupted const& ) { std::cerr << "thread_interrupted: thread was interrupted" << std::endl; } catch ( std::exception const& e) { std::cerr << "exception: " << e.what() << std::endl; } catch ( ... ) { std::cerr << "unhandled" << std::endl; } return EXIT_SUCCESS; }

1 0

Re: [boost] thread build on solaris
by Edward Peschko 19 Oct '08

19 Oct '08

H.J - hmm. That worked (thanks) but exactly why did it work? Shouldn't gcc be smart enough to realize that it is working either with a c++ file or linking to a c++ library? Ed It's part of a configure test as part of On Fri, Oct 17, 2008 at 9:24 PM, H.J. Lu <hjl.tools(a)gmail.com> wrote: > On Sat, Oct 18, 2008 at 11:13 AM, Edward Peschko <horos11(a)gmail.com> wrote: >> All, >> >> I'm trying to compile a thread with the boost, threading libraries, >> and am getting errors like these. >> >> gcc -o conftest -g -O2 >> -I/GAAL/pesced_release/install/fuego/include/boost-1_36 >> -L/GAAL/pesced_release/install/fuego/lib /tmp/aa.c >> -lboost_thread-gcc43-mt >> >> /GAAL/pesced_release/install/fuego/lib/libboost_thread-gcc43-mt.so: >> undefined reference to `__cxa_allocate_exception(a)CXXABI_1.3' >> /GAAL/pesced_release/install/fuego/lib/libboost_thread-gcc43-mt.so: >> undefined reference to `std::basic_string<char, >> std::char_traits<char>, std::allocator<char> >>>::_Rep::_M_destroy(std::allocator<char> const&)(a)GLIBCXX_3.4' >> /GAAL/pesced_release/install/fuego/lib/libboost_thread-gcc43-mt.so: >> undefined reference to `std::bad_alloc::~bad_alloc()@GLIBCXX_3.4' >> /GAAL/pesced_release/install/fuego/lib/libboost_thread-gcc43-mt.so: >> undefined reference to `__cxa_throw(a)CXXABI_1.3' >> >> This is on solaris 2.10, using gnu ld (version 2.18..) >> >> Any ideas on how to get around this? >> > > Please use g++ instead of gcc. > > > -- > H.J. >

2 1

Const-overload for bimap associative_container_adaptor::count()
by Matthew L. Creech 19 Oct '08

19 Oct '08

Would it be possible to include a const-overloaded version of count() for associative containers in boost::bimaps? I had some code like this: void CMyClass::func(size_t key) const { size_t num_elements=_member_map.count(key); ... } where _member_map was a std::map, and it worked fine. When I changed _member_map to a bimap, the equivalent code: void CMyClass::func(size_t key) const { size_t num_elements=_member_map.left.count(key); ... } gives an error, because count() is non-const (whereas GCC's std::map::count() is const). That's presumably done because the STL documentation declares count() as non-const (not sure why), but it doesn't seem there would be any harm in adding a const-overload so that this kind of code would compile when the underlying type supports it. The attached patch fixes the problem for me. Thanks -- Matthew L. Creech

1 0

[thread_safe_signals][signals2] review Nov 1st - Nov 10th
by Stjepan Rajko 19 Oct '08

19 Oct '08

Just a brief note: Thanks to the 5 reviewers that have signed up to review the Signals2 library (formerly known as thread_safe_signals) submitted by Frank Mori Hess, the review will happen as planned: November 1st - November 10th. Many thanks to the committed reviewers, and I hope other interested boosters that find some free time during the review period will be joining us as well. Kind regards, Stjepan

1 0

boost::asio::streambuf problem
by rod haxton 18 Oct '08

18 Oct '08

Hello, "Long time listener, first time caller..." I'm struggling with the "boost::asio::streambuf," and the "boost::asio::async_read_until." I'm trying to wait on the async_read_until, which I can do after the first message is sent, but subsequent messages received cause the streambuf to continuously grow. I am trying to use the streambuf via the .data() member. void TAsioSession::Start() { boost::asio::async_read_until(m_Socket, m_szAsioData, boost::regex("\n"), boost::bind(&TAsioSession::HandleRead, this, boost::asio::placeholders::error, boost::asio::placeholders::bytes_transferred)); } void TAsioSession::HandleRead(const boost::system::error_code& error, size_t bytes_transferred) { if(!error) { boost::asio::streambuf::const_buffers_type bufs = m_szAsioData.data(); std::string szBuffer( boost::asio::buffers_begin(bufs), boost::asio::buffers_begin(bufs) + bytes_transferred); LP_ICPACKET lpICPacket = reinterpret_cast<LP_ICPACKET>(const_cast<char*>(szBuffer.c_str())); // reset streambuf for reading (how?) . . . Start(); } Once I grab the data that is in the buffer, I want to reset the streambuf and go back to "async_read_until," and wait for another message to come in. I try to do the following to reset the streambuf pointers... // set the current put/get ptrs of streambuf to beginning of stream m_szAsioData.commit(-m_szAsioData.size()); m_szAsioData.consume(-m_szAsioData.size()); // clear the streambuff char szClear[512]; ZeroMemory(szClear, 512); m_szAsioData.sputn(szClear, sizeof(szClear)); m_szAsioData.sgetn(szClear, sizeof(szClear)); // set the current ptrs of streambuf back to beginning m_szAsioData.commit(-m_szAsioData.size()); m_szAsioData.consume(-m_szAsioData.size()); but the new message isn't at the head of the buffer, it is coming in at position 512 of the streambuf, and the streambuf grows. Any help would be appreciated. Thanks, Rod

1 1

[serialization] non-windows platform broken
by Juergen Hunold 18 Oct '08

18 Oct '08

Hi ! It seems that http://svn.boost.org/trac/boost/changeset/49349 Log: updated spirit headers to use "classic" broke the serialization build for all non-msvc and non-borland builds (all unices in fact ;-))) See http://www.boost.org/development/tests/trunk/developer/serialization.html for the yellow and red markers. And see http://tinyurl.com/5ltbd6 for details. The reason seem to be workaround macros like // spirit stuff #if (defined __BORLANDC__) && (__BORLANDC__ < 0x593) \ || (defined _MSC_VER) && #if (_MSC_VER <= 1300) #else #include <boost/spirit/home/classic/utility/chset.hpp> #endif found in boost/archive/impl/basic_xml_grammar.hpp where the #else clause contains non-existent headers. I've tried to fix this, but got lost in the vast amount of old, new and phoenix variants of spirit ;-(( Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! Ingenieurgesellschaft für * voice: ++49 511 262926 57 ! Verkehrs- und Eisenbahnwesen mbH * fax : ++49 511 262926 99 ! Lister Straße 15 * juergen.hunold(a)ivembh.de ! www.ivembh.de * * Geschäftsführer: ! Sitz des Unternehmens: Hannover * Prof. Dr.-Ing. Thomas Siefer ! Amtsgericht Hannover, HRB 56965 * PD Dr.-Ing. Alfons Radtke !

2 2

[repost] outdated status\expected_results.xml
by JOAQUIN M. LOPEZ MUÑOZ 18 Oct '08

18 Oct '08

Hello, I first posted this some days ago, allow me to repost just in case it went unnoticed: This file has not been updated since 08/12/07: http://svn.boost.org/trac/boost/browser/trunk/status/expected_results.xml which suggests it contains the expected results for Boost 1.34.1. So, Boost 1.36 tests are and 1.37 tests will be comparing against an outdated file (each version should compare against the former). There doesn't seem to be any documentation on Boost about how to do the updating, and the file is not even mentioned at the release manager's checklist at http://svn.boost.org/trac/boost/wiki/ReleasePractices/ManagerCheckList Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

Re: [boost] New library in Vault: Msm (Meta State Machine)
by Christophe Henry 18 Oct '08

18 Oct '08

Hi Andreas, First of all, thank you for taking the time for such a lengthy answer. > So IIUC then you think that transitions crossing state boundaries are bad > practice and should be avoided at all costs? Yes I do (not at any cost of course). Not only because it looks to me like a goto, but also because I feel it is a breach of encapsulation, for example, in the diagram, the "alarm-beeps" state is showing its implementation. It is also unclear to me if the entry method of "alarm-beeps" will be called. > OTOH, the transition triggered by x can only be > made non-state-boundary-crossing by introducing a guard, which is IMO less > concise than allowing for the transition as shown in the chart. This is a matter of taste. I personally prefer this as it reduces the coupling of the system. > As an aside, I don't see much of a connection of state-boundary crossing > transitions with goto. Given your code in the C() function, any transition > could/would be implemented with goto? What I mean is that if you imagined a transition processing as a function call, code using entry pseudo-states would in effect look like the code in the C() function where you could skip the initialization work done in the entry of C and B. It was not meant as real code but as illustration. Sorry if I didn't manage to make my point clear. > Given the examples in the Harel paper and the fact that the UML standard > expressly allows them, I would encourage you to support them. So does C++ support goto and breaching encapsulation, and it still doesn't make them desirable to me. Now, I thankfully take the feedback, and if confirmed, I will add the entry/exit states. > for the same reasons I don't detect value in seeing a composite state as a fully > fledged state machine (as your framework seems to do). I know that the UML > has so-called submachines but they are really just simple composite states > with entry and exit points thrown in. I admit the UML standard is not too clear in its description of submachines but states the goal clearly (UML Superstructure specification v2.1.2 p549), as: "Submachine state is a decomposition mechanism that allows factoring of common behaviors and their reuse". And this is a main design point for Msm. Submachines in Msm intend to be reusable blocks, like classes and functions. They have entry points (entry conditions and initial states), can be defined in different files and reused in different state machines. What defines a FSM with Msm is its transition table, not the inside of submachines. Submachines can be reused in different main state machines and the link between all is the transition table. Now, if the outside world knows the inside of the submachine, which would in turn know about the outside world, I'm afraid it'll be hard for submachines to be reused. However, your example and your point of view are very interesting as they force me to offer a better solution than the one I have (which would be in the init state to forward the events manually). Would the following compromise solution be acceptable to you? Like with deferred events, it would be possible to define automatic forwarding in a state (like the initial one) like this: typedef mpl::vector<T,T1,T2> forward_events; and at the end of the transition, these events would be resent (to the corresponding beep state as defined in the transition table). Like this, it is guaranteed that the entry methods are called, thus ensuring safe initialization and we would come close to an entry pseudostate. To explain better, I uploaded an image into the Vault. Regards and thank you for your time! Christophe

3 2

[1.37] [dynamic_bitset] Permission to port to the release branch
by Gennaro Prota 18 Oct '08

18 Oct '08

The latest changes to dynamic_bitset are either documentation improvements (markup, contents, wording) or removals of workaround code for compilers on which no tests are run anymore. I'll wait for a trunk test cycle anyway, but I thought to ask with some anticipation for permission to port them to the release-ready branch. -- Genny

2 2

Newbie want to get involved in boost projects and prepare for 2009 GSoC
by 徐兴军 18 Oct '08

18 Oct '08

Hi,all: I am a graduate student, and good at algorithm. If I want to get involved in boost projects and prepare for 2009 GSoC, which specific projects are suitable for me ? And how can I get started ? Thank you !

1 0

Re: [boost] [asio] [bind] ambiguous bind templates for asio::write() and asio::read()
by Gregory Dai 18 Oct '08

18 Oct '08

*code:* .... asio::streambuf response; size_t siz = asio::read(sslSock, response); .... *compilation error (g++ 3.4.6 on RHEL4):* asio/1.3.0/asio/impl/read.ipp:107: instantiated from `size_t asio::read(SyncReadStream&, asio::basic_streambuf<Allocator>&) [with SyncReadStream = asio::ssl::stream<asio::basic_stream_socket<asio::ip::tcp, asio::stream_socket_service<asio::ip::tcp> >, asio::ssl::stream_service>, Allocator = std::allocator<char>]' asio/1.3.0/asio/ssl/detail/openssl_stream_service.hpp:415: error: call of overloaded `bind(int (*)(SSL*, void*, int), boost::arg<1>, void*, int)' is ambiguous boost/1.36/boost/bind.hpp:1298: note: candidates are: boost::_bi::bind_t<R, F, typename boost::_bi::list_av_3<A1, A2, A3>::type> boost::bind(F, A1, A2, A3) [with R = int, F = int (*)(SSL*, void*, int), A1 = boost::arg<1>, A2 = void*, A3 = int] boost/1.36/boost/bind/bind_cc.hpp:47: note: boost::_bi::bind_t<R, R (*)(B1, B2, B3), typename boost::_bi::list_av_3<A1, A2, A3>::type> boost::bind(R (*)(B1, B2, B3), A1, A2, A3) [with R = int, B1 = SSL*, B2 = void*, B3 = int, A1 = boost::arg<1>, A2 = void*, A3 = int] Also, asio::write(sslSock, response); resulted in a similar error.

1 0