- Boost - lists.preview.boost.org

[repost][multi_index][serialization][Huang-Vista-x86_32_intel] Help with weird test failure
by joaquin＠tid.es 21 Sep '09

21 Sep '09

Hi, my first attempt went unanswered, reposting in the hope it'll bring more attention this time around: Huang-Vista-x86_32_intel toolset, which runs Intel 11.1 for Window, has this weird error on the serialization test for Boost.MultiIndex: Running 1 test case... ../libs/multi_index/test/test_serialization_template.hpp(82): error in "test_main_caller( argc, argv )": check all_indices_equal(m,m2) failed unknown location(0): fatal error in "test_main_caller( argc, argv )": std::exception: invalid signature (http://tinyurl.com/nd89x2 ) What I find weird is the throwing of invalid_signature, a Boost.Serialization exception that, according to docs, indicates that the beginning of a serialization file is not correct. I can't see how a problem with serializing multi_index_containers can lead to a file signature error. Any clue? Maybe the toolset maintainer can run this manually and provide more info? Thank you in advance, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[Foreach] Proposal to simplify using Boost.Foreach with maps
by Chris Purcell 20 Sep '09

20 Sep '09

As documented in the manual ("Pitfalls"), BOOST_FOREACH is a little awkward to use with associative containers. I've used the following in the past to simplify my own code, and wondered if it was suitable to add to the Boost Foreach library proper. std::map<int, int> my_map; BOOST_FOREACH_PAIR(int key, int value, my_map) std::cout << key << " : " << value << "\n"; The BOOST_FOREACH_PAIR macro is a clone of the BOOST_FOREACH macro with an extra for loop in it to assign both first and second from each pair in the map. If either is not wanted, ignore from Boost.Tuples can be used: std::vector<int> values; BOOST_FOREACH(boost::tuples::ignore, int value, my_map) values.push_back(value); References can be used just as with BOOST_FOREACH, to create a modifying loop: BOOST_FOREACH_PAIR(int key, int& value, my_map) value += key; There are a few alternatives to my solution that I have seen: (1) Predeclare a pair and use it each time around the loop: std::pair<int, int> kv; BOOST_FOREACH(kv, my_map) std::cout << kv.first << " : " << kv.second << "\n"; This adds overhead from copying pairs, and does not give meaningful names to the two halves of the pair. It also has no simple extension to a mutating loop that I am aware of. (2) Typedef the value type of the map before the loop, and use .first and .second: typedef std::pair<const int, int> KeyValue; BOOST_FOREACH(KeyValue const& kv, my_map) std::cout << kv.first << " : " << kv.second << "\n"; This removes the copying overhead, and is easy to change to a mutating loop, but still does not meaningfully name the key and value (3) Use Boost.Tuple's tie to turn the single assignment of BOOST_FOREACH into a double assignment: int key, value; BOOST_FOREACH(boost::tie(key, value), my_map) std::cout << key << " : " << value << "\n" This gives meaningful names, but has copying overhead (albeit not in this simple example). It also has no simple extension to a mutating loop that I am aware of. The key objection to all of these alternatives, from my point of view, is simply that they are unnecessarily complicated. The new macro is much cleaner. Implementation of BOOST_FOREACH_PAIR is simple: turn the innermost assignment loop of BOOST_FOREACH into a pair of loops, one assigning key, one value. Cheers, Chris Purcell

6 11

[polygon] late review
by Gordon Woodhull 20 Sep '09

20 Sep '09

Hi all, Sorry this is late - I intended to participate in the discussion, but the review schedule happened to intersect with an offline vacation. (Plus day job, school starting, etc.) Thank you, Luke, for submitting what I think is a very good start toward a Boost geometry library. I do not think the library is ready for inclusion in Boost at this time, but I believe it will be with further improvements. I would almost vote for acceptance with conditions, but the list is long and I think the concepts merit more discussion. Unfortunately I have not had time to take an in-depth look at the library; I have read some of the documentation and examples and it looks useable. So this is mostly a non-technical review of the issues raised by others. Also I offer a bit of "meta-review" of the review process for libraries that will continue to evolve and merge with other libraries. My application domain is mainly graph drawing (network visualization) but I might also use this in 2D screen graphics and games. For these purposes, the restriction to two dimensions is acceptable, and even the restriction to integer coordinates is mostly acceptable. However, I think the library name should reflect these restrictions. It will be some time (if ever) before a library can claim to be The geometry or polygon library. Boost has no merge process (if that's even possible), and neither Polygon nor GGL subsumes the other, so I think they should eventually be accepted in parallel, and merge concepts and algorithms over time. As I see it, this library provides two major contributions: 1. A set of concepts for VLSI and other 45/90 degree applications which can in the future be extended or bridged to other geometric problem domains, e.g. GIS, 3D, n-dimensional. 2. An extremely robust and (I believe) efficient polygon intersection algorithm. The interface still needs some work, but the concepts are a valuable first pass at defining this domain. I want to see some system of libraries that supports rectangles through arcs all the way up to splinegons. This isn't that, but I am patient. I will be interested to compare the advantages of concepts for polygons with holes versus the runtime version in GGL. I don't agree that accepting a library where the concepts/interface are incomplete or even wrong will pollute a future generalized geometry library. This library will just have to improved over time, and influenced by libraries from other domains. To mention just one specific interface problem: I don't like rect - int meaning shrink the rectangle. I think that everyone is going to have strong opinions about what operators they like and dislike and I hope that some future geometry library will allow choosing different sets for different domains. The intersection algorithm is very, very cool and I hope the ideas can be extended someday by someone to provide robust intersection of arcs and splines. I don't yet understand whether this is possible. I agree with those who would like to see lazier evaluation to run the intersection algorithm on as much as possible. Luke and Barend, I'm sorry but I don't believe either of your benchmarks. I think you are choosing problems that suit each of your libraries. This is understandable, but we will need to build a comprehensive suite of examples from many different domains to learn which algorithms are actually faster in which situations. Meta-review I admire the Boost process for protecting authorial control over libraries. However, one consequence is that two very important requirements, maintenance and cooperation, are only ensured indirectly by vigorous debate. 1. Maintenance. This is not really addressed by the Boost rules or review process, except to remind authors that they will be responsible for maintenance or for finding a new maintainer. There is no way to compel authors to respond to their users except for the threat of library removal which IIUC has almost never happened. So one of my essential criteria in reviewing a library - I've only reviewed one other library but followed many other reviews closely - is the attitude of the author toward changes requested. Users are inevitably going to have new requirements. Luke definitely seems willing to make the changes that are needed to get this into Boost, and I trust that he'll continue to help it adapt. I am slightly concerned that Intel will not allow the library to depend on Boost because I think that will slow down improvement. In particular I think operator customization and lazy evaluation would be helped by using Proto. I hope Intel will allow this. Or maybe that's the scope of a different library. 2. Cooperation. Boost has no rules or process for making libraries work together, never mind merging them. Maybe there is some work to be done here. But people will naturally want to make their libraries compatible if they're under the same umbrella. Competition is also a healthy human drive, but it's especially productive when there is some basis of cooperation, as I think there is between Luke and Barend, despite how nerves may have frayed during this review. I hope that both libraries are accepted, when ready, and that the authors and others interested in a "universal" Boost geometry library work to find the commonalities and connections. Fervently waiting, Gordon

2 2

Formal Review: Boost.Polygon starts today August 24, 2009
by Fernando Cacciola 20 Sep '09

20 Sep '09

Dear Developers, The formal review of the Boost.Polygon library by Lucanus Simonson starts today, August 24, 2009 and will finish September 2, 2009. I really hope to see your vote and your participation in the discussions on the Boost mailing lists! --------------------------------------------------- About the library: The boost polygon library provides algorithms focused on manipulating planar polygon geometry data. Specific algorithms provided are the polygon set operations (intersection, union, difference, disjoint-union) and related algorithms such as polygon connectivity graph extraction, offsetting and map-overlay. These so-called Boolean algorithms are of significant interest in GIS (Geospatial Information Systems), VLSI CAD as well al other fields of CAD, and many more application areas, and providing them is the primary focus of this library. The polygon library is not intended to cover all of computational geometry in its scope, and provides a set of capabilities for working with coordinates, points, intervals and rectangles that are needed to support implementing and interacting with polygon data structures and algorithms. Specifically, 3d and non-Cartesian/non-planar geometry is outside of the scope of the polygon library The design philosophy behind the polygon library was to create an API for invoking the library algorithms it provides on user geometry data types that is maximally intuitive, minimally error-prone and easy to integrate into pre-existing applications. C++-concepts based template meta-programming combined with generic operator overloading meets these design goals without sacrificing the runtime or memory efficiency of the underlying algorithms. This API makes the following code snippet that operates on non-library geometry types possible: void foo(list<CPolygon>& result, const list<CPolygon>& a, const list<CPolygon>& b, int deflateValue) { CBoundingBox domainExtent; using namespace boost::polygon::operators; boost::polygon::extents(domainExtent, a); result += (b & domainExtent) ^ (a - deflateValue); } The source is available at http://svn.boost.org/svn/boost/sandbox/gtl/boost/polygon/ And the documentation is at http://svn.boost.org/svn/boost/sandbox/gtl/doc/index.htm --------------------------------------------------- Please always state in your review, whether you think the library should be accepted as a Boost library! Additionally please consider giving feedback on the following general topics: - What is your evaluation of the design? - What is your evaluation of the implementation? - What is your evaluation of the documentation? - What is your evaluation of the potential usefulness of the library? - Did you try to use the library? With what compiler? Did you have any problems? - How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? - Are you knowledgeable about the problem domain? Best Regards Fernando Cacciola Review Manager

30 142

SQL client library ?
by Jean-Louis Leroy 19 Sep '09

19 Sep '09

What's the situation with SQL client libraries (similar to Rogue Wave's DBTools.h++) ? I know that there's a boost_sql_cli in the Vault, but it doesn't seem to make much progress. I have also heard about plans to bring Soci into Boost. Thanks, Jean-Louis

19 42

Error building Boost.MPI on WinXP with MPICH2
by Craig Henderson 19 Sep '09

19 Sep '09

I am trying to build Boost.MPI for the first time. I've downloaded and installed MPICH2 on my Windows XP machine, and added "using mpi ;" to tools/build/v2/user-config.jam file, and the mpich2/bin to the path. When I run bjam, I get the following output. ------------------------------------------------------ C:\root\Development\Library\Boost\boost_1_39_0>..\bjam --with-mpi The system cannot find the path specified. The system cannot find the path specified. The system cannot find the path specified. MPI auto-detection failed: unknown wrapper compiler mpic++ Please report this error to the Boost mailing list: http://www.boost.org You will need to manually configure MPI support. WARNING: No python installation configured and autoconfiguration failed. See http://www.boost.org/libs/python/doc/building.html for configuration instructions or pass --without-python to suppress this message and silently skip all Boost.Python targets Building C++ Boost. ------------------------------------------------------ The environment runs for building all other Boost libraries. Any ideas what's wrong or how to diagnose the problem? Thanks -- Craig Craig Henderson http://www.craighenderson.co.uk http://www.siteupdatenotification.com

1 0

cannot pass objects of non-POD type ‘class boost::detail::shared_count’ through ‘...’; call will abort at runtime
by Dave Steffen 19 Sep '09

19 Sep '09

Hi Folks [ Sorry if this gets posted twice; my company email server changed my email address, and I think my first post got bounced. Argh.] Just tried to compile my project with GCC 4.3 and Boost 1.40. (It compiles and works just fine with Boost 1.38.) As part of a home-built thread-locking shared pointer thing, we have this code: /// Constructor from pointer to complete type template<class Y> explicit shared_locking_ptr( Y * p ): px( p ), pn( p ) // Y must be complete { boost::detail::sp_enable_shared_from_this( pn, p, p ); } which now produces this result: ../util/thread/shared_locking_ptr.hpp:57:9: warning: cannot pass objects of non-POD type ‘class boost::detail::shared_count’ through ‘...’; call will abort at runtime In Boost 1.38, the relevent code in shared_ptr.hpp was this AFAICT: #ifdef _MANAGED [ ... ] #else // _MANAGED [...] inline void sp_enable_shared_from_this( shared_count const & /*pn*/, ... ) { } #endif // _MANAGED In 1.40, it's been changed to #ifdef _MANAGED [...] #else // _MANAGED inline void sp_enable_shared_from_this( ... ) { } #endif // _MANAGED Does anyone know why the change? Has anybody else seen this problem? It seems to me that GCC is correct, and that although it's an empty function so it doesn't matter anyway, the earlier version is preferable. Alternately, does anyone know of a way to silence GCC's warning? -- Dave Steffen, Ph.D - Software Engineer Numerica Corporation (www.numerica.us <http://www.numerica.us/> ) 4850 Hahns Peak Drive, Suite 200 Loveland, Colorado 80538 main (970) 461-2000 x 227 direct (970) 612-2327 fax (970) 461-2004 Email: dave.steffen(a)numerica.us

4 4

[iostreams][bug] Uncaught exception in destructor when using file_descriptor
by Sylvester-Bradley, Gareth 19 Sep '09

19 Sep '09

https://svn.boost.org/trac/boost/ticket/2932 I hope it's appropriate to ping the list about this issue, which was reported 4 months ago and has not been fixed in 1.39.0 or on the trunk. If closing a file descriptor fails, file_descriptor::impl::~impl() (or file_descriptor_impl::~file_descriptor_impl() on the trunk) throws an exception. This has the potential to happen during stack unwinding, causing immediate std::terminate(). Since the fix appears to be a trivial addition of try { /*...*/ } catch (...) {} it'd be a shame if this wasn't fixed in 1.40.0. Cheers, Gareth ************************************************************************ The information contained in this message or any of its attachments may be confidential and is intended for the exclusive use of the addressee(s). Any disclosure, reproduction, distribution or other dissemination or use of this communication is strictly prohibited without the express permission of the sender. The views expressed in this email are those of the individual and not necessarily those of Sony or Sony affiliated companies. Sony email is for business use only. This email and any response may be monitored by Sony to be in compliance with Sony's global policies and standards

2 2

Policy related to the time between a library is accepted and released?
by vicente.botet 18 Sep '09

18 Sep '09

Hi, On "Past Review Results and Milestones" (http://www.boost.org/community/review_schedule.html) we see the following There are 3 libraries accepted more than 1 year ago that are commited on trunk but not yet on release . * Property Tree Marcin Kalicinski May 20, 2006 * Forward (fast-track) Tobias Schwinger John Torjo December 3, 2007 - December 7, 2007 * Factory (fast-track) Tobias Schwinger John Torjo December 17, 2007 - December 21, 2007 There are 2 libraries accepted more than 1 year ago but not yet commited on trunk. * Time Series Eric Niebler August 17, 2007 * Floating Point Utilities Johan Råde Mars 8, 2008 There are 2 libraries accepted provisionally more than 1 year ago but without any outcome. * Switch Steven Watanabe January 13, 2008 * Phoenix Joel de Guzman Hartmut Kaiser September 21, 2008 - September 30, 2008 I understand that the authors have a lot of other things to do, but one year seems to me a good delay. Should't Boost have a policy related to the time between a library is accepted and released? If yes, which one? Best regards, Vicente

1 0

Need help with workaround for MSVC bug
by Emil Dotchevski 18 Sep '09

18 Sep '09

On MSVC, the following correct code produces error C2896: 'void operator ||(T,void (__cdecl *)(tag<X>))' : cannot use function template 'void bar(tag<X>)' as a function argument. struct foo { }; template <int X> struct tag { }; template <int X> void bar( tag<X> ) { } template <class T,int X> void operator||(T, void(*)(tag<X>)) { } int main() { foo()||bar<1>; } My goal is to have an operator|| overload that deduces tag<X> implicitly, but without using parenthesis, that is, foo()||bar<1>() wouldn't be satisfactory. Doesn't seem possible, but still I decided to ask. Any ideas? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

6 8

[type_traits] warning free is_signed on g++
by Edd Dawson 18 Sep '09

18 Sep '09

Hello, When using boost::is_signed<> on types such as unsigned int and unsigned long, various recent versions of g++ (MinGW 4.4.0 and Apple's 4.0.1, at least) spit out a warning: warning: comparison of unsigned expression < 0 is always false Would there be any harm in changing boost::detail::is_signed_helper in boost/type_traits/is_signed.hpp as follows? template <class T> struct is_signed_helper { typedef typename remove_cv<T>::type no_cv_t; // BOOST_STATIC_CONSTANT(bool, value = (static_cast<no_cv_t>(-1) < 0)); BOOST_STATIC_CONSTANT(bool, value = (static_cast<no_cv_t>(-1) < 1)); }; This change gets rid of the warnings emitted by g++. Kind regards, Edd

3 2

Boost on MSVC without Microsoft Extensions
by Craig Henderson 17 Sep '09

17 Sep '09

I am trying to build a client program using Boost on MSVC8 with the "Disable Language Extensions" /Za compilation flag. visual.hpp contains the following code // disable Win32 API's if compiler extentions are // turned off: // #ifndef _MSC_EXTENSIONS # define BOOST_DISABLE_WIN32 #endif win32.hpp contains: #ifndef BOOST_DISABLE_WIN32 // WEK: Added #define BOOST_HAS_FTIME #define BOOST_WINDOWS 1 #endif So, the preprocessor defines BOOST_DISABLE_WIN32 and doesn't define BOOST_WINDOWS. This doesn't sound right, and causes problems with Boost.ASIO where the Windows header files are conditionally included using #if defined(BOOST_WINDOWS) || defined(__CYGWIN__) which clearly evaluates FALSE. I consider this a bug in the boost config compiler detection rather than the asio library. Has anyone compiled with /ZA on MSVC? Thanks -- Craig Craig Henderson <http://craighenderson.co.uk/> http://www.craighenderson.co.uk http://www.siteupdatenotification.com

2 1

[task] new version 0.3.0
by k-oli＠gmx.de 17 Sep '09

17 Sep '09

I've uploaded a new version of boost.task - I hope someone will give me some feedback. regards, Oliver

1 0

cannot pass objects of non-POD type ‘class boost::detail::shared_count’ through ‘...’; call will abort at runtime
by Dave Steffen 17 Sep '09

17 Sep '09

Peter Dimov wrote: > I wrote: >> >>( Just tried to compile my project with GCC 4.3 and Boost 1.40. (It >> compiles and works just fine with Boost 1.38.) >> >> As part of a home-built thread-locking shared pointer thing, we have >> this code: [...] > > The signature of sp_enable_shared_from_this has changed, it now takes a > pointer to a shared_ptr as its first argument. Look at the current > shared_ptr constructor: > > template<class Y> > explicit shared_ptr( Y * p ): px( p ), pn( p ) // Y must be complete > { > boost::detail::sp_enable_shared_from_this( this, p, p ); > } > > Relying on implementation details has its maintenance costs. :-) Yeah. There are actually much better ways to do this now, like Boost threads and some other things, that weren't available when we started the project. It's also true that some refactoring would make the whole point moot, but I was really hoping to avoid tackling that on the current contract. > You'll probably need to refactor shared_locking_ptr to contain (or > privately derive from) a shared_ptr. ... which, arguably, we could have done in the first place. I'm inclined to refactor the whole issue out of our code at this point. :-) Anyway, thanks for the reply. I'm off to refactor. -- Dave Steffen - Software Engineer Numerica Corporation (www.numerica.us <http://www.numerica.us/> ) 4850 Hahns Peak Drive, Suite 200 Loveland, Colorado 80538 main (970) 461-2000 x 227 direct (970) 612-2327 fax (970) 461-2004 Email: dave.steffen(a)numerica.us k

1 0

[DateTime] valgrind warns on uninitialized jump
by Christoph Duelli 17 Sep '09

17 Sep '09

[from strings_from_facet.hpp, line 52] for (int m=0; m < 12; m++) { tm tm_value; tm_value.tm_mon = m; stringstream_type ss; ostream_iter_type oitr(ss); std::use_facet<time_put_facet_type>(locale).put(oitr, ss, ss.fill(), &tm_value, &*outfmt.begin(), &*outfmt.begin()+outfmt.size()); months.push_back(ss.str()); } valgrind (3.5.0, run on Linux, gcc 4.1.2, libstdc++ 6.0.8) reports: ==13166== 1 errors in context 1 of 1: ==13166== Conditional jump or move depends on uninitialised value(s) ==13166== at 0x41D793D: strftime_l (in /lib/libc-2.4.so) ==13166== by 0x40EE600: std::__timepunct<char>::_M_put(char*, unsigned int, char const*, tm const*) const (in /usr/lib/libstdc++.so.6.0.8) ==13166== by 0x40AC9DA: std::time_put<char, std::ostreambuf_iterator<char, std::char_traits<char> > >::do_put(std::ostreambuf_iterator<char, std::char_traits<char> >, std::ios_base&, char, tm const*, char, char) const (in /usr/lib/libstdc++.so.6.0.8) ==13166== by 0x40AAD95: std::time_put<char, std::ostreambuf_iterator<char, std::char_traits<char> > >::put(std::ostreambuf_iterator<char, std::char_traits<char> >, std::ios_base&, char, tm const*, char const*, char const*) const (in /usr/lib/libstdc++.so.6.0.8) The "error" goes away when tm_value.tm_hour is initialized to 0. (No idea why. Might be a bug in libstdc++) Best regards

1 0

Formal Review of Boost.Polygon is halfway through and no actual reviews so far
by Fernando Cacciola 17 Sep '09

17 Sep '09

Dear Developers, The formal review of the Boost.Polygon is halfway through and, while there was some useful discussion, there are still no "actual" reviews (where you clearly vote for inclusion and rejection). If you are interested in a geometric oriented library please try to make the time to post a formal review by the end of September 2 :) Best regards Fernando Cacciola Review Manager

4 7

Boost Review - changes to code being reviewed during the review?
by Paul A. Bristow 17 Sep '09

17 Sep '09

During most reviews, authors make changes to the code being reviewed. Some have questioned if this is 'allowed'. IMO, this is not only allowed but highly desirable - otherwise we will never get anywhere! But it can lead to confusion about exactly what is being reviewed. Now that we have SVN that keeps all changes and allows reasons to be recorded in the log, would it be useful for reviewers to quote the revision of the code that they are reviewing? Reviewers might include updates to say if the authors changes had solved problems, or changed their views. Paul --- Paul A. Bristow Prizet Farmhouse Kendal, UK LA8 8AB +44 1539 561830, mobile +44 7714330204 pbristow(a)hetp.u-net.com

1 0

Graph cut questions
by David Doria 17 Sep '09

17 Sep '09

1) If I do this: (with any of the max_flow algorithms, kolmogorov is just used as an example) double flow = kolmogorov_max_flow(g, SourceNode, SinkNode); I get the value of the max flow, but how do I tell which nodes of g belong to the "source side" of the graph and which nodes belong to the "sink side"? (thinking of it as a min cut rather than a max flow problem) 2) Is it possible to tell the max flow algorithm to use multiple sources/sinks? 3) The max_flow functions seem to require a source and sink to be specified. Shouldn't you be able to find the minimum cut that partitions the graph into two parts even without specifying a source/sink? 4) Currently you must use a bidirectional graph, and specify an edge_reverse_t in the graph traits, then set the reverse edge for every edge. a) this is pretty complicated for someone who is unfamiliar with generic programming. b) If an undirected graph is used, the algorithm should automatically take care of adding these reverse edges if they are required for the cut to be performed. Can these be considered as feature requests if they are not currently possible? I have not found a more promising graph library for c++, so it would be nice if BGL could be molded into the one everyone would like to use! Thanks, David

2 4

Re: [boost] [GIL] image rescale algorithms
by Est 16 Sep '09

16 Sep '09

Nicolas, One last, small thing. I would rename bicubic_filter in filters.hpp to mitchell_filter. Bicubic filter is a common name for bspline or photoshop style filters and mitchell is different. I think rgba32f_pixel_t is a good model for hdr pixels. I don't see the 0..1 range in floating point channels as limits. And GIL does not enforce them in any way. They only define a mapping between integer and floating point channels. In this case (rescale), clamping is an "artifact" of using integer channels and filters with possibly negative weights. I did some informal profiling, on a dual core machine, using the bicubic filter, I got this Big images: rescale serial took 9167.86 milliseconds (9.16786 sec) rescale parallel took 5055.94 milliseconds (5.05594 sec) Small images: rescale serial took 1923.46 milliseconds (1.92346 sec) rescale parallel took 1104.4 milliseconds (1.1044 sec) Est.

2 1

[GIL] image rescale algorithms
by Nicolas Lelong 16 Sep '09

16 Sep '09

Hi, I'm still working on updating my image management codebase, and I noticed that GIL does come only with by a very limited image rescaling/resampling algorithm (in gil/extension/numeric/resample.hpp) which does proper filtering for upsampling an image. As I need more robust image resampling, I came up with a source code for GIL, inspired by FreeImage implementation<http://freeimage.cvs.sourceforge.net/viewvc/freeimage/FreeImage/Source/Free…>; this code is available here :: http://code.google.com/p/rotoglup-scratchpad/source/browse/trunk/#trunk/rtg… This implementation is certainly not as generic as it could be, and could certainly benefit from 'gil concept checking' and various improvements ; I tried to make the code more 'readable' than 'efficient', and as I'm not really at ease with template metaprogramming, I may have missed a few points. For example, I think the mechanism I use to select the intermediate pixel format (used to store the averaged pixels during resizing) may be improved, and that there must be a way to let the user select a better pixel format if needed. I came up with virtual rescale view type, that allows to seamlessly rescale virtual views of any kind - it is not very efficient, but can be proved useful. I tried, as much as possible, to provide access to separable rescale functions (X & Y) so that users can control when/how (or whether) they should allocate the intermediate view for image rescaling. Feel free to use this work, and I'd be very happy to have some feedback on things that could be improved. The main functions defined are, in rescale.hpp<http://code.google.com/p/rotoglup-scratchpad/source/browse/trunk/rtgu/image…>:: // horizontal rescale only, rescale src view into dst view, matching dst view width template <typename SrcView, typename DstView, typename Filter> inline void rescale_cols(const SrcView& src, const DstView& dst, const Filter& filter); // vertical rescale only, rescale src view into dst view, matching dst view height template <typename SrcView, typename DstView, typename Filter> inline void rescale_rows(const SrcView& src, const DstView& dst, const Filter& filter); // rescale src view into dst view, matching dst view dimensions template <typename SrcView, typename DstView, typename Filter> inline void rescale(const SrcView& src, const DstView& dst, const Filter& filter); in rescale_any_view.hpp<http://code.google.com/p/rotoglup-scratchpad/source/browse/trunk/rtgu/image…>:: template <typename ViewTypes, typename Filter> inline void rescale_any_view(any_image_view<ViewTypes>& src, any_image_view<ViewTypes>& dst, const Filter& filter); in rescale_virtual_view.hpp<http://code.google.com/p/rotoglup-scratchpad/source/browse/trunk/rtgu/image…>:: // view factories template <typename SourceView, typename Filter> typename rescale_x_view_type<SourceView>::view_t rescale_x_view(SourceView const& view, typename SourceView::coord_t dst_width, const Filter& filter); template <typename SourceView, typename Filter> typename rescale_y_view_type<SourceView>::view_t rescale_y_view(SourceView const& view, typename SourceView::coord_t dst_height, const Filter& filter); template <typename SourceView, typename Filter> typename rescale_view_type<SourceView>::view_t rescale_view(SourceView const& view, typename SourceView::coord_t dst_width, typename SourceView::coord_t dst_height, const Filter& filter); and a few filters<http://code.google.com/p/rotoglup-scratchpad/source/browse/trunk/rtgu/image…>are provided. Cheers, Nicolas. **

2 4

Boost regression failure
by Christopher Jefferson 16 Sep '09

16 Sep '09

I hope I have reported this problem to the right place, apologises if I am wrong. I am currently unable to execute the regression tester (run.py). The important part of the error seems to be: error: Unable to find file or target named error: 'test_check.cpp' error: referred from project at error: '../libs/serialization/test' It was suggested on IRC this was introduced by: r56224 | ramey | 2009-09-16 00:23:51 +0400 (Wed, 16 Sep 2009) | 2 lines I enclose my full bjam.log: notice: found boost-build.jam at /Users/hudson/temp-test/boost/boost- build.jam notice: loading Boost.Build from /Users/hudson/temp-test/tools_bb notice: Searching /etc /Users/hudson /Users/hudson/temp-test/tools_bb / Users/hudson/temp-test /Users/hudso n/temp-test/tools_bb /Users/hudson/temp-test/tools_bb/kernel /Users/ hudson/temp-test/tools_bb/util /Users/ hudson/temp-test/tools_bb/build /Users/hudson/temp-test/tools_bb/ tools /Users/hudson/temp-test/tools_bb/co ntrib /Users/hudson/temp-test/tools_bb/. for site-config configuration file site-config.jam . notice: Loading site-config configuration file site-config.jam from / Users/hudson/temp-test/tools_bb/site- config.jam . notice: Searching /Users/hudson /Users/hudson/temp-test/tools_bb / Users/hudson/temp-test /Users/hudson/tem p-test/tools_bb /Users/hudson/temp-test/tools_bb/kernel /Users/hudson/ temp-test/tools_bb/util /Users/hudso n/temp-test/tools_bb/build /Users/hudson/temp-test/tools_bb/tools / Users/hudson/temp-test/tools_bb/contrib /Users/hudson/temp-test/tools_bb/. for user-config configuration file user-config.jam . notice: Loading user-config configuration file user-config.jam from / Users/hudson/user-config.jam . notice: will use '/usr/bin/g++' for darwin, condition <toolset>darwin-4.0.1 notice: using strip :: <toolset>darwin-4.0.1 :: /usr/bin/strip notice: using archiver :: <toolset>darwin-4.0.1 :: /usr/bin/libtool notice: available sdk :: <toolset>darwin-4.0.1/<macosx- version>10.3 :: /Developer/SDKs/MacOSX10.3.9.sdk notice: available sdk :: <toolset>darwin-4.0.1/<macosx- version>10.4 :: /Developer/SDKs/MacOSX10.4u.sdk notice: available sdk :: <toolset>darwin-4.0.1/<macosx- version>10.5 :: /Developer/SDKs/MacOSX10.5.sdk ===============MPI Auto-configuration=============== Found recent LAM-MPI or Open MPI wrapper compiler: mpic++ MPI compilation flags: -D_REENTRANT -I/usr//include MPI link flags: -Wl,-u,_munmap -Wl,-multiply_defined,suppress -L/usr// lib -lmpi_cxx -lmpi -lopen-rte -lope n-pal -lutil MPI build features: <define>_REENTRANT <include>/usr//include <library-path>/usr//lib <find-shared-library>mpi_cxx <find-share d-library>mpi <find-shared-library>open-rte <find-shared-library>open- pal <find-shared-library>util <linkf lags>-Wl,-u,_munmap <linkflags>-Wl,-multiply_defined,suppress MPI launcher: mpirun -np ==================================================== notice: iostreams: using prebuilt zlib notice: iostreams: using prebuilt bzip2 notice: [python-cfg] Configuring python... notice: [python-cfg] Checking interpreter command "python"... notice: [python-cfg] running command '"python" -c "from sys import *; print 'version=%d.%d\nplatform=%s\np refix=%s\nexec_prefix=%s\nexecutable=%s' % (version_info [0],version_info[1],platform,prefix,exec_prefix,ex ecutable)" 2>&1' notice: [python-cfg] ...requested configuration matched! notice: [python-cfg] Details of this Python configuration: notice: [python-cfg] interpreter command: "python" notice: [python-cfg] include path: "/System/Library/Frameworks/ Python.framework/Versions/2.5/include/pyt hon2.5" notice: [python-cfg] library path: "/System/Library/Frameworks/ Python.framework/Versions/2.5/lib/python2 .5/config" "/System/Library/Frameworks/Python.framework/Versions/2.5/ lib" notice: [python-cfg] framework directory is "/System/Library/ Frameworks/Python.framework" warning: Building Boost.Regex with the optional Unicode/ICU support disabled. note: Please refer to the Boost.Regex documentation for more information note: this is a strictly optional feature. warning: Graph library does not contain optional GraphML reader. note: to enable GraphML support, set EXPAT_INCLUDE and EXPAT_LIBPATH to the note: directories containing the Expat headers and libraries, respectively. error: Unable to find file or target named error: 'test_check.cpp' error: referred from project at error: '../libs/serialization/test'

2 1

doxygen doc / STL container unit test
by Stefan Strasser 16 Sep '09

16 Sep '09

I have two questions regarding boost library development: 1. this page: http://www.boost.org/doc/libs/1_35_0/doc/html/boostbook/getting/started.html explains how to set up the boost documentation system and write BoostBooks. what I find missing is how to generate the typical boost class synposis with doxygen. I also can't find doxygen configuration files or anything of that sort in the boost tree. how do you go about integrating automatically generated documentation into a BoostBook? 2. boost implements quite a few STL containers. is there a unit test that can test my STL container for conformity? say, I have a container that models the concept of a std::list, I'd like to change a typedef to my type, run the test and know that it behaves like advertised. Does anything like that already exist? thank you

5 10

[1.40.0] Compilation errors in Visual Studio
by Adam Badura 16 Sep '09

16 Sep '09

I experienced compilation problems with Boost 1.40. I am using Visual Studio 2005 and 2008. On both Boost compiles and links fine but is unusable in other code due to compilation errors. Currently I have access to errors produced on 2008 and it would be troublesome to get errors for 2005 (but if needed I will do it) - however the are the same (as to the message): 1>d:\libraries\boost_1_40_0\boost\integer_fwd.hpp(70) : error C2039: 'long_long_type' : is not a member of 'boost' 1>d:\libraries\boost_1_40_0\boost\integer_fwd.hpp(70) : error C2065: 'long_long_type' : undeclared identifier 1>d:\libraries\boost_1_40_0\boost\integer_fwd.hpp(70) : error C2913: explicit specialization; 'boost::integer_traits' is not a specialization of a class template 1>d:\libraries\boost_1_40_0\boost\integer_fwd.hpp(73) : error C2913: explicit specialization; 'boost::integer_traits' is not a specialization of a class template and so on... It is hard for me to tell which header causes the error but if requested I will look for this. 1.39 was just fine in both environments. The external (non-Boost) code did not change in the mean time. Any help? Adam Badura

7 10

[Endian] Version 0.10 available - Binary I/O added
by Beman Dawes 16 Sep '09

16 Sep '09

Version 0.10 of the Endian Integers library is available. Docs: http://mysite.verizon.net/beman/endian-0.10/libs/integer/doc/endian.html Zip: http://mysite.verizon.net/beman/endian-0.10.zip Sandbox: http://svn.boost.org/svn/boost/sandbox/endian This version adds binary I/O for both endian integers (<boost/integer/endian_binary_stream.hpp>) and C++ built-in types + std::string (<boost/integer/endian_binary_stream.hpp>). Support for C++0x features has also been added, ensuring that an Endian integer on C++0x is a POD. Comments appreciated! My Endian TODO list is pretty well cleared, so there are comments to the contrary, the library will be submitted for formal review in a few days. --Beman

3 4

(no subject)
by Berserker 16 Sep '09

16 Sep '09

Dmitry Goncharov wrote: > The difficulty that your example demonstrates is caused by the nature > of template template parameters. scoped_ptr should not be blamed for that. I agree, moreover I think that the advantages of this patch (often required in the list) justify the 1% use cases of Andrey Semashev's sample that in my opinion can be simplified in this way: template<typename T, typename P> void make_ptr(P &p) { p.reset(new T()); } _________________________________________________________________ Scopri tutti i servizi Windows Live, guarda i video http://www.windowslive.it/videoGallery.aspx

1 0