- Boost - lists.boost.org

RE: [boost] Unzipping the Boost distro
by Ferdinand Prantl 13 Dec '04

13 Dec '04

> From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of David Abrahams > > I just downloaded boost-1.32.0 and started to unzip it with > the built-in facilities in Windows XP; the OS reported it was > going to take 50 minutes and it was *crawling*. Using > cygwin's unzip tool it was done in under a minute. > > I'm thinking we should stop distributing raw .zip files > without an extractor... Hmm, I have never tried it. I always use Info-Zip's unzip or the built-in unzipper in some file manager. A notice about this strange behavior on the download page with a link to some good unzipping tool (preferably without the cygwin dependency) would do, for example the official Info-Zip site: http://www.info-zip.org/UnZip.html#Win32 Links to unpackers for the downloadable files are also on other sites. And you may consider submitting a feature change request to Microsoft ;-) Ferda > Dave Abrahams

2 1

Some Boost.Filesystem problems
by Ben Hutchings 13 Dec '04

13 Dec '04

I noticed that Boost.Filesystem doesn't use readdir_r to iterate over directories, even if it is available, making that non-thread-safe. There is a comment to this effect in operations_posix_windows.cpp. I've attached a patch that I believe will allow it to detect whether readdir_r is available and to use it iff it is. I have only tested this on Linux with g++ 3.3, but I tried deliberately breaking the declaration of readdir_r and verified that the code continues to work without it. On a visual inspection some time back I also noted that there's no special handling for empty root directories on Windows. The problem with these is that while even an empty directory normally has entries for "." and "..", so that FindFirstFile can return something, root directories on FAT volumes (and I think NTFS as well) do not have these and Windows doesn't fake them, so FindFirstFile on an empty root returns INVALID_HANDLE_VALUE. Note that this only applies to real root directories, not to the roots of drives that are mapped to sub-directories using subst or file sharing. I never got round to checking whether the Boost code actually handles this or not, as I only use Windows at work and we don't use Boost.Filesystem there. Perhaps someone could check that out? Unfortunately it's impractical to test automatically, as empty volumes are hard to generate on demand! Ben. -- Ben Hutchings DNRC Motto: I can please only one person per day. Today is not your day. Tomorrow isn't looking good either.

1 1

A replacement to any_cast
by Yuval Ronen 13 Dec '04

13 Dec '04

Hi, I've checked the 'any' library, and I have a suggestion. Wouldn't it be nicer if class any will have a member method like: template <typename T> T get() const; or maybe even: template <typename T> const T& get() const; template <typename T> T& get(); In my humble opinion, that would look better of the current 'any_cast' way of doing it. Thanks, Yuval Ronen

9 15

Re: [boost] Re: [iostreams] Version of Iostreams compatible with1.32available
by JOAQUIN LOPEZ MU?Z 13 Dec '04

13 Dec '04

Hi Jonathan ----- Mensaje original ----- De: Jonathan Turkanis <technews(a)kangaroologic.com> Fecha: Domingo, Diciembre 12, 2004 1:10 am Asunto: [boost] Re: [iostreams] Version of Iostreams compatible with1.32available > Has this been tested on Borland 5.x? No, it hasn't. This utility is a spin-off of multi_index, which does not compile in BCC (for many other reasons.) > I get errors (see end) unless > I make the > following change at line 132 > > template<typename Type> > struct result:Allocator::BOOST_NESTED_TEMPLATE rebind<Type> > { > }; > > ==> > > template<typename Type> > struct result:Allocator::BOOST_NESTED_TEMPLATE rebind<Type> > { > typedef typename Allocator::BOOST_NESTED_TEMPLATE > rebind<Type>::other other; > }; Well, your fix is kinda redundant. I guess every compiler will be happy with this instead: template<typename Type> struct result { typedef typename Allocator::BOOST_NESTED_TEMPLATE rebind<Type>::other other; }; If this works for BCC and you could do a quick check that it doesn't break the others (GCC, MSVC), please go ahead and commit to the CVS (thank you!) Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 2

[logo] slightly OT: about the FedEx logo
by JOAQUIN LOPEZ MU?Z 12 Dec '04

12 Dec '04

I can't resist posting this delightful article about a little-known hidden surprise in the FedEx logo: http://www.thesneeze.com/mt-archives/000273.php This is IMHO the kind of elegance we should strive for when building our Boost logo. Best, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[range + string algos] bug with Intel C++ 7.0 on Windows
by Pavel Vozenilek 12 Dec '04

12 Dec '04

This 2-liner: --------------------------- #include <boost/algorithm/string.hpp> #include <boost/range/iterator_range.hpp> --------------------------- produces error with Intel C++ 7.0 for Windows (plugged in VC6 IDE, old Dinkumware): P:\N\src\boost_1_32_0\boost/range/iterator_range.hpp(78): error: class template "boost::algorithm::iterator_range" may not be redeclared in the current scope class iterator_range ^ P:\N\src\boost_1_32_0\boost/range/iterator_range.hpp(78): error: class template "boost::algorithm::iterator_range" has already been defined class iterator_range ------ Comment on this from Eric Niebler: it's a compiler bug, algorithm/string.hpp causes iterator_range to be declared in boost::algorithm namespace, and range/iterator_range.hpp causes a different iterator_range to be defined in the boost namespace. That's fine, but your compiler doesn't seem to like it. The fix is probably to make the string algorithms use boost::iterator_range instead of defining its own version. ------ /Pavel

2 3

filter_iterator bidirectional traversal patch
by Bob Bell 12 Dec '04

12 Dec '04

Hi boosters- A couple of days ago I started a thread asking about the rationale for making filter_iterator only a forward traversal iterator. I presented some arguments for making filter_iterator bidirectional instead. As some people seemed to be convinced that this was OK, I took the liberty of creating a patch. Oddly enough, the work had almost been completed already -- all that was needed was to make the category bidirectional. Here's the patch: *** filter_iterator.hpp.orig Thu Aug 12 10:13:06 2004 --- filter_iterator.hpp Sun Dec 12 11:24:05 2004 *************** *** 33,39 **** typename iterator_traversal<Iterator>::type , bidirectional_traversal_tag > ! , forward_traversal_tag , use_default >::type > type; --- 33,39 ---- typename iterator_traversal<Iterator>::type , bidirectional_traversal_tag > ! , bidirectional_traversal_tag , use_default >::type > type; Here's the test program I used to verify it: #include <iostream> #include <list> #include <boost/iterator/filter_iterator.hpp> #include <boost/iterator/reverse_iterator.hpp> // simple filter that returns true for even numbers: struct filter { typedef int argument_type; bool operator()(argument_type iArg); }; bool filter::operator()(argument_type iArg) { return (iArg & 1) == 0; } // Simple functions that traverse a sequence and print them: template<typename It> void traverse_forward(It iBegin, It iEnd) { while (iBegin != iEnd) { std::cout << *iBegin << "\n"; ++iBegin; } } template<typename It> void traverse_backward(It iBegin, It iEnd) { while (iBegin != iEnd) { --iEnd; std::cout << *iEnd << "\n"; } } // Show that boost::filter_iterator won't make a forward iterator into a // bidirectional one. typedef boost::filter_iterator<filter, std::istream_iterator<int> > ii; enum { result = boost::is_convertible< boost::iterator_traversal<ii>::type , boost::bidirectional_traversal_tag >::value }; BOOST_STATIC_ASSERT(!result); int main (void) { std::list<int> l; for (int i = 0; i < 10; ++i) l.push_back(i); typedef boost::filter_iterator<filter, std::list<int>::iterator> fi; fi b, e; b = boost::make_filter_iterator(filter(), l.begin(), l.end()); e = boost::make_filter_iterator(filter(), l.end(), l.end()); std::cout << "Using filter_iterator:\n"; std::cout << "\nEven numbers forward:\n"; traverse_forward(b, e); std::cout << "\nEven numbers backward:\n"; traverse_backward(b, e); // Show that filter_iterator works with reverse_iterator: typedef boost::reverse_iterator<fi> ri; std::cout << "\nUsing reverse_iterator with a filter_iterator:\n"; std::cout << "\nEven numbers backward:\n"; traverse_forward(ri(e), ri(b)); std::cout << "\nEven numbers forward:\n"; traverse_backward(ri(e), ri(b)); } Here's the expected output: Using filter_iterator: Even numbers forward: 0 2 4 6 8 Even numbers backward: 8 6 4 2 0 Using reverse_iterator with a filter_iterator: Even numbers backward: 8 6 4 2 0 Even numbers forward: 0 2 4 6 8 Bob

1 0

Solaris 10 x86 - Compiling libboost_python
by Johan Carlstedt 12 Dec '04

12 Dec '04

Hello, I am having problems compiling Boost 1.32 on Solaris 10 X86 with gcc 3.4.1 and Python 2.23. The compilation fails for libboost_python with the error message below. It seems to be a problem with the Boost.Graph library, used by Boost.Python. I have tried with and without "-fpermissive". I would be grateful if anyone was able to advice. With friendly regards, Johan Carlstedt bash-2.05b# bjam "-sTOOLS=gcc" "-sGXX=g++ -fpermissive" install ....found 11612 targets... ....updating 32 targets... gcc-C++-action bin/boost/libs/python/build/libboost_python.so/gcc/debug/shared-linkable- true/inheritance.o In file included from /export/home/johan/boost_1_32_0/libs/python/build/../src/object/inherit ance.cpp:11: /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:441: error: expected identifier before numeric constant /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:441: warning: ISO C++ forbids declaration of `parameter' with no type /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:441: error: expected `>' before numeric constant /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: `VP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: `EP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: `GP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: `EL' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: type/value mismatch at argument 3 in template parameter list for `template<class OutEdgeListS, class VertexListS, class DirectedS, class VertexProperty, class EdgeProperty, class GraphProperty, class EdgeListS> class boost::adjacency_list' /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: expected a type, got `3' /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: template argument 4 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: template argument 5 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: template argument 6 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: template argument 7 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:444: error: `Tag' has not been declared /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:445: error: expected `,' or `...' before '&' token /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:445: warning: ISO C++ forbids declaration of `g' with no type /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:445: warning: ISO C++ forbids declaration of `parameter' with no type /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:445: warning: ISO C++ forbids declaration of `Value' with no type /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp: In function `void boost::set_property(int&, int, int)': /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:446: error: `m_property' has not been declared /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:446: error: request for member of non-aggregate type before ',' token /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:446: warning: there are no arguments to `Tag' that depend on a template parameter, so a declaration of `Tag' must be available /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:446: error: `value' undeclared (first use this function) /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:446: error: (Each undeclared identifier is reported only once for each function it appears in.) /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp: At global scope: /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:449: error: expected identifier before numeric constant /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:449: warning: ISO C++ forbids declaration of `parameter' with no type /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:449: error: expected `>' before numeric constant /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: `VP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: `EP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: `GP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: `EL' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: type/value mismatch at argument 3 in template parameter list for `template<class OutEdgeListS, class VertexListS, class DirectedS, class VertexProperty, class EdgeProperty, class GraphProperty, class EdgeListS> class boost::adjacency_list' /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: expected a type, got `3' /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: template argument 4 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: template argument 5 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: template argument 6 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: template argument 7 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: `Tag' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: template argument 1 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: template argument 2 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: expected init-declarator before '&' token /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:452: error: expected `;' before '&' token /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:457: error: expected identifier before numeric constant /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:457: warning: ISO C++ forbids declaration of `parameter' with no type /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:457: error: expected `>' before numeric constant /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: `VP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: `EP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: `GP' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: `EL' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: type/value mismatch at argument 3 in template parameter list for `template<class OutEdgeListS, class VertexListS, class DirectedS, class VertexProperty, class EdgeProperty, class GraphProperty, class EdgeListS> class boost::adjacency_list' /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: expected a type, got `3' /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: template argument 4 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: template argument 5 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: template argument 6 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: template argument 7 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: `Tag' was not declared in this scope /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: template argument 1 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: template argument 2 is invalid /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: expected init-declarator before '&' token /export/home/johan/boost_1_32_0/boost/graph/adjacency_list.hpp:461: error: expected `;' before '&' token

2 1

Re: [boost] Re: boost::filter_iterator Model
by JOAQUIN LOPEZ MU?Z 12 Dec '04

12 Dec '04

----- Mensaje original ----- De: Sylvain Pion <Sylvain.Pion(a)sophia.inria.fr> Fecha: Domingo, Diciembre 12, 2004 11:23 am Asunto: Re: [boost] Re: boost::filter_iterator Model > On Sun, Dec 12, 2004 at 02:46:12AM +0100, JOAQUIN LOPEZ MU?Z wrote: > > Admittedly, this quote does not state against which > > sequence the complexity must be amortized. From my > > point of view, the intended meaning is that the > > amortization is done wrt to full traversal: otherwise, > > even STL iterators cannot be compliant, as your > > example prove. > > My example prooves it for rb-trees, but they could be made > compliant : > just add a doubly-linked list linking the tree leaves, in parallel > to the > rb-tree, and use it for traversing. > Good catch. This is plain constant time, which leaves the question of what "amortized" meant in the first place. (Incidentally, you can get this in Boost.MultiIndex if you combine an ordered and a sequenced index.) > > > PS: I think the std is rather sloppy in this issue. > > I agree. > > -- > Sylvain > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

Re: [boost] Re: boost::filter_iterator Model
by JOAQUIN LOPEZ MU?Z 12 Dec '04

12 Dec '04

----- Mensaje original ----- De: Sylvain Pion <Sylvain.Pion(a)sophia.inria.fr> Fecha: Sábado, Diciembre 11, 2004 11:25 pm Asunto: Re: [boost] Re: boost::filter_iterator Model [...] > > I can't find anything in the standard that says that the cost > should be > amortized over the full traversal of the std::set. The only reference I'm aware of about complexity guarantees for iterators is in [lib.iterator.requirements], 24.1.8: "All the categories of iterators require only those functions that are realizable for a given category in constant time (amortized). Therefore, requirement tables for the iterators do not have a complexity column." Admittedly, this quote does not state against which sequence the complexity must be amortized. From my point of view, the intended meaning is that the amortization is done wrt to full traversal: otherwise, even STL iterators cannot be compliant, as your example prove. When working with infinite sequences, "full traversal" does not make sense, but it's obvious how to cover this case with limit considerations. Maybe this is a good question for comp.std.c++? Joaquín M López Muñoz Telefónica, Investigación y Desarrollo PS: I think the std is rather sloppy in this issue. > And it's possible to find sub-ranges which take non-bounded > average time > to traverse, when the size of the std::set increases : > - take the range [ (begin+end)/2 - n ; (begin+end)/2 + n ] in an > std::set of size() = 2^(2^n). This is a sequence of ranges of > size 2n, and which > take at least O(2^n) to traverse, and so definitely not constant > time amortized [over the length of the range]... > > When considering an amortized cost/complexity, it refers to sequences, > whose lengths grow to infinity, but here nothing specifies which > sequenceswe are considering. And if you allow any kind of > infinite sequences, then > set::iterator does not have the required complexity, from the > example above :( > > What am I missing ? > > -- > Sylvain > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

2 1