- Boost - lists.boost.org

Constructor with parameters -- Lambda
by albert meyburgh 13 Jun '08

13 Jun '08

Hi, I'm trying to use the lambda constructor provided in boost and it's not compiling. class someclass { someclass(sometype, int x) } std::vector v<sometype> std::vector v2<someclass> std::transform( v.begin(), v.end(), std::back_inserter( v2 ), boost::bind( boost::lambda::constructor<someclass>(), _1, 5) ); // where 5 is a constant int parameter for x to the constructor Resulting in Error 1 error C2039: 'result_type' : is not a member of 'boost::lambda::constructor<T>' boost_1_35_0\boost\bind.hpp 67 Error 2 error C2146: syntax error : missing ';' before identifier 'type' boost_1_35_0\boost\bind.hpp 67 Error 3 error C4430: missing type specifier - int assumed. Note: C++ does not support default-int boost_1_35_0\boost\bind.hpp 67 Error 4 error C2208: 'boost::_bi::type' : no members defined using this type boost_1_35_0\boost\bind.hpp 67 Error 5 fatal error C1903: unable to recover from previous error(s); stopping compilation boost_1_35_0\boost\bind.hpp 67 What is wrong with my syntax?

3 2

[ANN] xpressive v2.1
by Eric Niebler 13 Jun '08

13 Jun '08

I've uploaded to the Boost Vault a new version of xpressive. This should be the version that ultimately becomes part of Boost 1.36. If anybody find problems, pls. let me know. New Features: * skip(), for specifying which parts of the input sequence to ignore when matching it against a regex. http://tinyurl.com/5xndnk (<http://boost-sandbox.sourceforge.net/libs/xpressive/doc/html/boost/xpressiv…>) * regex_replace() accepts formatter objects and formatter expressions, in addition to format strings. http://tinyurl.com/4c8rt4 (<http://boost-sandbox.sourceforge.net/libs/xpressive/doc/html/boost_xpressiv…>) * Range-based regex_replace() algorithm. http://tinyurl.com/4awtoh (<http://boost-sandbox.sourceforge.net/libs/xpressive/doc/html/boost/xpressiv…>) Bugs Fixed: * Crash when semantic actions are placed in look-aheads, look-behinds or independent sub-expressions. Thanks, -- Eric Niebler BoostPro Computing http://www.boostpro.com

1 0

CORBA iimplementation for Boost interest?
by Jonathan Biggar 13 Jun '08

13 Jun '08

I've been working on a C++ CORBA implementation for a long time. I've considered making it open source in the past, but I hadn't seen the exact niche for it to fill. Now that Boost 1.35 is out, including ASIO and the new Threads implementation, I'm considering retargeting my implementation to only use boost libraries for underlying services. I'd be quite happy to contribute my implementation to boost, if there's enough interest for me to proceed. So, what do you all think? -- Jon Biggar Floorboard Software jon(a)floorboard.com jon(a)biggar.org

11 55

[serialization] Boost 1.35.0 version breaks backward compatibility.
by Jurko Gospodnetić 12 Jun '08

12 Jun '08

Hi all. I am not sure if this was the desired or even acceptable effect but Boost 1.35.0 version of the serialization library introduces an optimization in vector.hpp when serializing a std::vector of 'trivially constructible' types (e.g. int :-)) that breaks backward compatibility when serializing into a text archive. Example for a std::vector<int> holding values { 2, 4 }: Old implementation: '2 0 2 4' New implementation: '2 2 4' We found a workaround to make boost use the old serialization implementation by wrapping our 'default constructible' objects inside a a simple class with a non trivial constructor. None of this is documented in http://www.boost.org/doc/libs/1_35_0/libs/serialization/doc/release.html#di…. ----------------------- Some related questions: ----------------------- * Does anyone know if Boost serialization library is intended to remain backward compatible across different Boost releases or at least provide for explicitly turning on such backward compatibility? * What to do when one wants to use new & improved serialization algorithms but needs to occasionally support older ones in the same application? I know our class serialization can be conditioned based on some 'version' parameter but what to do about 'standard' classes, e.g. std::vector<int>, whose serialization is implemented by the Boost serialization library itself? For example, a new 'network application' release supports a new & improved serialization algorithm but still wants to support connecting to old 'network applications' that do not know how to 'speak the new language'. Many thanks for any explanation regarding this topic. On a related but separate issue - The optimization is conditioned on whether the type is 'default constructible' which seems incorrect. Default constructibility test as currently implemented does actually just test whether the constructor is trivial (using a compiler specific intrinsic) but that is not what the name 'has_default_constructor()' suggests. Hope this helps. Best regards, Jurko Gospodnetić

2 1

[thread] condvar wait exception
by Emil Dotchevski 12 Jun '08

12 Jun '08

Hello, I'm reading in the documentation that barrier::wait may throw thread_resource_error. Looking at the source, it uses condition_variable::wait, which in turn (I think) throws nothing on windows, but may throw boost::condition_error under pthread. So the documentation appears to be wrong. But also, I am puzzled why would wait() throw anything but boost::thread_interrupted? Let's say I have two threads call wait() on a barrier, and one of them throws an error. What am I supposed to do with that exception? How can I recover from such a failure? I am not an expert but I think that if the exception is used to report a bug in user code, it would be better to assert() instead of throwing an exception. One final note, Boost Thread doesn't use boost::throw_exception to throw exceptions. This means that the exception_ptr functionality in Boost Exception is crippled for exceptions emitted by Boost Thread. This is unfortunate because transporting exception objects between threads is a key motivation for boost::exception_ptr; see http://svn.boost.org/svn/boost/trunk/libs/exception/doc/cloning.html. Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

2 1

erfc id not found
by Gary.Stevens＠deq.idaho.gov 12 Jun '08

12 Jun '08

I have been trying to compile code that uses the erfc function. I can get it to build successfully using DevC++4.9.9.2, but cannot using Win-Visual C++2005 Express (C90 standard) which I have been using to construct a form for input-output. I have downloaded the boost libraries and have changed the configuration properties to include the boost directory and changed to Not Using Precompiled Headers. I continue to receive the following: 'erfc': identifier not found. I have tried adding the libraies for DevC++4.9.9.2 but receive the same error. I am new to C++ and this a small simple program but am spending a significant amount of time getting the erfc issue resolved. Any help would be very appreciated. Thank you. Gary

2 4

[ptr_container] Failures for ptr_set and ptr_unordered_set on Intel, Acc, and Cxx
by Markus Schöpflin 12 Jun '08

12 Jun '08

Hello, currently these tests fail with "../boost/ptr_container/ptr_set_adapter.hpp", line 362: error #2309: more than one instance of constructor "boost::ptr_container_detail::ptr_set_adapter_base<Key, VoidPtrSet, CloneAllocator, Ordered>::ptr_set_adapter_base [with Key=Base, VoidPtrSet=std::set<void *, boost::void_ptr_indirect_fun<std::less<Base>, Base, Base>, std::allocator<void *>>, CloneAllocator=boost::heap_clone_allocator, Ordered=true]" matches the argument list: function template "boost::ptr_container_detail::ptr_set_adapter_base<Key, VoidPtrSet, CloneAllocator, Ordered>::ptr_set_adapter_base(const Compare &, const Allocator &) [with Key=Base, VoidPtrSet=std::set<void *, boost::void_ptr_indirect_fun<std::less<Base>, Base, Base>, std::allocator<void *>>, CloneAllocator=boost::heap_clone_allocator, Ordered=true]" function template "boost::ptr_container_detail::ptr_set_adapter_base<Key, VoidPtrSet, CloneAllocator, Ordered>::ptr_set_adapter_base(InputIterator, InputIterator) [with Key=Base, VoidPtrSet=std::set<void *, boost::void_ptr_indirect_fun<std::less<Base>, Base, Base>, std::allocator<void *>>, CloneAllocator=boost::heap_clone_allocator, Ordered=true]" argument types are: (boost::void_ptr_iterator<__rw::__rw_tree_iter<void *, ptrdiff_t, void *const *, void *const &, __rw::__rw_rb_tree_node<std::allocator<void *>, void *, void *, __rw::__ident<void *, void *>>>, Base>, boost::void_ptr_iterator<__rw::__rw_tree_iter<void *, ptrdiff_t, void *const *, void *const &, __rw::__rw_rb_tree_node<std::allocator<void *>, void *, void *, __rw::__ident<void *, void *>>>, Base>) : base_type( first, last ) The compilers has difficulties choosing between: template< class Compare, class Allocator > ptr_set_adapter_base( const Compare& comp, const Allocator& a ) and template< class InputIterator > ptr_set_adapter_base( InputIterator first, InputIterator last ) Interestingly, if I just remove the following constructors, these tests pass for me on Cxx, and no other failures are introduced. template< class Compare, class Allocator > ptr_set_adapter_base( const Compare& comp, const Allocator& a ) template< class Compare, class Allocator > associative_ptr_container( const Compare& comp, const Allocator& a ) So are these constructors needed at all? Markus

2 2

[thread_safe_signals] reviving boost::trackable?
by Frank Mori Hess 12 Jun '08

12 Jun '08

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 It's occurred to me that thread-safe automatic connection management for signal/slot connections made in an object's constructor to one of its member functions could be accomplished by using a boost::trackable class that looks like class trackable: public enable_shared_from_this<trackable> { //... }; Above, I'm only requiring the "classic" enable_shared_from_this functionality, no special support for shared_from_this in constructors, etc. You would derive from trackable, visit_each would discover it inside bind objects, and its destructor would disconnect its associated connections, similar to how the current signals library works. It would do a bit more though. When the signal is invoked, it would: 1) check that the connection has not been disconnected. If not, it calls shared_from_this() to obtain a shared_ptr which can be used for connection tracking in the usual thread_safe_signals way. Calling shared_from_this can be made safe since the trackable destructor (which disconnects) will be called before the enable_shared_from_this destructor. 2) if the shared_ptr from shared_from_this is empty, that means the trackable object is either in the process of being destroyed, or hasn't been passed to an external shared_ptr owner yet. In either case, the slot is skipped by the signal invocation. However, there is a downside to this and other schemes where the signal/slot connection is made in the constructor but blocked until the object is passed to an external shared_ptr. In a common use case, an observer will connect to an observed object's signal and then manually query the observed object once to get its initial state. It can then rely on the signal to keep in sync with any changes the observed object undergoes. If the signal is blocked until the observer is owned by an external shared_ptr, it raises the possibility of the observer getting out of sync with the observed, since a signal could occur and be missed after the manual query of the observed object's initial state. So, doing all the connection setup in a postconstructor still seems preferable. -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.6 (GNU/Linux) iD8DBQFIUS7c5vihyNWuA4URAhPIAKC40cK1kgX9o7aPYILBaHZu3jwZhQCfYFjw o/drv0EOsHqvEt+7exy/PDo= =Lj6m -----END PGP SIGNATURE-----

1 0

Re: [boost] [circular_buffer] why is there no reserve(size_type)?
by Jan Gaspar 12 Jun '08

12 Jun '08

> no, but there are overlaps in functionality/use-cases and not having > reserve makes it harder to write generic code that accepts either type. list and deqeue functionality/use-cases overlap with vector too but they do not have reserve as well ... But if you really need it you can implement it by yourself, don't forget to document it properly and add unit tests. Ideally if you can send me a patch. Jan Send instant messages to your online friends http://uk.messenger.yahoo.com

1 0

Re: [boost] [circular_buffer] why is there no reserve(size_type)?
by Jan Gaspar 12 Jun '08

12 Jun '08

Sorry I don't have time to do this. Anyway IMO implementing reserve would give an impression that the capacity is not fixed and increases as you put elements into the circular buffer. And at last circular buffer is not a vector. ----- Original Message ---- From: Thorsten Ottosen <thorsten.ottosen(a)dezide.com> To: boost(a)lists.boost.org Sent: Wednesday, 11 June, 2008 9:49:29 PM Subject: Re: [boost] [circular_buffer] why is there no reserve(size_type)? Jan Gaspar skrev: > because: > 1) it's behaviour is slightly different from the standard - you can increase but also decrease the capaciry of the container; decreasing of the capacity is not supported by reserve() > 2) the word capacity is used all over the documentation of the circular buffer. I think set_capacity expresses better what the method does. So the function is slightly different from the one in std::vector :-) Having a reserve() won't hurt ... in fact, it will make it easier to write code that works for both vector and circular_buffer. -Thorsten _______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost __________________________________________________________ Sent from Yahoo! Mail. A Smarter Email http://uk.docs.yahoo.com/nowyoucan.html

2 1