March 2005 - Boost - lists.preview.boost.org

Re: [boost] [congif] BOOST_BEFRIEND_TEMPLATE, BOOST_PRIVATE
by Iain Hanson 04 Mar '05

04 Mar '05

On Thu, 2005-03-03 at 23:21 +0100, JOAQUIN LOPEZ MU?Z wrote: > > ----- Mensaje original ----- > De: Jonathan Turkanis <technews(a)kangaroologic.com> > Fecha: Jueves, Marzo 3, 2005 9:49 pm > Asunto: [boost] [congif] BOOST_BEFRIEND_TEMPLATE, BOOST_PRIVATE > > > > > #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS > > > > private: > > > > template<class Y> friend class shared_ptr; > > template<class Y> friend class weak_ptr; These 4 line of code I can read and understand. > > > > > > BOOST_PRIVATE: > > BOOST_BEFRIEND_TEMPLATE(shared_ptr, Y, 1) > > BOOST_BEFRIEND_TEMPLATE(weak_ptr, Y, 1) > > And these 2 lines don't mean anything I can grok. personally, I don't like obfuscated code. /ikh

2 1

RE: [boost] Re: Re: Boost.org Site Suggeswtion was [RE: Re:AdobeOpenSourceLibrary]
by Brian Braatz 04 Mar '05

04 Mar '05

Please keep going with this. I think such a page would help a lot with people "selling" the idea of using boost in their enterprise. For the ACE sample for example, it really provides people the ammunition to use ACE in their company. I use boost in my company and sometimes get weird looks from people when you say "open source" - they think in the back of their heads this is some weird hacky thing dreamed up by a 14 year old and does not have commercial value. (though it helps being the Chief Software Architect- I still get weirdness from non-developers) A list of projects which successfully uses boost would help considerably in dealing with the "pencil heads" of the world :) > -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Jeff Garland > Sent: Friday, March 04, 2005 3:41 AM > To: boost(a)lists.boost.org > Subject: Re: [boost] Re: Re: Boost.org Site Suggeswtion was [RE: > Re:AdobeOpenSourceLibrary] > > On Thu, 3 Mar 2005 12:25:30 -0800, Robert Ramey wrote > > There are a couple of reasons a wiki page might not be the best choice. > > > > a) too easily hackable > > b) I very much like the idea of getting some rough statistics. e.g. > > how many people use library x. This presume data with some sort of > simple > > structure. > > Here's a couple thoughts. First off, the need for this was brought up at > OOPSLA. People really like to see a list of users when evaluating if they > are > going to use a new open source tool. This is a very common feature of > open > source projects. So I think we really need to find a way to do this. As an > example: > > http://www.cs.wustl.edu/~schmidt/ACE-users.html > > As for how to gather the information, I think there needs to be 2 phases. > Phase 1 would be a 'logo like' campaign to gather up current users. We > can > use the wiki/mail list and whatever tools we have available to gather the > information. Publish a request on comp.lang.c++, etc. From this, I'll > volunteer to collate the list and create a fixed web page we can > incorporate > into the main Boost web site. > > Phase 2 would be to come up with a way to maintain this. We could use a > wiki > page or perhaps a small web form to gather up information. This might be > a > simple php script that takes the information and updates the wiki or sends > me > email to add the information to the site. Periodically we would gather > these > up and add them in. > > Actually now that I've written it, it seems like designing the form should > be > the first step... > > Jeff > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

1 0

best way to make {reverse_}fold a sequence
by Larry Evans 04 Mar '05

04 Mar '05

After creating: typedef range_c<int,0,3> types; typedef fold < types , empty_base , inherit< arg<2>, arg<1> > >::type tuple_type; I'd like to use for_each on tuple_type. For example: struct print_integral_c { template<int i, typename Right> void operator()(inherit<integral_c<int,i>, Right>)const { std::cout<<i<<"\n"; } }; for_each<tuple_type>(print_integral_c); However, tuple_type is not a sequence; hence, for_each won't work. I could define the necessary specializations for mpl::begin, etc., to make it a sequence, but I was wondering if there's any way or any plans to somehow automagically make fold or reverse_fold into a sequence so I could use for_each on it.

2 14

RE: [boost] Re: Boost.org Site Suggeswtion was [RE: Re: Adobe OpenSourceLibrary]
by Brian Braatz 04 Mar '05

04 Mar '05

> -----Original Message----- > On Behalf Of Thomas Matelich > OpenSourceLibrary] > > Sounds like a wiki page to me. > > > On Thu, 3 Mar 2005 08:29:17 -0800, Robert Ramey <ramey(a)rrsd.com> wrote: > > I would like to see this idea taken a little bit further. > > > > I would like a place where users of boost can add a line describing: > > > > name > > organization > > application > > which libraries they use > > general comments. > > > > This would be very helpful feedback as to what is getting used by whom > for > > what purpose. It would be useful to library authors to get a sense of > what > > is being used. It would be very useful to people who are considering > > downloading boost and want to know what parts have been found useful to > > other people. > > > > Think of it as "boost" marketing. > > > > Robert Ramey > > [Brian Braatz Writes:] I propose if it becomes a wiki- that there is a LINK to it on the MAIN page

7 7

[Threads] error notification (joining an already exited thread in Windows debug builds)
by Kevin Wheatley 04 Mar '05

04 Mar '05

Hi, using a thread_group, I have an application that runs something like this: thread_group myThreads; for each thread we need myThreads.create_thread(reference to thread function) for each work item { add work item to queue // threads just created start doing the work... } add 'finish' task to queue myThreads.join_all() delete threads... etc etc When running under windows debug build I noticed that the join on the individual threads in the group can fail the assertion: assert(res == WAIT_OBJECT_0); But rather unhelpfully it doesn't include the error code returned by the call or GetLastError() as to why ! In my case I belive this is because the thread has already exited before joining or something similar. now the question would be of course what to do if an error occurs during a non-debug build as the assert will not be there most likely and I'd never notice any problems as the reult is discarded. Thread join could return something rather then being void, that the thread group could then pass back, but then what if the failure occurs half way through the thread group? Should it return a list of error indicators? e.g. thread is not joinable, thread id is invalid, deadlock detected (POSIX optional), or should this be a 'checked_join_all()' (join_all_checked() ?) Is there any work going on that might addrss these concerns? (I checked the CVS branches but didn't find anything obvious) Thanks Kevin -- | Kevin Wheatley, Cinesite (Europe) Ltd | Nobody thinks this | | Senior Technology | My employer for certain | | And Network Systems Architect | Not even myself |

1 0

[Boost-bugs] [ boost-Support Requests-1156682 ] problem building on linux
by SourceForge.net 04 Mar '05

04 Mar '05

Support Requests item #1156682, was opened at 2005-03-04 06:16 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1156682&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: problem building on linux Initial Comment: I tried to build boost under my own user and in a tree that I own. I used : bjam "sTOOLS=gcc" -prefix=/nfs/us13/sverker/c++/boost/install/ install First it said #skipping phyton..." which is ok with me. Then I get : --------------------------------------------------------------------- don't know how to make sTOOLS=gcc don't know how to make -prefix=/nfs/us13/sverker/c++/boost/install/ ...patience... ...found 10593 targets... ...updating 3329 targets... ...can't find 2 targets... Then I get many complaints that it cannot write in /usr/local.. And finaly : ...failed updating 111 targets... ...skipped 3218 targets... ...updated 851 targets... /nfs/us13/sverker/c++/boost/install/ is empty. Do I always have ro run under root? Why do I get these two "dont know how to ..."? Yours Sverker Almehed Lund Sweden ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1156682&group_… ------------------------------------------------------- SF email is sponsored by - The IT Product Guide Read honest & candid reviews on hundreds of IT Products from real users. Discover which products truly live up to the hype. Start reading now. http://ads.osdn.com/?ad_id=6595&alloc_id=14396&op=click _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Joint view and make_variant_over
by Richard Peters 04 Mar '05

04 Mar '05

Hello, I encountered a problem using a sequence obtained by mpl::joint_view with make_variant_over. While I can make a variant over a sequence of types, I can't make the variant over two typesequences joined together with joint_view. I am really new with mpl, so I might just have done something really wrong. The program is below, the line commented out produces lots of errors when uncommented. Is this a problem in either the variant or the mpl library, or did I just do something wrong? thanks, Richard Peters #include <boost/mpl/vector.hpp> #include <boost/mpl/joint_view.hpp> #include <boost/variant.hpp> namespace mpl { using namespace boost::mpl; } struct a {}; struct b {}; int main() { typedef mpl::vector<a> list1; typedef mpl::vector<b> list2; typedef mpl::joint_view<list1, list2>::type joint_list; typedef boost::make_variant_over<list1>::type variant_type1; typedef boost::make_variant_over<joint_list>::type variant_type2; a x; variant_type1 y(x); //variant_type2 z(x); // doesn't compile }

1 0

Re: [boost] Re: RPC library
by Iain Hanson 04 Mar '05

04 Mar '05

On Fri, 2005-03-04 at 10:27 +0100, Johan Nilsson wrote: > "Pavel Vozenilek" <pavel_vozenilek(a)hotmail.com> wrote in message > news:d07hih$veg$1@sea.gmane.org... > > > > H. S. Lahman list available options and argues that passing > > anything else than values is dangerous and causes high coupling: > > http://groups.google.ca/groups?selm=3B86C364.AB1A6066%40worldnet.att.net > > (the paragraphs starting with "pure message"). > > > [snip] > If you use well-defined interfaces I can't see how that would cause any > higher coupling than during normal circumstances (remoting aside). A pretty > common usage would be implementing the Observer pattern cross-process. > Technically it does cause higher coupling. Both sides now know something about each other. But it is really a rather academic point. /ikh

1 0

Re: [boost] Re: Running regression tests
by JOAQUIN LOPEZ MU?Z 04 Mar '05

04 Mar '05

----- Mensaje original ----- De: Jody Hagins <jody-boost-011304(a)atdesk.com> Fecha: Jueves, Marzo 3, 2005 7:04 pm Asunto: Re: [boost] Re: Running regression tests > > Boy, do I feel stupid. I missed errors in the bjam.log file. It > lookslike there was a problem generating bjam.log (but since > stderr was > redirected to the file, it was not obvious). Anyway, I think that is > the problem, but I have no clue as to how it should be fixed. It > lookslike a problem with some Jamfile... > > > Anyone got an idea? > > > > boost-test(RUN) "multi_index/test_range" : Jody, are you trying to run the tests for multi_index in BCB6? This lib is not supposed to work for BCB... Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

3 2

More reviewers wanted: FSM review extended until Mar 6th
by Pavel Vozenilek 04 Mar '05

04 Mar '05

Review of Boost.FSM library was extended by one week, until March 6th. Reviews, even short opinions on this library are much welcomed. I'll encourage public by quoting Darryl Green: ------ quote ----------- I have seen substantial reductions in code complexity arise out of using the fsm libary in a refactoring of some existing code. The result is also much easier to modify/maintain. This last point is particularly important if the fsm is not well specified to start with and/or may need to be modified in reaction to changes in requirements. Using boost fsm an iterative/exploratory design approach works fine. In many ways this is less painful than if there were a code generator. ------- end quote ------ So now is your chance to recommend this tool into Boost (or pin-point problems or suggest alternatives). /Pavel ========================================== Original review announcement: Review of Finite State Machine library written by Andreas Huber starts today, February 21. The library can be found at: http://boost-sandbox.sf.net/fsm.zip (781 kB). FSM is feature rich library to design finite state machines without need for external generator. It is accompanied by extensive documentation. Here are some questions you might want to answer in your review: * What is your evaluation of the documentation? How easy (or hard) it is to understand library features? What can be improved? * What is your evaluation of the design? What features are supported better by alternative FSMs? What could be added (or removed) from the library? * The library documentation contains few not yet solved issues (name, separating the library into two parts, exception handling). What is you opinion here? * What is your evaluation of the implementation? Are there parts of code too obscure or duplicating exiting Boost functionality? Can something be factored out to standalone library or among general utilities? * Are there performance bottlenecks? Does the library design fit requirements of real-time systems? How is it useable for embedded systems? Is the documentation clear on performance tradeoffs? * What is your evaluation of the potential usefulness of the library? Can you compare this FSM to other implementations? * Did you try to use the library? With what compiler? Did you have any problems? Do you have tips for better support of older compilers? What are possible portability problems? * How much effort did you put into your evaluation? A glance? A quick reading? In-depth study? * Are you knowledgeable about the problem domain? And finally, every reviewer should answer this question: * Do you think the library should be accepted as a Boost library? Be sure to say this explicitly so that your other comments don't obscure your overall opinion. Pavel Vozenilek FSM review manager

5 5