March 2005 - Boost - lists.boost.org

Re: uBLAS mailing list
by Ian McCulloch 05 Mar '05

05 Mar '05

Nikos Platis wrote: > Hi, > > Being new to uBLAS I wanted to post a message to its mailing list. > Unfortunatly, the documentation still mentions the Yahoo Group, which, > as I now find out, is not the current mailing list of the project. I > read at > http://lists.boost.org/MailArchives/ublas/msg00095.php > that the problem will be corrected with the next release, We really have to wait until the next boost release to get an important correction made to the boost web page? That sounds nuts! > but, until > then, I believe that the easiest thing to do is add a large message at > the homepage of the Yahoo Group with information pointing to the new > mailing list (I have seen such messages in other Yahoo Groups). IIRC, the problem is none of the yahoo groups administrators are active on boost anymore, in which case that is not possible. Cheers, Ian

3 5

high_resolution_timer \ timer feature requests for Boost.Timer
by Brian Braatz 05 Mar '05

05 Mar '05

First off- note that Timer can take a start time on the ctor: class timer { public: timer() { _start_time = std::clock(); } // postcondition: elapsed()==0 (snip) high_resolution_timer does not however: class high_resolution_timer { public: // ctor high_resolution_timer() { start_time.QuadPart = 0; frequency.QuadPart = 0; if (!QueryPerformanceFrequency(&frequency)) throw std::runtime_error("Couldn't acquire frequency"); restart(); } (snip) MY PROBLEM: I need to feed the timer the START time (or get FROM it the start time would be preferred) The reason I need this is because for logging purposes (working with the Profiler from Christopher Diggins) I need to log the start and stop times, and I need it to (for internal cross reference) be the same number for multiple purposes. MY REQUESTS: Easy request: high_resolution_timer is changed to have the same type of ctor as timer does May Start a discussion request: That something like a starttime() method is provided for both classes Medium request- That both classes do a typedef for the type returned by the starttime method i.e. instead of class high_resolution_timer { public: (snip) private: timer t; // backup in case of QueryPerformanceCounter() bug LARGE_INTEGER start_time; LARGE_INTEGER frequency; }; You have instead: class high_resolution_timer { public: (snip) typedef LARGE_INTEGER TIME_TYPE; private: timer t; // backup in case of QueryPerformanceCounter() bug TIME_TYPE start_time; TIME_TYPE frequency; }; (for both high_resolution_timer and timer) There you go, those are my requests. Now I will sit here quietly and hope there is a Santa Claus.... (grin)

3 2

FSM - Late Review
by jdspalding＠comcast.net 05 Mar '05

05 Mar '05

FSM Review - John Spalding - 2005/MAR/04 Contents - Overall impression. - my use case. - review manager's questions. ******************************* Overall Impression ******************************* I have been completly impressed by the FSM library, and recommend that it be immediately accepted into the Boost Libraries. I had been looking for a system that implemented hierarchical state machines, and never before found anything satisfactory. The ideas behind the Harel state chart had always seemed to me to have a place in standard software development. Prior to using FSM, I had read through another effort on C++ state machine development "Practical State Charts in C++", by Miro Samek, CMP Books, 2002, and found its methods unsatisfactory. I was impressed by Samek's advocacy of the utility of hierarchical state machines in software design. I am now using FSM for a modest practical project at my work, involving about 10 events and 10 states. FSM will replace a home brew non-hierarchical state machine. I like the ability to model hierarchical states and I also like the way FSM allows state networks to be constructed and modified quickly. => improvements - new user documentation <= I would add to the documentation a small section on trouble shooting the compile. When I started out, the fact that state machine connectivity was specified in templates caused me a bit of head scratching. My typical new-user mistakes resulted in lots of error messages. I would explicitly address this area, describing how connectivity errors cause compile time errors, for common state machine hook up errors. For example, if I change the "context" for just one state from the correct value to an incorrect value, I get over 90 lines of output. I think if you explicitly described a simple strategy for tracking down these connectivity problems, it would help the new user. ********************************************** Usability Evaluation - my modest use case. ********************************************** A distinguishing characteristic of this FSM library is its use of C++ templates to specify event/state connectivity. - we specify which events are handled or ignored when we are in a specified state. - we specify the sub-state network for the state machine. These are two separate connection operations. Both are specified by the class declaration for the state. A typical class template I used follows, in the example code. - the event handing connectivity is specified by the 3-rd argument to the fsm::simple_state<> template, an mpl::list of events. Simpler forms exist for the case that an event does not require special processing, however this general case is not complex. - the sub-state network is handled by the first two arguments to the fsm::simple_state<> template. The second argument simply names the "outer state", or containing state of this state. The outermost states of the finite state machine also have to instead name the controlling class, derived from fsm::state_machine. - In addition, I have provided an IFsmState<> template that implements a "GetState()" function that can be called by the state machine. I have used FSM to implement a modest sized state machine with about 10 events and 10 states. This particular state machine implements the high level application state of a data taking machine control application. In this application there are about 4 varieties of data taking. Using a common outer state Acquisition, containing the data taking states, allows me to write once the common code that causes data taking to stop. This application also monitors a significant number of conditions that require the system to take action when an abnormal condition (or hazard) occurs. This led me to have two outermost states, Hazard and NoHazard. When an abnormal condition is signalled, the hierarchy allows me to write once the code that stops data taking, and causes the system to enter the Hazard state. Bottom line, I found hierarchical state modeling to be very useful. I also found that FSM had answers for all the problems I encountered reducing the hiersrchical state machine to working code, in this relatively small example. The only "advanced" functions of FSM I utilized were state_cast<> and context<>. struct StIdle : IFsmState<StIdle>, fsm::simple_state< StIdle, StNoHazard, mpl::list< fsm::custom_reaction< EvSortEnter>, fsm::custom_reaction< EvCalEnter>, fsm::custom_reaction< EvTestEnter>, fsm::custom_reaction< EvTemplGenEnter> > > { StIdle(); ~StIdle(); fsm::result react(const EvSortEnter &); fsm::result react(const EvCalEnter &); fsm::result react(const EvTestEnter &); fsm::result react(const EvTemplGenEnter &); }; // Used for all states... struct IFsmStateQuerry { virtual const type_info & GetState() const = 0; }; // Used for all states... template<typename T> struct IFsmState : public IFsmStateQuerry { const type_info & GetState() const { return typeid(T); } }; class SystemFsm : public IFsmStateQuerry, public fsm::state_machine< SystemFsm, StNoHazard > { public: SystemFsm() { } // ... // Get state information. const type_info & GetState() const { // state_cast produces object in active state. // GetState returns type_info for that state. return state_cast< const IFsmStateQuerry & >().GetState(); } }; ***************************** Review manager's questions ***************************** What is your evaluation of the documentation? - I proposed adding a new user section, to help with compile time problems caused by state machine connect errors. - I also think the central role of the "context" parameter in simple_state<>, when specifying how to connect up all the states, could be stressed more, esp. for new users. What is your evaluation of the design? - I did not review the design implementation. - The FSM API is novel, due to template use, but I grew to like it. Are there parts of the implementation that duplicate parts of BOOST? - no, the entire FSM is novel. I did not evaluate performance bottlenecks, nor real-time aspects of usage. I did try to use the library for a practical library, and had lots of fun. (see my use case section) How much work did you put into the evaluation. - I have spent several days reviewing FSM, and have tracked it since I read about it on the boost list in 2004. - I have spent 2-3 days on the modest practical project. Domain Knowledge... - I am an "interested" user, but not an expert. I strongly believe FSM should be accepted into Boost.

2 1

[Boost-bugs] [ boost-Patches-1157160 ] patch for boost::filesystem
by SourceForge.net 05 Mar '05

05 Mar '05

Patches item #1157160, was opened at 2005-03-05 07:23 Message generated for change (Comment added) made by fotzor You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1157160&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Steven Weiss (fotzor) Assigned to: Nobody/Anonymous (nobody) Summary: patch for boost::filesystem Initial Comment: hi, when you try to get the branch path of this "c:\some_dir\some_file.txt" under windows the branch path should be "c:\some_dir". what is returned instead is "c:" which isn't correct. so here's the fix: in path_posix_windows.cpp: std::string::size_type leaf_pos( const std::string & str, std::string::size_type end_pos ) // end_pos is past-the-end position // return 0 if str itself is leaf (or empty) { if ( end_pos && str[end_pos-1] == '/' ) return end_pos-1; std::string::size_type pos( str.find_last_of( '/', end_pos-1 ) ); # ifdef BOOST_WINDOWS if ( pos == std::string::npos ) pos = str.find_last_of( '\', end_pos-1 ); // ADDED if ( pos == std::string::npos ) pos = str.find_last_of( ':', end_pos-2 ); # endif return ( pos == std::string::npos // path itself must be a leaf (or empty) # ifdef BOOST_WINDOWS || (pos == 1 && (str[0] == '/' || str[0] == '\')) // or share // ADDED # endif ) ? 0 // so leaf is entire string : pos + 1; // or starts after delimiter } mfg steven ---------------------------------------------------------------------- >Comment By: Steven Weiss (fotzor) Date: 2005-03-05 08:24 Message: Logged In: YES user_id=1124235 i forgot something... in branch_path() you must also change the condition of the if to: if ( end_pos && (m_path[end_pos-1] == '/' || m_path[end_pos-1] == '\') && !detail::is_absolute_root( m_path, end_pos ) ) --end_pos; else it doesn't work proper. perhaps there are other functions depending on leaf_pos() that must be adjusted as well ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1157160&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

[Boost-bugs] [ boost-Patches-1157160 ] patch for boost::filesystem
by SourceForge.net 05 Mar '05

05 Mar '05

Patches item #1157160, was opened at 2005-03-05 07:23 Message generated for change (Tracker Item Submitted) made by Item Submitter You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1157160&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Steven Weiss (fotzor) Assigned to: Nobody/Anonymous (nobody) Summary: patch for boost::filesystem Initial Comment: hi, when you try to get the branch path of this "c:\some_dir\some_file.txt" under windows the branch path should be "c:\some_dir". what is returned instead is "c:" which isn't correct. so here's the fix: in path_posix_windows.cpp: std::string::size_type leaf_pos( const std::string & str, std::string::size_type end_pos ) // end_pos is past-the-end position // return 0 if str itself is leaf (or empty) { if ( end_pos && str[end_pos-1] == '/' ) return end_pos-1; std::string::size_type pos( str.find_last_of( '/', end_pos-1 ) ); # ifdef BOOST_WINDOWS if ( pos == std::string::npos ) pos = str.find_last_of( '\', end_pos-1 ); // ADDED if ( pos == std::string::npos ) pos = str.find_last_of( ':', end_pos-2 ); # endif return ( pos == std::string::npos // path itself must be a leaf (or empty) # ifdef BOOST_WINDOWS || (pos == 1 && (str[0] == '/' || str[0] == '\')) // or share // ADDED # endif ) ? 0 // so leaf is entire string : pos + 1; // or starts after delimiter } mfg steven ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=307586&aid=1157160&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

RE: [boost] high_resolution_timer \ timer featurerequests forBoost.Timerr
by Brian Braatz 05 Mar '05

05 Mar '05

> -----Original Message----- > On Behalf Of James Fowler > Sent: Friday, March 04, 2005 1:10 PM > Brian Braatz wrote: > > >First off- note that Timer can take a start time on the ctor: ... > > > >high_resolution_timer does not however: ... > > > > high_resolution_timer() { ... > > if (!QueryPerformanceFrequency(&frequency)) > > throw std::runtime_error("Couldn't acquire frequency"); > >... > > > >MY PROBLEM: > > I need to feed the timer the START time (or get FROM it the start > >time would be preferred) > > > >The reason I need this is because for logging purposes (working with the > >Profiler from Christopher Diggins) I need to log the start and stop > >times, and I need it to (for internal cross reference) be the same > >number for multiple purposes. > > [Brian Braatz Writes:] My most basic problem is high_resolution_timer and boost.timer have different interfaces, one takes a time to start with the other does not. I realize the high_resolution_timer is windows only and I realize that the struct it uses to store the time is windows specific. At the simplest level I am asking for this: Have both high_resolution_timer and timer support: * Typedef's for the internal TYPE * Same construction interface using that type * Accessor method to GET to the internal data Then I could accomplish what I am trying to do- I am not just measuring things, but putting a layer on top. I can live with the issues with timers. What I am after is being able to do this- Record profile LOGS in different threads (not reports, but logs of every call that happened), spit out the approximate TIME each one of those events occurred, this gives the human reader a conceptual way to connect the different logs in time- Right now I am using hours, mins, seconds for this, getting to the internal time is one way , the other is to make a redundant call to QueryPerformanceCounter() or what have you. This probably gets into the deeper question of "are these classes supposed to have roles that extend a bit beyond just holding time duration?" If nothing else, I ask that making the interface amongst the timers be the same (same ctor style and the typedef so I can write code against either) > > > IMHO, based on the example you gave, you're mixing two separate > problems: how to capture a representation of current time, and how to > present an interface to capture durations of time. I haven't really > examined the Profiler mentioned lately in detail, so maybe you've > actually already dealt with this in the real code. If so, I'd like to > take a look, as I'm working through similar issues myself. If not, I'm > working on something that be useful to you. [Brian Braatz Writes:] Yes, I am mixing many problems. I am building something on top of Profiler (by Chris Diggings) to also do log tracing, and do it multi-threaded- So now I can see the normal profile report, AND I can also turn on DEEP TRACING which will tell me all the calls that occurred and how long they took. (the sample below doesn't show it, but I have need of getting the internal time data and using it to get a sense of "roughly" when 2 threads of execution are near-about each other- it can be a little off and that is fine) Here is some samples of what I have working: (EVENT_BEGIN and EVEN_END define the profiler objects which use RAII to engage and disengage the profile point) (sample code to test the profiler \ logger) class Fname { public: void SetText() { EVENT_BEGIN(Fname,SetText); Sleep(300); EVENT_END(Fname,SetText); } }; class EntryScreen { Fname m_FName; public: void DoSomethingElse() { EVENT_BEGIN(EntryScreen,DoSomethingElse); PROFILE_CHECKPOINT(DataBaseOperation); Sleep(1234); EVENT_END(EntryScreen,DoSomethingElse); } void DoOtherStuff() { EVENT_BEGIN(EntryScreen,DoOtherStuff); Sleep(1432); m_FName.SetText(); EVENT_END(EntryScreen,DoOtherStuff); } }; class MainWindow { EntryScreen r; public: void DoSomething() { EVENT_BEGIN(MainWindow,DoSomething); { r.DoSomethingElse(); r.DoOtherStuff(); } EVENT_END(MainWindow,DoSomething); } }; Test() { MainWindow in; In.DoSomething(); } Here is the profile REPORT: (this is what the Profiler that Mr Diggins started produces) profile total count mean percent CP-DataBaseOperation 1.230334 1 1.230334 16.392611 Fname#SetText 0.312570 1 0.312570 4.164595 MainWindow#DoSomething 2.981596 1 2.981596 39.725903 EntryScreen#DoOtherStuff 1.750382 1 1.750382 23.321574 EntryScreen#DoSomethingElse 1.230537 1 1.230537 16.395316 total entries 5 total time elapsed 7.505420 overall average 1.501084 NOW- here is the LOG DEPTH DATE TIME NAME ELAPSED 1 3/4/2005 17:06:02 MainWindow#DoSomething 2.98135 2 3/4/2005 17:06:02 EntryScreen#DoSomethingElse 1.23054 2 3/4/2005 17:06:03 EntryScreen#DoOtherStuff 1.75038 3 3/4/2005 17:06:05 Fname#SetText 0.312562 NOTE THE DEPTH COL- by reading this I can tell that: MainWindow#DoSomething ran for about 3 seconds total it called doSomethingElse- which ran for 1.2 seconds then DoSomething called DoOtherStuff() which then called SetText (the depth col makes it a tree) LONG TERM GOALS FOR ME: 1- Get this finished in my production app and working to solve some real problems 2- Merge the logging stuff with the profiler library 3- finish the process of getting this ready for boost EXTREMELY LONG TERM GOALS for the profiling library: * Use wave to parse the boost source code- and make a copy of all the code and insert the profling code INTO the boost libraries Then run the unit tests on the mangled code- spitting out performance info * integrate this with unit testing so that boost libraries can now be tested with integrated profiling Would like to see how the different libraries perform on different platforms with different compilers Would like boost to have yet something else the other libraries of the world do not (I love boost and want to help move it along in any way I can figure out) > > Here's some food for thought: > > * interface issues for capturing durations > o consistent, portable representation > o normalized conversion(s) for use in external expressions > (i.e., as double representing seconds) > o support for internal expressions (add, subtract, compare) > o variety of use cases for establishing boundary moments [Brian Braatz Writes:] (snip) I have read this mail several times and have saved it for reference, I am not a timer expert and VERY MUCH appreciate the information THANK YOU. (and yes it sounds like this work would make what I am working on better) > > Hopefully this gives a taste of the complexities surrounding the > seemingly simple task of getting a precise representation of "now". It > can be a very dangerous area to explore for anyone with perfectionistic > tendencies ;) . IMHO this is a classic "can't see the forest for the [Brian Braatz Writes:] Yes, I will be running into more of these as I move forward, I am in the basic stages right now. Fundamentally, I have an app that has some weird performance issues, and I am working on "baking in" logging and performance analysis to help debug these production issues. So my needs are *very much* from the front lines :) > trees" issue (and I've gotten lost in that forest a few times over the > years...). With the myriad possibilities for differing results driven > by the matrix of potential variation, trying to predict just how a > given combination will behave becomes an exasperating challenge. How > can we get past that? Stop trying to predict the results. Go produce > the results instead. Line up all the possible combinations that can > work on a given platform, turn them loose and take notes. Pinning exact > timing on individual moments may always involve a little uncertainty, > but analyzing average trends can lead to deeper insights and justifiable > confidence in the system overall. Some of the issues with > QueryPerformanceCounter(...) may certainly be "real", yet their impact > on the real world of your applications may prove irrelevant with a > little testing. > [Brian Braatz Writes:] I agree :) For the most part- I am LOOKING for things like this- (example) today the application took 30 seconds to perform an operation that should take 10 seconds. So the issues with realtime ARE important for me from a boost sense, but are livable for the production problem I am working on. > > > >MY REQUESTS:... > > > >There you go, those are my requests. Now I will sit here quietly and > >hope there is a Santa Claus.... > > > >(grin) > > > > > So was this less, or more, than you asked for? Although I suppose you'd > rather have it done than have it described. :) Alas, for that you'll > have to be patient, but perhaps not for long. Since I'm in the process > of writing documentation which needed to address high resolution timing > anyway, organizing my thoughts in this response probably helped me more > than it will help you! At least, until the whole package is ready to go > under the tree... > > - james [Brian Braatz Writes:] It was WAY more than I asked for, and thank you for the brain dump and stimulating discussion. :)

1 0

RE: [boost] Re: high_resolution_timer \ timer feature requestsfor Boost.Timer
by Brian Braatz 05 Mar '05

05 Mar '05

I am generally doing the following- Solving my specific problem for my specific application. After I am through with that issue, I will look more at the general issues (as I ended up inheriting the profiler). For my APP- I am logging in hierarchical form the timings-(in addition to the report the profiler already does) so if you have (code is high level and pseudo) FuncB() { PROFILE POINT FUNCTION B { Sleep(1000); // 1 second } } FuncA() { PROFILE POINT FUNCTION B { Sleep(1000); // 1 second FuncB(); } } Then you will have in the profile Report (overall): FuncA took 2 seconds FuncB took 1 second But the Profile LOG (like a trace of what happened) looks like this DEPTH NAME TIME 0 FuncA 2 Seconds 1 FuncB 1 Second Does that answer your question, or am I missing something? > -----Original Message----- > From: boost-bounces(a)lists.boost.org [mailto:boost-bounces@lists.boost.org] > On Behalf Of Goran Mitrovic > Sent: Friday, March 04, 2005 12:21 AM > To: boost(a)lists.boost.org > Subject: [boost] Re: high_resolution_timer \ timer feature requestsfor > Boost.Timer > > How do you intent to deal with nested timers (outer ones might become very > inaccurate because of the inner ones)? > > Also, how do you plan to represent results of such profiling? > > > _______________________________________________ > Unsubscribe & other changes: > http://lists.boost.org/mailman/listinfo.cgi/boost

2 1

Re: Adobe Open Source Library
by Sean Parent 05 Mar '05

05 Mar '05

> > Adobe has apparently open sourced some libraries- I (very brief) quick > look shows me: If you read my foreword <http://opensource.adobe.com/asl_foreword.html> you will see I give a great deal of credit to Boost and the libraries do depend on Boost. Although I'm not active on this list (too much traffic for me to track) - I do know many people here and have folks like Mat forward me information of interest. As for the question about the relationship of this work to Mat - ASL is the work of Adobe's Software Technology Lab - the team Mat is on, although Mat isn't working directly on these libraries at the moment - he and Alex Stepanov (another STLab member) are working hard on another project. Certainly they influence mine and Foster's work a great deal. I'd be happy to answer technical questions - either directly or though the ASL forum on SourceForge. Sean

2 1

[Boost-bugs] [ boost-Support Requests-1156957 ] Regex
by SourceForge.net 04 Mar '05

04 Mar '05

Support Requests item #1156957, was opened at 2005-03-04 13:19 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=1156957&group_… Category: None Group: None Status: Open Resolution: None Priority: 5 Submitted By: Nobody/Anonymous (nobody) Assigned to: Nobody/Anonymous (nobody) Summary: Regex Initial Comment: PROBLEM: ======== If I use the following code: lv_rcode = regcomp(&lr_re, ms_RegExp, REG_EXTENDED); lv_rcode = regexec(&lr_re, &lv_string[0], 1, &pm, 0); to find the following text: cm582172 Using the following regular expression [A-Z]{2}[[:space:]]*[0-9]{6}[[:space:]]* The text if found. However if I use instead the following code boost::regex regx(config.vRegx.at(iCnt).c_str()); flags = boost::match_default; boost::regex_search(start, end, what, regx, flags) With the same regular expression it does not find the string unless I use the following regular expression: [a-z]{2}[[:space:]]*[0-9]{6}[[:space:]]* The difference is the lower case of the alpha range [a-z] My question: Is there a way I can use regexec to be case sensitive for the alpha range like it is with regex_search function? Thanks, Matias ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1156957&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

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

04 Mar '05

On Fri, 2005-03-04 at 10:56 -0700, Jonathan Turkanis wrote: > Iain Hanson wrote: > On Thu, 2005-03-03 at 23:21 +0100, JOAQUIN LOPEZ MU?Z wrote: > > > > > personally, I don't like obfuscated code. > > And you think I do? Obviously I wouldn't suggest the macros if I though it made > code harder to understand. > Sorry, I could have phrased that better. I'm afraid I let my strong dislike of macros shoow a little to much. /ikh

1 0

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

Singleton is documented!
by Jason Hise 04 Mar '05

04 Mar '05

The singleton library is finally documented! A complete tutorial in using the library along with an extensive reference section are provided. A tutorial on extending the library is forth-coming. The new zip is available in the <a href="http://boost-sandbox.sourceforge.net/vault/">sandbox</a> under the singleton folder, and should be extracted into the boost root directory. As always, suggestions are welcome. -Jason

6 17

Looking for some WINDOWS help
by Jody Hagins 04 Mar '05

04 Mar '05

Whenever I get a spare moment, I try to get my typeid/type_info tests working on windows (I am convinced that if I had started programming under that environment, I would have chosen a different line of work). Right now I am struggling a bit with the DLL library that is part of testing type_info. Everything works fine, except when it doesn't ;-> The documentation of LoadLibrary() says it returns NULL on failure. However, I can feed it some files (like a valid .LIB that is not a DLL) and before LoadLibrary() returns, it displays a dialog box saying "Bad Image." I guess this could be an exception that BCB is intercepting and turning into a dialog box, but the docs say nothing about an exception. Also, I look on google, and find that people have similar problems from within Java (though I could not find any solutions). How do I prevent that from happening? Thanks in advance!

2 1

Re: [boost] [congif] BOOST_BEFRIEND_TEMPLATE, BOOST_PRIVATE
by JOAQUIN LOPEZ MU?Z 04 Mar '05

04 Mar '05

----- Mensaje original ----- De: Peter Dimov <pdimov(a)mmltd.net> Fecha: Viernes, Marzo 4, 2005 0:32 am Asunto: Re: [boost] [congif] BOOST_BEFRIEND_TEMPLATE, BOOST_PRIVATE > Jonathan Turkanis wrote: > > Hi, > > > > <boost/shared_ptr.hpp> contains the following in the public section > > of the class definition (reformatted): > > > > // Tasteless as this may seem, making all members public > > // allows member templates to work in the absence of member > > // template friends. (Matthew Langston) > > > > #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS > > > > private: > > > > template<class Y> friend class shared_ptr; > > template<class Y> friend class weak_ptr; > > > > > > #endif > > > > T * px; // contained pointer > > detail::shared_count pn; // reference counter > > > > This has become a pretty common technique, I believe. I > certainly use > > it a lot, at any rate. > > > > I'd like to suggest two macros which would allow code like the above > > to be simplified as follows: > > > > BOOST_PRIVATE: > > BOOST_BEFRIEND_TEMPLATE(shared_ptr, Y, 1) > > BOOST_BEFRIEND_TEMPLATE(weak_ptr, Y, 1) > > > > T * px; // contained pointer > > detail::shared_count pn; // reference counter > > This doesn't look any better to me than the original, sorry. ;-) Well, I think there are situations were it'd improve readability: Example 1: previous section was not public #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS private: template<class Y> friend class shared_ptr; template<class Y> friend class weak_ptr; #else public: #endif Example 2: derivation class Derived: #ifndef BOOST_NO_MEMBER_TEMPLATE_FRIENDS private else public #endif Base { ... }; Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0

[mpl-docs] portability trap
by Tobias Schwinger 04 Mar '05

04 Mar '05

Hi, This code: #include <boost/mpl/vector.hpp> #include <boost/mpl/pop_front.hpp> #include <boost/mpl/assert.hpp> #include <boost/mpl/equal.hpp> using namespace boost; // Doc says: pop_front returns a vector typedef mpl::pop_front< mpl::vector<bool,char,int> >::type v; // Doc says: vectors have a type member equal to itself BOOST_MPL_ASSERT(( mpl::equal< v, v::type > )); fails to compile with GCC ( v::type is mpl::vector3<bool,char,int> ) and compiles fine with other compilers. Examples for false conclusions that could be easily drawn from the current documentation: "Oh great - I do not need mpl::identity when using v with mpl::eval_if" "Let's inherit from 'v::type' so I can save the '::type' later" "::type always gives the numbered form of my current sequence so I can use it with partial specialization" I got trapped by this in two different places (and I still hope not to be surpassingly stupid ;-). Shouldn't this behaviour be documented in some way ? Regards, Tobias

2 2

Re: [boost] Looking for some WINDOWS help
by JOAQUIN LOPEZ MU?Z 04 Mar '05

04 Mar '05

----- Mensaje original ----- De: Jody Hagins <jody-boost-011304(a)atdesk.com> Fecha: Viernes, Marzo 4, 2005 0:37 am Asunto: [boost] Looking for some WINDOWS help > > Whenever I get a spare moment, I try to get my typeid/type_info tests > working on windows (I am convinced that if I had started programming > under that environment, I would have chosen a different line of > work). > Right now I am struggling a bit with the DLL library that is part of > testing type_info. Everything works fine, except when it doesn't > ;-> > > The documentation of LoadLibrary() says it returns NULL on > failure. > However, I can feed it some files (like a valid .LIB that is not a > DLL)and before LoadLibrary() returns, it displays a dialog box > saying "Bad > Image." I guess this could be an exception that BCB is > intercepting and > turning into a dialog box, but the docs say nothing about an > exception. > Also, I look on google, and find that people have similar problems > fromwithin Java (though I could not find any solutions). > > How do I prevent that from happening? > With SetErrorMode, I think. Joaquín M López Muñoz Telefónica, Investigación y Desarrollo

1 0