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

Nominate Boost for SourceForge Community Choice Awards 2009
by joaquin＠tid.es 15 May '09

15 May '09

Hello, SourceForge Community Choice Awards 2009 is open for nominations: http://sourceforge.net/community/cca09/ You can nominate Boost by following this link http://tinyurl.com/ogao6x Personally, I nominated for categories "Best Project" and "Best Tool or Utility for Developers". Please spread the word! Best regards, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

PropertyTree's XML parsers survey
by Tan, Tom (Shanghai) 15 May '09

15 May '09

>From: Sebastian Redl <sebastian.redl(a)getdesigned.at> > >Hi, > >PropertyTree currently has 5 (five!) different xml readers using 4 >different parsers. I don't want to maintain them all. Looking at the >open tickets for PT shows that most bugs occur in the various xml >readers, and there's no point in having more than one. > >I just wonder which one to keep. To those who use PropertyTree's XML >format, which parser do you use? Do you have any experience with the >pros and cons of the various parsers? > >All feedback is highly appreciated. I had some experience with RapidXml managing the settings of my not a long time ago. Pro: - the API interfaces are STL-like, easy to use - header only Con: - ANSI only in practice - buggy in supporting wstring, and UNICODE. I ended up implementing my own version supporting UTF-16LE for Windows only based on RapidXml V1.11. The most wanted XML parser/writer feature for me is the support of wide-char(UTF16) version of UNICODE, rather than UTF8. It seems no light-weight XML library does it well.

2 1

[PATCH] Shadow Variables and Unused Globals Cause Warnings/Errors When Headers Are Not in System Path
by Grant Erickson 15 May '09

15 May '09

I've recently added Boost to an Xcode 3.1.2 project with the following warnings enabled in GCC/G++ 4.0.1: -Werror -Wreturn-type -Wunused-function -Wunused-label -Wunused-variable -Wshadow Unfortunately, when boost is not installed in a "system" path as is the case here. Unused and shadow variable warnings cause the build to fail when warnings are treated as errors. This issue last come up for me about a year ago in 1_35_0 with filesystem.hpp: http://article.gmane.org/gmane.comp.lib.boost.user/38297/match=shadow+variab les+cause The included headers this time are: boost/accumulators/accumulators.hpp boost/accumulators/statistics/stats.hpp boost/accumulators/statistics/rolling_mean.hpp To test and fix, I isolated with: printf "#include <${BoostHeader}>\nint main(void) { return 0; }" | /Developer/usr/bin/gcc-4.0 -x c++ -Wall -Wshadow -Werror -o test -I${BoostRoot}/boost/include - The patch to address this is as follows and impacts the headers below: boost/accumulators/framework/accumulator_set.hpp boost/accumulators/framework/accumulators/droppable_accumulator.hpp boost/accumulators/statistics/rolling_mean.hpp boost/accumulators/statistics/rolling_window.hpp boost/accumulators/statistics_fwd.hpp boost/circular_buffer/base.hpp boost/circular_buffer/details.hpp boost/circular_buffer/space_optimized.hpp boost/fusion/container/list/cons.hpp boost/fusion/container/list/cons_iterator.hpp boost/fusion/container/vector/vector_iterator.hpp boost/fusion/view/filter_view/filter_view.hpp boost/fusion/view/filter_view/filter_view_iterator.hpp boost/fusion/view/iterator_range/iterator_range.hpp boost/fusion/view/joint_view/joint_view.hpp boost/fusion/view/joint_view/joint_view_iterator.hpp boost/fusion/view/single_view/single_view.hpp boost/parameter/aux_/arg_list.hpp boost/parameter/aux_/maybe.hpp Because this problem seems to come up frequently, perhaps there is a way -Wshadow and -Wall can be forced for all unit tests? Signed-off-by: Grant Erickson <gerickson(a)nuovations.com> --- --- a/boost/accumulators/framework/accumulator_set.hpp 2008-06-20 09:01:50.000000000 -0700 +++ b/boost/accumulators/framework/accumulator_set.hpp 2009-05-14 13:27:51.000000000 -0700 @@ -42,8 +42,8 @@ template<typename Args> struct accumulator_visitor { - explicit accumulator_visitor(Args const &args) - : args(args) + explicit accumulator_visitor(Args const &in_args) + : args(in_args) { } --- a/boost/accumulators/framework/accumulators/droppable_accumulator.hpp 2008-06-19 20:47:42.000000000 -0700 +++ b/boost/accumulators/framework/accumulators/droppable_accumulator.hpp 2009-05-14 13:23:19.000000000 -0700 @@ -218,9 +218,9 @@ private: with_cached_result &operator =(with_cached_result const &); - void set(result_type const &result) + void set(result_type const &in_result) { - ::new(this->cache.address()) result_type(result); + ::new(this->cache.address()) result_type(in_result); } result_type const &get() const --- a/boost/accumulators/statistics/rolling_mean.hpp 2008-12-30 11:30:45.000000000 -0800 +++ b/boost/accumulators/statistics/rolling_mean.hpp 2009-05-14 13:33:12.000000000 -0700 @@ -69,7 +69,7 @@ // namespace extract { - extractor<tag::rolling_mean> const rolling_mean = {}; + extern extractor<tag::rolling_mean> const rolling_mean = {}; } using extract::rolling_mean; --- a/boost/accumulators/statistics/rolling_window.hpp 2008-12-30 11:30:45.000000000 -0800 +++ b/boost/accumulators/statistics/rolling_window.hpp 2009-05-14 13:32:57.000000000 -0700 @@ -153,8 +153,8 @@ // namespace extract { - extractor<tag::rolling_window_plus1> const rolling_window_plus1 = {}; - extractor<tag::rolling_window> const rolling_window = {}; + extern extractor<tag::rolling_window_plus1> const rolling_window_plus1 = {}; + extern extractor<tag::rolling_window> const rolling_window = {}; } using extract::rolling_window_plus1; --- a/boost/accumulators/statistics_fwd.hpp 2008-12-30 11:30:45.000000000 -0800 +++ b/boost/accumulators/statistics_fwd.hpp 2009-05-14 13:31:22.000000000 -0700 @@ -30,7 +30,7 @@ } namespace extract { - extractor<tag::quantile> const quantile = {}; + extern extractor<tag::quantile> const quantile = {}; } using extract::quantile; @@ -46,7 +46,7 @@ } namespace extract { - extractor<tag::tail_mean> const tail_mean = {}; + extern extractor<tag::tail_mean> const tail_mean = {}; } using extract::tail_mean; --- a/boost/circular_buffer/base.hpp 2008-08-18 01:54:04.000000000 -0700 +++ b/boost/circular_buffer/base.hpp 2009-05-14 13:38:46.000000000 -0700 @@ -1006,9 +1006,9 @@ \par Complexity Constant. */ - explicit circular_buffer(capacity_type capacity, const allocator_type& alloc = allocator_type()) + explicit circular_buffer(capacity_type in_capacity, const allocator_type& alloc = allocator_type()) : m_size(0), m_alloc(alloc) { - initialize_buffer(capacity); + initialize_buffer(in_capacity); m_first = m_last = m_buff; } @@ -1046,13 +1046,13 @@ \par Complexity Linear (in the <code>n</code>). */ - circular_buffer(capacity_type capacity, size_type n, param_value_type item, + circular_buffer(capacity_type in_capacity, size_type n, param_value_type item, const allocator_type& alloc = allocator_type()) : m_size(n), m_alloc(alloc) { - BOOST_CB_ASSERT(capacity >= size()); // check for capacity lower than size - initialize_buffer(capacity, item); + BOOST_CB_ASSERT(in_capacity >= size()); // check for capacity lower than size + initialize_buffer(in_capacity, item); m_first = m_buff; - m_last = capacity == n ? m_buff : m_buff + n; + m_last = in_capacity == n ? m_buff : m_buff + n; } //! The copy constructor. @@ -1145,10 +1145,10 @@ <a href="http://www.sgi.com/tech/stl/RandomAccessIterator.html">RandomAccessIte rator</a>). */ template <class InputIterator> - circular_buffer(capacity_type capacity, InputIterator first, InputIterator last, + circular_buffer(capacity_type in_capacity, InputIterator first, InputIterator last, const allocator_type& alloc = allocator_type()) : m_alloc(alloc) { - initialize(capacity, first, last, is_integral<InputIterator>()); + initialize(in_capacity, first, last, is_integral<InputIterator>()); } #endif // #if BOOST_WORKAROUND(BOOST_MSVC, < 1300) @@ -1260,9 +1260,9 @@ assign(size_type, const_reference)\endlink</code>, <code>assign(InputIterator, InputIterator)</code>, <code>assign(capacity_type, InputIterator, InputIterator)</code> */ - void assign(capacity_type capacity, size_type n, param_value_type item) { - BOOST_CB_ASSERT(capacity >= n); // check for new capacity lower than n - assign_n(capacity, n, cb_details::assign_n<param_value_type, allocator_type>(n, item, m_alloc)); + void assign(capacity_type in_capacity, size_type n, param_value_type item) { + BOOST_CB_ASSERT(in_capacity >= n); // check for new capacity lower than n + assign_n(in_capacity, n, cb_details::assign_n<param_value_type, allocator_type>(n, item, m_alloc)); } //! Assign a copy of the range into the <code>circular_buffer</code>. @@ -1333,8 +1333,8 @@ <code>assign(InputIterator, InputIterator)</code> */ template <class InputIterator> - void assign(capacity_type capacity, InputIterator first, InputIterator last) { - assign(capacity, first, last, is_integral<InputIterator>()); + void assign(capacity_type in_capacity, InputIterator first, InputIterator last) { + assign(in_capacity, first, last, is_integral<InputIterator>()); } //! Swap the contents of two <code>circular_buffer</code>s. @@ -2079,14 +2079,14 @@ } //! Initialize the internal buffer. - void initialize_buffer(capacity_type capacity) { - m_buff = allocate(capacity); - m_end = m_buff + capacity; + void initialize_buffer(capacity_type in_capacity) { + m_buff = allocate(in_capacity); + m_end = m_buff + in_capacity; } //! Initialize the internal buffer. - void initialize_buffer(capacity_type capacity, param_value_type item) { - initialize_buffer(capacity); + void initialize_buffer(capacity_type in_capacity, param_value_type item) { + initialize_buffer(in_capacity); BOOST_TRY { cb_details::uninitialized_fill_n_with_alloc(m_buff, size(), item, m_alloc); } BOOST_CATCH(...) { @@ -2135,35 +2135,35 @@ //! Specialized initialize method. template <class IntegralType> - void initialize(capacity_type capacity, IntegralType n, IntegralType item, const true_type&) { - BOOST_CB_ASSERT(capacity >= static_cast<size_type>(n)); // check for capacity lower than n + void initialize(capacity_type in_capacity, IntegralType n, IntegralType item, const true_type&) { + BOOST_CB_ASSERT(in_capacity >= static_cast<size_type>(n)); // check for capacity lower than n m_size = static_cast<size_type>(n); - initialize_buffer(capacity, item); + initialize_buffer(in_capacity, item); m_first = m_buff; - m_last = capacity == size() ? m_buff : m_buff + size(); + m_last = in_capacity == size() ? m_buff : m_buff + size(); } //! Specialized initialize method. template <class Iterator> - void initialize(capacity_type capacity, Iterator first, Iterator last, const false_type&) { + void initialize(capacity_type in_capacity, Iterator first, Iterator last, const false_type&) { BOOST_CB_IS_CONVERTIBLE(Iterator, value_type); // check for invalid iterator type #if BOOST_WORKAROUND(__BORLANDC__, BOOST_TESTED_AT(0x581)) - initialize(capacity, first, last, BOOST_ITERATOR_CATEGORY<Iterator>::type()); + initialize(in_capacity, first, last, BOOST_ITERATOR_CATEGORY<Iterator>::type()); #else - initialize(capacity, first, last, BOOST_DEDUCED_TYPENAME BOOST_ITERATOR_CATEGORY<Iterator>::type()); + initialize(in_capacity, first, last, BOOST_DEDUCED_TYPENAME BOOST_ITERATOR_CATEGORY<Iterator>::type()); #endif } //! Specialized initialize method. template <class InputIterator> - void initialize(capacity_type capacity, + void initialize(capacity_type in_capacity, InputIterator first, InputIterator last, const std::input_iterator_tag&) { - initialize_buffer(capacity); + initialize_buffer(in_capacity); m_first = m_last = m_buff; m_size = 0; - if (capacity == 0) + if (in_capacity == 0) return; while (first != last && !full()) { m_alloc.construct(m_last, *first++); @@ -2179,32 +2179,32 @@ //! Specialized initialize method. template <class ForwardIterator> - void initialize(capacity_type capacity, + void initialize(capacity_type in_capacity, ForwardIterator first, ForwardIterator last, const std::forward_iterator_tag&) { BOOST_CB_ASSERT(std::distance(first, last) >= 0); // check for wrong range - initialize(capacity, first, last, std::distance(first, last)); + initialize(in_capacity, first, last, std::distance(first, last)); } //! Initialize the circular buffer. template <class ForwardIterator> - void initialize(capacity_type capacity, + void initialize(capacity_type in_capacity, ForwardIterator first, ForwardIterator last, size_type distance) { - initialize_buffer(capacity); + initialize_buffer(in_capacity); m_first = m_buff; - if (distance > capacity) { - std::advance(first, distance - capacity); - m_size = capacity; + if (distance > in_capacity) { + std::advance(first, distance - in_capacity); + m_size = in_capacity; } else { m_size = distance; } BOOST_TRY { m_last = cb_details::uninitialized_copy_with_alloc(first, last, m_buff, m_alloc); } BOOST_CATCH(...) { - deallocate(m_buff, capacity); + deallocate(m_buff, in_capacity); BOOST_RETHROW } BOOST_CATCH_END --- a/boost/circular_buffer/details.hpp 2008-08-20 09:13:07.000000000 -0700 +++ b/boost/circular_buffer/details.hpp 2009-05-14 13:39:23.000000000 -0700 @@ -146,9 +146,9 @@ public: //! Constructor. - capacity_control(Size capacity, Size min_capacity = 0) - : m_capacity(capacity), m_min_capacity(min_capacity) { - BOOST_CB_ASSERT(capacity >= min_capacity); // check for capacity lower than min_capacity + capacity_control(Size in_capacity, Size in_min_capacity = 0) + : m_capacity(in_capacity), m_min_capacity(in_min_capacity) { + BOOST_CB_ASSERT(in_capacity >= in_min_capacity); // check for capacity lower than min_capacity } // Default copy constructor. --- a/boost/circular_buffer/space_optimized.hpp 2008-08-18 01:54:04.000000000 -0700 +++ b/boost/circular_buffer/space_optimized.hpp 2009-05-14 13:33:40.000000000 -0700 @@ -1229,8 +1229,8 @@ } //! Ensure the reserve for possible growth up. - size_type ensure_reserve(size_type new_capacity, size_type size) const { - if (size + new_capacity / 5 >= new_capacity) + size_type ensure_reserve(size_type new_capacity, size_type in_size) const { + if (in_size + new_capacity / 5 >= new_capacity) new_capacity *= 2; // ensure at least 20% reserve if (new_capacity > m_capacity_ctrl) return m_capacity_ctrl; --- a/boost/fusion/container/list/cons.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/container/list/cons.hpp 2009-05-14 13:22:20.000000000 -0700 @@ -69,13 +69,13 @@ cons() : car(), cdr() {} - explicit cons(typename detail::call_param<Car>::type car) - : car(car), cdr() {} + explicit cons(typename detail::call_param<Car>::type in_car) + : car(in_car), cdr() {} cons( - typename detail::call_param<Car>::type car - , typename detail::call_param<Cdr>::type cdr) - : car(car), cdr(cdr) {} + typename detail::call_param<Car>::type in_car + , typename detail::call_param<Cdr>::type in_cdr) + : car(in_car), cdr(in_cdr) {} template <typename Car2, typename Cdr2> cons(cons<Car2, Cdr2> const& rhs) --- a/boost/fusion/container/list/cons_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/container/list/cons_iterator.hpp 2009-05-14 13:21:41.000000000 -0700 @@ -35,8 +35,8 @@ typename add_const<Cons>::type> identity; - explicit cons_iterator(cons_type& cons) - : cons(cons) {} + explicit cons_iterator(cons_type& in_cons) + : cons(in_cons) {} cons_type& cons; }; --- a/boost/fusion/container/vector/vector_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/container/vector/vector_iterator.hpp 2009-05-14 13:17:57.000000000 -0700 @@ -36,8 +36,8 @@ typedef vector_iterator_identity< typename add_const<Vector>::type, N> identity; - vector_iterator(Vector& vec) - : vec(vec) {} + vector_iterator(Vector& in_vec) + : vec(in_vec) {} Vector& vec; }; }} --- a/boost/fusion/view/filter_view/filter_view.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/filter_view/filter_view.hpp 2009-05-14 13:27:21.000000000 -0700 @@ -36,8 +36,8 @@ typedef typename result_of::end<Sequence>::type last_type; typedef Pred pred_type; - filter_view(Sequence& seq) - : seq(seq) + filter_view(Sequence& in_seq) + : seq(in_seq) {} first_type first() const { return fusion::begin(seq); } --- a/boost/fusion/view/filter_view/filter_view_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/filter_view/filter_view_iterator.hpp 2009-05-14 13:27:03.000000000 -0700 @@ -36,8 +36,8 @@ typedef last_iter last_type; typedef Pred pred_type; - filter_iterator(First const& first) - : first(filter::call(first_converter::call(first))) {} + filter_iterator(First const& in_first) + : first(filter::call(first_converter::call(in_first))) {} first_type first; }; --- a/boost/fusion/view/iterator_range/iterator_range.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/iterator_range/iterator_range.hpp 2009-05-14 13:20:41.000000000 -0700 @@ -36,9 +36,9 @@ typedef typename traits::category_of<begin_type>::type category; - iterator_range(First const& first, Last const& last) - : first(convert_iterator<First>::call(first)) - , last(convert_iterator<Last>::call(last)) {} + iterator_range(First const& in_first, Last const& in_last) + : first(convert_iterator<First>::call(in_first)) + , last(convert_iterator<Last>::call(in_last)) {} begin_type first; end_type last; --- a/boost/fusion/view/joint_view/joint_view.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/joint_view/joint_view.hpp 2009-05-14 13:19:35.000000000 -0700 @@ -40,9 +40,9 @@ typedef typename result_of::end<Sequence2>::type concat_last_type; typedef typename mpl::plus<result_of::size<Sequence1>, result_of::size<Sequence2> >::type size; - joint_view(Sequence1& seq1, Sequence2& seq2) - : seq1(seq1) - , seq2(seq2) + joint_view(Sequence1& in_seq1, Sequence2& in_seq2) + : seq1(in_seq1) + , seq2(in_seq2) {} first_type first() const { return fusion::begin(seq1); } --- a/boost/fusion/view/joint_view/joint_view_iterator.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/joint_view/joint_view_iterator.hpp 2009-05-14 13:18:46.000000000 -0700 @@ -37,9 +37,9 @@ typedef forward_traversal_tag category; BOOST_STATIC_ASSERT((!result_of::equal_to<first_type, last_type>::value)); - joint_view_iterator(First const& first, Concat const& concat) - : first(first_converter::call(first)) - , concat(concat_converter::call(concat)) + joint_view_iterator(First const& in_first, Concat const& in_concat) + : first(first_converter::call(in_first)) + , concat(concat_converter::call(in_concat)) {} first_type first; --- a/boost/fusion/view/single_view/single_view.hpp 2007-11-25 10:07:19.000000000 -0800 +++ b/boost/fusion/view/single_view/single_view.hpp 2009-05-14 13:21:08.000000000 -0700 @@ -35,8 +35,8 @@ single_view() : val() {} - explicit single_view(typename detail::call_param<T>::type val) - : val(val) {} + explicit single_view(typename detail::call_param<T>::type in_val) + : val(in_val) {} value_type val; }; --- a/boost/parameter/aux_/arg_list.hpp 2008-03-22 14:45:55.000000000 -0700 +++ b/boost/parameter/aux_/arg_list.hpp 2009-05-14 13:16:48.000000000 -0700 @@ -211,9 +211,9 @@ // Create a new list by prepending arg to a copy of tail. Used // when incrementally building this structure with the comma // operator. - arg_list(TaggedArg arg, Next const& tail) + arg_list(TaggedArg in_arg, Next const& tail) : Next(tail) - , arg(arg) + , arg(in_arg) {} // A metafunction class that, given a keyword and a default --- a/boost/parameter/aux_/maybe.hpp 2008-03-22 14:45:55.000000000 -0700 +++ b/boost/parameter/aux_/maybe.hpp 2009-05-14 13:16:03.000000000 -0700 @@ -33,8 +33,8 @@ BOOST_DEDUCED_TYPENAME remove_reference<reference>::type >::type non_cv_value; - explicit maybe(T value) - : value(value) + explicit maybe(T in_value) + : value(in_value) , constructed(false) {} @@ -48,23 +48,23 @@ this->destroy(); } - reference construct(reference value) const + reference construct(reference in_value) const { - return value; + return in_value; } template <class U> - reference construct2(U const& value) const + reference construct2(U const& in_value) const { - new (m_storage.bytes) non_cv_value(value); + new (m_storage.bytes) non_cv_value(in_value); constructed = true; return *(non_cv_value*)m_storage.bytes; } template <class U> - reference construct(U const& value) const + reference construct(U const& in_value) const { - return this->construct2(value); + return this->construct2(in_value); } void destroy() ---

2 3

Serialization / "Pointer conflict"
by Dan Eaton 15 May '09

15 May '09

Hi all, Sorry for my last question; it was posted hastily -- I subsequently found the Reference->Special Considerations->Optimizations section. Anyway, I have a new problem/question: It's somewhat similar to the "pointer_conflict" example: template<class T> void save(T t) { // create stream & output archive "oar" ar << t; // send with mpi/asio } template<class T> T load() { // retrieve string with mpi/asio T tmp; // create stream & input archive "iar" iar >> tmp; return tmp; } My problem (a few hours of debugging) was that on one end, I was passing in a pointer to an object: FooClass *foo; save(foo) and on the deserialization end, I was requesting an object: FooClass foo = load<FooClass>(); My mistake only showed up through the "array_size_too_short", since as part of the deserialization of FooClass, a fixed-length array was being deserialized, and I guess wonky parsing resulted in "count" being larger than "current_count" in iserializer.hpp. Is what I was doing dangerous, or should/can the boost::serialization library somehow catch that mistake (i.e. in the serialized string, cant it not detect that the object is a pointer to an object, even if it's unregistered)? My fix is to disallow the serialization of pointers on the forward side: if( boost::is_pointer<T> ) throw exception Thanks in advance for any thoughts you might share on the matter, Danny

2 1

Boost and Mac OS X SDK 'nil' Conflicts
by Grant Erickson 14 May '09

14 May '09

There doesn't appear to be an issue for this in Trac or any semblance of a discussion thread; however, the Mac OS SDK definition of 'nil' seems to cause Boost 1_39_0 (perhaps other versions) to emit a copious number of warning and error messages when included AFTER any OS X SDK header such as: #include <CoreFoundation/CoreFoundation.h> #include <IOKit/IOKitLib.h> #include <boost/accumulators/accumulators.hpp> #include <boost/accumulators/statistics/stats.hpp> #include <boost/accumulators/statistics/rolling_mean.hpp> using namespace boost; using namespace accumulators; As near as I can tell CoreServices/MacTypes.h is the source of the definition: #define nil NULL Fortunately, this can be resolved by reordering the include directives to include OS X headers AFTER Boost; however, it seems like these headers should play nicely together. Has Boost reserved 'nil' for some time or might something like 'nil_t' be used alternatively? Regards, Grant

2 1

PropertyTree's XML parsers survey
by Sebastian Redl 14 May '09

14 May '09

Hi, PropertyTree currently has 5 (five!) different xml readers using 4 different parsers. I don't want to maintain them all. Looking at the open tickets for PT shows that most bugs occur in the various xml readers, and there's no point in having more than one. I just wonder which one to keep. To those who use PropertyTree's XML format, which parser do you use? Do you have any experience with the pros and cons of the various parsers? All feedback is highly appreciated. Sebastian

1 0

Performance issues with bellman_ford_shortest_paths
by Paul De La Musica 14 May '09

14 May '09

Hi, I just did a timing experiment on bellman_ford_shortese_paths. It appears to be 200 times slower than LEDA. I am using BGL 1.33.1. Has anyone experienced this? Thanks, Paul

3 4

Build boost on msvc7.1 without native wchar_t
by matthias_0 14 May '09

14 May '09

Hi! I try to compile boost using bjam and toolset=msvc-7.1. To comply with the rest of our libraries I need boost to build without the native wchar_t type. So far none of the solutions I have found seem to work ("snative-wchar_t=off", "-sBUILD=<native-wchar_t>off") In boost\tools\v2\tools\msvc.jam I found a line that adds /Zc:wchar_t to the CFLAGS. Removing that entry didn't help either. Does anyone know a solution to this problem? Thanks, Matthias -- View this message in context: http://www.nabble.com/Build-boost-on-msvc7.1-without-native-wchar_t-tp23539… Sent from the Boost - Users mailing list archive at Nabble.com.

2 3

New version of C++ Middleware Writer now on line
by Brian Wood 14 May '09

14 May '09

Shalom Version 1.9 of the C++ Middleware Writer is now available. This version adds support for Boost Array and it also has a command line interface that allows users to bypass the web interface. In other words, it makes it easy to integrate the C++ Middleware Writer into your build process. http://webEbenezer.net/build_integration.html<http://webebenezer.net/build_integration.html> -- Brian Wood Ebenezer Enterprises http://www.webEbenezer.net <http://www.webebenezer.net/>

1 0

[signals] References rather than copies of functors in slots
by James C. Sutherland 14 May '09

14 May '09

It appears that when a slot is attached to a signal it is copied in. However, if the slot contains a functor, and I want to modify the contents of the functor object, then those changes are not made in the slot since it is a copy of the original object. This is probably a really simple question, but how do tell a signal to hold references/pointers to slot objects rather than copies? Is there a trick with boost::shared_ptr or something? Thanks for any tips. James

2 1

Conditionally show_progress ?
by David Doria 14 May '09

14 May '09

I would like to do something like this void Conditional(const bool show) { unsigned int NumIters = 1e9; boost::progress_display show_progress; if(show) show_progress = boost::progress_display(NumIters); double temp; for(unsigned int i = 0; i < NumIters; i++) { temp = sin(i) / i; if(show) ++show_progress; } } It doesn't seem like I can instantiate a progress_display like this. Is there a way to conditionally have a progress display? Thanks, Dave

3 2

[BGL] A bug in graphviz parser ?
by Dmitry Bufistov 14 May '09

14 May '09

Hi, read_graphviz() parser considers names "b" and b as two different names while the native parser from AT&T does not. Regards, Dmitry

2 2

[boost] [Test] [1.35] How would one access a global fixture's member?
by Stephen Watjen 14 May '09

14 May '09

I came across an example of a global fixture macro in the docs, 'BOOST_GLOBAL_FIXTURE( fixture )' The example that is provided with Boost demonstrates setup and teardown utilizing the constructor and destructor of the fixture passed through the macro. It does not show members in this global fixture. I added a member to the fixture and tried to access it within a test case and I received a compiler error stating that the variable had not been declared in this scope. Is it possible to access a global fixture member? If yes, then how? struct Fixture { const char* str; } BOOST_GLOBAL_FIXTURE( Fixture ) BOOST_TEST_CASE( testGlobalFixture ) { BOOST_CHECK( str != 0 ); } // The above code fails to compile stating: 'str' undeclared (first use this function) Steve Watjen

2 1

Boost::asio // Barrier synchronization
by Dan Eaton 14 May '09

14 May '09

Hello, I'll soon be implementing barrier synchronization over TCP/boost::asio (much like MPI_Barrier) -- has anyone else implemented something similar? Is there any guidance you can offer? Many thanks :) Danny Dan Eaton Software Developer Acceleware Corp. (TSX-V:AXE) www.acceleware.com<http://www.acceleware.com/> Phone: +1.403.249.9099 Ext.295 Fax: +1.403.249.9881 Email: daniel.eaton(a)acceleware.com<mailto:daniel.eaton@acceleware.com> Get superpowered! Acceleware gets your products to market faster, better and stronger! This e-mail may contain information that is privileged and confidential and subject to legal restrictions and penalties regarding its unauthorized disclosure or use. You are prohibited from copying, distributing or otherwise using this information if you are not the intended recipient. If you have received this e-mail in error, please notify us immediately by return e-mail and delete this e-mail and its attachments from your system. Thank you. (c) 2008 Acceleware, Inc. All Rights Reserved

1 0

[Accumulators] Are all statistics lazily evaluated by default?
by pete＠pcbartlett.com 14 May '09

14 May '09

Hi all, I really like the range of statistical properties that the accumulators library supports but am a little unclear about the laziness properties of the library. Suppose I wish to offer a interface that lets the user send a bunch of data and request the k-th moments where k is specified by the user at runtime. Will the accumulator_set accumulator_set< value_type , ba::tag::moments > acc; where k_max >= k (but the inequality may be strict) be efficient. I.e. I only do the calculations necessary to get the k-th moment not the k-max-th? The reason I ask is the documentation makes a distinction between variance and lazy_variance, but this distinction does not seem to be made for other statistics. Thanks in advance for any assistance, Pete

3 3

(Boost.Python) How to print from C++ to the same stream as Python's 'print' does?
by Dietrich Bollmann 14 May '09

14 May '09

Hi, I would like to print from C++ to the same stream as Python's 'print' command does. I am using an embedded Python shell and when using std::cout nothing is printed at all... Currently I am using the following code: std::ostringstream oss; oss << "test\n"; std::string cs = oss.str(); PySys_WriteStdout(cs.c_str()); I wonder if there is an easier way to get the same result? Thanks, Dietrich

3 4

Re: [Boost-users] Tips on implementing a function queue with unique queue items (compare function problem)
by Peter Åberg 14 May '09

14 May '09

Excellent, spot on, thanks gurus :-) /Peter Åberg Steven Watanabe wrote: > If the caller of push knows the type of the function object, > then you can template the push function. > > template<class F> > void push(const F& f) { > if(std::find_if(queue.begin(), queue.end(), f == _1) != queue.end()) { > queue.push_back(item); > } > } > > This is going to be pretty inefficient because of the linear search, > but the same idea applies if you want to store the function objects > in a data structure that supports faster lookup. > > In Christ, > Steven Watanabe > > Nat Goodspeed Wrote: > You're right that we can't compare two boost::function objects, but it > *is* permitted to compare a boost::function with an rvalue that could > initialize it. If you make your push() method a template accepting an > argument of arbitrary type, presumably you could compare each existing > item with that new value before storing it into the deque. > >

1 0

[test] boost::test equivalent of CppUnit's "protectors" ?
by Tim Day 14 May '09

14 May '09

I've used both CppUnit and boost::test for C++ unittesting. Generally I prefer boost::test, mainly because the auto-test macros minimise the effort to setup tests. But there's one thing I really miss from CppUnit: the ability to register your own custom "protectors", instances of which automatically wrap all the run tests. (Technically, you install a test "listener", and that can wrap each test run in a protector scope. Multiple listeners and nested protectors are possible). I've found these invaluable in the past for monitoring unittests for unexpected side effects (e.g checking code hasn't changed the floating-point unit state flags, or messed with other global state). I can't see any equivalent in the boost::test documentation, although BOOST_FIXTURE_TEST_CASE maybe comes closest. (However, whereas a CppUnit protector can return a bool to indicate pass/fail, it's less clear to me how a fixture destructor should indicate failure). Any suggestions for how to best achieve the same thing as CppUnit's protectors in boost::test (and without updating the body of each test) ? Thanks for any advice Tim

2 6

date_time\gregorian\conversion.hpp : fatal error C1001 MSVC 7.1
by Wilkinson, John (Software) 14 May '09

14 May '09

I get the following error with boost 1.39 and MSVC 7.1 SP1 when including <boost/thread/thread.hpp>. c:\boost_libs\V1_39_0\boost\date_time\gregorian\conversion.hpp(43) : fatal error C1001: INTERNAL COMPILER ERROR (compiler file 'msc1.cpp', line 2708) Please choose the Technical Support command on the Visual C++ Help menu, or open the Technical Support help file for more information This problem was in 1.38 as reported here http://archive.netbsd.se/?ml=boost-users&a=2009-02&t=9851835. I was wondering should I raise a bug? I have searched the bugs database but cannot find it already there. Also can anyone suggest a work-around? Turning the browse facility off is not an option; it is a feature I often use. Thanks John <DIV><FONT size="1"> E-mail confidentiality. -------------------------------- This e-mail contains confidential and / or privileged information belonging to Spirent Communications plc, its affiliates and / or subsidiaries. If you are not the intended recipient, you are hereby notified that any disclosure, copying, distribution and / or the taking of any action based upon reliance on the contents of this transmission is strictly forbidden. If you have received this message in error please notify the sender by return e-mail and delete it from your system. If you require assistance, please contact our IT department at helpdesk(a)spirent.com. Spirent Communications plc Northwood Park, Gatwick Road, Crawley, West Sussex, RH10 9XN, United Kingdom. Tel No. +44 (0) 1293 767676 Fax No. +44 (0) 1293 767677 Registered in England Number 470893 Registered at Northwood Park, Gatwick Road, Crawley, West Sussex, RH10 9XN, United Kingdom. Or if within the US, Spirent Communications, 26750 Agoura Road, Calabasas, CA, 91302, USA. Tel No. 1-818-676- 2300 </FONT></DIV>

1 0

Boost gzip_decompressor - compilation errors
by einav_i2 14 May '09

14 May '09

Hi! I'm trying to compile the following function on Boost 1.34.1 (Ubuntu 8.04): void decompress(string &gzipString, string & target) { boost::iostreams::filtering_ostream decompressingStream; boost::iostreams::gzip_decompressor gzdc; decompressingStream.push(gzdc); decompressingStream.push(boost::iostreams::back_inserter(target)); decompressingStream << gzipString; boost::iostreams::flush(decompressingStream); } And I'm getting the following (quite long) error: /usr/include/boost/iostreams/chain.hpp: In member function ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’: /usr/include/boost/iostreams/chain.hpp:207: instantiated from ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’ /usr/include/boost/iostreams/chain.hpp:465: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ /usr/include/boost/iostreams/chain.hpp:453: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::gzip_decompressor, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ main.cpp:93: instantiated from here /usr/include/boost/iostreams/chain.hpp:233: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ /usr/include/boost/iostreams/stream_buffer.hpp: At global scope: /usr/include/boost/iostreams/stream_buffer.hpp: In instantiation of ‘boost::iostreams::stream_buffer<boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, std::char_traits<char>, std::allocator<char>, boost::iostreams::output>’: /usr/include/boost/iostreams/chain.hpp:246: instantiated from ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’ /usr/include/boost/iostreams/chain.hpp:207: instantiated from ‘void boost::iostreams::detail::chain_base<Self, Ch, Tr, Alloc, Mode>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Self = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >, Ch = char, Tr = std::char_traits<char>, Alloc = std::allocator<char>, Mode = boost::iostreams::output]’ /usr/include/boost/iostreams/chain.hpp:465: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push_impl(const T&, int, int) [with T = boost::iostreams::basic_gzip_decompressor<std::allocator<char> >, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ /usr/include/boost/iostreams/chain.hpp:453: instantiated from ‘void boost::iostreams::detail::chain_client<Chain>::push(const T&, int, int, typename boost::disable_if<boost::iostreams::is_std_io<T>, void>::type*) [with T = boost::iostreams::gzip_decompressor, Chain = boost::iostreams::chain<boost::iostreams::output, char, std::char_traits<char>, std::allocator<char> >]’ main.cpp:93: instantiated from here /usr/include/boost/iostreams/stream_buffer.hpp:66: error: invalid application of ‘sizeof’ to incomplete type ‘boost::STATIC_ASSERTION_FAILURE<false>’ A similar "compress" function seem to compile without any problems. Any ideas what can cause this error? Thanks, Einav -- View this message in context: http://www.nabble.com/Boost-gzip_decompressor---compilation-errors-tp235353… Sent from the Boost - Users mailing list archive at Nabble.com.

1 0

Serialization / Fast [non-portable] serialization for binary data
by Dan Eaton 14 May '09

14 May '09

Hi, One more question for the list: I have my own 1, 2 and 3 dimensional array classes, and would like to serialize large such objects quickly. In other words, for( unsigned i=0; i<some_large_dynamic_number; i++ ) ar & ptr[i]; is not desirable (or perhaps modern compilers actually do a sufficiently good job at optimizing this case? opinions?) Is this a case where I'd be better to specialize my "serialize" method for both text_?archive (portable) and binary_?archive (fast), and then further split the binary case into save/load, which would in turn invoke save_binary and load_binary (as appropriate)? In this case (assuming the above is right, and out of curiosity) why is there no "serialize_binary" method instead of separate save/load_binary methods? I'm thinking that with this method, there would be no need to split "serialize" into "save"/"load" for this case... Thank you, Danny

2 1

multi-index-container with nested templates => problem getting iterator on 2nd index.
by JohnQ 14 May '09

14 May '09

Hi, I'm really stuck on this one, so I'm hoping someone can lend me a hand. Basically, I'm defining a templated multi-index-container to hold one piece of data along with two indexes to that data. Next, I'm wrapping that in another templated class that will handle concurrent access to that structure. My problem is that I'm having trouble figuring out how to define a type that will give me an interator on the 2nd index of the multi-index-container ("bimimapIterator2" below). I'm basing this on the Boost multi-index-container example here: http://www.boost.org/doc/libs/1_39_0/libs/multi_index/example/bimap.cpp Here's what I have... //******************************************************************** // multi-index-container //******************************************************************** struct index1{}; struct index2{}; template<typename Key1,typename Key2, typename Data> struct bimultimap { typedef boost::tuple<Key1,Key2,Data> value_type; typedef boost::multi_index_container< value_type, indexed_by< ordered_non_unique< tag<index1>,member<value_type,Key1,&value_type::first> >, ordered_non_unique< tag<index2>,member<value_type,Key2,&value_type::second> > > > bimimap; }; //******************************************************************** // concurrent access class. //******************************************************************** template<typename Key1, typename Key2, typename Data> class concurrent_bimultimap { private: typename bimultimap<Key1, Key2, Data>::bimimap the_bimultimap; mutable boost::mutex the_mutex; boost::condition_variable the_condition_variable; public: typedef typename bimultimap<Key1,Key2,Data>::bimimap bimimapType; typedef typename bimultimap<Key1,Key2,Data>::bimimap::iterator bimimapIterator; typedef typename bimultimap<Key1,Key2,Data>::bimimap::index<index2>::type::iterator bimimapIterator2; void insert(Key1 const& key1, Key2 const& key2, Data const& data) { boost::mutex::scoped_lock lock(the_mutex); the_bimultimap.insert( bimultimap<Key1,Key2,Data>::bimimap::value_type(key1,key2,data) ); lock.unlock(); // Note: because we unlock above and notify below, we can starve the "pop" thread for short durations in burst situations. That's ok so far. the_condition_variable.notify_one(); } bool findKey1(Key1& key1, Data& data) { boost::mutex::scoped_lock lock(the_mutex); bimimapIterator itFindIt = the_bimultimap.find(key1); if (itFindIt != the_bimultimap.end()) { data = itFindIt->third; return true; } else return false; } bool findKey2(Key2& key2, Data& data) { boost::mutex::scoped_lock lock(the_mutex); bimimapIterator2 itFindIt = the_bimultimap.get<index2>().find(key2); if (itFindIt != the_bimultimap.get<index2>().end()) { data = itFindIt->third; return true; } else return false; } ..... there's more but this gives the essence of the problem .... };

3 3

Bidirectional Graph and undirected graphs
by Daniel Russel 14 May '09

14 May '09

I'm trying to add the needed functions to make one of our graphs work as a boost graph and ran into a contradiction in the docs: The introduction to bidirectional graph says "For undirected graphs this [need for extra information] is not an issue, since the in_edges() and out_edges() functions are the same, they both return the edges incident to the vertex." however the function docs for in_edges say: "For both directed and undirected graphs, the target of an out-edge is required to be vertex v and the source is required to be a vertex that is adjacent to v." The latter implies that undirected graphs have to have two copies of each edge, one pointed each direction. Which is correct? The former, I hope :-) Thanks.

3 5

boost:statechart: How can I access the state machine from within a custom error handler?
by Jale Gulea 13 May '09

13 May '09

Hello, I have replaced the null_exception_translator (http://www.boost.org/doc/libs/1_34_1/libs/statechart/doc/reference.html#nul…) with one of my own brew and I cannot figure a way to get the state machine in the context of which the the handler gets called. The 'machine_' member is private in both the 'Action' and the 'ExceptionEventHandler'. The 'translator_' is also private - thus inaccessible in my derived state machine. Any ideas are appreciated. Kind regards /JG

3 2

[operators] equality_comparable
by Robert Jones 13 May '09

13 May '09

Given a template class like template < typename T > struct A { template < typename U > friend bool operator == ( const A &, const U & ); template < typename U > friend bool operator == ( const U &, const A & ); template < typename U > friend bool operator != ( const A &, const U & ); template < typename U > friend bool operator != ( const U &, const A & ); // ...other stuff... }; can I express it using equality_comparable? Thanks, Rob.

2 1