December 2004 - Boost - lists.preview.boost.org

patch: Boost.DateTime wide string conversion in MSVC6
by Davlet Panech 13 Dec '04

13 Dec '04

Added missing int64_t to wide string conversion for MSVC6. --- boost/date_time/posix_time/time_formatters.hpp.orig 2004-12-13 14:52:15.054188600 -0500 +++ boost/date_time/posix_time/time_formatters.hpp 2004-12-12 17:42:54.000000000 -0500 @@ -6,7 +6,7 @@ * Boost Software License, Version 1.0. (See accompanying * file LICENSE-1.0 or http://www.boost.org/LICENSE-1.0) * Author: Jeff Garland, Bart Garst - * $Date: 2004/11/04 12:28:49 $ + * $Date: 2004/10/29 06:27:24 $ */ #include "boost/date_time/gregorian/gregorian.hpp" @@ -26,6 +26,20 @@ namespace boost { namespace posix_time { + +#if (defined(BOOST_MSVC) && (_MSC_VER <= 1200)) // 1200 == VC++ 6.0 + namespace detail { + template <typename charT> struct convert_int64; + template <> struct convert_int64<char> { + static char *convert (char *buff, boost::int64_t i) + { return _i64toa(i, buff, 10); } + }; + template <> struct convert_int64<wchar_t> { + static wchar_t *convert (wchar_t *buff, boost::int64_t i) + { return _i64tow(i, buff, 10); } + }; + } +#endif // template function called by wrapper functions: // to_*_string(time_duration) & to_*_wstring(time_duration) @@ -69,7 +83,7 @@ date_time::absolute_value(td.fractional_seconds()); // JDG [7/6/02 VC++ compatibility] charT buff[32]; - _i64toa(frac_sec, buff, 10); + detail::convert_int64<charT>::convert(buff, frac_sec); #else time_duration::fractional_seconds_type frac_sec = date_time::absolute_value(td.fractional_seconds()); @@ -138,7 +152,7 @@ date_time::absolute_value(td.fractional_seconds()); // JDG [7/6/02 VC++ compatibility] charT buff[32]; - _i64toa(frac_sec, buff, 10); + detail::convert_int64<charT>::convert(buff, frac_sec); #else time_duration::fractional_seconds_type frac_sec = date_time::absolute_value(td.fractional_seconds());

1 0

patch: Boost.DateTime with MSVC6/STLport IOStreams
by Davlet Panech 13 Dec '04

13 Dec '04

Workaround for an internal compiler error in VC6 when compiled with STLport iostreams. --- boost/date_time/date_formatting.hpp.orig 2004-12-13 14:09:35.404548400 -0500 +++ boost/date_time/date_formatting.hpp 2004-12-12 17:42:53.000000000 -0500 @@ -27,7 +27,16 @@ template<class month_type, class format_type, class charT=char> class month_formatter { - public: +// Workaround for ICE in MSVC 6 when building with STLport IOstreams +#if defined (BOOST_MSVC) && BOOST_MSVC <= 1200 && \ + (defined(__SGI_STL_PORT) || defined(_STLPORT_VERSION)) && \ + !defined (_STLP_NO_OWN_IOSTREAMS) + private: + typedef std::basic_ostream<charT> _ostream_type; + public: + static _ostream_type &format_month(const month_type& month, _ostream_type &os) +#else + public: //! Formats a month as as string into an ostream /*! This function demands that month_type provide * functions for converting to short and long strings @@ -35,6 +44,7 @@ */ static std::basic_ostream<charT>& format_month(const month_type& month, std::basic_ostream<charT>& os) +#endif { switch (format_type::month_format()) {

1 0

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

13 Dec '04

> From: David Abrahams > Ferdinand Prantl wrote: > >> 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 > > That's what I mean. I used the built-in unzipper in the Win > XP file manager. OK, I tried it with the WinXP extractor in the explorer (I used the copy&paste files method). It estimated at first 25 minutes, after a minute only 9 minutes and it finished after 20 minutes, wonderful... ;-) My machine is P4 2 GHz with 80 GB seagate / 2MB cache Norton antivirus and unbelievably messed up Windows installation ;-) Just to display the archive content (like a folder content) takes relatively long. I am not sure why but I would guess that it could be in the implementation of the shell namespace extension for archives in windows xp. It can be quite expensive to build the structure of shell item nodes for every file/folder in the archive, if the archive contains so many items. They should be created on demand, I faced the problem in my shell extension too. But without the source code I cannot guess. For example WinRAR shell extension "Extract Here" extracts the zip file quick - 2 minutes (it has no explore option, it is only a context menu shell extension) and I believe WinZIP or 7ZIP will have similar results. Btw., rd /q/s xxx is also faster that deleting using the explorer. I understand, that the zip distribution is primarily for the windows users and such slowness is painful. Nevertheless, a crappy implementation of some plugin in OS would annoy only the users who use it, the others can follow the recommendation from the boost download page, and download an alternative unzipping tool, for example from the info-zip site. There is no problem in the zipped file, it's just too big :-) An alternative would be a self-extracting archive, which can be produced by some free tools as well. Ferda

1 0

[Boost-bugs] [ boost-Support Requests-1084615 ] spirit: run-time error
by SourceForge.net 13 Dec '04

13 Dec '04

Support Requests item #1084615, was opened at 2004-12-13 20:40 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1084615&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Alessio Marchetti (bnf) Assigned to: Nobody/Anonymous (nobody) Summary: spirit: run-time error Initial Comment: I am using the Spirit library v1.8.1, part of Boost 1.32. Here is a test case which fails at run-time: I get a VC++ Debug Library Error in file core\non-terminal\impl\rule.ipp at line 173. My compiler is VC++ 7.1 on Windows XP SP2. In particular I get a Run-Time Check Failure #2: Stack around the variable 'context-wrap' was corrupted. Any idea about what can be the problem? Please note that with the following I don't get any error: definition(const JSIGrammar& self) { Rule_T pp_token = real_p r = ch_p('#') >> str_p("line") >> +(pp_token); } struct JSIGrammar : public grammar<JSIGrammar> { template <typename ScannerT> struct definition { typedef rule<ScannerT> Rule_T; definition(const JSIGrammar& self) { Rule_T pp_number = real_p; Rule_T pp_token = pp_number; r = ch_p('#') >> str_p("line") >> +(pp_token); } const Rule_T& start() const { return r; } Rule_T r; }; }; int main(int argc, char* argv[]) { string str; { ifstream in(argv[1]); ostringstream out; out << in.rdbuf(); str = out.str(); } typedef parse_info<string::iterator> Info; JSIGrammar g; Info pi = parse(str.begin(), str.end(), g, space_p); if ( pi.hit ) { cout << "Match" << endl; cout << "Full: " << (pi.full ? "Yes" : "No") << endl; cout << "Length: " << pi.length << endl; } else { cout << "No match" << endl; } return 0; } ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1084615&group_… ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://productguide.itmanagersjournal.com/ _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

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

[Boost-bugs] [ boost-Bugs-1083760 ] Error in msvc in building inheritance.obj to build hello.pyd
by SourceForge.net 12 Dec '04

12 Dec '04

Bugs item #1083760, was opened at 2004-12-12 01:56 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1083760&group_… Category: Python Group: None Status: Open Resolution: None Priority: 5 Submitted By: AIM (andre_mikulec) Assigned to: David Abrahams (david_abrahams) Summary: Error in msvc in building inheritance.obj to build hello.pyd Initial Comment: Error in msvc in building inheritance.obj to build hello.pyd Hello, I am trying to build the boost 1.31.0 sample extension hello.cpp. I can not compile the file inheritance.cpp because the two files containing some templates: adjacency_list.hpp and mem_fn.hpp can not compile. Does anyone have any solutions? Instead of Visual C++ 6.0 should I use a different compiler? Anyone have any success on any other compiler? Did anyone manage to build a hello.pyd? Thank you very much. Here is my script below (with embedded results). rem I have MSVC 6.0 Service Pack 5 on Windows 2000 Service Pack 3 default installs on F: rem Python is located in F:\Python23 rem Boost is located in W:\boost_1_31_0 rem MSVC stlPort 4.6.2 installed, compiled and rem VC studio include dirs and libraries dirs configured to use it. rem build boost.jam (so I have a bjam.exe for all below) W: vcvars32.bat cd W:\boost_1_31_0\tools\build\jam_src rem below since I have multilple toolsets installed I will always be specific. .\build.bat msvc rem result: 2 minutes later: NO WARN NO ERRORS dir W:\boost_1_31_0\tools\build\jam_src\bin.ntx86\* rem result: OK I have *jam*.exe executables: bjam.exe jam.exe mkjambase.exe yyacc.exe rem build boost (using boost.jam (bjam from above)) W: vcvars32.bat set PYTHON_ROOT=F:\Python23 set PYTHON_VERSION=2.3 set PATH=%PATH%;W:\boost_1_31_0 \tools\build\jam_src\bin.ntx86 rem APPEND THE BJAM PATH ABOVE TO THE SYSTEM ENVRONMENT VARIABLE PATH cd W:\boost_1_31_0 rem below since I have multilple toolsets installed I will always be specific. bjam "-sTOOLS=msvc" install rem about 90 minutes later ERROR RESULTS FOLLOW: <<< errors.txt contents below >>> cl /Zm800 -nologo -GX -c -DNDEBUG -DNDEBUG - DBOOST_PYTHON_DYNAMIC_LIB - DBOOST_PYTHON_SOURCE /Ogity /O2 /Gs /Ob2 /GX /GR /MD -I"bin\boost\libs\python\build" - I"W:\boost_1_31_0" -I"F:\Python23\include" - I"F:\Program Files\Microsoft Visual Studio\VC98 \Include" - Fo"bin\boost\libs\python\build\boost_python.dll\msvc\rele ase\inheritance.obj" -Tp"W:\boost_1_31_0 \libs\python\build\../src/object/inheritance.cpp" rem error below results below ... F:\Program Files\Microsoft Visual Studio\VC98 \Bin>cl /Zm800 -nologo -GX -c -DNDEBUG -DNDEBUG - DBOOST_PYTHON_DYNAMIC_LIB - DBOOST_PYTHON_SOURCE /Ogity /O2 /Gs /Ob2 /GX /GR /MD -I"bin\boost\libs\python\build" - I"W:\boost_1_31_0" -I"F:\Python23\include" -I"F:\Program Files\Microsoft Visual Studio\VC98 \Include" - Fo"bin\boost\libs\python\build\boost_python.dll\msvc\rele ase\inheritance.obj" -Tp"W:\boost_1_31_0 \libs\python\build\../src/object/inheritance.cpp" inheritance.cpp W:\boost_1_31_0\boost/graph/detail/adjacency_list.hpp (1055) : error C2244: 'bidirectional_graph_helper_with_property<Config >::remove_edge' : unable to resolve function overload W:\boost_1_31_0\boost/graph/detail/adjacency_list.hpp (1057) : error C2954: template definitions cannot nest W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2039: 'dm' : is not a member of '_mfi' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2143: syntax error : missing ';' before '<' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2501: 'dm' : missing storage-class or type specifiers W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2059: syntax error : ';' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2059: syntax error : '<' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2653: 'T' : is not a class or namespace name W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2645: no qualified name for pointer to member (found ':: *') W:\boost_1_31_0\boost/mem_fn.hpp(320) : error C2143: syntax error : missing ';' before '}' W:\boost_1_31_0\boost/mem_fn.hpp(320) : fatal error C1506: unrecoverable block scoping error F:\Program Files\Microsoft Visual Studio\VC98\Bin> W:\boost_1_31_0\boost/graph/detail/adjacency_list.hpp (1055) : error C2244: 'bidirectional_graph_helper_with_property<Config >::remove_edge' : unable to resolve function overload W:\boost_1_31_0\boost/graph/detail/adjacency_list.hpp (1057) : error C2954: template definitions cannot nest rem the problem area in adjacency_list.hpp is here ... template <class Config> inline void bidirectional_graph_helper_with_property<Config>::remov e_edge(typename Config::edge_descriptor e) { typedef typename Config::graph_type graph_type; graph_type& g = static_cast<graph_type&>(*this); boost::remove_edge(source(e, g), target(e, g), *this); } // O(E/V) or O(log(E/V)) template <class EdgeOrIter, class Config> inline void remove_edge(EdgeOrIter e, bidirectional_graph_helper_with_property<Config>& g_) { g_.remove_edge(e); } W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2039: 'dm' : is not a member of '_mfi' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2143: syntax error : missing ';' before '<' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2501: 'dm' : missing storage-class or type specifiers W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2059: syntax error : ';' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2059: syntax error : '<' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2653: 'T' : is not a class or namespace name W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2645: no qualified name for pointer to member (found ':: *') W:\boost_1_31_0\boost/mem_fn.hpp(320) : error C2143: syntax error : missing ';' before '}' W:\boost_1_31_0\boost/mem_fn.hpp(320) : fatal error C1506: unrecoverable block scoping error rem The problem area in mem_fn.hpp is here ... creating a template class at the end of mem_fn.hpp template<class R, class T> _mfi::dm<R, T> mem_fn(R T::*f) { return _mfi::dm<R, T>(f); } } // namespace boost rem build hello world W: vcvars32.bat set PYTHON_ROOT=F:\Python23 set PYTHON_VERSION=2.3 set PATH=%PATH%;W:\boost_1_31_0 \tools\build\jam_src\bin.ntx86 rem APPEND THE BJAM PATH ABOVE TO THE SYSTEM ENVRONMENT VARIABLE PATH cd W:\boost_1_31_0\libs\python\example\tutorial bjam -sTOOLS=msvc The results are as follows W:\boost_1_31_0\libs\python\example\tutorial>bjam - sTOOLS=msvc ...found 1978 targets... ...updating 7 targets... vc- C++ ..\..\..\..\bin\boost\libs\python\build\boost_python.d ll\msvc\debug\inheritance.obj inheritance.cpp W:\boost_1_31_0\boost/graph/detail/adjacency_list.hpp (1055) : error C2244: 'bidirectional_graph_helper_with_property<Config >::remove_edge' : unable to resolve function overload W:\boost_1_31_0\boost/graph/detail/adjacency_list.hpp (1057) : error C2954: template definitions cannot nest W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2039: 'dm' : is not a member of '_mfi' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2143: syntax error : missing ';' before '<' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2501: 'dm' : missing storage-class or type specifiers W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2059: syntax error : ';' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2059: syntax error : '<' W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2653: 'T' : is not a class or namespace name W:\boost_1_31_0\boost/mem_fn.hpp(315) : error C2645: no qualified name for pointer to member (found ':: *') W:\boost_1_31_0\boost/mem_fn.hpp(320) : error C2143: syntax error : missing ';' before '}' W:\boost_1_31_0\boost/mem_fn.hpp(320) : fatal error C1506: unrecoverable block scoping error "cl" /Zm800 -nologo -GX -c - DBOOST_PYTHON_DYNAMIC_LIB - DBOOST_PYTHON_SOURCE /Z7 /Od /Ob0 /GX /GR /MDd -I"..\..\..\..\bin\boost\libs\python\build" - I"W:\boost_1_31_0" -I"F:\Python23\include" - I"F:\PROGRA~1\MICROS~3\VC98\include" -Fo"..\..\..\.. \bin\boost\libs\python\build\boost_python.dll\msvc\debug \inheritance.obj" -Tp"W:\boost_1_31_0 \libs\python\build\../src/object/inheritance.cpp" ...failed vc- C++ ..\..\..\..\bin\boost\libs\python\build\boost_python.d ll\msvc\debug\inheritance.obj... ...skipped <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.CMD for lack of <@boost!libs!python! build\boost_python.dll\msvc\debug>inheritance.obj... ...skipped <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.dll for lack of <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.CMD... ...skipped <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.lib for lack of <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.CMD... ...skipped <@boost!libs!python!example! tutorial\hello.pyd\msvc\debug>hello.CMD for lack of <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.lib... ...skipped <@boost!libs!python!example! tutorial\hello.pyd\msvc\debug>hello.pyd for lack of <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.dll... ...skipped <@boost!libs!python!example! tutorial\hello.pyd\msvc\debug>hello.lib for lack of <@boost!libs!python! build\boost_python.dll\msvc\debug>boost_python.dll... ...failed updating 1 target... ...skipped 6 targets... W:\boost_1_31_0\libs\python\example\tutorial>dir hello*.* rem results: ALL hello.CMD hello.pyd hello.lib NOT FOUND Any Ideas about a possible solution? AIM Andre_Mikulec(a)Hotmail.com ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=107586&aid=1083760&group_… ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://productguide.itmanagersjournal.com/ _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

[thread] Why is there a restriction for the runtime libraries?
by Stefan Slapeta 12 Dec '04

12 Dec '04

There are two restrictions in the thread jamfile I don't understand: - the thread lib must be built with static runtime libraries - the thread dll must be built with dynamic runtime libraries What is the reason for that? Why can't I use the shared rt and link boost.thread statically (and vice versa)??? Stefan

5 19

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

11 Dec '04

Hi Dave, ----- Mensaje original ----- De: David Abrahams <dave(a)boost-consulting.com> Fecha: Sábado, Diciembre 11, 2004 9:01 pm Asunto: [boost] Re: boost::filter_iterator Model [...] > Is that the right way to understand the complexity guarantee? > I'm really asking. Consider std::set. As the size of the set > grows, the > average cost of incrementing an iterator grows without bound. This is not correct, IMHO. Consider a set::iterator doing a full traversal from begin to end. From the rb-tree point of view, this is equivalent to visiting the whole tree in an inorder fashion. And it is easy to see that every node will get hopped from at most three times: - when visiting its left subtree. - when visiting its right subtree. - when leaving to an upper level. So the total number of hops is bounded by 3*N, and the average cost of incrementing is constant, which is the same as to say that increment complexity is amortized constant, as required by the std. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

2 1

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

11 Dec '04

----- Mensaje original ----- De: David Abrahams <dave(a)boost-consulting.com> Fecha: Sábado, Diciembre 11, 2004 9:01 pm Asunto: [boost] Re: boost::filter_iterator Model [...] > > >> Is that stretching the definition of an iterator? I'm not sure. > > > > That's too much for me. > > I tend to think that it's stretching what users might expect > when they see > > "constant time amortized operation". > > This is tricky territory. It certainly warrants a note in the > documentation, but I'm not exactly sure what to say. I'm afraid that, generally speaking, filter_iterator<> cannot just guarantee the std-required complexity, and you cannot do anything about it (consider for instance filter_iterator<is_prime<int>, counting_iterator<int> >) To say it bluntly, not all instantiations of filter_iterator<> are iterators. I'd just say it so: "std-mandated complexity guarantees are provided only if the number of skipped elements divided by the length of the base range remains constant in average." Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

boost::filter_iterator Model
by Bob Bell 11 Dec '04

11 Dec '04

Hi- I was wondering what the rationale was for boost::filter_iterator not modeling anything more than a forward traversal iterator. Recently I was trying to use filter_iterator in a situation where I needed bidirectional traversal, but got stymied by this. Is there something about the notion of filtering that precludes bidirectionality? Or is this something that could be made to work? Thanks, Bob

4 8

Sandbox file vault.
by Rene Rivera 11 Dec '04

11 Dec '04

As I mentioned in some earlier post.. I set up file vault are in the Boost-Sandbox web space: http://boost-sandbox.sourceforge.net/vault/ It works much like the Yahoo files area used to work. It's read only for everyone, and read-write if you "register". Registration is not closed or anything and is only there to verify that it's a real person, or as close as email verification can get, uploading files. NOTE: It seems a bit sluggish. Don't know if it's SF or the scripts. But I would suspect the scripts. If you need admin access email me. -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org - grafik/redshift-software.com - 102708583/icq

2 6

logos
by David Abrahams 11 Dec '04

11 Dec '04

For a while there, we were having such fun posting proposed logo designs; there were easily 20 posts a day on the topic. I requested that the local posting stop so we could run a contest "for real," that would include the wider C++ community, and solicited a contest manager, but so far nobody has stepped forward. It would be a real shame if Boost ended up with no new logo or an inferior logo just because of that. Really, for some of you who've been very involved with the previous flurry of posts, this job shouldn't occupy much more time than you were already going to spend on it. Someone just has to: 1. write up a voting system 2. modify the wiki page to reflect recent requirements consensus 3. post an announcement 4. tally the results Rene has already established a great "head start" by setting up the Wiki page. Isn't there anyone out there who's willing to perform this valuable service to the Boost community? Don't make me start emailing individuals to prod them ;-) -- Dave Abrahams Boost Consulting http://www.boost-consulting.com

6 5

[smart cont.] Const semantics in boost::ptr_map vs. std::map
by Eelis van der Weegen 11 Dec '04

11 Dec '04

Two issues: (1.) I stumbled upon a strange inconsistency in boost::ptr_map's iterator interface. I've attached some demonstration code that shows the problem. (2.) Given a (nonempty) const std::map<X, Y*> object, it is possible to retrieve a Y& from it. Given a const boost::ptr_map<X, Y> object, it is not possible (without casting) to retrieve a Y& from it. Thus, it is not possible (in general) to refactor code which uses a std::map<X, Y*> combined with manual ptr_map-like lifetime/ownership management to use a boost::ptr_map<X, Y> without changing const semantics. Was this effect intentional? If so, why was this approach chosen? It seems like ptr_map attempts to "hide" the level of indirection that a standard container of pointers has. While this may be desirable, I think it should be mentioned in the documentation since it can come as a surprise to people (like me) who actually try to perform the refactoring mentioned above. Eelis #include <map> #include <boost/smart_container/ptr_map.hpp> typedef std::map<int, int *> M; typedef boost::ptr_map<int, int> N; void f (M & m) { M::iterator i = m.begin(); M::iterator const ci = i; int & a = *(i->second); // ok int & b = *(ci->second); // ok } void g (N & n) { N::iterator i = n.begin(); N::iterator const ci = i; int & a = *i; // ok int & b = *ci; // error: invalid initialization of reference of type 'int&' from expression of type 'const int' }

2 4

auto-link, DLLS and exported constants
by Robert Ramey 11 Dec '04

11 Dec '04

I'm trying to implement auto-link and build static versions of the serialization libraries. It seems I'm making progress but I'm sort of stuck on one point right now. one my header files now contains: extern BOOST_SERIALIZATION_DECL const char * ARCHIVE_SIGNATURE; extern BOOST_SERIALIZATION_DECL unsigned int ARCHIVE_VERSION; while the corresponding implemenation file contains: /////////////////////////////////////////////////////////////////////// // constants used in archive signature //This should never ever change. note that is not an std::string // string. BOOST_SERIALIZATION_DECL const char * ARCHIVE_SIGNATURE = "serialization::archive"; // this should change if the capabilities are added to the library // such that archives can be created which can't be read by previous // versions of this library // 1 - initial version // 2 - made address tracking optional // 3 - numerous changes - can't guarentee compatibility with previous versions BOOST_SERIALIZATION_DECL unsigned int ARCHIVE_VERSION = 3; When I link an executable with the static library things work fine. When I link with the dll import library I get errors indicating undefined symbols for these const variables. What is recommended here? Robert Ramey

2 1

[Boost-bugs] [ boost-Support Requests-1083024 ] Boost Library Unknown compiler version
by SourceForge.net 10 Dec '04

10 Dec '04

Support Requests item #1083024, was opened at 2004-12-10 08:47 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1083024&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: Boost Library Unknown compiler version Initial Comment: I have used the Boost Library (boost_1_32_0) until this afternoon, when my system was updated. Now the c++ version 3.4.2 is installed and I'm not able to compile anymore. I tried to run ./configure script and move the user.cpp file in the config directory, but I din't solve the problem. ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1083024&group_… ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://productguide.itmanagersjournal.com/ _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

typeof integrated
by Arkadiy Vertleyb 10 Dec '04

10 Dec '04

Hi all, Peder and I have put together a combined version of our typeof implementations. The integrated library supports both compliant and vintage compilers, and can be found in the Boost sandbox CVS (boost/typeof, libs/typeof) or at: http://groups.yahoo.com/group/boost/files/typeof_integrated.zip As always, any comments are most welcome. Regards, Arkadiy

6 38