July 2008 - Boost - lists.preview.boost.org

Re: [boost] How do you make MPL-compatible template meta-functions?
by joaquin＠tid.es 09 Jul '08

09 Jul '08

Daryle Walker escribió: > On Jul 9, 2008, at 3:02 AM, joaquin(a)tid.es wrote: > [...] >> You can use boost::mpl::equal to test this: >> >> BOOST_STATIC_ASSERT >> ( (boost::mpl::equal<distinct_integral_bit_counts, >> boost::mpl::list_c<int, 8, 16, 32> >::value) ); >> } >> >> Other than that, your type_to_digit_count is perfectly lambda- >> cabable AFAICS. HTH, >> > > Thanks. I switched to mpl::equal and it compiled. I later switched > to BOOST_MPL_ASSERT. (Remember to take _out_ the "::value" part!) I > originally had the "integral_c" part of "type_to_digit_count" as a > member called "type," instead of as a base class, then I switched > back and forth. Both ways work. Why is that? Because integral_c (and all other integral constant types in Boost.MPL) evaluates to itself, that is, it has the form: template<typename T, T N>struct integral_c { typedef integral_c<T,N> type; ... }; > And which way is best > (if they're not equally good, and without a better third alternative)? > I don't think it makes any difference in compile times or otherwise, but deriving from integral_c is terser and more MPL-idiomatic. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

How do you make MPL-compatible template meta-functions?
by Daryle Walker 09 Jul '08

09 Jul '08

Here's what I'm trying (to redo integer_test.cpp): //============================== #include <boost/config.hpp> #include <boost/limits.hpp> #include <boost/integral_c.hpp> #include <boost/mpl/list.hpp> #include <boost/mpl/transform.hpp> #include <boost/static_assert.hpp> #include <boost/type_traits.hpp> #include <climits> namespace { // List all the conventional integral types, without the ones that are like // a strong-typedef of a lower type typedef boost::mpl::list<unsigned char #if USHRT_MAX > UCHAR_MAX , unsigned short #endif #if UINT_MAX > USHRT_MAX , unsigned int #endif #if ULONG_MAX > UINT_MAX , unsigned long #endif #if defined(BOOST_HAS_LONG_LONG) && ((ULLONG_MAX > ULONG_MAX) || (ULONGLONG_MAX > ULONG_MAX)) , boost::ulong_long_type #elif defined(BOOST_HAS_MS_INT64) && (0xFFFFFFFFFFFFFFFFui64 > ULONG_MAX) , unsigned __int64 #endif > distinct_unsigned_types; typedef boost::mpl::transform<distinct_unsigned_types, boost::make_signed<boost::mpl::_1> >::type distinct_signed_types; // New type list: integral type -> (wrapped) number of bits template < typename T > struct type_to_digit_count : boost::mpl::integral_c<int, std::numeric_limits<T>::digits> { }; typedef boost::mpl::transform<distinct_unsigned_types, type_to_digit_count<boost::mpl::_1> >::type distinct_integral_bit_counts; BOOST_STATIC_ASSERT ( (boost::is_same<distinct_integral_bit_counts, boost::mpl::list_c<int, 8, 16, 32, 64> >) ); } //============================== I originally did not have that last line there with the "BOOST_STATIC_ASSERT," but I put it in after some errors when doing a compiler-sanity check while coding. I cleaned up the other errors, but the compiler complains that the first argument of "is_same," i.e. "distinct_integral_bit_counts," is an invalid template argument. I don't think my definition of "type_to_digit_count" is lambda-safe, like "make_signed" is. How do I get it that way? (Or is the problem in the definition of "distinct_integral_bit_counts"?) -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

1 0

[test][gcc] return value support broken with "-pedantic"
by Juergen Hunold 09 Jul '08

09 Jul '08

Hi ! The latest changes to Boost.Test broke compilation with gcc in "pedantic" mode. This seems to be: http://svn.boost.org/trac/boost/changeset/47153 Just add "<toolset>gcc:<cxxflags>-pedantic" to libs/test/test/Jamfile.v2 and recompile. This will bail out with: gcc.compile.c++ /build/bjam/boost_1.36.0/libs/test/test/output_test_stream_test.test/gcc-4.2/debug/output_test_stream_test.o output_test_stream_test.cpp: In member function 'void test_constructor::test_method()': output_test_stream_test.cpp:30: error: ISO C++ forbids braced-groups within expressions I've disabled "return value support" locally (by commenting out test_tools.hpp line 86) but would like to have a conformant solution. Should we rise the warning level by _always_ activating "-pedantic" at least for the test suite ? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! Ingenieurgesellschaft für * voice: ++49 511 262926 57 ! Verkehrs- und Eisenbahnwesen mbH * fax : ++49 511 262926 99 ! Lister Straße 15 * juergen.hunold(a)ivembh.de ! www.ivembh.de * * Geschäftsführer: ! Sitz des Unternehmens: Hannover * Prof. Dr.-Ing. Thomas Siefer ! Amtsgericht Hannover, HRB 56965 * PD Dr.-Ing. Alfons Radtke !

4 6

[test] Serious breakage - please fix or revert immediately
by Beman Dawes 09 Jul '08

09 Jul '08

Yesterday's changes to Boost.Tests appear to be breaking many libraries on gcc compiles. Please fix or revert immediately. --Beman Examples: ../boost/test/impl/test_main.ipp(40): error: destructible entities are not allowed inside of a statement expression BOOST_CHECK( test_main_result == 0 || test_main_result == boost::exit_success ); In file included from ../boost/test/minimal.hpp:37, from ../libs/crc/test/crc_test.cpp:23: ../boost/test/impl/execution_monitor.ipp:60:1: error: unterminated #if ../boost/test/impl/execution_monitor.ipp:24:1: error: unterminated #ifndef

2 2

Fusion Question
by Tom Brinkman 09 Jul '08

09 Jul '08

>> Have you looked into Adobe's Eve library, described in >> http://lambda-the-ultimate.org/node/563 Oh, yes. definately; and if its as good as Adobe's GIL library, I'm sure it would be a most welcome addition to boost. An Adobe sponsered layout engine would be very welcome, I'm sure. As you know, I use GIL extensively in my own graphics layout library. I think that it represents many of the best-practices that can be found on boost. As far as my own boost::layout library, I'd be happy to merge it with adobe's or just add extensions to it. I'll let you and others guide me on that.

3 3

[extension] Concatenating factory_map objects
by Robert Dailey 09 Jul '08

09 Jul '08

Hi, I'm developing a plugin system and I will be loading several DLLs. Basically, as far as I know, this means having one factory_map per DLL (on Windows). I need to concatenate either the factory_map objects or their maps so that I can do lookups in one map instead of several maps. Is there a recommended way of doing this? Right now this requires keeping all of the factory_map objects around (for cleanup purposes only) and having my additional global std::map, that contains the concatenated std::map's from the factory_map objects (it's essentially one large copy).

2 7

[extension] factory::create() constness
by Robert Dailey 09 Jul '08

09 Jul '08

Hi, Would it be possible to make boost::extension::factory::create() a const member function? I haven't taken the time to look at the implementation of create() myself, but if there's a possibility of that function becoming const I can make my wrapper interfaces const as well. I just have a feeling that a create method should not mutate the factory object at all, but I could be mistaken.

2 1

[gil] new opencv extension
by Christian Henning 08 Jul '08

08 Jul '08

Hi there, over the past few weeks I have rewritten the current opencv extension. Now there is a lot more functionality available as it was before. The following topics are covered: * converting colorspaces ( gray, rgb, rgba, xyz, hsv, hls, and lab ) * drawing primitives ( line, rectangles, circle, polyline, and text ) * edge detection ( sobel, laplace, canny, ... ) * resizing images( nearest neighbor, linear, area, and cubic ) * smoothing ( blur, gaussian, median, and bilateral ) As usual this extension is header only, but a user would need to make the opencv headers and libs available for compiling and linking. You can download the extension here using subversion: http://gil-contributions.googlecode.com/svn/trunk/gil_2 The folder structure is the same as with all boost libraries. There are some tests that can be used for testing and for learning the rather simple interface. Only the vc8 compiler has been used so far and though I would like ask for some assistance for making the extension compilable with gcc, for instance. Please give me some insight of what you think and about what functionality you might miss. I started to toy around with Tom Brinkman's idea of stacking up operations to batch process them which you can see in the drawing_test.cpp. Regards, Christian BTW: OpenCV is distributed with the BSD license and if I understand wikipedia correctly there isn't any objection using it in commercial applications. "The BSD License allows proprietary commercial use, and for the software released under the license to be incorporated into proprietary commercial products. Works based on the material may even be released under a proprietary license (but still must maintain the license requirements)."[wikipedia]

1 0

[date_time] Constructor copy-paste bug?
by Chris Newbold 08 Jul '08

08 Jul '08

While cleaning up GCC -Wshadow warnings in the date_time library, we've found what appears to be a copy-paste error in a date_generator_formatter constructor. The following constructor... //! Constructor that allows for a custom set of phrase elements date_generator_formatter(const string_type& first, const string_type& second, const string_type& third, const string_type& fourth, const string_type& fifth, const string_type& last, const string_type& before, const string_type& after, const string_type& of) { phrase_strings.push_back(string_type(first_string)); phrase_strings.push_back(string_type(second_string)); phrase_strings.push_back(string_type(third_string)); phrase_strings.push_back(string_type(fourth_string)); phrase_strings.push_back(string_type(fifth_string)); phrase_strings.push_back(string_type(last_string)); phrase_strings.push_back(string_type(before_string)); phrase_strings.push_back(string_type(after_string)); phrase_strings.push_back(string_type(of_string)); } ...takes a whole series of arguments, which it summarily ignores as the constructor body is an exact duplicate of that for the default constructor. Presumably the right fix is to push all of the given arguments into phrase_strings. -Chris

1 0

Newbie Trying to Build Boost Libraries on 64-bit MS Windows Vista
by Beverly Pope 08 Jul '08

08 Jul '08

Hi, I am a complete newbie at boost, who must compile several Boost 1.33.1 Libraries on 64-bit MS Windows Vista, using MS VS2005. I downloaded the 64-bit version of Python (python-2.5.2.amd64.msi) as well as bjam (boost-jam-3.1.16-1-ntx86.zip) and Boost 1.33.1 (boost_1_33_1.zip); I then installed Python and extracted the other two files, placing bjam in the PATH. I tried various things to build the libraries. I finally got some (not all) of them to build by setting MSVCDir, which makes the builds bypass running msvcvars32.bat. I am currently using the following to do the build (I've also tried --toolset=msvc, but that does not do any better): bjam ^ -sTools=8_0-amd64 ^ --prefix=%myBoostDir%\newboost ^ --builddir=%myBoostDir%\newboost ^ --debug-configuration ^ --with-python-root=%myPythonDir% ^ --with-python-version=2.5 ^ --with-pydebug ^ stage ^ > %myBoostDir%\logfile.txt 2>&1 1) I see numerous (21360) warnings like the following -- I don't know whether that is something that can be ignored? D:\work\intersect\boost_1_33_1\boost/config/abi_prefix.hpp(19) : warning C4103: 'd:\work\intersect\boost_1_33_1\boost\config\abi_prefix.hpp' : alignment changed after including header, may be due to missing #pragma pack(pop) 2) When building the libraries, I get the following errors when it tries to build object_protocol.cpp (three times) : vc-C++ d:\work\intersect\boost_1_33_1\newboost\bin\boost\libs\python\build\boost_python.dll\vc-7_1\debug\threading-multi\object_protocol.obj cl : Command line warning D9002 : ignoring unknown option '/Op' object_protocol.cpp D:\work\intersect\boost_1_33_1\libs\python\build\../src/object_protocol.cpp(110) : error C2664: '_PyEval_SliceIndex' : cannot convert parame ter 2 from 'int *' to 'Py_ssize_t *' Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast D:\work\intersect\boost_1_33_1\libs\python\build\../src/object_protocol.cpp(112) : error C2664: '_PyEval_SliceIndex' : cannot convert parame ter 2 from 'int *' to 'Py_ssize_t *' Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast D:\work\intersect\boost_1_33_1\libs\python\build\../src/object_protocol.cpp(137) : error C2664: '_PyEval_SliceIndex' : cannot convert parame ter 2 from 'int *' to 'Py_ssize_t *' Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast D:\work\intersect\boost_1_33_1\libs\python\build\../src/object_protocol.cpp(139) : error C2664: '_PyEval_SliceIndex' : cannot convert parame ter 2 from 'int *' to 'Py_ssize_t *' Types pointed to are unrelated; conversion requires reinterpret_cast, C-style cast or function-style cast Do I just need to change the cast or is something else going on? Thanks for your time. Bev

2 1

[release] merging doc changes?
by joaquin＠tid.es 08 Jul '08

08 Jul '08

Is it OK to merge documentation changes to the release branch? Thank you, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 2

[fusion] fusion sequence of non-copy-constructible types
by Oliver Mueller 08 Jul '08

08 Jul '08

hello, at the last boostcon i had the chance to be introduced to fusion by dan and joel. i appreciate the idea of fusion a lot and the library amazingly detailed. since we have already had great exposure to the mpl the fusion concepts present ample opportunity for new ideas. still, some little things sometimes make it hard for me to keep rolling with fusion: i need to have a vector/list of non-copy-constructible types. using e.g. a standard fusion::vector that does not seem to be possible since objects are constructed first, then copied. of course, i could provide a public copy-constructor but that would in other places remove the compiler enforced contract that those objects are not copied under any circumstances. i also cannot think of a good reason why it is nesseccary to copy in that case. so is there a way of having a fusion sequence that does work on non-copy-constructible types? thanks for any suggestions, oliver

6 13

Re: [boost] [1.36.0] Libraries with unmerged changes?
by Jan Gaspar 08 Jul '08

08 Jul '08

Hi Thorsten, I've just found your emails in the spam folder. ?? Will merge the changes into the release branch. Jan ----- Original Message ---- From: Thorsten Ottosen <thorsten.ottosen(a)dezide.com> To: boost(a)lists.boost.org; Jan Gaspar <jano_gaspar(a)yahoo.com> Sent: Tuesday, 8 July, 2008 10:45:01 AM Subject: Re: [1.36.0] Libraries with unmerged changes? Beman Dawes skrev: > Below is a list of libraries whose header files appear to differ between > the trunk and branches/release. > circular_buffer I have had diffuculties reaching Jan regarding this library. There are some quite imortant changes here, especially for the default constructor. If we can't reach Jan soon, I wonder if I could just patch the constructor in the release branch for him? -Thorsten __________________________________________________________ Not happy with your email address?. Get the one you really want - millions of new email addresses available now at Yahoo! http://uk.docs.yahoo.com/ymail/new.html

1 0

Fusion Question
by Tom Brinkman 08 Jul '08

08 Jul '08

Joel de Guzman, I'd like to enhance my future boost::layout library proposal to use your boost::fusion. Here is a simple example of the boost::layout framework, that uses boost::gill as the view parameter. A boost::layout functor takes the following form: struct layer { template <typename view_t> void operator()(view_t& view) {} }; Examples of layers could be: fill_layer<> fill; border_layer<> border; text_layer<> text; Lets say I want to combine three layers into a single drawing operation. Currently, I do it like this: typedef boost::function<void (view_t&) > layer_t; layer_t layers[] = { fill_layer<>, border_layer<>, text_layer<> } draw_layers draw(layers,sizeof(layers)/sizeof(layer_t)); boost::gil::rgb8view_t view; draw(view); This works fine, but I would like to improve it by using boost fusion. Any suggestions or hints to get me started?

2 1

patch for NetBSD support
by brook＠biology.nmsu.edu 07 Jul '08

07 Jul '08

I tried to build boost-trunk on a NetBSD system. The following patch is required to get most of the way through (the math lib has additional errors). Because these changes are completely dependent on identifiers of NetBSD, I cannot see how they might negatively affect anything else. What is the procedure for getting this patch applied? Thanks for your help. Cheers, Brook =========================================================================== --- ./boost/config/platform/bsd.hpp.orig 2008-07-05 12:13:48.000000000 -0600 +++ ./boost/config/platform/bsd.hpp 2008-07-05 15:58:45.000000000 -0600 @@ -43,7 +43,7 @@ // // No wide character support in the BSD header files: // -#if !(defined(__FreeBSD__) && (__FreeBSD__ >= 5)) +#if !(defined(__FreeBSD__) && (__FreeBSD__ >= 5) || defined(__NetBSD__)) # define BOOST_NO_CWCHAR #endif // --- ./tools/build/v2/tools/python.jam.orig 2008-07-05 12:37:43.000000000 -0600 +++ ./tools/build/v2/tools/python.jam 2008-07-05 16:03:18.000000000 -0600 @@ -647,6 +647,8 @@ case darwin : return ; case windows : return ; + case netbsd : return <library>pthread <toolset>gcc:<library>util ; + case hpux : return <library>rt ; case aix : return <library>pthread <library>dl ;

2 2

Request for comments on changes to the dynamic_bitset docs
by Gennaro Prota 07 Jul '08

07 Jul '08

Hi, I just fixed the dynamic_bitset docs for issue #1591; the problem is with a couple of duplication of sentences of this kind: Note that the expression b1 & b2 is equivalent to creating a temporary copy of b1, using operator&=, and returning the temporary copy. I think such sentences are almost without meaning and should simply be dropped. The only concern is for "breaking a contract" in this case, though frankly I don't see what the user could sensibly rely upon. And "equivalent" is so generic, anyway. In case you agree with removing the sentences, would you note that in the section "Changes from previous version(s)"? -- Genny

1 0

[bimap] Excessive Compilation Memory Usage with VC8 - 1.35.0
by Bryan Petty 07 Jul '08

07 Jul '08

Hi, I've run into some serious problems getting my application to build after adding some usage of boost::bimap. In my application's case, a single bimap of any type causes the VC8 compiler to use more than 1GB of extra ram than it does normally (which is around 1GB). It compiles without errors, and runs flawlessly, but if I add a second bimap of any type elsewhere in my code, the additional ram usage becomes a problem and the build fails due to lack of sufficient memory to finish the compilation. These bimaps are declared and defined in a static library linked to my application which is setup with pre-compiled headers for that library. The compilation generally takes the most ram during compilation of the pre-compiled headers, and that's where this fails. This seems especially weird since from what I can tell, bimap is simply an implementation of boost::multi_index for a specific purpose, and we already make use of 4 different multi_index containers throughout our application without any memory consumption issues. I've taken the time to test this with a new skeleton Win32 project, and used the simple bimap example included with Boost. Without bimap, cl.exe only peaks at 3.25MB committed (measured with Process Monitor) in debug mode, but when I copy in the simple bimap example it peaks at 325MB committed in debug, and 148MB committed in release. I don't see anywhere near these kind of numbers with GCC on x86 linux, g++ stays around 3MB. System: Windows XP, VC8, 2GB RAM, Boost 1.35.0 One user on #boost experienced similar numbers when compiling with VC9 as well. When I add more bimaps in the simple example, it doesn't add as much of a jump as the first does, but it's still fairly significant (from 325MB to 360MB in debug with the second bimap). I have no idea how to go about debugging this. Regards, Bryan Petty

1 0

Reassigning tickets #1531 and #1591 to me?
by Gennaro Prota 07 Jul '08

07 Jul '08

Hi guys, I sent the same request yesterday, to the Moderators address, but didn't get any reply (sorry if this duplication causes any inconvenience): could someone with sufficient privileges reassign tickets #1531 and #1591 to me, so that I can close them? Or should I ask Jeremy? Thanks, -- Genny

2 2

How do I configure MPI?
by Daryle Walker 07 Jul '08

07 Jul '08

I'm trying out Boost.Build. I used to get warnings like: //=================================== 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. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. Building Boost.Regex with the optional Unicode/ICU support disabled. Please refer to the Boost.Regex documentation for more information (don't panic: this is a strictly optional feature). //=================================== I added a "using mpi ;" line, and now I'm getting errors like: //=================================== 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. //=================================== So, how do I configure MPI support? Do I have to set up GraphML support first? -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

2 1

determining if an object is faster to pass by value or const reference
by Michael Marcin 07 Jul '08

07 Jul '08

In general noone would write a function that took an int by const reference because doing so doesn't make sense from a performance standpoint. However often times we pass these trivial types to functions generically written to take const T&. It seems like type traits would make it simple to overload based on this convention. However I don't see a type trait that is fit for this use case. The has_trivial_copy trait would seem promising but it could return true for large pod objects that you wouldn't want to copy. The is_scalar trait seems promising but it will return false for lightweight user defined types and be suboptimal. Using has_trivial_copy together with some sizeof limit seems promising but a bit hand wavy. Is there a trait designed for this use case I'm overlooking? Thanks, Michael Marcin

5 10

Boost.Process 0.2 released
by Boris 07 Jul '08

07 Jul '08

I stumbled over Boost.Process some months ago. The library was created as a Google Summer of Code project in 2006 (see http://www.netbsd.org/~jmmv/process/) As I needed the functionality provided by this library and didn't manage to contact the author I went through the code myself to tidy it up, fix various bugs, convert the documentation to DocBook etc. I also added one minor but important improvement: With Boost.Asio 1.1 it's now possible to use asynchronous I/O (on Windows the macro BOOST_PROCESS_WINDOWS_USE_NAMED_PIPE must be defined as on Windows only named pipes support asynchronous I/O). I've been using the library myself only on Windows so far where it seems to work fine. I didn't make any tests yet on a POSIX platform. I didn't update the documentation yet much either. And I have no idea how to integrate the samples and test programs into Boost.Build (there are two Jamfiles but don't be surprised if they don't work :). As this library wasn't touched for nearly 2 years I don't know if there is any interest at all. As I had tidied up the code now anyway for my own purposes I provide a new snapshot for the community. You can find everything (including a link to download version 0.2) here: http://www.highscore.de/boost/process/ Boris

6 13

[test] test_tools.hpp: gcc-warnings patch
by Juergen Hunold 07 Jul '08

07 Jul '08

Hi ! The attached patch fixes two gcc warnings about unused parameters in BOOST_TEST_DONT_PRINT_LOG_VALUE. Okay to commit to trunk ? Yours, Jürgen -- * Dipl.-Math. Jürgen Hunold ! Ingenieurgesellschaft für * voice: ++49 511 262926 57 ! Verkehrs- und Eisenbahnwesen mbH * fax : ++49 511 262926 99 ! Lister Straße 15 * juergen.hunold(a)ivembh.de ! www.ivembh.de * * Geschäftsführer: ! Sitz des Unternehmens: Hannover * Prof. Dr.-Ing. Thomas Siefer ! Amtsgericht Hannover, HRB 56965 * PD Dr.-Ing. Alfons Radtke !

2 2

[metagraph] definition
by Gordon Woodhull 07 Jul '08

07 Jul '08

I just have to share this little insight: finally, a concise definition. A metagraph is a system of objects where the types of the objects (classes) and the relations between them (e.g. pointers, mappings, containers) can be described in a graph called a pattern. In the C++ implementation, the patterns are metadata, which allows static typing and static polymorphism and moves the abstraction penalty to compile time (when the pattern is known at coding time). Patterns and their implementation code are combined into larger patterns; the "total pattern" is what actually gets instantiated. The library allows implementation of hypergraphs, subgraphs, various nested/mixed/ clustered layout schemes, constraints on graphs, and generally graphs- of-graphs, hence the name metagraph. Can any static analysis fans out there tell me if there's already a name for this? Note that in this definition, metagraph is something which already exists in lots of forms. This library proposes (for now) to implement the data structures in a nicer way and (in the future) to describe and access existing structures in a consistent way. My profuse apologies for continuing to talk about code that doesn't yet exist. Soon, soon. Cheers, Gordon

2 2

Re: [boost] [integer] Can anyone double-check this test?
by Vladimir Prus 07 Jul '08

07 Jul '08

Daryle Walker wrote: > I'm trying to tweak Boost.Integer, and I noticed that only 3 of the 6 > test files there are being used. I changed the jam-file there, but I > don't use Boost.Build myself, so can someone here confirm that the > changes work. You can check out the exact changes with Change-set > 47123 at <http://svn.boost.org/trac/boost/changeset/47123>. In other words, you've checked in something, and you don't know if that works? You really better learn how to use Boost.Build -- for the mainstream toolsets and operating systems, it's trivial. - Volodya

3 7

Graph library noise in logs
by Emil Dotchevski 07 Jul '08

07 Jul '08

Isn't it a good idea to remove these messages from the Graph library Jamfile? 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. warning: skipping optional Message Passing Interface (MPI) library. note: to enable MPI support, add "using mpi ;" to user-config.jam. note: to suppress this message, pass "--without-mpi" to bjam. note: otherwise, you can safely ignore this message. IMO this information belongs in the documentation. At present it is displayed every time I build anything that uses Boost, even if it doesn't use Graph. Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

1 0

[test][darwin][trunk] using some undefined signal macros on Power PC
by JOAQUIN M. LOPEZ MUÑOZ 07 Jul '08

07 Jul '08

Hello, I guess it is pretty apparent by now, but Boost.Test is causing a lot of regressions in the Sandia-darwin-ppc regression runner with the following: http://tinyurl.com/689u7x ../boost/test/impl/execution_monitor.ipp: In member function 'void boost::detail::system_signal_exception::report() const': ../boost/test/impl/execution_monitor.ipp:292: error: 'ILL_ILLOPN' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:297: error: 'ILL_ILLADR' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:312: error: 'ILL_PRVREG' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:317: error: 'ILL_COPROC' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:322: error: 'ILL_BADSTK' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:332: error: 'FPE_INTDIV' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:337: error: 'FPE_INTOVF' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:367: error: 'FPE_FLTSUB' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:397: error: 'BUS_ADRERR' was not declared in this scope ../boost/test/impl/execution_monitor.ipp:402: error: 'BUS_OBJERR' was not declared in this scope AFACIS <signal.h> does not define these macros in Power PC architectures, further confirmation of this fact here http://source.winehq.org/source/dlls/ntdll/signal_powerpc.c I guess it's easy enough to conditionally #define the offending parts out relying on defined(__POWERPC__). I'd propose a patch mysel but I don't have the appropriate environment to test locally with. And unfortunately we don't have a Darwin/PPC champion yet: http://svn.boost.org/trac/boost/wiki/PlatformChampions HTH, Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

5 5

[flyweight] rw_locking policy patch for review
by Tim Blechmann 06 Jul '08

06 Jul '08

i have implemented a rw_locking policy for flyweight factories, based on boost::shared_mutex. to achieve that, i had to adapt the factory interface ... joaquín, would it be possible for you to review the patch? it is based against the version of flyweight from the boost sandbox svn ... best, tim -- tim(a)klingt.org http://tim.klingt.org Cheat your landlord if you can and must, but do not try to shortchange the Muse. It cannot be done. You can't fake quality any more than you can fake a good meal. William S. Burroughs

2 3

BGL: Graph edges with greater than 2 vertices
by Aman Sinha 06 Jul '08

06 Jul '08

I am looking to build a graph where an edge can be incident on multiple vertices. I believe this is also called a hypergraph. The boost archives have some discussion of hypergraphs from way back in year 2002. Does anyone know what is the status of that? If is is not supported, is there a reasonable workaround to build such graphs? Thanks, Aman

4 4

[utility/swap] Okay to add array support to Boost.Swap (sandbox/swap)?
by Niels Dekker - mail address until 2008-12-31 06 Jul '08

06 Jul '08

Hi Joe, hi Steven, Would it be okay to you if we would add support for array types to the Boost.Swap utility that is located in the sandbox? I'm asking now, because I wrote an issue, asking the C++ Standards Committee to add an overload of std::swap for array types. And Howard Hinnant just mailed me the other day that the issue has reached status Ready. :-) LWG issue 809, "std::swap should be overloaded for array types" http://home.twcny.rr.com/hinnant/cpp_extensions/issues_preview/lwg-active.h… Of course, it will still take a while before STL implementations will actually add such an std::swap overload. It isn't yet part of the Standard, officially. So I would very much appreciate if boost::swap would already start supporting array types. And I think it would be helpful when implementing swap member functions for templates like boost::value_initialized<T>. Array support could easily be added to swap/boost/utility/swap.hpp (http://svn.boost.org/trac/boost/browser/sandbox/swap/boost/utility/swap.hpp) by overloading boost_swap_impl::swap_impl, as follows: template<class T, std::size_t N> void swap_impl(T (& left)[N], T (& right)[N]) { for (std::size_t i = 0; i < N; ++i) { ::boost_swap_impl::swap_impl(left[i], right[i]); } } Please tell me what you think. I do have SVN write access, so I wouldn't mind committing the necessary changes. :-) Kind regards, -- Niels Dekker http://www.xs4all.nl/~nd/dekkerware Scientific programmer at LKEB, Leiden University Medical Center

7 26

Question about boost::asio's design
by Yingfeng 06 Jul '08

06 Jul '08

I am using asio to my software and i have some design issue about asio and hope could get your idea about it. I plan to develop a server based on asio, which could support high concurrency with complicated back end tasks to be provided, that is to say, when received a request from a client, there exists a task involved with lots of disk io and many cpu cycles to serve that request. Therefore, some concurrency design pattern would be used together with a thread pool, such as Half-Asyn/Half-Syn or Leader/Followers. I have read some sources of Asio, i think the idea of using Reactor to implement Proactor is pretty cool. Here is what I have got from the code about the working flow: Take asyn_receive as an example: 1. A functor of receive_handler together with the socket descriptor is added to the read operation queue. 2. Reactor is blocked on the demulplex call such as select 3. When read is available, Reactor retrieves the read op from the read operation queue and invoke the functor named receive_handler 4. Reactor receive the data 5. After the data has been finished reading, another event with the handler which could be customed by users is posted to the read operation queue. ... According to the above flow, I can see that there exist two kinds of events in the operation queue: events to handle socket IO and events with completion handler customed by users. In the users' eye, the process of retrieving operation from queue and then invoke handler is proceeded within io_service::run(), therefore a thread pool should be binded with io_service::run(), which is just shown in the example of Http server 3. In the design pattern of Half-Asyn/Half-Syn or Leader/Followers, the working flow is: after retrieving an operation from the queue, then dispatch a thread to process that operation handler. However, in the asio's design, if I used the threadpool to io_service::run(), then both events of processing socket IO and completion handler will occupy the thread. I think this will cause more threading overhead. I think it is reasonable that only one thread to process the network IO, and other threads to process the task of completion handler. However, it is difficult to do that in the current design. Do you have any opinion about my situation? Very grateful! Yingfeng

1 0

problems with boost exception in trunk?
by Robert Ramey 06 Jul '08

06 Jul '08

Current testing shows two compilers failing to link tests for the wide character version of the seriliazation library. For Comeau - the error is symbol already defined. It appears that certain symbols are instantiated in both the serialization library and its wide character brother. This results in a failure to link the tests. For Intel, there is a cryptic message related to symbol count - so it might or might not be the same issue. I would appear that the same code is getting instantiated in both libraries. If my analysis is correct, this problem could appear for any application which links to two or more boost libraries which use boost exception. Since we don't explicitly test for this, this we would generally have no way of knowing about this. Could whoever is responsible for the exception library please look into this? I hope that the version in the trunk has not yet been merged into the release. Robert Ramey

2 5

[integer] Can anyone double-check this test?
by Daryle Walker 06 Jul '08

06 Jul '08

I'm trying to tweak Boost.Integer, and I noticed that only 3 of the 6 test files there are being used. I changed the jam-file there, but I don't use Boost.Build myself, so can someone here confirm that the changes work. You can check out the exact changes with Change-set 47123 at <http://svn.boost.org/trac/boost/changeset/47123>. -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

1 0

more filesystem questions :)
by Emil Dotchevski 05 Jul '08

05 Jul '08

Without boost::filesystem, it is quite common for programs to take a path as user input and pass it to the OS without caring much if it's valid native path or not. If it isn't, the OS function call will fail. I don't think that this common use case would change much if it's ported to use boost::filesystem. This leads to my questions: if I can store any string into a path object, how are the semantics of boost::path different from the semantics of a string? What is the path type invariant? Does it give me any guarantees about the stored string? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

1 0

Inspection report and non-ASCII characters
by John Maddock 05 Jul '08

05 Jul '08

Would it be possible for the inspection report to print out the line containing the non-ASCII characters? There are a few files that are being flagged up, where I just can't find anything wrong with them :-( Thanks, John.

8 17

[dynamic_bitset] bug in to_ulong() in dynamic_bitset.hpp
by Boris Gubenko 05 Jul '08

05 Jul '08

A failure of dynamic_bitset library test dyn_bitset_unit_tests3 on Tru64/cxx and HP-UX/aCC revealed what appears to be a bug in <boost/dynamic_bitset/dynamic_bitset.hpp> introduced after Boost 1.34. The bug affects platforms where 'long' type is larger than 'int'. On both Tru64 and HP-UX, 'int' is a 32-bit type. On Tru64, 'long' is a 64-bit type. On HP-UX, 'long' is a 64-bit type in 64-bit data model (+DD64, which is how Boost testing is done on this platform) and 32-bit type otherwise. The test also fails on other platforms and while I cannot verify it, from the test output it apears that these platforms are affected by the same bug. What fails is the two testcases below in b.to_long() suite in boost/libs/dynamic_bitset/dyn_bitset_unit_tests3.cpp invoked with run_test_cases<unsigned int>() : { std::string str(ul_width - 1, '1'); boost::dynamic_bitset<Block> b(str); Tests::to_ulong(b); } { std::string ul_str(ul_width, '1'); boost::dynamic_bitset<Block> b(ul_str); Tests::to_ulong(b); } The code in <boost/libs/dynamic_bitset/bitset_test.hpp> converts dynamic_bitset<unsigned int> argument to unsigned long and checks that the appropriate bits in the result are set: result_type num = lhs.to_ulong(); // Be sure the number is right if (sz == 0) BOOST_CHECK(num == 0); else { for (std::size_t i = 0; i < sz; ++i) BOOST_CHECK(lhs[i] == (i < n ? nth_bit(num, i) : 0)); } This check fails for the bits in the upper half of the result. Here is an excerpt from dynamic_bitset<Block, Allocator>::to_ulong() function in <boost/dynamic_bitset/dynamic_bitset.hpp> in the trunk: result_type result = 0; for (size_type i = 0; i <= last_block; ++i) { assert((size_type)bits_per_block * i < (size_type)ulong_width); result |= (m_bits[i] << (bits_per_block * i)); } In our case, last_block = 1 and bits_per_block = 32. m_bits[i] has 'unsigned int' type. On the second loop iteration, a 32-bit integer is left-shifted by 32 bit positions. This triggers undefined behaviour. From 5.8 - Shift operators [expr.shift] : "The behavior is undefined if the right operand is [...] greater than or equal to the length in bits of the promoted left operand." With cxx and aCC, such shift results in zeroing of all bits of the left operand. Here is the code from <boost/dynamic_bitset/dynamic_bitset.hpp> in Boost 1.34 : unsigned long result = 0; for (size_type i = 0; i <= last_block; ++i) { assert((size_type)bits_per_block * i < (size_type)ulong_width); // gps unsigned long piece = m_bits[i]; result |= (piece << (bits_per_block * i)); } Here on the second loop iteration, a 64-bit long is left-shifted by 32 bit positions which yields the intended result. x.cpp below illustrates the difference between trunk and Boost 1.34: x.cpp ----- #include <stdio.h> #include <limits.h> int main() { unsigned int m_bits[] = { UINT_MAX, UINT_MAX }; unsigned int bits_per_block = sizeof(int) * CHAR_BIT; unsigned long result = 0; for(int i = 0; i <= 1 ; ++i) { #ifndef Boost_1_34 result |= (m_bits[i] << (bits_per_block * i)); #else unsigned long piece = m_bits[i]; result |= (piece << (bits_per_block * i)); #endif printf("result = %llx\n", result); } } cxxosf.zko.hp.com> cxx x.cpp && a.out result = ffffffff result = ffffffff cxxosf.zko.hp.com> cxx x.cpp -DBoost_1_34 && a.out result = ffffffff result = ffffffffffffffff cxxosf.zko.hp.com> Replacing result |= (m_bits[i] << (bits_per_block * i)); with unsigned long piece = m_bits[i]; result |= (piece << (bits_per_block * i)); on the trunk makes the test succeed: verified on Tru64/cxx and on HP-UX/aCC. In <http://lists.boost.org/Archives/boost/2007/12/131126.php> I said: > It looks like a regression in boost/dynamic_bitset/dynamic_bitset.hpp > introduced in 1.35, but even in 1.34.1, it seems to me that the code in > to_ulong() is relying on undefined behaviour. What I was referring to is the code in 1.34 applying bitwise shift operator to a long operand. It would trigger an undefined behavior in C where "The operands shall have integer type", but it is legal in C++ where "The operands shall be of integral or enumeration type". So, I no longer claim that the code in 1.34 is relying on undefined behaviour. And the last thing: why the bug affects only platforms where 'long' type is larger than 'int'? Because if they are the same, as is the case on VMS or HP-UX in 32-bit data model, last_block = 0 and the single iteration of the for loop just assigns m_bits[0] to the result: the right operand of the shift operator is zero. To fix the problem, I suggest to replace the buggy code in <boost/dynamic_bitset/dynamic_bitset.hpp> in the trunk with that in 1.34. If there are no objections, I can do it. Thanks, Boris

3 3

[math] pow redux and observations
by John Moeller 05 Jul '08

05 Jul '08

I noticed that the trunk now has corrections for pow<N> to reduce template instantiations. However, the "N=1" specialization isn't correct. The second template parameter (bool odd) should be "true," not "false." I could be mistaken that 1 is an odd number, though. :-) As it is now, the whole template would work, but would ignore the 1/false specialization and create a new 1/true specialization that just multiplies "base" by the result of 0/false. Changing 1/false to 1/true will just cause it to return "base," as desired. Note also, please, that positive_power<0,false> returns 1 when base is 0. Since 0^0 is technically undefined, the "N=0" case should probably be handled at a higher level (in power_if_positive, perhaps), and cause an error, just like negative powers of 0. If that is done, the 0/false case could be removed from positive_power.

9 50

[filesystem] Function name changes
by Beman Dawes 05 Jul '08

05 Jul '08

All the changes mentioned below leave the current names in place as synonyms, so will break no existing code. * Change is_regular() to is_regular_file(). Dave Abrahams and several other people, including me, have found that the name of the is_regular() function is too obscure. It was chosen over is_regular_file() for brevity, but isn't holding up well with experience. The status name is already "regular_file" and the term "regular file" is used by the POSIX standard. * Change leaf() to base_name(). * Change branch() to base_path(). In the long thread '[filesystem] "leaf"', several people found the current names obscure or invoking the wrong metaphor. Many alternative names were discussed, with an eye to making the names more obvious, conforming to names such as "basename" used in other programming languages, and/or using names already in use by the STL. Not breaking existing code was also a major concern, given that "basename" is already used in Boost.Filesystem. The mental model for the new names is that for a path, p: p == p.base_path() / p.base_name() Thus if p == "foo/bar/boo.txt", p.base_path() == "foo/bar", and p.base_name() == "boo.txt". * Change basename() to base_name_prefix(). * Change to extension() to base_name_extension(). This change is to avoid confusion with base_name(). The mental model for the new name is that for a path, p: p.base_name() == base_name_prefix(p) + base_name_extension(p) Thus if p == "foo/bar/boo.txt", base_name_prefix(p) == "boo", and base_name_extension(p) == ".txt". Comments? --Beman

10 41

filesystem question
by Emil Dotchevski 05 Jul '08

05 Jul '08

What is the rationale for providing path and wpath types instead of using a single path type? Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

3 3

libs/dynamic_bitset/bitset_test unmerged changes?
by David Abrahams 05 Jul '08

05 Jul '08

Should these be in the trunk? Index: bitset_test.hpp =================================================================== --- bitset_test.hpp (revision 40672) +++ bitset_test.hpp (working copy) @@ -1006,7 +1006,8 @@ bool did_throw = false; try { - s << b; + static_cast<void> + (s << b); } #if defined BOOST_OLD_IOSTREAMS catch(...) { @@ -1081,7 +1082,8 @@ const std::ios::iostate except = is.exceptions(); bool has_stream_exceptions = true; try { - is >> b; + static_cast<void> + (is >> b); } catch(const std::ios::failure &) { did_throw = true; -- Dave Abrahams Boost Consulting http://www.boost-consulting.com

2 1

Finding algorithms returning ranges?
by Mathias Gaunard 04 Jul '08

04 Jul '08

Finding algorithms (find, find_if, max_element, and others) usually return an iterator to the found position, or the past-the-end iterator. While enough, it can be quite annoying when used with range adaptors and the like. Imagine something like this: auto r = some_range | some adapters...; auto it = max_element(r, comparison_function); if(it != end(r)) { do_something; } Without auto, it is simply unusable. If such algorithms returned the range [found, end), we would be able to write: if(!empty(max_element(some_range | some adapters..., comparison_function)) { do_something; } Particularly, I find it practical to use it with a function like that: optional<typename range_value<Range>::type> deref_opt(const Range& r) { typedef typename range_value<Range>::type T; return empty(r) ? optional<T>() : optional<T>(*begin(r)); } or like that: typename range_value<Range>::type deref_def(const Range& r) { typedef typename range_value<Range>::type T; return empty(r) ? T() : *begin(r); } For compatibility, maybe returning a range type that implicitly converts to the beginning iterator could work. Do people think this is a good idea?

2 1

Re: [boost] Any interest in generic sequence searching through single-pass iterators?
by dpxguard-boost＠yahoo.gr 04 Jul '08

04 Jul '08

Jim Xochellis wrote: > > I have written in my free time the "single_pass_search" C++ template function, which performs generic sequence searching similarly to the std::search STL algorithm. The most important quality of single_pass_search and its main advantage over std::search > > is its capability to search for a sub-sequence in a search-range that is accessed through a pair of single-pass (input) iterators, while std::search requires that the search-range must be accessed via forward iterators at least. Mathias Gaunard wrote: > I guess it could be interesting to overload std::search to work with > input iterators too. > There is no need to give it a different name. Unfortunately, I cannot think of a way to "overload" std::search to work with input iterators, without changing its behavior significantly. Please see the section "Oddities and drawbacks" of the Home/Algorithms/single_pass_search/single_pass_search.html documentation file in the "Boost File Vault", for more details. Best regards, Jim Xochellis ___________________________________________________________ Χρησιμοποιείτε Yahoo!; Βαρεθήκατε τα ενοχλητικά μηνύματα (spam); Το Yahoo! Mail διαθέτει την καλύτερη δυνατή προστασία κατά των ενοχλητικών μηνυμάτων http://login.yahoo.com/config/mail?.intl=gr

1 0

Any interest in generic sequence searching through single-pass iterators?
by dpxguard-boost＠yahoo.gr 04 Jul '08

04 Jul '08

Hi list, I have written in my free time the "single_pass_search" C++ template function, which performs generic sequence searching similarly to the std::search STL algorithm. The most important quality of single_pass_search and its main advantage over std::search is its capability to search for a sub-sequence in a search-range that is accessed through a pair of single-pass (input) iterators, while std::search requires that the search-range must be accessed via forward iterators at least. For example, single_pass_search can easily search a file directly through a pair of istream iterators, while std::search requires the interference of an intermediate container in order to obtain the file data via a pair of forward iterators at least. With data sources like istream, using single_pass_search instead of std::search is by far simpler, more efficient and less memory consuming as well, because the std::search algorithm additionally requires an intermediate container and some stream buffering logic. Anybody interested? For more information, I have uploaded in the "Boost File Vault" the following files: Documentation: Home/Algorithms/single_pass_search/single_pass_search.html Implementation: Home/Algorithms/single_pass_search/single_pass_search.h Example: Home/Algorithms/single_pass_search/Example..cpp Best regards, Jim Xochellis ___________________________________________________________ Χρησιμοποιείτε Yahoo!; Βαρεθήκατε τα ενοχλητικά μηνύματα (spam); Το Yahoo! Mail διαθέτει την καλύτερη δυνατή προστασία κατά των ενοχλητικών μηνυμάτων http://login.yahoo.com/config/mail?.intl=gr

2 1

[1.36.0] Final requirements for directory and file names
by Beman Dawes 04 Jul '08

04 Jul '08

The final requirements for directory and file names are now posted at http://beta.boost.org/development/requirements.html#Directory_structure These are now stable for 1.36.0. Hopefully they will also be stable for quite some time beyond 1.36.0. The inspect program has been updated accordingly. --Beman

7 12

Compile time maths/square root?
by Joseph Gauterin 04 Jul '08

04 Jul '08

Does boost have a library of compile time maths functions? I've only been able to find GCD and LCM algorithms (boost/math/common_factor.hpp) If such a library exists, it would be worth adding a summary of them to /libs/math/doc/html/index.html In paticular, I was looking for a compile time integer square root function.

2 1

[extension] load_single_library() - silent failure?
by Robert Dailey 04 Jul '08

04 Jul '08

When calling load_single_library(), if the 3rd parameter, which is the name of the export factory function, is incorrect, load_single_library() will silently fail and return as if nothing went wrong. However, since the name of that function was mistyped (in my case), I had to debug into the boost.extensions library to figure out the actual source of the problem. I think this should have thrown an exception. For example, I called the function like below: factory_map fm; load_single_library( fm, "my_library.dll", "my_export_method_typo" ); And my function, as defined in the DLL source, is as follows: extern "C" void BOOST_EXTENSION_EXPORT_DECL my_export_method( boost::extensions::factory_map& fm ) { } As you can see, the string (in the first code example) is clearly mistyped/misnamed. This results in silent failure. Opinions on this would be useful.

2 2

[property_tree] XML parser errors
by Preston A. Elder 03 Jul '08

03 Jul '08

Hey, This is not a new issue, but a quick search sees it not reported. Each of the XML parsers that are available for property_tree has a problem, with the exception of the TinyXML version (which is annoying because it requires an external lib). - RapidXML (the default) Lines 95 and 98 of xml_parser_read_rapidxml.hpp need to be changed from this: if (flags & no_comments) doc.parse<parse_normalize_whitespace>(&v.front()); else doc.parse<parse_normalize_whitespace | parse_comment_nodes>(&v.front()); to this: if (flags & no_comments) doc.template parse<parse_normalize_whitespace>(&v.front()); else doc.template parse<parse_normalize_whitespace | parse_comment_nodes>(&v.front()); Without this change gcc 4.2 won't compile them (not sure about other versions of gcc). - PugXML Line 1827 of pugxml.hpp looks like: class xml_iterator : public std::_Ranit<_Ty,_Diff,_Pointer,_Reference> I don't know about anyone else, but my STL doesn't have a _Ranit class, and depending on non-standard components is a bad idea for portable code. - Spirit It fails to parse some XML that is perfectly valid under the RapidXML and and TinyXML versions. On the plus side, it compiles out of the box ;) I'm not 100% sure what it is, I get this error: terminate called after throwing an instance of 'boost::property_tree::xml_parser::xml_parser_error' what(): <unspecified file>: invalid character entity Aborted Here is a trimmed down XML file that should work fine, and does under rapid and tiny: <log> <formatter type="literal" name="BEGIN"> <string>TEMP</string> </formatter> <appender type="file" name="FILE"> <filename>test.log</filename> <formatter>BEGIN</formatter> <truncate>true</truncate> </appender> <logger name="test"> <threshold>10</threshold> <appender>FILE</appender> </logger> <fallback>test</fallback> </log> I don't see anything specifically wrong with this. Note however, that using spirit on a DIFFERENT xml file that imho is significantly more complex and larger parses just fine with spirit (I would paste it, but it >2.5k). PreZ :)

1 1

[filesystem] Change "remove" function's return to void?
by Beman Dawes 03 Jul '08

03 Jul '08

The remove(p) function is currently specified to return a bool with a value of exist(p) before the post-condition is established. The post-condition is !exists(p). The original thought in providing this was that the return value might be useful and would cost nothing. It turns out that providing this return value does have several costs: * A call to exists() could be omitted if the actual system removal call succeeds. exists() is surprisingly expensive on some operating systems. * It makes the remove() function less reliable in that it introduces a potential race condition. * It makes flow of control more complex (and thus harder to test) for some implementations. Thus I'd like to change the return to void. Although that will break some code, the breakage will result in a noisy compile-time error that is easy to fix by inserting a call to exits() before the call to remove(). Comments? --Beman PS: This was precipitated by ticket #1972, but doesn't affect the resolution of the remove() issue it raises. That will be fixed for 1.36.0 regardless.

4 4

boost::exception lib question
by Tom Brinkman 03 Jul '08

03 Jul '08

Is there a way to delay throwing an exception? Reason #1 Sometimes, one may want to accumulate all error conditions, but ignore them unless a fatal error condition occurs. These non-throw errors might be considered warnings, but useful to report if a later fatal error conditions occurs. Reason #2 It may be preferable to report all errors at once and not have a throw after each error. Waiting to throw the error may provide for more complete error statements. Example: my_error error; error << error1("aaaaa"); error << error2("bbbbbb"); .... <later> throw error << error3("cccc");

2 1

[allocators] Article and library about allocator improvements
by Ion Gaztañaga 03 Jul '08

03 Jul '08

Hi, While developing of Interprocess, I started to think about optimizations for STL-like allocators. I even wrote a proposal about some new features for standard containers (N2045, http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2006/n2045.html) that was not received with much interest by the committee. I refined those improvements for shared memory containers and I measured performance benefits when containers take advantage of more advanced allocators. The last few months, I've taken another step forward and I've developed a small Boost library based on a modified DLmalloc code. I've developed some allocators above the modified DLmalloc and I've measured the performance benefits that can be obtained with optimized allocators that offer some new features like buffer expansion, burst allocation, etc... Test were performed using Interprocess containers, but instead of shared memory allocators, I've compared DLmalloc based heap allocators against the standard std::allocator<>. I've written a long article with my explanations and conclusions: http://www.drivehq.com/web/igaztanaga/allocplus/ The library (includes the article) can be downloaded here: http://www.drivehq.com/web/igaztanaga/allocplus.zip The library has no docs (the article explains all the basics) and does not surely meet Boost standards. The only goal of this article, the library and this post is to share information with other Boost container authors and discuss possible improvements that maybe could be applied to Boost containers. If those improvements are considered interesting, it would be great if we could write a library with allocators and develop some "existing practice" with boost containers before writing a future proposal to improve allocators. I plan to publish the article somewhere (supposing someone is crazy enough to publish it ;-) ) but first I wanted to share this with boosters to try to improve the article/library and know if developers are interested in allocator issues. Comments are welcome! Regards, Ion

5 11

[filesystem] Function name changes
by Tom Brinkman 03 Jul '08

03 Jul '08

>> p.base_name() == base_name_prefix(p) + base_name_extension(p) Yep. These are much better names. I think I must have looked at the help file at least 5 or 6 times to find out what "leaf" means.

1 0

boost-style mutable heap
by Tim Blechmann 03 Jul '08

03 Jul '08

hi all, i am curious, is there any attempt to implement mutable priority queues as a boost-style library ... i am familiar with dietmar kuehl's heap implementations, which have never been reviewed nor integrated in boost ... is anyone working on / interested in a mutable priority queue implementation, maybe as part of boost.intrusive? thanks, tim -- tim(a)klingt.org http://tim.klingt.org Question: Then what is the purpose of this "experimental" music? Answer: No purposes. Sounds. John Cage

3 2

A branching/tagging idea for releases
by Daryle Walker 03 Jul '08

03 Jul '08

Here's an idea on how we can manage our source-control for releases: 1. When we're ready to start a new release, make a branch from the trunk with a name like release_1_??_x (e.g. "release_1_37_x") 2. Finalize what needs to be done to make that branch ship-worthy 3. Make a tag from that branch with a name like release_1_??_0 (e.g. "release_1_37_0") 4. Export that tag to a fresh directory and create the appropriate archive file to upload to SourceForge, etc. (The directory shouldn't have any source-control debris in it. Maybe this needs to be done once on each platform to ensure the best archive format and the proper line-ending markers.) 5. If bug-fixes for that release need to be done, continue to use the release_1_??_x branch (and merge the fixes back to the trunk, or vice versa) 6. Make a new tag named like release_1_??_1 and ship it as in [4] for any bug-fix releases (increase the number for subsequent bug- fixes published) 7. New stuff and substantial changes go on the trunk; publish those by going back to [1] with a release_1_(??+1)_x branch -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

6 14

Documentation for Boost libraries
by Edward Diener 03 Jul '08

03 Jul '08

In general Boost has many libraries with good to absolutely first class documentation. Among the many Boost libraries I have used, all with good documentation, are regex, iostreams, function, bind, optional, signals. tribool, tokenizer, and spirit, but of course there are many other libraries with great documentation in Boost. One of my prerequisites for a library with good documentation is that some sort of overview must be given for the functionality of the library so that the end user knows what is available, and what each available part of the library generally entails. For me this overview must be written out and not just given as a series of programming examples, whether in the form of tutorial code, example code, or whatever one wants to call explanations of functionality based almost purely on some hypothetical program or mini-program. In this I may be different from many programmers but I just find it very hard to understand library functionality from example code without basic generalized explanations of functionality. Today, looking for a socket library to use in my C++ code I decided to look at the documentation for ASIO. I was shocked to find out that there is no overview of the functionality of this library at all, but just a series of tutorials and examples and then a reference listing a multitude of classes. I do not believe this is adequate for explaining library functionality and puts a totally unnecessary burden of the end-user when learning the functionality of a library. I would like to encourage Boost developers to always give an overview of the functionality of their library and its general concepts and classes, as almost all libraries currently do. While I am appreciative of tutorials and exmaples as an extra learning device, I do not believe that library documentation should exist with some sort of overview, as mentioned above. I have written this because I am disturbed that ASIO was accepted with the sort of documentation which has been created for it. I do not think such a way of presenting a library is adequate for an organization like Boost whose overall excellence is acknowledged throughout the C++ community.

6 12

[shifted_ptr] STL required modifications
by Phil Bouchard 03 Jul '08

03 Jul '08

Ok, If we comment out line 68 of shifted_ptr_test2.cpp in the sandbox and uncomment line 69 we will get a simplified version of the error messages we used to have with std::vector. It is easier this way uncovering the required modifications necessary to make STL user-friendly with smart pointers. I have also made shifted_allocator the way it should be. Yes it is strange replacing pointers to nodes inside containers and I don't see an urgent need for it but this can help unobfusticating the standards regarding pointers to nodes. Thanks, -Phil

1 0

Interest in HeapAware mixin?
by Corey Goldfeder 03 Jul '08

03 Jul '08

Hi everyone, Would there be any interest in a mixin class that signs an object as being on the stack or the heap? Any class that needs to know if it can delete 'this' can (possibly multiply) inherit from class HeapAware, and will gain a member function on_heap() that returns whether the object was dynamically allocated. A similar idea is discussed in More Effective C++, item 27, but unlike that approach, my implementation works correctly for arrays. It also does all the work during construction, so that checking on_heap() just returns a preset bool. The extra cost at construction is a small constant. It is not yet thread safe, but could be made so reasonably easily. Unlike some similar classes, it uses nothing compiler specific, even for arrays, which is where people usually need to "cheat". In particular, for arrays it makes no assumptions about where in the allocated memory the objects are constructed, and so alignment issues or extra compiler bookkeeping don't cause any problems. I currently use this class within a 3d mesh library I maintain. I have triangles that belong to multiple meshes, and I want updates to a triangle to be noticed by all meshes that contain it, so that they can mark their cached mesh statistics as being out of date. This means I need an event listener mechanism. I also want triangles ownership to be shared among the meshes, so that deleting a mesh deletes any triangles that no other mesh currently contains. I built a two way smart pointer / event listener class that maintains a single list that serves as both listeners and owners. The HeapAware class that I am proposing for Boost was invaluable to me, because it allowed me to disable self deletion for triangles on the stack. The snippet below demonstrates how HeapAware can be used. (Obviously this a trivial example). My implementation produces the correct output for all these cases, as well as for globals, statics, and objects created with placement new and placement new[]. It also works correctly with copy construction, which some other implementations fail at. class Widget : public HeapAware {}; int main() { Widget stack_w; Widget* heap_w = new Widget; Widget stack_copy(*heap_w); Widget* heap_copy = new Widget(stack_w); Widget stack_array_w[2]; Widget* heap_array_w = new Widget[2]; printf("Stack Widget: %d\n", stack_w.on_heap()); printf("Heap Widget: %d\n", heap_w->on_heap()); printf("Stack copy of Heap widget: %d\n", stack_copy.on_heap()); printf("Heap copy of Stack widget: %d\n", heap_copy->on_heap()); printf("Stack array widget 0: %d\n", stack_array_w[0].on_heap()); printf("Stack array widget 1: %d\n", stack_array_w[1].on_heap()); printf("Heap array widget 0: %d\n", heap_array_w[0].on_heap()); printf("Heap array widget 1: %d\n", heap_array_w[1].on_heap()); return 0; } Thanks! -Corey Goldfeder

1 0

Exception lib documentation
by Emil Dotchevski 02 Jul '08

02 Jul '08

I have a question about the release procedure, do I need to do anything special to hook the Exception library documentation into the main Boost documentation? (The main Boost Exception documentation file is libs/exception/doc/boost-exception.html) Emil Dotchevski Reverge Studios, Inc. http://www.revergestudios.com/reblog/index.php?n=ReCode

3 5

[release][website] Adding 1.36 to the beta site and checklist additions
by Daniel James 02 Jul '08

02 Jul '08

Hi, I've just created a placeholder for the new release information in the beta site. I hope I'm not jumping the gun there. Also, I've added a few items to the release manager checklist which need to be done for the website. These tasks probably should be delegated but I thought they were worth including in the main checklist. Also, would it be possible to upload (or download for that matter) the release snapshots to the beta site? So we can see how well the new documentation works in the site before it is released. thanks, Daniel

1 0

Is "+" safe for file names?
by Rene Rivera 02 Jul '08

02 Jul '08

Just noticed this directory name: libs/filesystem/test/vc++.boost.filesystem Is "+" safe to use across file systems? Hm, actually I'm fairly sure more than one "." is not safe. For example in the MVS systems? -- -- Grafik - Don't Assume Anything -- Redshift Software, Inc. - http://redshift-software.com -- rrivera/acm.org (msn) - grafik/redshift-software.com -- 102708583/icq - grafikrobot/aim,yahoo,skype,efnet,gmail

7 11

Where can I find Phoenix 2.0?
by Mathias Gaunard 02 Jul '08

02 Jul '08

I discovered Phoenix 2.0 which looks fairly great according to the documention, however I can't find it anywhere. Is it what's in trunk/final/boost/spirit/phoenix/ on the spirit svn?

2 1

[circular_buffer] will release branch be updated with fixes from trunk?
by Thorsten Ottosen 02 Jul '08

02 Jul '08

Hi Jan, The old behavior of the default constructor is causing my release regressions to break. I'm sure the new behavior (not doing any allocation) will be most welcome in the release branch for other reasons as well. Do you plan on changing this in the release branch? best regards -Thorsten

1 0

Subversion problem(s)?
by Dean Michael Berris 02 Jul '08

02 Jul '08

I tried doing the following just now... Anything going on? $ svn co http://svn.boost.org/svn/boost/trunk boost-trunk-flux svn: REPORT request failed on '/svn/boost/!svn/vcc/default' svn: REPORT of '/svn/boost/!svn/vcc/default': 400 Bad Request (http://svn.boost.org) -- Dean Michael C. Berris Software Engineer, Friendster, Inc.

2 2

[asio] failure in ~wrapped_handler
by Dean Michael C. Berris 02 Jul '08

02 Jul '08

Hi everyone, I recently ran into a problem with Boost.Asio while using a slightly modified version of the HTTP 2 example server. The debugger trace (attached) shows where a segfault had occurred in the code. The short of it is that when ~wrapped_handler is called, the call to boost::detail::atomic_exchange_and_add fails when boost::detail::sp_counted_base::release is invoked. It occurs when a handler_wrapper is deleted/destructed (~handler_wrapper is called) in the strand_service. I'm just wondering what could be causing this -- it's worth noting that under not-so-heavy load, the problem does not manifest itself; but soon enough when the load on the server goes up (more incoming connections) the server crashes consistently. Any pointers where I should be looking? I'm using Boost.Trunk revision number 43296. -- Dean Michael Berris Software Engineer, Friendster, Inc.

3 2

Re: [boost] [system] boost compilation
by simonvifr＠voila.fr 01 Jul '08

01 Jul '08

Hello, Thank you for your help. The error is now fixed. My configuration was not correctly set. However, it still remains an error when building the C++ program. After including the line "#include <boost/asio.hpp>" the following messages are displayed : Linking console executable: .objs\Menu.o:Menu.cpp:(.text+0x19a3): undefined reference to `boost::system::get_system_category()' .objs\Menu.o:Menu.cpp:(.text+0x19bc): undefined reference to `boost::system::get_posix_category()' .objs\Menu.o:Menu.cpp:(.text+0x19d5): undefined reference to `boost::system::get_posix_category()' .objs\Menu.o:Menu.cpp:(.text+0x19ee): undefined reference to `boost::system::get_system_category()' .objs\Menu.o:Menu.cpp:(.text$_ZN5boost4asio5error19get_system_categoryEv[boost::asio::error::get_system_cathttp://mail3.voila.fr/webmail/fr_FR/write.html# Envoyeregory()]+0x7): undefined reference to `boost::system::get_system_category()' collect2: ld returned 1 exit status Process terminated with status 1 (0 minutes, 0 seconds) I think I need to link the "boost_system-iw-mt-1_35.lib" and/or the "boost_system-iw-mt.lib" libraries but I do not know how. I have tried without success. Thank you for your answer to fix this error. Regards. > Message du 01/07/08 à 16h36 > De : "Beman Dawes" <bdawes(a)acm.org> > A : boost(a)lists.boost.org > Copie à : > Objet : Re: [boost] [system] boost compilation > > > simonvifr(a)voila.fr wrote: > > > I contact you because an error occurs when compiling the "system" > > library with the following command prompt : bjam --with-system > > --toolset=intel --debug-configuration stage > > > > The intel compiler seems to be invoked correctly (see mail below). > > > > The message error is : > > > > error_code.cpp libs\system\src\error_code.cpp(90): error: namespace > > "std" has no member "strerror" const char * c_str = std::strerror( ev > > ); ^ compilation aborted for libs\system\src\error_code.cpp (code 2) > > > > My OS version is Windows XP. > > My boost version is 1.35.0 > > My boost-jam version is 3.1.16-1 (ntx86) > > My intel compiler version is 10.1.021 > > Each of those is exactly identical to the setup on my main development > machine. The Intel compiler is one of the ones I test with regularly. > > Yet the command line you specify about works fine for me. > > One possibility, and it is only a guess, is that your configuration is > finding the wrong set of C++ standard library include files. > > > Thank you for your answer to fix this error. > > HTH, > > --Beman > > _______________________________________________ > Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost > > ____________________________________________________ Sur le mail Voila, vous pouvez personnaliser l’anti-spam ! http://mail.voila.fr

1 0

DocBook -> Boost documentation?
by Boris 01 Jul '08

01 Jul '08

Is there any XSLT file to convert a DocBook to a Boost library documentation (the HTML files everybody uses)? I've been clicking around on the Boost website to find out how a library documentation is created but could only find http://www.boost.org/development/requirements.html#Documentation which refers to http://www.boost.org/doc/libs/1_34_1/more/writingdoc/index.html (which basically says everyone may do what he wants). Boris

3 4

Anyone interested in a generic loop (and loop unrolling) library ?
by Hui Li 01 Jul '08

01 Jul '08

Loops, in particular loop-unrolling, can be made generic, easy to write, and accessible to everybody. With the help of Boost.Lambda (and a few other boost libraries), we can easily construct arbitrary loops that are unrolled at compile-time. I haven't implemented the full library yet, in fact I've implemented only a few very preliminary functionalities (hardly flawless), it serves only to illustrate the ideas. From what they can do, a possible Boost.Loop library looks very promising. However I feel that I need much help on the design of such a library. The implementation could be straightforward (with the help of so many good libraries in Boost), once a good design is found. Hopefully there are interested people here so I won't have to work on my own. (If there already exists such a library, please let me know.) In the example, you can see how easy it is to construct arbitrary (limited only by Boost.Lamda) loops that are generically unrolled at compile time. With an optimizing compiler, it can be as efficient as hand-written codes. Not only that, but also can we make (almost) any linear-algebra libraries work together without difficulty. In the example, we don't need any extra coding to make a c_array, std::vector, or even a column_view of a ublas::matrix to work together. In the following I give the full example code to illustrate what it's capable of and how to use it. The header file, loop.hpp, is attached at the end of this post. The example has been tested with apple-gcc4.0.1 . Thanks, Hui /**********************************************************************************************************/ #include <vector> #include <iostream> #include <iterator> #include <functional> #include <boost/array.hpp> #include <boost/numeric/ublas/matrix.hpp> #include <boost/numeric/ublas/matrix_proxy.hpp> #include <boost/numeric/ublas/io.hpp> #include "loop.hpp" using namespace std; using namespace boost; using namespace boost::lambda; using namespace boost::numeric; using namespace boost::numeric::ublas; using namespace loop; int idt(int i) { return i; } int main(int argc, char* argv[]) { const size_t N = 8, M = 3; boost::array<double,N> v; std::vector<double> w(N); matrix<double> m(N,M); // All loops are unrolled at compile time // indtrans acts like an array whose individual element equals its index index_transform<double(int)> indtrans(&idt); // equivalent to for(i=0;i<N;i+=2){ v[i]=w[i]=1; } loop_over< linear_range<0,N,2> >( _1 = _2 = 1, v, w ); // equivalent to for(i=1;i<N;i+=2){ v[i]=i; } loop_over< linear_range<1,N,2> >( _1 = _2, v, indtrans ); // equivalent to for(i=1;i<N;i+=2){ w[i]=i; } loop_over< linear_range<1,N,2> >( _1 = _2, w, indtrans ); // loop_over< linear_range<1,N,2> >( _1 = _2 = _3, v, w, indtrans ); // I wonder why this line doesn't compile with gcc4?? m.clear(); // set m to a zero matrix // equivalent to for(i=1;i<N;++i){ column(m,2)[i]=1+i*2; } loop_over< linear_range<0,N,1> >( _1 = 1+_2*2, loop::ref(column(m,2)), indtrans ); // equivalent to for(i=1;i<2;++i){ v[i]*=-2; } followed by for(i=N-3;i<N;++i){ v[i]*=-2; } loop_over< link_range<linear_range<0,2,1>,linear_range<N-3,N,1> > >( _1 *= -2, v); // vertically print out v and w, side by side loop_over< linear_range<0,N,1> >( cout << _1 << constant('\t') << _2 << constant('\n'), v, w ); cout<<endl; // print out m cout << m << endl << endl; double s = 0; // calculate the inner-product of w and column(m,2) (when the column is viewed as a vector/array) loop_over< linear_range<0,N,1> >( _1 += _2*_3, loop::ref(loop::scalar(s)), w, loop::ref(column(m,2)) ); cout << s << endl << endl; return 0; } /**********************************************************************************************************/ Here is the loop.hpp /********************************************************************************************************** * loop.hpp * Created by Hui Li on 6/26/08. ******************************************************************************************************** */ #ifndef LOOP_H #define LOOP_H #include <boost/static_assert.hpp> #include <boost/ref.hpp> #include <boost/lambda/lambda.hpp> #include <boost/function.hpp> #include <boost/function_types/function_arity.hpp> #include <boost/mpl/if.hpp> #include <boost/mpl/bool.hpp> #include <boost/mpl/assert.hpp> namespace loop { // the empty range struct empty_range {}; // a range starting from Start, ending at End, with stride Stride template < int Start, int End, int Stride = 1 > struct linear_range { BOOST_MPL_ASSERT(( boost::mpl::bool_<(Start*Stride<End*Stride)> )); static const int first = Start; typedef typename boost::mpl::if_ < boost::mpl::bool_< ((Start+Stride)*Stride < End*Stride) >, linear_range < Start+Stride, End, Stride >, empty_range >::type next_range; }; // link two arbitrary ranges template < typename LeftRange, typename RightRange > struct link_range { static const int first = LeftRange::first; typedef typename boost::mpl::if_ < typename boost::is_same < typename LeftRange::next_range, empty_range >::type, RightRange, link_range < typename LeftRange::next_range, RightRange > >::type next_range; }; // implementation of the unrolled loop over a range template < typename LambdaExpr, typename Range > struct loop_Impl { template < typename V1 > void operator()(LambdaExpr& expr, V1& v1) { expr(v1[Range::first]); loop_Impl < LambdaExpr, typename Range::next_range >()(expr,v1); } template < typename V1, typename V2 > void operator()(LambdaExpr& expr, V1& v1, V2& v2) { expr(v1[Range::first],v2[Range::first]); loop_Impl < LambdaExpr, typename Range::next_range >()(expr,v1,v2); } template < typename V1, typename V2, typename V3 > void operator()(LambdaExpr& expr, V1& v1, V2& v2, V3& v3) { expr(v1[Range::first],v2[Range::first],v3[Range::first]); loop_Impl < LambdaExpr, typename Range::next_range >()(expr,v1,v2,v3); } }; // looping over an empty range does nothing template < typename LambdaExpr > struct loop_Impl < LambdaExpr, empty_range > { template < typename V1 > void operator()(LambdaExpr&, V1){} template < typename V1, typename V2 > void operator()(LambdaExpr&, V1&, V2&){} template < typename V1, typename V2, typename V3 > void operator()(LambdaExpr&, V1&, V2&, V3&){} }; // helper functions template < typename Range, typename LambdaExpr, typename V1 > void loop_over(LambdaExpr& expr, V1& v1) { loop_Impl<LambdaExpr,Range>()(expr,v1); } template < typename Range, typename LambdaExpr, typename V1, typename V2 > void loop_over(LambdaExpr& expr, V1& v1, V2& v2) { loop_Impl<LambdaExpr,Range>()(expr,v1,v2); } template < typename Range, typename LambdaExpr, typename V1, typename V2, typename V3 > void loop_over(LambdaExpr& expr, V1& v1, V2& v2, V3& v3) { loop_Impl<LambdaExpr,Range>()(expr,v1,v2,v3); } // map a call to operator[] to a unary function all template < typename Function > struct index_transform { BOOST_STATIC_ASSERT(( boost::function_types::function_arity<Function>::value == 1 )); typedef boost::function<Function> func_type; typename func_type::result_type operator[](typename func_type::argument_type x) { return func(x); } template < typename FuncTp > index_transform(FuncTp f):func(f){} private: func_type func; }; // force removal of const-ness of a reference // not so elegant but should be okay template < typename T > T& ref(const T& t) { return const_cast<T&>(t); } // independent of whatever the index might be, it always returns the reference to the same variable template < typename T > struct scalar_Impl { T& operator[](int) { return ref; } scalar_Impl(T& t):ref(t){} private: T& ref; }; // scalar helper template < typename T > scalar_Impl<T> scalar(T& t) { return scalar_Impl<T>(t); } } // namespace loop #endif /**********************************************************************************************************/

4 3

[system] boost compilation
by simonvifr＠voila.fr 01 Jul '08

01 Jul '08

Hello, I contact you because an error occurs when compiling the "system" library with the following command prompt : bjam --with-system --toolset=intel --debug-configuration stage The intel compiler seems to be invoked correctly (see mail below). The message error is : error_code.cpp libs\system\src\error_code.cpp(90): error: namespace "std" has no member "strerror" const char * c_str = std::strerror( ev ); ^ compilation aborted for libs\system\src\error_code.cpp (code 2) My OS version is Windows XP. My boost version is 1.35.0 My boost-jam version is 3.1.16-1 (ntx86) My intel compiler version is 10.1.021 Thank you for your answer to fix this error. Regards. > Message du 29/06/08 à 16h30 > De : "Vladimir Prus" <ghost(a)cs.msu.su> > A : simonvifr(a)voila.fr > Copie à : boost-build(a)lists.boost.org > Objet : Re: [Boost-build] boost compilation > > > On Sunday 29 June 2008 18:14:43 simonvifr(a)voila.fr wrote: > > > > Hello, > > > > It is now ok for running the icl.exe in the same command prompt. > > However the following command prompt generate errors : bjam --with-system --toolset=intel stage > > I have then added "--debug-configuration" but I have still errors when executing the command prompt : bjam --with-system --toolset=intel --debug-configuration stage > > > > The error messages are : > > > > error_code.cpp > > libs\system\src\error_code.cpp(90): error: namespace "std" has no member "strerror" > > const char * c_str = std::strerror( ev ); > > ^ > > compilation aborted for libs\system\src\error_code.cpp (code 2) > > Okay, so it appears that the intel compiler is invoked correctly, and then reports > an error of the source code itself. At this point, I don't think it's Boost.Build > issue, but either issue with the Boost.System library, or the Intel compiler -- I > suggest you ask at boost(a)lists.boost.org, making sure "[system]" is in email subject. > > > An other error message is : > > > > notice: [cmdline-cfg] Detected command-line request for intel: toolset= intel version= > > notice: [cmdline-cfg] toolset intel not previously configured; attempting to auto-configure now > > What makes you think this is an error message -- it is not. > > - Volodya > ____________________________________________________ Sur le mail Voila, vous pouvez personnaliser l’anti-spam ! http://mail.voila.fr

2 1

[1.36.0] Bug fix schedule change
by Beman Dawes 01 Jul '08

01 Jul '08

The original 1.36.0 schedule called for branches/release to be closed for routine bug fixes on Thursday, July 3. Because of the Fourth of July holiday in the US, that closing date is being moved to Monday, July 7. Thus developers can still commit routine bug fixes through the weekend. --Beman

1 0

[system] LWG issue 805 name changes applied
by Beman Dawes 01 Jul '08

01 Jul '08

The C++ committee's LWG issue 805 has been applied to Boost.System in trunk, using a namespace and enum as a workaround for non-availability of C++ scoped enums. This changes names: posix_errno -> errc posix_category -> generic_category get_posix_category -> get_generic_category "POSIX" -> "GENERIC" The old names are still supported as deprecated synonyms, so virtually no existing code is expected to break. The changes tested OK locally on Windows against Boost.Filesystem and Boost.ASIO. Let me know if any problems arise. Thanks, --Beman

3 2

error_code and error_category problem
by Berserker 01 Jul '08

01 Jul '08

In my project (using asio) I have something like this: void Foo::myCallback(const boost::system::error_code &e) { if(e == boost::asio::error::operation_aborted) { // bla bla... } } This call is made across a shared dll and I notice that for a "strange" reason e == boost::asio::error::operation_aborted was always false. I discover that when the temporary object boost::system::error_code is constructed from the constants boost::asio::error::operation_aborted the error_code's costructor take a pointer to a "error_category" and the comparison operator is (m_cat is an error_category pointer): inline friend bool operator==( const error_code & lhs, const error_code & rhs ) { return lhs.m_cat == rhs.m_cat && lhs.m_val == rhs.m_val; } In my situation (using shared modules) lhs.m_cat == rhs.m_cat points to differents memory regions (even if are of the same type "system_category") because of the static initialization in the function "get_system_category". The problem exist in the comparison operator of error_category too: bool operator==(const error_category & rhs) const { return this == &rhs; } I suggest to change the comparison criteria (for example using an enumerated value) _________________________________________________________________ Sai che con Messenger guardi la TV con i tuoi amici? http://www.messenger.it/messengertv.html

2 1

[interprocess] Bug in os_file_functions.hpp
by Lars Hagström 01 Jul '08

01 Jul '08

Hi, I've just tried to use the file_locks from the boost trunk, and stumbled across a bug (well, two related bugs, really) when using the try_lock* metods. The problem occurs on linux systems only. The try_acquire_file_lock_sharable and try_acquire_file_lock functions both have the following code in them: int ret = ::fcntl(hnd, F_SETLK, &lock); if(ret == -1){ return (errno != EAGAIN && errno != EACCES) ? acquired = false, true : false; } I believe this should be changed into int ret = ::fcntl(hnd, F_SETLK, &lock); if(ret == -1){ return (errno == EAGAIN || errno == EACCES) ? acquired = false, true : false; } (its the errno checking line that is changed) Without my fix the result of trying to lock a lock that someone else has is an exception. Cheers Lars

2 2

Broken bug reports :-(
by Marshall Clow 01 Jul '08

01 Jul '08

The reporting mechanism in Trac has changed from 0.10 to 0.11; breaking my scripts that generate (most of) the bug reports I send out in the mornings. It will be a few days until I figure out how to fix them. -- -- Marshall Marshall Clow Idio Software <mailto:marshall@idio.com> It is by caffeine alone I set my mind in motion. It is by the beans of Java that thoughts acquire speed, the hands acquire shaking, the shaking becomes a warning. It is by caffeine alone I set my mind in motion.

1 0