- Boost - lists.boost.org

How do I run the tests for a specific library using bjam?
by eg 31 Aug '07

31 Aug '07

I notice that all the boost libraries have tests associated with them, which can be invoked by bjam somehow. Can someone tell me how to invoke bjam to run a specific test for a given (single) library, or run the whole suite of tests for the single library? As opposed to running all tests for all libraries. Alternatively, if you could point me to some docs which describe it, I can take it from there. (I did some searching but have struck out so far). Thanks

4 3

tools/release/user-config.jam
by Vladimir Prus 31 Aug '07

31 Aug '07

There's tools/release/user-config.jam file, that contains some boostbook declarations that can only work on somebody's system. Users are confusing that file with tools/build/v2/user-config.jam. Anybody can explain why we need tools/release/user-config.jam? Assuming nobody will stand up and tell it's really needed within a week, I'll just delete it. - Volodya

1 0

[constrained-value] zero-overhead
by Neal Becker 31 Aug '07

31 Aug '07

One more wish/requirement for cv. Maybe this is already met? I haven't checked. I want to be able to select a policy that does nothing, and on (reasonably modern compilers) achieve performance comparable to the underlying (int) type. That is, I want to use this like logging - where I can switch it off at compile time and make the overhead negligible.

4 5

[Boost.Build] installation problem
by david shaw 31 Aug '07

31 Aug '07

Hi, I go there http://www.boost.org/doc/html/jam/building.html I do: C:\Documents and Settings\src\boost\tools\jam\src>build mingw --debug (like explained) A new folder named bin.ntx86.debug is added after I go there http://www.boost.org/doc/html/bbv2/installation.html 1:(done) 2: I do: C:\Documents and Settings\src\boost\tools\build\v2> bjam --version Instead of seing: Boost.Build V2 (Milestone 11)Boost.Jam 03.1.14 I see: syntax error at EOF Boost.Build V2 (Milestone 11)Boost.Jam 03.1.14 3: I open the user-config.jam file (like explained) and I modify the file, the modification is the following: import toolset : using gcc ; # GCC configuration # Configure gcc (default version) using gcc : : "C:\mingw\bin\g++"; 4: I copy bjam.exe from C:\Documents and Settings\src\boost\tools\build\v2 to C:\Documents and Settings\src\boost\tools\build\v2\example\hello and I run bjam (like explained): C:\Documents and Settings\src\boost\tools\build\v2\example\hello>bjam then I see: "syntax error at EOF No toolsets are configured ..." What is my error? David _________________________________________________________________ Retrouvez tous les services Windows Live sur votre mobile ! http://mobile.live.fr/

3 4

[graph] planar: face traversal and connected issues
by Jens Müller 31 Aug '07

31 Aug '07

I am porting LEDA code to BGL, including code dealing with planar graphs. I have code like this: e2 = G.face_cycle_succ(e1); LEDA documentation says "For an edge e of a map G let face_cycle_succ(e) = cyclic_adj_pred(reversal(e))" I suppose there currently isn't any direct support for such an operation? As far as I understand, I would have to get the embedding[target(e,g)] and then look for e there, and take the predecessor of e, right? I suppose in an undirected graph edges and their "reversal" (i.e., the edge descriptor you get when you get the edge from the other end) are equal? I think directly supporting this would be a nice addition. Furthermore, I think LEDA can do this in O(1), which we cannot. Well, amortized it should be something like O(1), no? The only solution to this problem would probably be storing the embedding in the graph object. Another issue I have is adding an edge to a planar graph while preserving the embedding. E.g., in LEDA, I have code like this: newEdges.append(x = G.new_edge(e3,v)); newEdges.append(e1 = G.new_edge(e1,w)); G.set_reversal(x, e1); From the LEDA docs: "edge G.new_edge(edge e, node w, int dir=leda::behind) adds a new edge x = (source(e), w) to G. x is inserted in front of (dir=leda::before) or behind (dir=leda::behind) edge e into adj$ \_$edges(source(e)) and appended to in$ \_$edges(w) (if G is directed) or adj$ \_$edges(w) (if G is undirected). Here leda::before and leda::behind are predefined constants. The operation returns the new edge x. Precondition source(e)! = w if G is undirected." It seems to me that there is only one adjacent edges list for a vertex, that represents the planar embedding if it has been correctly computed and not invalidated. Well, what I want to say: Functions that can add edges to an embedding would be really cool. Of course, it would be the user's obligation not to invalidate the embedding. Cheers, Jens

3 5

[docs]
by Andrew Sutton 31 Aug '07

31 Aug '07

Has anybody tried building any quickbook docs lately? I updated yesterday (and again today) and found that I can't build any of the docs that I've been working on - or any of the other docs in sandbox/ doc_test. It looks like something is broken with the boostbook build instructions. This is (basically) my Jamfile. using quickbook ; xml std : std.qbk ; boostbook standalone : std : .... ; Running it, I get this: /.../boost/tools/build/v2/build/virtual-target.jam:1017: in virtual- target.register-actual-name from module virtual-target error: Duplicate name of actual target: <pbin/gcc-4.1.2/debug>std.xml error: previous virtual target { quickbook%quickbook.quickbook-to- boostbook-std.xml.XML { std.qbk.QUICKBOOK } } error: created from ./std error: another virtual target { quickbook%quickbook.quickbook-to- boostbook-std.xml.XML { std.qbk.QUICKBOOK } } error: created from ./std error: added properties: <python-debugging>off error: removed properties: none If I comment out the boostbook target, the build will actually succeed, so the problem has to be something with the boostbook - and its something that has to have changed in the last week or so.[ Anybody have any ideas? Andrew Sutton asutton(a)cs.kent.edu

1 0

[Config?] Cannot download 1.34.1, possibly due to "bug" in file type
by Peter Bartlett 31 Aug '07

31 Aug '07

Hi, I just tried to download the 1.34.1 zip from Sourceforge from my behind my corporate firewall. That firewall is of the extremely zealous type and as part of its virus scan of zip files it checks that the "content of the file matches the content type". This check fails for at least one file in the boost archive, and this has the effect that I am prevented from downloading any of the zip file. Here is all the information I have about the failure: > The transferred file > >"http://mesh.dl.sourceforge.net/sourceforge/boost/boost_1_34_1.zip/boost_1_3…" >has been blocked by Webwasher, because the content of the file does not match the >content type "application/x-sh" and Webwasher can not correct > it. In my view there is a bug somewhere along the line (boost sources, sourceforge, my corporation's firewall software/policies) so I am posting this message here in case boost developers can help. Pete

2 2

Can SFINAE be used for testing some trait classes?
by Daryle Walker 31 Aug '07

31 Aug '07

We have some class templates in forms like: //========================================================== template <unsigned X> struct my_test; template <> struct my_test<0u> {}; template <unsigned X> struct my_test { typedef my_test<(X - 1u)> type; }; //========================================================== IOW, the traits express their result as a type, but omit the type for out-of-domain values. I was looking at the enable_if documentation and I was wondering if we can use SFINAE to create functions and/or function templates that will test manifestations of "my_test," but skip the test for out-of-domain values without have to explicitly exclude the values. Here, it's easy to omit "0" from the test file, but for some templates it won't be so obvious which values to exclude. (Worse, the omitted values may change between platforms!) For example, could something like //========================================================== template < unsigned X > typename my_test<X>::type print_out( my_test<X> const &x ) { std::cout << "There's a specialization at " << x << '.' << std::endl; return my_test<X>::type(); } template < typename T > void print_out( T const &x ) { std::cout << "There's no 'type' here." << std::endl; } //========================================================== with some sort of compile-time list (maybe with MPL) that runs each version of "my_test" through the best version of "print_out" be made? (This is all for replacing the macros in "integer_test.cpp" with something more up-to-date.) -- Daryle Walker Mac, Internet, and Video Game Junkie darylew AT hotmail DOT com

3 2

[thread_safe_signals] connection without block/unblock?
by Oliver.Kowalke＠qimonda.com 31 Aug '07

31 Aug '07

Hello, The thread safe signals library contains connection class without block/unblock memebr function (but connection::blocked is available). Is it planed to add this feature - or what is the status of this lib? Regards, Oliver

2 3

Re: [boost] [statechart] Completion transitions again.
by Leandro Lucarella 30 Aug '07

30 Aug '07

> Hi Leandro Hi >> I saw your email[1] via the gmane web interface (did you Cc me? > > Not exactly, I forwarded the message: > > To: llucarella_at_[hidden] > Message-ID: <37229.1564.qm_at_[hidden]> > >> maybe >> you mail was eaten by my antispam =). > > Probably... It was a problem with my ISP, if it's not much trouble, please Cc/forward me to luca at integratech dyndns org. Thanks! >> I don't really know how to handle "partial" completion transitions (I >> mean, with guards). But simple completion transitions could be expressed >> something like: >> >> struct B; >> struct A: sc::simple_state< A, Machine > >> { >> typedef sc::completion_transition< B > reactions; >> }; >> >> I guess is better to have partial support than no support at all =) > > It seems what you want to do with completion transitions can easily be > achieved by posting an event in the entry action of a state? That is, the only additional work you'd have to do in comparison to a library supported scenario is to derive from state instead of simple_state and post an event in the ctor? A state that automatically posts an event in its entry action is useful in other scenarios, please see Dynamic choice points under: > <http://www.boost.org/libs/statechart/doc/rationale.html#Limitations> Yes, I know I could do that, but I have to create a dummy event and it looks like a little dirty to me. > I'm considering to add such a class. I'll have to think about the naming and the exact interface though. Great! What about the other idea? I'm sorry about the lame format, my MUA was messing my ASCII-art =P. Here it is again, I hope this time is more readable: struct ev: sc::event< ev > {}; struct B; struct C; struct A: sc::simple_state< A, Machine > { typedef mpl::list< sc::completion_transition< >, sc::custom_reaction< ev > > reactions; sc::result react(const completion_event&) { if (guard) return transit< B >(); return discard_event(); } sc::result react(const ev&) { if (!guard) return transit< C >(); return discard_event(); } }; >> Another simple question about statechart: it can handle this? >> >> ,-----------------. >> | S |<--- T >> | | >> o--+--> A --> B <--o | >> | | >> `-----------------´ Same here. What I wanted to show was: ,-------------------. z | S |<--- T w | x y | o---+--> A ---> B <---o | | | `-------------------´ >> I want the state machine to start at A, but any other time S is entered, >> I want to start at B. AFAIK this is possible in UML. > > Really? A pointer would be appreciated. Well, it's not exactly the same but in the presentation[1] linked from boost.statechart web page is an example (page 6). In the example is not the initial pseudostate which goes to the inner state. >> Can I express that >> in boost.statechart? > > Not directly, again you could find out which state you want to enter in a > initial helper state entry action and then post an appropriate event. Ok, again this is not very pretty, but I didn't figured this out for this case, I've tried it and it worked, so thanks :) >> I think I hit an static assertion when trying to do >> that (/usr/include/boost/statechart/simple_state.hpp:885: error: invalid >> application of ‘sizeof’ to incomplete type >> ‘boost::STATIC_ASSERTION_FAILURE<false>’). > > You passed mpl::list filled with multiple initial states? If so, then you > tried to create a state with multiple orthogonal regions: > > <http://www.boost.org/libs/statechart/doc/tutorial.html#OrthogonalStates> No, I wasn't using orthogonal regions. I tried to reproduce the error in a smaller example but I couldn't. I attach the example anyways because I hit another error. I'll try to reproduce the previous problem and post it later. TIA -- Leandro Lucarella Integratech S.A. 4571-5252

2 1