- Boost - lists.boost.org

[ptr_container] linking errors
by Felipe Magno de Almeida 06 Jun '05

06 Jun '05

Hi, I'm having linking errors(multiple definitions) with the ptr_map in VC7.1. The problem is in the struct eraser(all its methods) inside the function insert_lookup in the ptr_map_adapter_base template. I've tried inlining all the methods with no success. The workaround I found was making eraser a inner class inside the ptr_map_adapter_base template(moved it from the insert_lookup function). This errors appear when using the operator[] of the very same ptr_map in two different files. I attached the simplest files that I could make that shows these problems... Thank you for boost, Felipe Magno de Almeida. -- Felipe Magno de Almeida Developer from synergy and Computer Science student from State University of Campinas(UNICAMP). Unicamp: http://www.ic.unicamp.br Synergy: http://www.synergy.com.br "There is no dark side of the moon really. Matter of fact it's all dark."

3 3

RE: [boost] Who's Using Boost?
by Brian Braatz 06 Jun '05

06 Jun '05

this is AWESOME. a HUGE THANK YOU for putting this together. Extremely cool. This will definitely help with folks trying to "get permission" to use boost in their company. > -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of John Maddock > Sent: Monday, June 06, 2005 4:23 AM > To: Boost mailing list > Subject: [boost] Who's Using Boost? > > There are now a set of prototype "Who's Using Boost?" pages available at: > > http://freespace.virgin.net/boost.regex/who/html/index.html > > Comments and suggests welcome, but in particular we need more case > studies/products etc that are using Boost to be listed. If you have a > product or project that could be listed then please see the submission > guidelines at: > > http://freespace.virgin.net/boost.regex/who/html/who_s_using_boost_/subm it > .html > > Regards, > > John. > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Regression, fixes, and stuff
by Pedro Lamarão 06 Jun '05

06 Jun '05

Hello all. I've been playing more intimately with boost lately, and running the regression tests. As I do it, I feel I'll have the time to help fixing bugs here and there. But I wouldn't like to just start throwing patches in the list risking entering in conflict with other people's work. So... How is the development process coordinated? Do regressions get bugs assigned to them? Is there a list for sending patches? -- Pedro Lamarão Desenvolvimento Intersix Technologies S.A. SP: (55 11 3803-9300) RJ: (55 21 3852-3240) www.intersix.com.br Your Security is our Business

2 1

compressed_pair requirements?
by David Abrahams 06 Jun '05

06 Jun '05

Can arguments to compressed_pair be const-qualified? The documentation only lists this restriction: Note that compressed_pair can not be instantiated if either of the template arguments is a union type, unless there is compiler support for boost::is_union, or if boost::is_union is specialised for the union type. I believe I am getting an error from Intel C++ when an argument to compressed_pair is const. The question is whether we need a workaround in compressed_pair.hpp or a change to the html documentation. -- Dave Abrahams Boost Consulting www.boost-consulting.com

6 22

Re: Typeof: Review result
by Tom Brinkman 06 Jun '05

06 Jun '05

Andy Little wrote: > Three positive reviews is not sufficient in my opinion. However, > the precedent has already be set, as other libraries have been approved on > a similar limited number of reviews. >>Obvious questions in response to this... >>How many reviews are sufficient? >> What proportion in favour/against acceptance is acceptable? The judgement of the library's review manager is the final determinent. The criteria that he/she used to accept or reject the submission should be clearly stated in the review managers report after the review period is over. Tom Brinkman

6 5

[lambda] how can I access structure member
by Rafal Dabrowa 06 Jun '05

06 Jun '05

Suppose I have the following structure: struct xy { int x, y; }; and the following vector: vector<xy> v(10); I want to use lambda library for find an item in the table. Let's say, with x member value equal to 10. Something like this doesn't work: pos = find_if(v.begin(), v.end(), _1.x == 10); How the above line should be written ? Rafal

2 1

[assign][range][ptr_container] using-induced problem
by Joaquín Mª López Muñoz 06 Jun '05

06 Jun '05

Martin Wille posted about this a couple of days ago (http://lists.boost.org/boost-testing/2005/05/1216.php) but I'm afraid it could have passed unnoticed. Some tests from Boost.(Assign|Range|PointerContainer) have the following layout #include<...> using namespace std; using namespace boost; ... #include <boost/test/unit_test.hpp> having the using directives before boost/test/unit_test.hpp is AFAICS illegal and does indeed cause problems with GCC 3.4.x and GCC 4.x, see for instance http://tinyurl.com/8payc I cannot test it, but I guess it suffices to move all the includes before any using directive. This will probably clear up dozens of tests, including some toolsets that are currently marked as unusable. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

4 10

Boost Array Initialization Technique
by christopher diggins 06 Jun '05

06 Jun '05

The fact that the Boost array class does not support constructors in favour of the limited and somewhat obscure aggregate initialization syntax has me concerned. IMO it would be much more flexible and powerful to support overloading of the comma operator. The following works on Visual C++ template<typename array_T, unsigned int N> struct array_comma_helper { array_comma_helper(array_T& x) : m(x) { } array_comma_helper(const array_comma_helper& x) : m(x.m) { } array_comma_helper& operator=(typename array_T::value_type x) { m[0] = x; return *this; } mutable array_T& m; }; template<class array_T, unsigned int N, class Scalar_T> array_comma_helper<array_T, N+1> operator,(array_comma_helper<array_T, N> h, const Scalar_T& x) { array_comma_helper<array_T, N+1> ret(h.m); ret.m[N + 1] = x; return ret; } template<class array_T> array_comma_helper<array_T, 0> initialize(array_T& x) { return array_comma_helper<array_T, 0>(x); } This enables us to write: int n = 2; array<int, 3> a; initialize(a) = 1, n, 3; This is much more flexible and it allows us to have constructors in boost::array thus making it a full reversible container. Christopher Diggins http://www.cdiggins.com

15 36

Re: [boost] Re: Re: Boost Array Initialization Technique
by brangdon＠cix.compulink.co.uk 06 Jun '05

06 Jun '05

In-Reply-To: <d7iigr$7tn$1(a)sea.gmane.org> technews(a)kangaroologic.com (Jonathan Turkanis) wrote (abridged): > boost::array is just supposed to give built-in arrays a container > interface. Built-in arrays never have size 0, so I don't see > why boost::arrays should. Surely built-in arrays can have size 0? For example: int n = 0; int *array = new int[n]; In my experience it is important to handle zero edge-cases correctly and uniformly. I have been reading: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2003/n1479.html and I don't understand the reasoning there. Personally I'd rather change the language so that: const int n = 0; int array[n]; was acceptable too, making the static case consistent with the dynamic case and both consistent with n>0. Even if this glitch is not fixed (because it requires a language change), I'd rather an array library not perpetuate the problem. For example: array<T,0> a; could allocate a single byte of memory with alignment suitable for T. At worst, sizeof(T) bytes could be allocated, but no T should be constructed. -- Dave Harris, Nottingham, UK.

2 1

Math constants - updated.
by Paul A Bristow 06 Jun '05

06 Jun '05

I have recently posted to the Boost Sandbox vault an update of my collection of mathematical constants, previously reviewed as a Boost library and ultimately not accepted because of lack of agreement on how to present the constants, especially for User Defined Types, and an outbreak of macrophobia. However the values are still valid and some may find them a useful and convenient source, with even more reassuringly sufficient decimal places to give you a warm feeling ;-) The values are take from Internet sources and then computed with NTL a arbitrary (very high) precision library and presented as 40 decimal digit strings, suitable for all hardware as yet envisioned. I have tried to check as many as possible against two source to try to avoid mistakes, but please tell me of any that you find. The same values are actually presented in header files as macros, floats, doubles, and long doubles, (and also as the functions allowing pi to call a function pi() proposed by Michael Kenniston, even though I am not entirely convinced of their usefulness). So including double_constants.hpp will give lots of values, for example: static const double cubeRootTwo = 1.25992104989487316476721060727822835057; // 2^1/3 If you prefer a macro, the define_constants.h will give you values like #define M_EPOWPI 23.14069263277926900572908636794854738027L /* e^pi */ You can of course also cut and paste invididual lines, if you just want pi. No choice of names will suit everyone - so I have indulged myself. You can change them of course. http://tinyurl.com/7p6es for two zips of headers and documentation as html. Enjoy? Paul PS Some of these values are to be used in the math functions for stats library that I am in danger of getting around to Real Soon Now. Paul A Bristow Prizet Farmhouse, Kendal, Cumbria UK LA8 8AB +44 1539 561830 +44 7714 330204 mailto: pbristow(a)hetp.u-net.com

10 44