- Boost - lists.boost.org

Documentation policy about namespaces
by Lasse Kärkkäinen 03 Aug '09

03 Aug '09

I couldn't find any discussion about this, but I have noticed that the documentation often completely neglects to mention the namespaces used or just mentions somewhere which using namespace directives should be used instead of documenting the namespaces of individual symbols. To me it would seem best to use explicit namespace specification in all example code and reference documentation. However, in example code where this is unsuitable (e.g. boost::placeholders::_1), the required using declarations and directives should be documented along with which symbols they are used for. Adding the namespace information to the documentation increases clarity because it instantly tells the reader which symbols are part of the library and which are part of the example code. Additionally, a number of Boost libraries already use the same symbol names in their respective namespaces, so assuming a large collection of using namespace directives is a bad practice. Documenting the header files to use and the libraries to link is another similar issue, but the problem is not as severe as it is with namespaces.

2 1

Release branch regression testing failures
by Beman Dawes 03 Aug '09

03 Aug '09

Stale tests have been cleared, and there is a fresh release branch regression test report up at: http://beta.boost.org/development/tests/release/developer/summary.html Libraries reporting errors on more than one platform are: bimap - all platforms failing build - all non-Linux platforms failing math - all platforms failing numeric/interval - two platforms failing optional - two platforms failing python - Linux platforms failing spirit - all platforms failing type_traits - all platforms failing units - two platforms failing I'd appreciate it if the developers involved would clear these tests in the next few days. Thanks, --Beman

10 12

There's a serious problem with the Boost Community :(
by Jon Biggar 03 Aug '09

03 Aug '09

Even though this is a complaint, let me start off by stating that I'm a happy user of Boost libraries for over six years, and don't intend to stop. That said, here's the problem: simple patches submitted languish without action or response for far too long. I submitted a patch for bjam with ticket #2552 back in November, including test cases to verify that it operates correctly. But despite requesting over several release cycles since then, no action has been taken and I haven't even gotten a response. It's a pain in the butt to have to keep reintegrating the same patch, release after release so I can keep working on code that I hope to one day submit to for inclusion in a Boost release. The Boost Community *really* needs a mechanism to ensure that patches submitted are acknowledged, vetted, and if found worthy, integrated into a release in a timely manner. Not doing so discourages contribution. Let me suggest that the Community set up something like the review queue, where a few volunteers could regularly select the next patch, request comments from the community and then champion getting the patch integrated into the next Boost release. I understand that library owners have a stake in the design vision and integrity of their library's code, so the community will have to figure out a policy where patches with minimal impact on a library's integrity can be quickly integrated without requiring a lot of the primary library owner's or maintainer's time, but will still get integrated or rejected in a timely manner. -- Jon Biggar jon(a)floorboard.com jon(a)biggar.org jonbiggar(a)gmail.com

4 5

Help with SVN required
by Robert Ramey 02 Aug '09

02 Aug '09

I want to merge current state of the directories of the serialization library into the release branch. In order to do this, I consult the SVN documentation as well as the instructions at https://svn.boost.org/trac/boost/wiki/ImprovingPractices When I do the merge - I get a large number of conflicts. It looks like: a) lines deleted from the trunk are not deleted from the new (release) working copy. b) files deleted from the trunk are not deleted from the new (release) working copy. c) files which have been added to the trunk don't show up in my (release) working copy. According to the SVN documentation I should go through the dozens of files with conflicts one by one and examine them and resolve all the conflicts. What I really want is for the current state of the trunk to be "transfered" to the release branch. Any body know what i might be doing wrong? Robert Ramey

3 5

request: BOOST_NO_SFINAE_EXPR macro
by Mathias Gaunard 01 Aug '09

01 Aug '09

It would be very nice if Boost.Config provided the BOOST_NO_SFINAE_EXPR macro, that would be defined if the compiler does not support SFINAE applied to expressions. http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2008/n2634.html GCC supports this feature since 4.4 both for C++03 and C++0x for example.

3 7

issues when compiling boost with visual c++ 8 and 9
by Sean Farrow 01 Aug '09

01 Aug '09

Hi: The following is the output I am currently getting with the current trunk when trying to compile with visual c++ 9, tried with visual c++ 8 and got a similar error: C:/Program Files/boost/tools/build/v2/tools\msvc.jam:1040: syntax error at keyword = C:/Program Files/boost/tools/build/v2/build\toolset.jam:38: in toolset.using rule msvc.init unknown in module toolset. C:/Program Files/boost/tools/build/v2\build-system.jam:465: in process-explicit-toolset-requests C:/Program Files/boost/tools/build/v2\build-system.jam:545: in load C:\Program Files\boost\tools\build\v2/kernel\modules.jam:283: in import C:\Program Files\boost\tools\build\v2\kernel\bootstrap.jam:138: in boost-build C:\Program Files\boost\boost-build.jam:17: in module scope Hope this helps. Sean.

3 3

Please Help: Experienced very bad performance with Multi-index
by Jarolin, Robert 31 Jul '09

31 Jul '09

Below is a sample program that I am running. If I create a multi-index as defined below, the performance as the number of entries increases gets to the point of being unusable. Examples: Num Entries Time to insert last entry Time to insert all entries 100 452 usecs 30.4 millisecs 1000 4.6 millisecs 2.4 seconds 10000 52.2 millisecs 266.92 seconds (over 4.5 minutes) This performance does not seem to be correct to me. Deletions from a multiindex based on a key, were taking super long as well (not shown in the below program). To delete all 1000 entries based on being below a certain ordered value was taking over 2 minutes. Is there something that is wrong with the below program that is causing these issues? Thanks for any help. XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX Cut Here XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX #if !defined(NDEBUG) #define BOOST_MULTI_INDEX_ENABLE_INVARIANT_CHECKING #define BOOST_MULTI_INDEX_ENABLE_SAFE_MODE #endif #include <boost/multi_index_container.hpp> #include <boost/multi_index/member.hpp> #include <boost/multi_index/ordered_index.hpp> #include <boost/multi_index/hashed_index.hpp> #include <algorithm> #include <iostream> #include <iterator> #include <string> #include <sys/time.h> using boost::multi_index_container; using namespace boost::multi_index; using namespace std; struct ErRecord { int value1; std::string value2; int value3; int value4; ErRecord() : value1(0), value2(""), value3(0), value4(0) { } ErRecord(int _value1, const std::string& _value2, const int _value3, int _value4) : value1(_value1), value2(_value2), value3(_value3), value4(_value4) { } }; //@@== Tags struct value1 {}; struct value2 {}; struct value4 {}; struct value3 {}; typedef multi_index_container < ErRecord, indexed_by < ordered_non_unique < tag<value1>, BOOST_MULTI_INDEX_MEMBER(ErRecord, int, value1) >, ordered_non_unique < tag<value2>, BOOST_MULTI_INDEX_MEMBER(ErRecord, std::string, value2) >, ordered_non_unique < tag<value3>, BOOST_MULTI_INDEX_MEMBER(ErRecord, int, value3) >, ordered_non_unique < tag<value4>, BOOST_MULTI_INDEX_MEMBER(ErRecord, int, value4) > > > ErRecordMap; int main(int argc, char* argv[]) { int numloops = 100; if (argc > 1) numloops = atoi(argv[1]); ErRecordMap em; char buf[50]; int i = 0; int sec; int usec; unsigned long long u64; struct timeval tv_start, tv_end; struct timeval tv_before, tv_after; gettimeofday( &tv_start, 0 ); while (1) { sprintf(buf, "value2-%d", i); gettimeofday( &tv_before, 0 ); em.insert(ErRecord(i, string(buf), i, i)); gettimeofday( &tv_after, 0 ); if( i == numloops ) { sec = tv_after.tv_sec - tv_before.tv_sec; usec = tv_after.tv_usec - tv_before.tv_usec; if (usec < 0) { sec--; usec += 1000000; } u64 = sec * 1000000 + usec; cout << "Time to insert last entry: " << sec << ":" << usec << endl; } ++i; if( i > numloops ) { break; } } gettimeofday( &tv_end, 0 ); sec = tv_end.tv_sec - tv_start.tv_sec; usec = tv_end.tv_usec - tv_start.tv_usec; if (usec < 0) { sec--; usec += 1000000; } u64 = sec * 1000000 + usec; cout << "total: " << numloops << "," << sec << ":" << usec << endl; cout << "average: " << numloops << "," << u64/numloops << "usec" << endl; return 0; } XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX Cut Here XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

3 9

Boost.Build tests on OSX
by Vladimir Prus 31 Jul '09

31 Jul '09

In the current release state, there are three Boost.Build tests that fail on OSX, and I neither have access to OSX right now nor won't have access to it in future. Could somebody who already has Boost.Build setup, to to tools/build/v2/test and run three commands: python library_chain.py --verbose python library_order.py --verbose python searched_lib.py --verbose And send me the output? Thanks, Volodya

2 3

Re: [boost] 0MQ messaging in Boost
by dhruva 31 Jul '09

31 Jul '09

Hello, Apologies for replying to the chain with no context as I just enabled the mail delivery on this list (was using the web front end). I have a need for a robust and fast peer to peer messaging service in C++. If it has extra language bindings, it makes it better so that I can ask clients to write their own subscribers in any language. I thought of using memcache but that does not work in a pure windows (server and client) environment. MPI seems to be more for distributing work load and not for distributed computing (I confess I still have not understood the differences). 0MQ (zeroMQ) appears to be the best available library from what I know. Since I use Boost and intend to use as much of it as possible to streamline the code and interface, I prefer a solution from Boost distribution. Message Queue is more a pattern and IMO feel it fits into Boost. The same way Boost::Accumulators use Boost::Math, 0MQ could use ASIO and extend ASIO to help application programmers with a MQ implementation. The fact that 0MQ does not use Boost today should not guide the decision on whether to incorporate 0MQ into Boost or not? 0MQ can use the most suitable parts of Boost (ASIO and maybe many more libraries) so that it exposes a similar Boost like interface to the user. Note: Along similar lines, I had posted regarding a distributed lock manager. Message queue and distributed lock manager using ASIO can be great libraries for cluster programming. Boost can become one single requirement for enterprise programming in the distributed/cloud environment. regards, dhruva Yahoo! recommends that you upgrade to the new and safer Internet Explorer 8. http://downloads.yahoo.com/in/internetexplorer/

1 0

Re: [boost] 0MQ messaging in Boost
by Brian Wood 31 Jul '09

31 Jul '09

Yigong Liu writes: > Hello Pieter, > Could you please have a look of "Channel", a message passing library i have > been developing in boost, for a comparison with 0MQ? > website: http://channel.sourceforge.net/ > design doc: > http://channel.sourceforge.net/boost_channel/libs/channel/doc/design.html > download: Hi, Yigong, The following section from the Channel documentation doesn't do much for me. 7.2 compare STL and ChannelSome mapping between STL and Channel's concepts: - containers (sequence, assoc) <=> name spaces (linear/hier/assoc) - elements in container <=> names (unit/element in name space) - iterator_range (target of algorithms) <=> name binding set (sender->receiver(s), receiver->sender(s)) target of dispatchers - algorithms <=> dispatchers Brian Wood Ebenezer Enterprises www.webEbenezer.net "Then Samuel took a rock and set it up between Mizpah and Shen. He named it Ebenezer [Rock of Help] and said, 'Until now the L-RD has helped us.'"

2 1