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

Compile problems with instrusive::slist::push_back
by Johannes Gajdosik 16 May '09

16 May '09

From this piece of code ---------------------------------------- #include <boost/intrusive/slist.hpp> class Node : public boost::intrusive::slist_base_hook<> { public: Node(int x) : x(x) {} int x; }; typedef boost::intrusive::slist<Node> List; int main(int argc,char *argv[]) { List list; Node n1(1234); Node n2(5678); list.push_front(n1); list.push_back(n2); return 0; } ------------------------------------------ I get the following error: johannes@pc1:~/Progs/Components/Boost> g++ IntrusiveTest1.C -Iboost_1_39_0 boost_1_39_0/boost/intrusive/slist.hpp: In member function 'void boost::intrusive::slist_impl<Config>::push_back(typename std::iterator_traits<typename boost::intrusive::detail::eval_if_c<boost::intrusive::slist_impl<Config>::external_value_traits, boost::intrusive::detail::eval_value_traits<typename Config::value_traits>, boost::intrusive::detail::identity<typename Config::value_traits> >::type::pointer>::reference) [with Config = boost::intrusive::slistopt<boost::intrusive::detail::base_hook_traits<Node, boost::intrusive::slist_node_traits<void*>, safe_link, boost::intrusive::default_tag, 2>, long unsigned int, true, false, false>]': IntrusiveTest1.C:16: instantiated from here false>boost_1_39_0/boost/intrusive/slist.hpp:382: error: invalid false>application of 'sizeof' to incomplete type false>'boost::STATIC_ASSERTION_FAILURE<false>' IntrusiveTest1.C:16: false>instantiated from here false>boost_1_39_0/boost/intrusive/slist.hpp:382: error: invalid false>application of 'sizeof' to incomplete type false>'boost::STATIC_ASSERTION_FAILURE<false>' This is boost_1_39_0. I use operating system johannes@pc1:~/Progs/Components/Boost> uname -a Linux pc1 2.6.22.19 #1 PREEMPT Fri Apr 10 00:41:29 CEST 2009 x86_64 AMD Athlon(tm) 64 Processor 3000+ AuthenticAMD GNU/Linux and compiler gcc version 4.3.2 (Gentoo 4.3.2-r3 p1.6, pie-10.1.5) I cannot understand, why list.push_front(n1) compiles, while list.push_back(n2) fails to compile. Thanks in advance for your help. Yours, Johannes Gajdosik

3 2

Re: [Boost-users] iterators must go
by John Dlugosz 15 May '09

15 May '09

> Date: Wed, 13 May 2009 02:18:07 -0400 > From: Scott McMurray <me22.ca+boost(a)gmail.com> > Subject: Re: [Boost-users] iterators must go > To: boost-users(a)lists.boost.org > Message-ID: > <fa28b9250905122318s3460e1dam5d624160d95ced5(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > On Sun, May 10, 2009 at 09:24, Neal Becker <ndbecker2(a)gmail.com> wrote: > > Interesting presentation: > > > > http://www.boostcon.com/site- > > media/var/sphene/sphwiki/attachment/2009/05/08/iterators-must-go.pdf > > > > Very persuasive, but it's careful to touch only the examples that look > nice. Note, for example, that every range was a whole container. > > The three-iterators part was somewhat handwaved-over as well. Take > this bit of current code, for example: > > auto i = find(c.begin(), c.end(), some_pred()); > rotate(c.begin(), i, c.end()); > > How do you do that nicely with ranges, when he has find returning a > range? (Since right now, it implicitly actually returns 2 ranges.) > > And how does insertion work? Do we still need to keep the iterators > around for insertion position? > > I'd love to see the finicky bits worked out, though, since I do like > the idea. > > ~ Scott Any place you really want a single iterator, a range of one value would work. For appending or streaming out, you really want the concept of an open-ended range. --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

4 3

Re: [Boost-users] iterators must go
by John Dlugosz 15 May '09

15 May '09

> I think a ranges can be used as insertion positions. The element could > be inserted just before or after the start of the range. The details > have to be worked out, like if it's before or after, and if it's > before, > if the range grows to include the element. I thought that Boost has ranges for some time, and the upcoming C++ standard incorporates them. So, haven't the details *been* worked out? --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 1

Boost.Regex 1.39.0: Crash in boost::sub_match::str()
by Peter Klotz 15 May '09

15 May '09

The program below crashes when compiled and executed in Windows using MSVC8. The crash happens in boost::sub_match::str(). It seems that the internal structure m_subs gets somehow corrupted. The crash disappears when passing the const reference fileName instead of it->path().filename(). I have no idea why this should make any difference. The program expects a directory on the command line. Just put an empty file called "AAA-0.txt" in this directory. Any help is appreciated. Regards, Peter. #include <iostream> #include <boost/filesystem/path.hpp> #include <boost/filesystem/convenience.hpp> #include <boost/regex.hpp> int main(int argc, char** argv) { try { if (argc==2) { const boost::filesystem::path p(argv[1]); const boost::regex regEx("^([A-Za-z0-9_]+)-(.*)\\.txt$"); boost::smatch match; for (boost::filesystem::directory_iterator it(p);it!=boost::filesystem::directory_iterator();++it) { const std::string& fileName=it->path().filename(); if (boost::regex_match(it->path().filename(),match,regEx)) // <- using fileName makes the crash disappear { const std::string projectName=match.str(1); // <- here it crashes } } // for return 0; } } catch (const std::exception& e) { std::cout << e.what() << std::endl; } return 1; }

3 2

Re: [Boost-users] How to print from C++ to the same stream as Python's 'print' does?
by John Dlugosz 15 May '09

15 May '09

> Date: Wed, 13 May 2009 06:19:20 -0500 > From: Early Ehlinger <earlye(a)gmail.com> > Subject: Re: [Boost-users] (Boost.Python) How to print from C++ to the > same stream as Python's 'print' does? > To: boost-users(a)lists.boost.org > Message-ID: > <5922b0d30905130419x3d030f24s948b15cfd42d91f(a)mail.gmail.com> > Content-Type: text/plain; charset="iso-8859-1" > Can you ask Python to give you the underlying OS or C standard library handle? Then you can create a C++ ofstream around that. --John TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

Re: [Boost-users] thread-safe ref-counted objects
by John Dlugosz 15 May '09

15 May '09

> Date: Tue, 12 May 2009 19:17:47 +0300 > From: Igor R <boost.lists(a)gmail.com> > Subject: [Boost-users] [boost-users][signals2] thread-safe > disconnection for intrusively ref-counted objects > To: boost-users(a)lists.boost.org > Message-ID: > <cfe0a3cf0905120917u55751463i566d0e96b420c011(a)mail.gmail.com> > Content-Type: text/plain; charset=UTF-8 > > Is there any trick or customization that would allow the subj? > I mean the following situation: > I have a set of reference-counting pointer classes that are designed specifically for cross-thread use. It *expects* to be incremented and decremented on different threads at the same time. <http://github.com/jdlugosz/repertoire> <http://www.dlugosz.com/Repertoire/refman/Classics/Smart%20Pointers%20Ov erview.html#toptop> probably doesn't tell you anything you don't already know, since it was just assumed that everything would be thread-safe and doesn't consider that an "issue". <http://www.dlugosz.com/Repertoire/refman/Classics/handle_guide.html#thr eads> goes over the thread features. Feel free to abscond with or borrow any of the code or ideas therein, if it helps you. --John (sorry about the footer; not my choice) TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

1 0

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