October 2011 - Boost - lists.preview.boost.org

[boost threads] threadid copy constructor
by Jason Newton 21 Oct '11

21 Oct '11

The following patch adds a copy constructor to threadid. There seems to be no reason why they shouldn't be copyable. Comments? -Jason

2 2

difference_type size()?
by Olaf van der Spek 21 Oct '11

21 Oct '11

Hi, iterator_range returns a signed size. Is this correct? IMO it should return size_t. boost\range\iterator_range_core.hpp: difference_type size() const { return m_End - m_Begin; } Olaf

6 28

Using trac for boost-sandbox?
by Paul A. Bristow 21 Oct '11

21 Oct '11

Is it permitted to use the Boost Trac system for libraries under development at boost-sandbox? This would be very helpful. (especially if a history could refer to the Trac in Quickbook, as done in Boost.Pool new docs at pool.qbk [section:tickets Appendix E: Tickets] Report and view bugs and features by adding a ticket at [@https://svn.boost.org/trac/boost Boost.Trac]. Existing open tickets for this library alone can be viewed [@https://svn.boost.org/trac/boost/query?status=assigned&status=new&status=reopened&component=pool&c ol=id&col=summary&col=status&col=owner&col=type&col=milestone&order=priority here]. Existing tickets for this library - including closed ones - can be viewed [@https://svn.boost.org/trac/boost/query?status=assigned&status=closed&status=new&status=reopened&co mponent=pool&col=id&col=summary&col=status&col=owner&col=type&col=milestone&order=priority here]. [endsect] [/section:tickets Appendix E: Tickets] This removes a boring burden on authors on updating the history of features and bugs. (There isn't an option to use sandbox in the drop-downs - only trunk, release, 1.n ...). Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

1 0

Fwd: Re: [Boost-announce] [Review] Boost.Atomic review starts today, October 17th 2011
by Tim Blechmann 21 Oct '11

21 Oct '11

---------- Forwarded Message ---------- Subject: Re: [Boost-announce] [boost] [Review] Boost.Atomic review starts today, October 17th 2011 Date: Friday 21 October 2011, 10:20:42 From: Darren Cook <snip> CC: Tim Blechmann <tim(a)klingt.org> > Boost.Atomic ... implements the > interface as defined by the C++11 standard, but makes this feature available > for platforms lacking system/compiler support for this particular C++11 > feature. Hello, (I wanted to cc Helge Bahmann but couldn't find an email address) As the library is a stand-in until compilers catch-up, I think it would be useful to have a page in the documentation that shows the minimum compiler versions where it is no longer needed, for at least the major compilers. (I skimmed the docs but couldn't see this covered.) Darren P.S. No need to reply, and sorry I won't be able to take part in the review. (I'm also not on boost-devel list currently.)

1 0

Throws exception while deserializing large no object
by Bikas Tanti 21 Oct '11

21 Oct '11

I'm using vs 2010 and getting memory leaks when deserializing objects with binary archive . #include <boost/archive/binary_oarchive.hpp> #include <boost/archive/binary_iarchive.hpp> class ElementResultData { private: friend class boost::serialization::access; template<class Archive> void serialize(Archive & ar,const unsigned int version) { ar & m_pass; ar & m_fail; ar & m_units; ar & m_result_no; ar & m_outof_tolerance; ar & m_iPartNo; ar & m_iActualValue; ar & m_iMeasurement1; ar & m_iMeasurement2; ar & m_iMeasurement3; } public: std::string m_pass; std::string m_fail; std::string m_units; std::string m_result_no; std::string m_outof_tolerance; unsigned long m_iPartNo; double m_iActualValue; double m_iMeasurement1; double m_iMeasurement2; double m_iMeasurement3; public: ElementResultData(){}; ElementResultData(std::string ps,std::string fl,std::string unit,std::string rno,std::string tol, int n,double av,double m1,double m2, double m3) : m_pass(ps),m_fail(fl),m_units(unit),m_result_no(rno),m_outof_tolerance(tol),m_iPartNo(n), m_iActualValue(av),m_iMeasurement1(m1),m_iMeasurement2(m2),m_iMeasurement3(m3) {} }; //DataResultDlg.h class CDataResultDlg { // Construction public: std::map<int, ElementResultData> m_mElemResDatafirst; std::map<int, ElementResultData> m_mElemResDataSecond; std::map<int, ElementResultData> m_mElemResultData; }; //DataResultDlg.cpp #define NUM_ELEMENTS 50000 // works fine when NUM_ELEMENTS is 1 class CDataResultDlg { for(unsigned long i=0;i<NUM_ELEMENTS;i=i+2) { m_mElemResDatafirst.insert(std::make_pair(i, ElementResultData("Pass","No", "MM","PartA","O",i,1.6020,1.0400,1.320,1.1010))); m_mElemResDatafirst.insert(std::make_pair(i+1,ElementResultData("Fail","Yes","MM","PartB","O",i+1,1.085,1.0004,2.320,1.1010))); } //Saving Data std::ofstream ofs("ResultData"); // save data to archive { boost::archive::binary_oarchive oafirst(ofs,std::ios::app); //write instance to archive int no_of_map = 2; oafirst<< no_of_map; oafirst << m_mElemResDatafirst; oafirst << m_mElemResDataSecond; } //Loading Data std::ifstream ifs("ResultData",std::ios::binary); { // create and open an archive for input boost::archive::binary_iarchive ia(ifs); // read class state from archive int no_of_Element; ia>>no_of_Element; for(int i =0;i<no_of_Element;i++) ia >>m_mElemResultData; *// Out Of Memory * }; Same code works fine for text_archive.I have to serialize huge amount of data to a file . Any help will be appreciated . -- View this message in context: http://boost.2283326.n4.nabble.com/Throws-exception-while-deserializing-lar… Sent from the Boost - Dev mailing list archive at Nabble.com.

2 3

[msm] state machine construction / destruction
by Jinsong Huang 21 Oct '11

21 Oct '11

MSM enthusiasts, I have done a performance profiling with a simple parser with 3 implementations, plain C++, SMC and Boost MSM. I was happy to learn that the MSM implementation was very efficient. I'm having some questions about MSM space allocation, please let me know if my understanding of things are wrong (very likely). I work in a high performance computing environment so I will try to minimize unnecessary object constructions. Is it possible for the data in the state machine backend live somewhere else external to the state machine? If that's possible then I can put the state machine's internal states close to the data that needs to be manipulated and the state machine itself is data-less and I can have a single copy of the state machine and each data item carries everything. I know this breaks encapsulation but I'm just wondering. The state machine has a events queue (std::deque?), can I choose to not have this and other data structures I don't think I will need? Thanks, -jh

2 1

enable_if : how to make it work in the case of templated method of a template base inherited several times
by nico 20 Oct '11

20 Oct '11

I hope the subject didn't make you run away ;-) Let me be clearer (I'll try at least): If I have a template base class with a template method : template <typename T> class S { public: template <typename U> void f(U p, typename enable_if<is_same<T, U> >::type*dummy = 0) { std::cout << p << std::endl; } }; For the example, I simplify the method : it must "exists" only if T == U If A is this class: class A : public S<int> {}; Then I have what I want: int i = 1; A a; a.f(i); compiles, but double d = 2.0; a.f(d); doesn't compile : error: no matching function for call to ‘A::f(double&)’ It is the expected behavior. Now let's A inherit from S<double> also : class A : public S<int>, public S<double> {}; Then the following code doesn't compile : int i = 1; A a; a.f(i); error: request for member ‘f’ is ambiguous error: candidates are: template<class U> void S::f(U, typename boost::enable_if<boost::is_same<T, U>, void>::type*) [with U = U, T = double] error: template<class U> void S::f(U, typename boost::enable_if<boost::is_same<T, U>, void>::type*) [with U = U, T = int] I expected there is no ambiguity : f<int> exists only for S<int> In the compiler error, we can notice that T is known when this piece of code is compiled, but not U (U = U). Any explanation or "workaround" ? Thanks. Nicolas.

4 3

[Re:Opaque Typedef] observations on opaque typedef
by Robert Ramey 20 Oct '11

20 Oct '11

Vicent - I saw your post on this subject some months ago and I've reviewed the thread. I didn't look at the code though. I also looked at the C++0x document and I have something to say about this. a) as you know I'm the author of BOOST_STRONG_TYPEDEF which lets one assign a unique type to some primitive integer type. I did this to permit overloads on integers used for different purposes. The new types created had all the properties of integer types but they were all different types. So far so good. b) I eventually found the BOOST_STRONG_TYPEDEF did too much - what I really wanted to not to inherit all the interoperations but only some of them. So I've reduced or eliminated usage of BOOST_STRONG_TYPE from the serialization library implementation. Never the less, I do see it useful in other contexts so your efforts to create and opaque typedef seem useful to me. c) BUT now I really want something else. I want the ability to assign a new type to an existing type. The current typedef has the feature that if two different names are used for the same type, a new type is NOT created. That is typedef creates a synonym rather than a new type. I thought that C++0x template alias would do this. But a careful reading of the standard document that I have leads me to believe that if two names are aliased to the same underlying type - a new type is not created - just like the current typedef. So what we have in the new C++ is basically a templated typedef. d) what I really need is the equivalent to #define OPAQUE_TYPEDEF(name, t) \ struct name : public t {}; so I can say struct dollar_amount { ... operator *(const & rhs) const {..} // don't include this operator - makes no sense }; OPAQUE_TYPEDEF(debit, dollar_amount); OPAQUE_TYPEDEF(price, dollar_amount) and then say void f(debit, t){...} void f(price t){...} Notice in my example, I don't want debit and price types to be true types and not just synonyms for dollar_amount. I realize that this is whole different kettle of fixh than BOOST_STRONG_TYPE or OPAQUE_TYPE. So this might be considered off topic. or maybe not. Comments welcome. Also anyone can feel free to correct my understanding of the template alias feature of C++0x to create new types. Robert Ramey

5 7

missing locale/info.hpp
by markus.rauber＠bluewin.ch 20 Oct '11

20 Oct '11

Hi in your documentation you mention the availability of info.hpp (located in /boost/locale) I've just downloaded the latest 1.47 release and there's no such "locale" subdirectory and no info.hpp file containing a <locale> include statement. I'd like to use the language settings provided with this header file. Where can it be found? Where can the corresponding library be found? Thanks for your feedback Markus

2 1

using nabble to read/write on Boost ML
by lcaminiti 20 Oct '11

20 Oct '11

Hello all, I use Nabble to read/write Boost emails but it puts special HTML instead of the template parenthesis: template<typename T> Other Nabble users (if any), is there a way to configure Nabble to not do this? If not, is there another web-based tool (a side from my personal gmail) I can use to view and reply Boost emails? Thanks a lot. --Lorenzo -- View this message in context: http://boost.2283326.n4.nabble.com/boost-using-nabble-to-read-write-on-Boos… Sent from the Boost - Dev mailing list archive at Nabble.com.

1 0

Re: [boost] [utility] How can I contribute?
by Stewart, Robert 20 Oct '11

20 Oct '11

Andrzej Krzemienski wrote: > > I am not well familiar with Boost procedures, so I apologize > if my question is silly. There's a good deal published on the web site (see Community). > I found a bug (or a missing feature) in template > boost::value_initialized. I found that a bug report and the > proposed resolution are already there in BoostTrac: > https://svn.boost.org/trac/boost/ticket/5483. Is there a way I > could help speed the process of getting it fixed up? Can people > from outside commit changes to Boost trunk? Outsiders may not commit changes. Adding "[utility]" to your subject would have helped to focus attention on the affected library. Boost.Utility has no single maintainer, so adding that to the subject will attract attention from the interested parties and your asking about the bug reported six months ago will help to increase attention. You might want to add your own details to the Trac report, including whether the proposed patch fixes your problem. (If it did, it should encourage the maintainers to accept the patch.) _____ Rob Stewart robert.stewart(a)sig.com Software Engineer using std::disclaimer; Dev Tools & Components Susquehanna International Group, LLP http://www.sig.com ________________________________ IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

1 0

Re: [boost] [locale] missing locale/info.hpp
by Stewart, Robert 20 Oct '11

20 Oct '11

markus.rauber(a)bluewin.ch wrote: > > in your documentation you mention the availability of info.hpp > (located in /boost/locale) I've just downloaded the > latest 1.47 release and there's no such "locale" subdirectory > and no info.hpp file containing a <locale> include statement. > > I'd like to use the language settings provided with this > header file. > Where can it be found? > Where can the corresponding library be found? Boost.Locale was accepted into Boost this past spring (see http://www.boost.org/community/review_schedule.html for details). It has not yet been made part of a release (as can be seen from http://www.boost.org/doc/libs/, which you can access from boost.org's Libraries link.) FYI: It is also helpful to include the library name in square brackets in your subject to ensure the library author/maintainer discovers it (see http://www.boost.org/community/policy.html#subject-line) Conventionally, the library name is rendered in lower case. I have done so in my reply, so Artyom may well have more details to offer you. _____ Rob Stewart robert.stewart(a)sig.com Software Engineer using std::disclaimer; Dev Tools & Components Susquehanna International Group, LLP http://www.sig.com ________________________________ IMPORTANT: The information contained in this email and/or its attachments is confidential. If you are not the intended recipient, please notify the sender immediately by reply and immediately delete this message and all its attachments. Any review, use, reproduction, disclosure or dissemination of this message or any attachment by an unintended recipient is strictly prohibited. Neither this message nor any attachment is intended as or should be construed as an offer, solicitation or recommendation to buy or sell any security or other financial instrument. Neither the sender, his or her employer nor any of their respective affiliates makes any warranties as to the completeness or accuracy of any of the information contained herein or that this message or any of its attachments is free of viruses.

1 0

RFC: A better shared_array
by Olaf van der Spek 19 Oct '11

19 Oct '11

Hi, The current shared_array doesn't keep track of size. This greatly decreases it's usefulness. So I wrote a variant that does: http://pastebin.com/wkdLVqM1 Any interest in such a variant? Olaf

3 14

How can I contribute?
by Andrzej Krzemienski 19 Oct '11

19 Oct '11

Hi, I am not well familiar with Boost procedures, so I apologize if my question is silly. I found a bug (or a missing feature) in template boost::value_initialized. I found that a bug report and the proposed resolution are already there in BoostTrac: https://svn.boost.org/trac/boost/ticket/5483. Is there a way I could help speed the process of getting it fixed up? Can people from outside commit changes to Boost trunk? Regards, &rzej

1 0

Re: [boost] Interest in StaticVector - fixed capacity vector
by Nevin Liber 19 Oct '11

19 Oct '11

On 14 October 2011 05:32, Dave Abrahams <dave(a)boostpro.com> wrote: > Use-cases, please! I worked on a messaging system that created messages via serialization (that took iterators) and delivered them via UDP. Most messages were small (<100 bytes) with occasional messages 1K-2K in size. To give ourselves breathing room, we allowed messages up to, say, 32K, as it would be a non-trivial effort to implement splitting/reassembly of messages. > How could it ever be a "drop-in replacement for vector" For over a decade, the mental model for calling push_back, insert, resize, etc. is that it they have no preconditions to check. This is true *for every standard container* (which supports the corresponding operation, of course). You want to *silently* break that consistency. That will lead to buffer overrun bugs, which we know are hard to debug and I'm not saying we don't need the unchecked functionality. I'm saying it should never be spelled p-u-s-h-_-b-a-c-k, i-n-s-e-r-t, r-e-s-i-z-e, etc. (which is one of the reasons I'm arguing against making it policy based). I'm strongly opposed to any solution that uses the same function signatures as the standard containers that isn't as safe and easy to call as the ones in the standard containers. -- Nevin ":-)" Liber <mailto:nevin@eviloverlord.com> (847) 691-1404

3 7

[context] interface to query remaining stack space
by Charlls Quarra 19 Oct '11

19 Oct '11

Hi All, is there a easy way to query the remaining stack space in a given context? assuming the context is running, i can check the address of a stack dummy variable, but i don't see a way to query the top address of the stack. One could do this by storing that top address before creating the context, but i was wondering if there is already an interface that i'm missing? thanks

1 1

Interest in StaticVector - fixed capacity vector
by Andrew Hundt 19 Oct '11

19 Oct '11

On Sun, Aug 14, 2011 at 5:55 AM, Andrew Hundt <athundt(a)gmail.com> wrote: > I've implemented a small companion class to boost.array that functions > like a stack allocated vector with fixed capacity. The motivation for this > class came when I was using boost.array in an interprocess library, when I > realized that I actually desired an adjustable size boost.array, without the > complexity of the vector class in the interprocess library. The result is > StaticVector, which is boost.array directly modified with a size in front of > the array, and added facilities to match std::vector. > > The Implementation is available at: > https://github.com/ahundt/Boost.StaticVector > > Sample Code: > StaticVector<std::size_t,3> three; > three.push_back(5); > three.push_back(2); // size: 2 capacity: 3 > three.push_back(3); > > three.push_back(1); // throws std::out_of_range exception indicating the > capacity has been exceeded > > So here is the big question: > Is there any interest in the class? > > Cheers! > Andrew Hundt > > On Mon, Aug 15, 2011 at 5:20 PM, Nevin Liber <nevin(a)eviloverlord.com> wrote: > On 15 August 2011 16:05, Andrew Hundt <athundt(a)gmail.com> wrote: > > > Good point. I've modified elems to be a char array, and I now > > reinterpret_cast to the class T as necessary. Elements should only be > > constructed when they are added now. > > > > What are you doing about alignment? Take a look at Synyhesizing Types with > Specific Alignments in the Type Traits library for a start. > -- > Nevin ":-)" Liber <mailto:nevin@eviloverlord.com> (847) 691-1404 > Phil Endecott wrote: > In the case of StativVector<char,N> where N<256, you should consider using > uint8_t to store the size - and similar variations. Boost.Integer makes it > possible to select a suitable type. Sorry for the duplicate email, but my other email seemed to get lost in the shuffle. I know its been a while since I sent my first emails regarding StaticVector, but I have fixed some of the issues others pointed out. - I added a benchmark based on a move benchmark found on C++Next, that shows StaticVector outperforming vector by about 30%, which seems reasonable since there is no dynamic allocation. - I believe I've resolved the StaticVector alignment using type_traits' aligned_storage, as suggested by Nevin Liber. - I've also added the use of Boost.Integer to select the smallest possible type to track the size of the vector given its capacity, as suggested by Phil Endecott. The Implementation is available at: https://github.com/ahundt/Boost.StaticVector Anyone still have additional thoughts or interest in this? Cheers! Andrew Hundt

27 129

range: strided unused parameter 'first' [PATCH]
by Shaun Jackman 18 Oct '11

18 Oct '11

Hi, When using boost::strided I get the following error: boost/range/adaptor/strided.hpp:52: error: unused parameter 'first' The following patch should fix this error. Cheers, Shaun --- boost/range/adaptor/strided.hpp (revision 75052) +++ boost/range/adaptor/strided.hpp (working copy) @@ -49,7 +49,7 @@ namespace boost { } - strided_iterator(base_iterator first, base_iterator it, base_iterator last, difference_type stride) + strided_iterator(base_iterator, base_iterator it, base_iterator last, difference_type stride) : super_t(it) , m_last(last) , m_stride(stride)

1 0

[review] request date change for Local review
by Jeffrey Lee Hellrung, Jr. 18 Oct '11

18 Oct '11

I'm manager for the review of Lorenzo Caminiti's Local library. After a brief discussion with Lorenzo and Greg Crosswhite (review manager assistant), we've decided it would be prudent to push the Local review back to November 10th - 20th (originally scheduled for October 24th - November 2nd), given its overlap with the Atomic review and it being likely that several possible review contributors could be tied up getting 1.48.0 shipped out during the original review time frame. Is it not too late to reschedule? It looks like Local is the last library scheduled for review, and I don't see any conflicts in the calendar. If this is problematic for anyone for any reason, please let me know. Thanks, - Jeff

1 0

[Review:Algorithms] - Review by Neil Groves
by Neil Groves 18 Oct '11

18 Oct '11

*Evaluation of the design.* The design is pleasingly consistent with other algorithms with the exception of clamp_range. The clamp_range function copies, which is inconsitent with the other Boost string algorithms that have the _copy suffix. The clamp_range feature would be better designed as a clamped range adaptor. *Evaluation of the implementation* Generally, the algorithms would benefit from concept checking. In particular the iterator traversals, and range concept requirements should be checked. The implementation of the functions in all.hpp and clamp.hpp are correctly implemented. The clamp function does not provide the usual guarantees about NaN values that most of the floating-point operations do. That is any one argument being NaN does not guarantee a NaN result. This is probably intended, if so a note should be made in the documentation.The argument types may benefit from using call_traits to optimally chose between constant reference and value types. It might be worth considering an assertion that p(lo,hi) is true in the clamp function. The mixing of differing integer types makes the search algorithms defective. The int type is signed, and typically <= the size of std::size_t yet these are mixed. The skip table uses ints, but std::size_t values are inserted. Certainly there should not be any c style casts. It would seem logical to use the boost::iterator_difference<Iterator>::type instead. Currently these algorithms are defective albeit under unusual conditions. There are numerous invocations of non-member functions that should use qualified calls to avoid accidental argument-dependent lookup. range_const_iterator<Rng> has been deprecated in favour of range_iterator<const Rng> The Range versions of the functions should provide a non-const reference version since there are no requirements for the interoperability of range_iterator<const Range> and range_iterator<Range> although they normally exist.. The tests have some defects with respect to dereferencing end iterators. As others have mentioned there should be range versions of all of the functions. *Evaluation of the documentation* The documentation should make very clear that the result for empty ranges into all_of, any_of, none_of as this is currently ambiguous. The documentation should provide more clear performance guarantees about the number of predicate evaluations where this is possible eg. any_of can and does early exit. The documentation should also provide the exception guarantees. *Evaluation of usefulness* If corrected and properly documented these functions will be very useful. The functions any_of etc. are extremely useful for runtime assertions of pre- and post-conditions. *Did I try to use the library?* I used the library with GCC 4.6.1. I had no problems, although I did defect the defects noted above. *How much effort did I put into my evaluation?* I reviewed the code for a couple of hours which was sufficient for the small amount of code under review. *Am I knowledgeable about the problem domain?* Yes, I maintain Boost.Range hence my comments with respect to ranges are reasonably well informed. I have long been a fan of Design by Contract and hence I have experience using my own versions of the functions all_of etc. I vote for inclusion into Boost if and only if: 1. the defects in the search functions and test are resolved 2. clamp_range is removed or replaced. Regards, Neil Groves

9 15

[multi_array] swap
by Maxim Yanchenko 18 Oct '11

18 Oct '11

Hi, The swap support for multi_array was under discussion from the very beginning. A multi_array is quite a heavy object so having light-weight and no-throw swap would be really great. In 2009 a patch was proposed (https://svn.boost.org/trac/boost/ticket/1045) and Ronald Garcia generally liked it, but planned to do some extra work before adding swap to multi_array (see the comments for the ticket above). What is the current status? Thanks, Maxim

2 1

[msm]Event convert at exit point
by Takatoshi Kondo 17 Oct '11

17 Oct '11

Hello, I have a question about Boost.Msm event conversion at exit pseudo state. (Version 1.47.0) http://www.boost.org/doc/libs/1_47_0/libs/msm/doc/HTML/ch03s02.html#d0e942 Exit pseudo states struct event6 { event6(){} template <class Event> event6(Event const&){} }; //convertible from any event Above document said that we can convert the event using the template constructor. This exmaple doesn't access the constructor's parameter. I want to propagate some value of the event. Event2 is a source event. And Event3 is a target event like this.(see attached file) struct Event2 { Event2(int val_):val(val_) {} int val; }; struct Event3 { Event3(int val_):val(val_) {} template <class T> Event3(T const& e):val(e.val) {} // error Event3(Event2 const& e):val(e.val) {} // OK int val; }; // Transition table struct transition_table:mpl::vector< // Start Event Next Action Guard msmf::Row < SubState1, Event2, Exit, msmf::none, msmf::none > > {}; struct Exit :msm::front::exit_pseudo_state<Event3> {}; But compile error occurred. The compiler said Event1 doesn't have a member 'val'. I'm not sure why Event3's constructor instantiate from Event1. This is the question. If I define the constructor that has a parameter Event2 instead of template parameter, compile error doesn't occur. exit_pt_convert.cpp(attached file) is a source code that reproduces this error. Thanks, Takatoshi

3 4

Extra files in release branch
by Marshall Clow 17 Oct '11

17 Oct '11

As of revision #74996, the following files and directories exist only in the release branch - not in the trunk. Is this on purpose? boost/smart_ptr/enable_shared_from_this2.hpp boost/test/detail/unit_test_parameters.hpp boost/test/exception_safety.hpp boost/test/impl/unit_test_suite.ipp boost/test/interaction_based.hpp boost/test/logged_expectations.hpp boost/test/mock_object.hpp boost/test/test_observer.hpp boost/test/unit_test_suite_impl.hpp boost/test/utils/callback.hpp libs/phoenix/doc/html/phoenix-doc_HTML.manifest libs/test/example/cla/Jamfile libs/test/example/unit_test_example_011.cpp libs/test/example/unit_test_example_012.cpp libs/test/src/unit_test_suite.cpp libs/test/test/CMakeLists.txt libs/geometry/test/ranges (empty directory) libs/phoenix/doc/html/phoenix (not empty directory) libs/spirit/doc/html/spirit (not empty directory) libs/spirit/repository/doc/html/spirit_repository (not empty directory) libs/test/doc/html/utf/usage-recomendations (not empty directory) -- Marshall Marshall Clow Idio Software <mailto:mclow.lists@gmail.com> A.D. 1517: Martin Luther nails his 95 Theses to the church door and is promptly moderated down to (-1, Flamebait). -- Yu Suzuki

4 5

Adding a --log_level="message" runtime option to a Boost.test test-suite
by Paul A. Bristow 16 Oct '11

16 Oct '11

Can anyone tell me how to add a --log_level="message" runtime option to a Boost.Test test-suite. Running using VS project I have a Custom Build Step command line "$(TargetDir)$(TargetName).exe" --log_level="message" I'd like to replicate this in a jamfile : ... test-suite "multiprecision EFX numerical test" : [ run numerical_test.cpp ] ; but adding --log_level="message" (and perhaps other Boost.test options as well). (I want this for all compilers of course, so placing in compile options doesn't seem right.) Suggestions most welcome. Thanks Paul --- Paul A. Bristow, Prizet Farmhouse, Kendal LA8 8AB UK +44 1539 561830 07714330204 pbristow(a)hetp.u-net.com

2 6

Unittest capability for meta-programs feedback request
by Ben Robinson 16 Oct '11

16 Oct '11

This submission would make it possible to write a complete set of unit tests for meta-programs, to test both the positive, compiling statements, and the negative, non-compiling statements. These tests will all compile, and the negative tests can throw an exception instead of failing to compile. The submission source is available at https://github.com/icaretaker/Metatest. The provided examples are based on the factorial metafunction from Chapter 8 of "C++ Template Metaprogramming" by David Abrahams and Aleksey Gurtovoy - http://www.boostpro.com/mplbook/. Chapter 8 explains the rational behind the BOOST_MPL_ASSERT_* macros. This submission complements these macros by allowing the writing of regression unit tests, to ensure the user will encounter the mpl formatted compiler error, if the library types are incorrectly instantiated. Currently, many meta-programs are written using one of the BOOST_MPL_ASSERT_* macros. Unit tests for these metaprograms must of course compile, therefore unittests for these programs can verify that valid types produce the correct run-time behavior. This submission provides the following four complementary macros: BOOST_METATEST(pred) BOOST_METATEST_NOT(pred) BOOST_METATEST_RELATION(x, rel, y) BOOST_METATEST_MSG(cond, msg, types) Meta-program authors can use these macros to assert predicates/relations/conditions exactly as done with BOOST_MPL_ASSERT_*. In shipped library code, these four macros exactly forward to their BOOST_MPL_ASSERT_* counterparts, since the BOOST_MPL_ASSERT_* macros do an excellent job of providing maximally informative compiler error messages. In unit test code (where BOOST_METATEST_RUNTIME will need to be defined), these macros will instead instantiate an object, which will throw a runtime exception if the predicate/relation/condition fails. Now meta-program authors can write unittests like the following: BOOST_AUTO_TEST_CASE(factorials_should_not_be_negative) { BOOST_CHECK_THROW( factorial<mpl::int_<-1> > instance;, metatest_exception ); } As you can see, this unit test validates that the factorial meta-function will in fact fail to compile. All exceptions are subclassed from boost::metatest_exception. If the user would instead like to supply their own exception types for individual assertions, one of the following four macros can be used alternatively: BOOST_METATEST_EXP(pred, exp) BOOST_METATEST_NOT_EXP(pred, exp) BOOST_METATEST_RELATION_EXP(x, rel, y, exp) BOOST_METATEST_MSG_EXP(cond, msg, types, exp) Another feature of this library, is that it is independent of any unit testing framework, provided the framework can catch exceptions by type. The examples provided show how this is done with Boost Test. The submission files also show how to use try/catch directly should your unit test framework not have such a capability. I look forward to your feedback. Thank you, Ben Robinson, Ph.D.

16 40