May 2010 - Boost - lists.preview.boost.org

[MSM] compiling MSM with GCC 4.4.1 and -fno-rtti
by Richard Szabo 24 May '10

24 May '10

Hi All I try to compile boost msm in an embedded target with gcc 4.4.1 for performance reasons I want to disable RTTI. I'm having problems because backend is using boost::any which is uses RTTI. Is it possible to remove this dependency ?. or introduce some compile switch like in shared pointers .... BOOST_NO_STD_TYPEINFO Thanks in advance. Richie

1 0

Maintenance Patches and cleaning up trac
by Christopher Jefferson 24 May '10

24 May '10

Having recent been browsing through boost trac I have noticed that it seems to be getting a little clogged with some very simple patches. Examples of simple patches: https://svn.boost.org/trac/boost/ticket/3402 - simple documentation patch, 6 months old, duplicated. https://svn.boost.org/trac/boost/ticket/3669 - add stdint.h to thread, fixes comeau, 6 months old. https://svn.boost.org/trac/boost/ticket/4060 - boost thread support for BOOST_NO_IOSTREAM I notice these 3 are in 'thread', and several others are in 'filesystem'. I do not wish to maintain these libraries myself, and it appears no-one else is coming forward to keep these libraries ticking over on a day-to-day basis. I would however personally be happy (possibly with help) to look at applying these patches, and applying the to trunk, and then release in time, assuming they pass regression testing. I would suggest a policy something like the following: 1) If a patch is considered to be "trivially obvious", mark the patch in trac, by leaving a comment, as a 'maintenance patch'. 2) If no-one disagrees within some period of time (2 weeks? 3?), then the patch is applied to trunk. If it passes regression testing it is then moved to release. Any thoughts on the topic? Chris

8 14

Re: [boost] [Boost-docs] Maintaining boost.org
by David Abrahams 24 May '10

24 May '10

At Tue, 25 May 2010 00:32:02 +0800, Joel de Guzman wrote: > > On 5/24/10 10:41 PM, Rene Rivera wrote: > > > > One idea I had, before Boostcon when the whole where should Boost go > > discussion came up, was to move to using something like the Drupal model > > for sub-projects <http://drupal.org/project/Modules>. Particularly how > > the projects each have their own web area. And also how the groups > > section area of Drupal works <http://groups.drupal.org/>. > > > > Note, I'm not suggesting Drupal (even if I do currently use it). Just > > some of the structure they employ for projects since it does mirror the > > conglomerate project structure Boost has. > > Last November, we switched the Spirit site to Wordpress. > > http://boost-spirit.com/home/ > > After having tried Drupal, Joomla, and a couple of other > CMS, we settled on Wordpress because of its simplicity, > low entry barrier and low maintenance. It's just perfect for > people on the go, like us. Agreed; WP rocks. Consider WPMU (or WP3.0) and/or BuddyPress also. I am using those at http://techarcana.net, although I haven't had time to make everything really nice yet. -- Dave Abrahams Meet me at BoostCon: http://www.boostcon.com BoostPro Computing http://www.boostpro.com

1 0

How to build Boost with C++0x compilers
by vicente.botet 24 May '10

24 May '10

Hi, I don't know how to build Boost with C++0x compilers. Which option must be used with bjam? Should the user.config file be modified? Can someone help me? Best, Vicente

5 6

Testing macros..
by Rene Rivera 24 May '10

24 May '10

Once upon a time I did a bunch of work towards a Boost Predef library. The goal was to have a consistent set of version and feature definitions as could be determined from the predefined macros of toolsets <https://svn.boost.org/svn/boost/sandbox/predef/>. But the work stalled for one basic reason.. How do I write tests for such a library? The only other library that approaches the domain of this one is Boost Config and, AFAICT, it doesn't test the macros themselves. As I'm looking to finish of this lib for eventual submission I'm looking for ideas on this. -- -- 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

3 2

Is there a plan to provide a C++0x std library repository in Boost?
by vicente.botet 24 May '10

24 May '10

Hi, Boost provides a lot of C++0x accepted libraries that could be in the std namespace. As it was done for std::tr1, is there a plan to provide these libraries on namespace std? Best, Vicente

4 5

[challenge!] find a common domain
by Eric Niebler 23 May '10

23 May '10

I recently solved a devilish C++ coding problem related to the new sub-domain feature of Proto. I don't care for my solution, so I thought I'd throw it out there and see if some smart person could do better. I'm sending along the skeleton of the solution and some tests that it needs to satisfy. The rest is up to you. The problem goes like this. Every Proto expression has a "domain", which is a type defined something like this: struct my_domain : domain<> {}; A domain can be a sub-domain of another domain, defined like this: struct my_sub_domain : domain<my_domain> {}; When combining sub-expressions into larger expressions, the new expression has some domain that depends on the domains of its children. This domain is calculated according to some rules. - Domains that share no common super-domain are incompatible with each other. The result should be not_a_domain. - A sub-domain is "stronger" than its super-domain. - For a set of domains, the common domain is the strongest domain that is a super-domain of every domain in the set. - default_domain is special; it is compatible with (and dominated by) all other domains. - A sub-domain of default_domain is stronger than default_domain and still compatible with and dominated by all other domains. Your job: implement the deduce_domain3 template that finds the common domain of 3 domains. You're allowed to use decltype, but you get bonus points for a solution that doesn't. Bonus also for instantiating fewest templates. The challenge is for the ternary case, but your solution should scale to N domains. If your solution is better than mine, I'll use it in Proto and credit you! Good luck. P.S. I haven't checked my solution in yet, so you can't look in trunk and cheat. ;-) -- Eric Niebler BoostPro Computing http://www.boostpro.com

8 24

Proposal regarding "boost::add_const".
by Michael Soliman. 23 May '10

23 May '10

Moin Moin. First of all, this is my first boost posting, and as all I could find on "http://lists.boost.org/mailman/listinfo.cgi/boost" told my to post my proposal to this address, I did so (despite of being astonished, that there does not seem to be a directory of subgroups to browse.). However, at least on MSVC 9 as well as on ICL 11 there exists the problem, that the "BOOST_MPL_ASSERT" terms in the attached "consten.rar\consten\consten.cpp" do fail for "boost::add_const" but not for "consten", meaning, that "boost::add_const" was not capable to add constness to reference-types, which "consten" is. Hence my proposal is, to create a service-pack to "boost::add_const" based on "consten" and similarly to all other affected traits, such as "boost::add_volatile" and the like. With kind regards, Michael. P.S.: Is there a web-based, thematically browsable discussion-list (I know it to be sounding typical for windows-users, but these types of lists do save time.). -- __________________________________________ Michael Soliman. Web: http://soliman.de Email: mailto:michel@soliman.de Adresse: Dresdener Strasse 6 64839 Muenster GERMANY Telephon: +(49)6071420815 Handy: +(49)1705605430 Skype: skypeto:michel_soliman_de Oeffentlicher PGP-Schluessel: http://soliman.de/pgp.asc __________________________________________ Alopex GbR (Inhaber.: Michael Soliman & Henning Voß) Gross-Bieberauer Strasse 4, 64354 Reinheim. __________________________________________ Alopex-IT GmbH&Co KG, Eingetragener Name: "Alopex Informationstechnologie GmbH & Co. KG (pers. haft. Gesell.: Alopex Verwaltungsgesellschaft mbH ) ", Ort und Nr. des Registereintrages: Darmstadt, HR A 32356/Darmstadt, HR B 33834, Alopex-Patente GmbH&Co KG, Eingetragener Name: "Alopex Patentverwertungsgesellschaft mbH & Co. KG (pers. haft. Gesell.: Alopex Verwaltungsgesellschaft mbH ) ", Ort und Nr. des Registereintrages: Darmstadt, HR A 32357/Darmstadt, HR B 33834, Sitze: Gross-Bieberauer Strasse 4, 64354 Reinheim, Rechtsformen: GmbH&Co KG, Geschaeftsfuehrer: Voss, Henning und Soliman, Michael. ------------------------------ Zeitweise auch taetig fuer: NETWORK PEOPLE AG Alsfelder Straße 11, 64289 Darmstadt, Germany fon: + 49 . 6151 . 35076-0 fax: + 49 . 6151 . 35076-10 eMail: m.soliman(a)networkpeople.de visit: www.networkpeople.de Vorsitzender des Vorstands: Dipl.-Ing. Siamak Mashayekhi Aufsichtsrat: Dipl.-Chem. Michael Schnieder (Vors.) Sitz: 64283 Darmstadt Amtsgericht Darmstadt HRB 7604 Umsatzsteuer ID: DE204157624 Steuer-Nr.: 007 240 00336 ------------------------------ Diese Mail enthält vertrauliche und/oder rechtlich geschützte Informationen. Wenn Sie nicht der richtige Adressat sind oder diese E-Mail irrtümlich erhalten haben, informieren Sie bitte sofort den Absender und vernichten Sie diese Mail. Das unerlaubte Kopieren sowie die unbefugte Weitergabe dieser Mail ist nicht gestattet. This eMail may contain confidential and/or privileged information. If you are not the intended recipient (or have received this eMail in error) please notify the sender immediately and destroy this eMail. Any unauthorised copying, disclosure or distribution of the material in this eMail is strictly forbidden.

2 1

[test] broken on trunk under cygwin
by Eric Niebler 23 May '10

23 May '10

Eric@AERIX ~/boost/org/trunk/libs/proto/test $ bjam toolset=gcc-4.5 ...patience... ...patience... ...found 1435 targets... ...updating 71 targets... gcc.compile.c++ ../../../bin.v2/libs/proto/test/noinvoke.test/gcc-4.5/debug/link-static/noinvoke.o noinvoke.cpp: In function ‘void test_noinvoke()’: noinvoke.cpp:67:36: warning: unused variable ‘t2’ gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.5/debug/link-static/compiler_log_formatter.o In file included from ../../../boost/config.hpp:57:0, from ../../../boost/detail/workaround.hpp:41, from ../../../boost/test/utils/basic_cstring/basic_cstring_fwd.hpp:19, from ../../../boost/test/utils/basic_cstring/basic_cstring.hpp:20, from ../../../boost/test/detail/global_typedef.hpp:18, from ../../../boost/test/output/compiler_log_formatter.hpp:19, from ../../../boost/test/impl/compiler_log_formatter.ipp:19, from C:\cygwin\home\Eric\boost\org\trunk\libs\test\src\compiler_log_formatter.cpp:1 6: ../../../boost/config/suffix.hpp:484:18: warning: ISO C++ 1998 does not support ‘long long’ ../../../boost/config/suffix.hpp:485:18: warning: ISO C++ 1998 does not support ‘long long’ In file included from ../../../boost/test/unit_test_log_formatter.hpp:23:0, from ../../../boost/test/output/compiler_log_formatter.hpp:20, from ../../../boost/test/impl/compiler_log_formatter.ipp:19, from C:\cygwin\home\Eric\boost\org\trunk\libs\test\src\compiler_log_formatter.cpp:1 6: ../../../boost/test/execution_monitor.hpp:366:5: error: expected ‘}’ before ‘BOOST_FPE_INV’ ../../../boost/test/execution_monitor.hpp:366:41: error: invalid conversion from ‘int’ to ‘boost::fp e::masks’ ../../../boost/test/execution_monitor.hpp:367:1: error: expected ‘,’ or ‘;’ before ‘}’ token ../../../boost/test/execution_monitor.hpp:367:2: warning: extra ‘;’ ../../../boost/test/execution_monitor.hpp:375:1: error: expected declaration before ‘}’ token "/usr/local/gcc-4.5/bin/g++.exe" -ftemplate-depth-128 -O0 -fno-inline -Wall -pedantic -g -DBOO ST_ALL_NO_LIB=1 -I"../../.." -c -o "C:\cygwin\home\Eric\boost\org\trunk\bin.v2\libs\test\build\gcc- 4.5\debug\link-static\compiler_log_formatter.o" "C:\cygwin\home\Eric\boost\org\trunk\libs\test\src\c ompiler_log_formatter.cpp" ...failed gcc.compile.c++ ../../../bin.v2/libs/test/build/gcc-4.5/debug/link-static/compiler_log_for matter.o... -- Eric Niebler BoostPro Computing http://www.boostpro.com

2 1

[nt2] Code from Boostcon 2010
by Ravi 23 May '10

23 May '10

Hi, Is the code for NT2 (presented at BoostCon 2010) publicly available? There is an empty repository on gitorious and another seemingly inactively-developed version on sourceforge. My google-fu fails me in finding a more up-to-date copy. Regards, Ravi

3 4

[castor] Interest in Logic Paradigm for C++ ?
by Roshan Naik 23 May '10

23 May '10

Based on suggestions from some Boost community experts, I would like to gauge interest to see if there is broader interest for including the Castor library into Boost. In short, Castor's aim is to foster multiparadigm programming in C++ by supporting techniques from the Logic Paradigm. See below for a longer description. ============== Description: ============== Logic Paradigm (LP) is a general purpose declarative programming paradigm. It focuses on "what" to compute and not "how" to compute. Although LP has been well explored in Computer Science as a fundamental computational model, it remains unavailable for main stream software development due to lack of support in popular programming languages. Prolog is perhaps the most commonly known language among those that support LP. Castor takes a pure library approach (i.e. without language extensions) for introducing LP to C++. Instead of providing a Logic interpreter or evaluation engine in library form, Castor provides a few simple library primitives on which LP techniques can be supported. This approach allows a natural and deep integration of declarative code into the language and also provides the flexibility of freely combining Logic with the other paradigms such as OO, generics, functional etc. STL concepts like iterators, containers and streams can also be used in declarative code. For an introductory tutorial on LP in C++ and Castor please refer to http://mpprogramming.com/downloads/betaTutorial.pdf. Castor is intended to be a free standing library that depends only on the standard C++ library. It does not depend on Boost or other libraries. It is a pure header library. ============== Current State: ============== A stable 1.0 version has been available since 2008 on www.mpprogramming.com/cpp under the MIT license. Work on version 1.1 is in progress and an early beta is now available. Current efforts are directed largely towards making Castor a richer "standard library" for working with LP in C++. Castor was not originally targeted for Boost but more recently I have been giving it more serious consideration regarding inclusion into Boost. At the upcoming BoostCon 2010 I will be presenting 'Logic Paradigm for C++'. If there is interest, my thought is that feedback from the Boost review/submission process and modifications to satisfy other Boost requirements/guidelines will perhaps yield a 1.2 version that will become the real Boost candidate. Any help in this space will be much appreciated. ================== Links for Castor - v1.1 beta (ported to Gcc 4.4.1 and VC++ 2008) : ================== Library+docs: http://mpprogramming.com/downloads/prebeta-1.1.zip Individually downloadable documentation: Tutorial: http://mpprogramming.com/downloads/betaTutorial.pdf Reference Manual: http://mpprogramming.com/downloads/betaRefManual.pdf Design doc: http://mpprogramming.com/downloads/betaDesignDoc.pdf - Roshan Naik

16 52

[config] GCC symbol visibility across shared libraries
by Beman Dawes 22 May '10

22 May '10

There are several outstanding tickets (2114, 2309, 3697) dealing with GCC symbol visibility across shared libraries (DSO's on UNIX-like systems, DLL's on Windows-like systems). A particular problem that is affecting several Boost libraries (system, filesystem, threads, etc) is that with compiler switch -fvisibility=hidden an exception thrown in one library cannot be caught in another library or in the main program. For more background, see http://gcc.gnu.org/wiki/Visibility Ticket 2114 provided patches to fix the problem, and work started on getting them ready for trunk. But that work seems to have stalled. See http://svn.boost.org/trac/boost/ticket/2114 What needs to be done to restart this effort? It would be better is discussion could occur on this list, rather than as comments attached to the ticket. That will ensure more eyeballs look at this. --Beman

8 33

boost:: program_options
by Vijay Samuel 22 May '10

22 May '10

Hi, I have a query regarding boost:: program_options. Is it possible for multiple programs to use a single configuration file? If so, then how? I have two programs which have to use a single configuration file. Both programs have both similar and unique options but have different default values. Thanks in advance. Cheers, -Vijay Samuel

2 2

Clang Builds Boost
by Doug Gregor 22 May '10

22 May '10

Hi all, Well, we didn't make it before the end of BoostCon, but now we have: Clang successfully builds all of Boost's regression tests on the release branch. More information available at http://blog.llvm.org/2010/05/clang-builds-boost.html . - Doug

17 25

[Atomic] Any multi-threaded tests?
by Phil Endecott 21 May '10

21 May '10

Dear Helge & others, I now have a working ARM Linux system again and I feel I should test the atomics code that I submitted late last year. Is there any test code that actually exercises the atomics across threads? Currently I can see only one test program, and it doesn't seem to involve any concurrency. (Let's not lose momentum on this important library....) Regards, Phil.

1 0

[1.43.0][preprocessor] BOOST_PP_SEQ_FOR_EACH doesn't work recursively
by Adam Badura 21 May '10

21 May '10

BOOST_PP_SEQ_FOR_EACH macro when used within another BOOST_PP_SEQ_FOR_EACH does not expand at all (and the same happens with _R versions). I use Visual Studio 2005. A simple test is: >>>>>>>>>>>>>>>>>>>> #include <boost/preprocessor.hpp> #define SEQ \ ( ( n1 )( n2 )( n3 ) ) \ ( ( n4 )( n5 )( n6 ) ) #define CAT( _r, _data, _elem ) \ BOOST_PP_CAT( _data, _elem ) #define JOIN( _r, _seq ) \ BOOST_PP_SEQ_FOR_EACH_R( _r, CAT, ::, _seq ) #define MAKE( _r, _data, _elem ) \ JOIN( _r, _elem ) BOOST_PP_SEQ_FOR_EACH( MAKE, nil, SEQ ) <<<<<<<<<<<<<<<<<<<< The expected result is something like: >>>>>>>>>>>>>>>>>>>> ::n1 ::n2 ::n3 ::n4 ::n5 ::n6 <<<<<<<<<<<<<<<<<<<< while it is not. Instead we get something like: >>>>>>>>>>>>>>>>>>>> BOOST_PP_SEQ_FOR_EACH_M(3, (CAT, ::, ( n1 )( n2 )( n3 ) (nil))) BOOST_PP_SEQ_FOR_EACH_M(4, (CAT, ::, ( n2 )( n3 ) (nil))) BOOST_PP_SEQ_FOR_EACH_M(5, (CAT, ::, ( n3 ) (nil))) BOOST_PP_SEQ_FOR_EACH_M(4, (CAT, ::, ( n4 )( n5 )( n6 ) (nil))) BOOST_PP_SEQ_FOR_EACH_M(5, (CAT, ::, ( n5 )( n6 ) (nil))) BOOST_PP_SEQ_FOR_EACH_M(6, (CAT, ::, ( n6 ) (nil))) <<<<<<<<<<<<<<<<<<<< It seems to me that something is wrong with BOOST_PP_SEQ_FOR_EACH(_R) because following JOIN macro works well in this test case: >>>>>>>>>>>>>>>>>>>> #define JOIN( _r, _seq ) \ BOOST_PP_LIST_FOR_EACH_R( \ _r, \ CAT, \ ::, \ BOOST_PP_TUPLE_TO_LIST( BOOST_PP_SEQ_SIZE( _seq ), BOOST_PP_SEQ_TO_TUPLE( _seq ) ) \ ) <<<<<<<<<<<<<<<<<<<< While all it does it to use BOOST_PP_LIST_FOR_EACH_R instead of BOOST_PP_SEQ_FOR_EACH_R and change the given sequence to a tuple and then that tuple to a list. Adam Badura

2 1

[Booster] Or boost is useless for library developers
by Artyom 21 May '10

21 May '10

Hello, I want to bring up an important issue that boost developers are not aware of: anybody who develops a library and wants to keep any kind of backward compatibility can-not use Boost. Issue, let's assume I want to develop a small library that keeps backward comparability well. Let's assume I want to use `boost::shared_ptr` as one of the most important parts of boost in my library interface... Impossible. why? Even, for such a small part of boost with stable (even tr1) definitions it is impossible to promise that it would not be broken between releases. Why boost::details::sp_counted_base may be changed because in next version atomic counter was implemented using assembly rather then pthread's mutex... which affects the layout of boost::details::sp_counted_base and thus breaks compatibility. That is not a first time I bring up this issue. But at this point I started to bring a some kind of solution. I do need boost for my FOSS project CppCMS <http://cppcms.sf.net>. I was trying for a long period use renamed version of Boost (with a small tool I written similar to BCP's renamer) inside the library not showing the interface outside but finally I realized that I need boost in interface. I need ASIO, I need shared_ptr, I need regex, I need thread and much more... So I created a small library I called "booster" as part of CppCMS project that has a goal - provide backward compatible and stable boost like library that can be used by other libraries. It has following libraries: - smart_ptr: intrusive_ptr, shared_ptr, - function - locale (full copy of Boost.Locale I develop) - regex (pcre-wrapper, no replace functionality, no wide api) - system (meanwhile without error_condition) - thread (partial) - aio - my own ASIO like library. - ptime - Posix time (very different from boost one) For this purposes I did: - Adopted some of boost code to booster (shared_ptr/intrusive_ptr) and made sure that it would not break ABI with internal changes. - Wrapped pthreads with boost.thread like interface (in any case boost.thread is more like pthreads with C++ interface). So under windows it requires pthreads-win32 library. - I wrapped pcre library with boost.regex like interface. - I had written my own Boost.Asio like library (Booster.AIO) that has very limited use of templates. It uses epoll/devpoll/kqueue where available and poll or select on other platforms (no IOCP as it adds many limitations). - It uses CMake instead of Boost.Build. - It supports **only** modern compilers: gcc>=3.4, MSVC-2008 (2005 should work as well, but not tested), intel 11 compiler. - It is little bit less Windows friendly then Boost - no auto-link, no wide api, no IOCP support. Believe me it wasn't simple decision to start writing this library. But I just had no other choice. ------------------------------------------------ The source code can be found there (svn): https://cppcms.svn.sourceforge.net/svnroot/cppcms/framework/branches/refact… - I do not encourage anybody use it over boost, but if you have similar problems with boost as I have, you are welcome to take a look on it, try it. - I do think that boost is great library. - I would really prefer to use boost if it was not breaking ABI every few month. - I would probably adopt more boost libraries into booster (where possible) ------------------------------------------------------------- I want boost community to think about it... Is it right that developers of many libraries can't use Boost. Think of GTKmm, think of Qt, think of kdelib - that no-one can use it just because they promise backward compatibility. Maybe there is something wrong with it? Artyom.

27 110

Re: [boost] [challenge!] find a common domain
by Krishna Achuthan 21 May '10

21 May '10

"Eric Niebler" <eric(a)boostpro.com> wrote in message news:< 4BF5CA3B.8090807(a)boostpro.com>... > On 5/20/2010 10:54 AM, John Bytheway wrote: > > On 19/05/10 07:02, Eric Niebler wrote: > > <snip> > >> Your job: implement the deduce_domain3 template that finds the > >> common domain of 3 domains. You're allowed to use decltype, but you > >> get bonus points for a solution that doesn't. Bonus also for > >> instantiating fewest templates. The challenge is for the ternary > >> case, but your solution should scale to N domains. If your solution > >> is better than mine, I'll use it in Proto and credit you! > > > > I attach my solution for completeness, though I think Daniel's is > > neater. I used a similar idea to him, but without the use of > > sizeof/decltype, and with the distance-to-not_a_domain implemented > > as a metafunction, rather than injected into the definition of domain. > > > > I think we use about the same number of instantiations, but Daniel's > > lends itself to unrolling much more than mine. I might argue that > > my implementation is a little easier to follow than his, but it > > would be a pretty feeble claim. > > Thanks, John. I'll need to investigate more closely. Everybody's code > is easy to follow when they wrote it! :-) Though I admit, Daniel's > solution is subtle and had me scratching my head for a while. > > And for completeness, here is my (decltype-based) solution. I tried to > make one giant expression that calculates the result in one shot. Like > Daniel, I use inheritance and overloading, but I build a parallel > hierarchy instead of reusing the domains. (For reasons that aren't > relevant, I don't want domains to actually inherit from other domains > in > Proto.) > > -- > Eric Niebler > BoostPro Computing > http://www.boostpro.com > Here's another try. No inheritance or function overloading. I have no idea how many template instantiations are there in this code and if it is acceptable. There is some influence from Daniel's solution in getting the default_domain resolutions right. - Krishna Achuthan

1 0

Let's use stack exchange!
by Gennadiy Rozental 21 May '10

21 May '10

Hi, I've always envied a bit how stackoverflow site was operating. I like the interface much better than mailing lists. Search, filtering, thread tracking... Now that the engine behind it is free http://www.joelonsoftware.com/items/2010/04/13.html I think we can benefit a lot from using it for boost. In addition it should help us with review managers issues. We can use "reputation" based system to qualify potential managers. In practice: who should agree to this and who would do the work? Gennadiy

9 13

[thread] Compiler eoorrs while running the tests
by vicente.botet 21 May '10

21 May '10

Hi, I get some compile errors with boost 1.43 gcc.compile.c++ ..\..\..\bin.v2\libs\thread\test\test_thread_return_local_lib.test\gcc-mingw-4.4.0\debug\threading-multi\test_thread_return_local.o ..\..\../boost/thread/detail/thread.hpp: In function 'boost::thread make_thread_return_local(boost::thread::id*)': ..\..\../boost/thread/detail/thread.hpp:111: error: 'boost::thread::thread(boost::thread&)' is private test_thread_return_local.cpp:16: error: within this context How can the following compile? boost::thread make_thread_return_local(boost::thread::id* the_id) { boost::thread t(do_nothing,the_id); return t; } Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 8

Re: [boost] [challenge!] find a common domain
by Krishna Achuthan 21 May '10

21 May '10

----- Original Message ----- From: <daniel(a)boostpro.com> Newsgroups: gmane.comp.lib.boost.devel To: <boost(a)lists.boost.org> Sent: Thursday, May 20, 2010 6:05 AM Subject: Re: [challenge!] find a common domain > On Wed, May 19, 2010 at 03:54:29PM -0700, Eric Niebler wrote: >> On 5/19/2010 3:29 PM, Daniel Wallin wrote: >> > On Tue, May 18, 2010 at 11:02:56PM -0700, Eric Niebler wrote: >> >> Your job: implement the deduce_domain3 template that finds the common >> >> domain of 3 domains. You're allowed to use decltype, but you get bonus >> >> points for a solution that doesn't. Bonus also for instantiating fewest >> >> templates. The challenge is for the ternary case, but your solution >> >> should scale to N domains. >> > >> > Here's mine. It's decltype based, but I guess it could be sizeof based >> > in C++03. >> >> Wow! SO much simpler than my solution. I'll need to study this in depth. >> I also specialized domain<default_domain> to insert an extra level in >> the inheritance tree like you did. That's a great simplification, but it >> took me a week to see that. Kudos. > > Thanks. :) > >> BTW, you're creating a zero-sized array in sized_type<0>. I just >> bumped all the integers by one and it works fine on msvc-10. > > Duh, good catch. > >> This looks more efficient at compile-time, too. I'll be embarrassed to >> post my solution. :-O But not yet. Anybody care to eliminate decltype so >> I can use this in Proto? Anybody think they can instantiate fewer templates? > > Here's one without decltype. The changes needed were pretty minor. It > might still be possible to reduce the number of instantiations. For > instance, you could specialize nth_domain<> on some more indicies (I'm > guessing the number of super domains should be fairly low), but I don't > know what the cost of specialization compared to instantiation is. > > -- > Daniel Wallin > BoostPro Computing > http://www.boostpro.com When I tried to compile the code using VC 2005, it failed with the following error: error C2064: term does not evaluate to a function taking 1 arguments deduce_domain.cpp 53 After I broke the struct into two pieces like below, it works fine. template <class D0, class D1> struct domain_depth { static const int value = domain<D0>::index - sizeof(domain<D0>::deduce((D1*)0)); }; template <class D0, class D1, int DefaultCase = sizeof(default_case((D0*)0, (D1*)0))> struct deduce_common : nth_domain<domain_depth<D0, D1>::value, D0> {}; - Krishna Achuthan

2 1

[geometry][units] Vector Class
by Terry Golubiewski 21 May '10

21 May '10

I imagine that using geometry/unit together will be common. I just posted these files on boost-user too, but I wanted the geometry/units developers to see what I've done. I think it was too difficult to make a Vector<quantity<U,T>> class. However, it could be done, so that is very good! The problem is that the geometry library assumes that the types of T*T and sqrt(T) is the same as T. terry

5 7

[Test] WinCE patch for floating point changes
by David Deakins 20 May '10

20 May '10

Hi Gennadiy, I noticed the recent floating point feature broke testing on Windows CE since it does not have the _controlfp_s function like full-blown Windows. Do you mind if I apply the attached patch to make testing work again (at least until a suitable real implementation is found for WinCE if possible). Thanks, -Dave

1 0

boost thread slow with only one thread
by Natacha Fort 20 May '10

20 May '10

hi! here is my problem i am multithreading my program with boost but i don't get what i expect, and i can't understand why! i just run one thread and wait for it, and the fps are divide by 3. basically with no thread i have 30fps, and with 1 thread i have 10fps. here is the code: Code: boost::thread_group forces_threads; forces_threads.create_thread(boost::bind(&ElasticRods::computeBendingForces,this,edges,kb,edges_initial)); forces_threads.join_all(); i use thread_group because i want to run 7 thread but it is already too slow! do you have an idea of why this is so slow? thank you for your help!

3 2

[config] Is there a macro to check if we are compiling in C++0x mode?
by vicente.botet 20 May '10

20 May '10

Hi, In Boost.Config I see "Macros that describe C++0x features not supported", but there is a macro to check if the compiler is working on C++0x mode? Best, _____________________ Vicente Juan Botet Escribá http://viboes.blogspot.com/

2 2