- Boost - lists.boost.org

Re: [boost] Presentation of Boost.Process (SoC project)
by JOAQUIN LOPEZ MU?Z 22 Aug '06

22 Aug '06

----- Mensaje original ----- De: "Julio M. Merino Vidal" <jmmv84(a)gmail.com> Fecha: Miércoles, Agosto 16, 2006 5:31 pm Asunto: [boost] Presentation of Boost.Process (SoC project) > Hello, > > During the past two-three months Jeff Garland (as mentor) and I have > been working on the Boost Summer of Code project whose goal was to > implement a library to spawn and manage child processes. A little > introduction and a link to the source code can be found here: > > https://www.boost-consulting.com:8443/trac/soc/wiki/process > > But you'll probably want to go straight to the documentation which > includes, among many other information, a couple of tutorials and > multiple examples. I'm keeping an up-to-date snapshot at the > following URL: > > http://www.NetBSD.org/~jmmv/process/ > > If it wasn't for the imminent SoC deadline (next Monday), I wouldn't > present it just yet because there are still a couple of important > issues that I would like to see resolved as soon as possible: > > First is the lack of a "design decisions" chapter in the > documentation. This is not an extremely big issue because the Wiki > page linked above already contains many discussions on the library's > current design. In other words, that chapter will end up summarizing > the information in there and adding few new things. > > Second, and very important, is the "need" to integrate the library > with Boost.Asio to allow asynchronous management of communication > streams and process termination. Unfortunately it does not support > such asynchronous events yet, and integrating with Boost.Asio sounds > like a reasonable approach to cover this area. > > Anyway, I wouldn't like this to discourage you from taking a look at > the documentation and code. The library is already big enough to let > you get a general idea on its focus and design. You can start > criticising now! ;-) Sincerely, any constructive comments will be > certainly appreciated. > > Thank you. > Hello Julio, A cursory look at the docs shows this can be a very valuable contribution to Boost. Thank you for your effort! Although I plan to give a thorough review during the next week, let me advance a few issues: 1. The lib provides functionality to spawn child processes and examine them through launcher and child classes, respectively. Yet, it seems to lack functionality to examine the *current* process. In particular, it looks like one cannot get the handle_type of the current process (Win32:GetCurrentProcessID) in a manner compatible with child::get_handle. Would it be feasible to extend the lib to support this? In case it would, maybe it'd be a good idea then to rename "child" to a neutral "process", for instance, so that process classes are returned by laucher as well as by some potential "current_process" facility. 2. Would it be safe to guarantee that handle_type is an integral type? It is so at least for POSIX and Win32. This would allow the programmer to output handle_type's to std::ostreams's (for tracing purposes, for instance) and to use handle_type's in a number of scenarios, vg to store them in STL data structures. Joaquín M López Muñoz Telefónica, Investigación y Desarollo

4 7

[xpressive] test2u/msvc-8.0/64 failures
by Vladimir Prus 22 Aug '06

22 Aug '06

Hello, current regression matrix says the above test fails. At the same time, it passes for 32-bit compiler. See http://tinyurl.com/qfgec for error message, which is: LINK : fatal error LNK1000: unknown error; consult documentation for technical support options Unless somebody has any ideas how to workaround this, maybe the failures should be marked as expected? Eric? - Volodya

2 1

Re: [boost] Boost Units library preview
by Eric Lemings 22 Aug '06

22 Aug '06

> -----Original Message----- > From: Eric Lemings > Sent: Monday, August 21, 2006 10:58 AM > To: 'boost(a)lists.boost.org' > Subject: RE: [boost] Boost Units library preview > > > > > -----Original Message----- > > From: boost-bounces(a)lists.boost.org > > [mailto:boost-bounces@lists.boost.org] On Behalf Of Matthias Troyer > > Sent: Sunday, August 20, 2006 6:29 AM > > To: boost(a)lists.boost.org > > Subject: Re: [boost] Boost Units library preview > > > > > ... > > Wait, if I multiply quantities (which have units) then also > the result > > will have a unit. E.g. if I divide 10 meters by 2 seconds > then I get 5 > > m/s . I wouldn't call that anonymous since I know the > > unit: m/s > > This brings up a good question. Say you have two objects: > > meters m = 1; > feet f = 2; > > What is the type (or unit) of the following expression? > > m * f; Doh! This should be addition, not multiplication. m + f; Eric.

6 10

Re: [boost] Boost Units library preview
by Eric Lemings 22 Aug '06

22 Aug '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Andy Little > Sent: Monday, August 21, 2006 3:55 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost Units library preview > > > "Deane Yang" <deane_yang(a)yahoo.com> wrote in message > news:ecd87h$brg$1@sea.gmane.org... > > Eric Lemings wrote: > >>> This brings up a good question. Say you have two objects: > >>> > >>> meters m = 1; > >>> feet f = 2; > >>> > >>> What is the type (or unit) of the following expression? > >>> > >> m + f; > >> > > > > I apologize for repeating myself, but I want this to fail > to compile. > > I do not want implicit conversion of units. I believe I am not > > completely alone in this view. Could you provide your rationale for wanting expressions like this to fail? Maybe there is something we've overlooked? > Personally I love implicit unit conversions. :-) I'm inclined to agree. As long as the dimensions are correct and a.) the result type is the dimension of the unit, or b.) the programmer specifies the desired units, I don't see a problem with implicit conversions between quantities (measures, whatever) of compatible dimensions and units. Eric.

4 7

[TR1] sun problems, OSVL4-V2
by Vladimir Prus 22 Aug '06

22 Aug '06

John, you reported previously that some TR1 tests fail on sun, which you suspected to be V2 issue. You said, specifically: A typical list of errors here: http://tinyurl.com/pcwf5 suggests that the "real" version of <memory> is getting included rather than the Tr1 version. The command line shows that the TR1 headers are in the path, but *after* the Boost include path, and while I'm not completely sure, I believe this is the problem On closer look, I think I don't understand what's going on. The "real" <memory> is in "standard" include directories, and that "standard" include directory is not present in command line at all. Even though boost include directory is present before TR1 include directory, I see no way how this can cause system <memory> to be preferred to TR1's <memory>. Could it be that the problem is somewhat more contrived? Doug, as a quick check, can you try running the same command that fails, but with the order of -I".." and -I"/home/user1/dgregor/BoostRegressionTesting/boost/boost/tr1/tr1" reversed? If that works, can you run the failing command with -save-temps, and send me the .ii file? Thanks, Volodya

3 2

Re: [boost] Boost Units library preview
by Eric Lemings 22 Aug '06

22 Aug '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Andy Little > Sent: Sunday, August 20, 2006 9:34 AM > To: boost(a)lists.boost.org > Subject: Re: [boost] Boost Units library preview > > ... > > Having had correspondence from various people, I am now > fairly sure that the Americans have a different concept of a > unit than (at least) Europeans. Well I don't presume to speak for all Americans but I define a "unit" as a standard of measure. Plain and simple. How do Europeans define it? Eric.

3 2

[Boost-bugs] [ boost-Support Requests-1544410 ] Regex: multi-processor scalability, user-defined allocators
by SourceForge.net 22 Aug '06

22 Aug '06

Support Requests item #1544410, was opened at 2006-08-22 11: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=1544410&group_… Please note that this message will contain a full copy of the comment thread, including the initial issue submission, for this request, not just the latest update. Category: regex Group: None Status: Open Resolution: None Priority: 5 Submitted By: Roy (r_emek) Assigned to: John Maddock (johnmaddock) Summary: Regex: multi-processor scalability, user-defined allocators Initial Comment: I'm using boost-regex library, and I'm running into multi-threading scalability issues. When tested on a machine with several CPUs, my performance tests show improvement of about 60-70% when moving from a single thread to 2 threads. Question 1: Is anyone aware of this problem? Is there a known solution? >From some testing we've done, it seems that the cause of the scalability issue is problematic implementation of std:allocator. This is a known issue on some operating systems (e.g., Solaris 8). Some of the boost::regex classes (e.g., match_results) accept a user-defined allocator. However, as far as I can understand there's no way to completely override the use of std::allocator. Question 2: is there a way to completely prevent boost / regex from using std::allocator? If no, can such a capability be added? (One solution to this problem would be global overriding the 'new' and 'delete' operators - but for various reasons this cannot be done in the application I'm developing). ---------------------------------------------------------------------- You can respond by visiting: https://sourceforge.net/tracker/?func=detail&atid=207586&aid=1544410&group_… ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ Boost-bugs mailing list Boost-bugs(a)lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/boost-bugs

1 0

Visual Studio 2003 SP1 is now available...
by Kevin Wheatley 22 Aug '06

22 Aug '06

Available from http://msdn.microsoft.com/downloads/ Direct Link http://www.microsoft.com/downloads/details.aspx?FamilyID=69D2219F-CE82-46A5… 'release notes' http://www.microsoft.com/downloads/details.aspx?FamilyID=DC455C5D-2C99-43CC… There isn't much in terms of a list of bugs fixed at the moment, but I'm sure they will correct that. Lots more fun for everyone Kevin -- | Kevin Wheatley, Cinesite (Europe) Ltd | Nobody thinks this | | Senior Technology | My employer for certain | | And Network Systems Architect | Not even myself |

5 6

Re: [boost] email client weirdness (was: Boost Units library preview)
by Eric Lemings 22 Aug '06

22 Aug '06

> -----Original Message----- > From: boost-bounces(a)lists.boost.org > [mailto:boost-bounces@lists.boost.org] On Behalf Of Janek Kozicki > Sent: Monday, August 21, 2006 2:24 PM > To: boost(a)lists.boost.org > Subject: Re: [boost] email client weirdness (was: Boost Units > library preview) > > Eric Lemings said: (by the date of Mon, 21 Aug 2006 > 13:39:49 -0600) > > > Doh! This should be addition, not multiplication. > > > > m + f; > > > > Eric. > > > Eric, please check your email client configuration with > respect to 'replying to posts' on this mailing lists. All > posts from you do not stack correctly with other posts to > form a thread. They all seem to be just a reply to the > toplevel post. That makes reading them a bit confusing. Unfortunately, I have no idea what the problem is or how to fix it. Would appreciate any help. Eric.

2 2

[SoC] Tree
by Bernhard Reiter 21 Aug '06

21 Aug '06

Hello to all, as time's almost over for this year's Summer of Code, I'll join my fellow SoCers in presenting the resulting projects. I've been working on what was entitled a "Generic tree container" in the original Boost SoC suggestions wiki; but having discovered that most people were looking much more for some unifying concepts dealing with the similarities found in the vast diversity of existing tree designs, I sought to expand the scope of my work towards e.g. all kinds of search trees that my original proposal hadn't covered. I believe that I've distilled a couple of quite powerful concepts from the resources I reviewed; but as you might guess, this took more time than anticipated so that I can only present a very incomplete implementation of what I came up with. The code can be obtained via svn from https://www.boost-consulting.com:8443/svn/main/boost/soc/2006/tree/trunk or viewed in a browser at https://boost-consulting.com:8443/trac/soc/browser/boost/soc/2006/tree/trunk At the moment, there is only an unbalanced binary tree (including a "cursor" class), a couple of traversal and search algorithms, plus a "searcher" adaptor. For more information about the individual components, please refer to the documentation at http://www.unet.univie.ac.at/~a0057324/php/soc2006/doc/html/ Again, please keep in mind that neither code nor documentation are complete enough to be regarded a proper tree framework library -- which I intend them to be eventually, however. For now, I'll again join other SoCers, this time trying to catch some sun; I'll be leaving tomorrow (22nd) morning (CEST) for about a week of vacations. After that, I'll have another month until my university classes start again, which coincides with the deadline for TR2 submission. Now I know the following might seem a little ambitious, but: given the amount of literature and newsgroup/mailing list posts dealing with trees and C++, there seems to have been interest in an STL tree component about since the standard came out. So I'd like to try to refine especially the conceptual documentation parts first when I come back, implement what's still missing, and, with the help of some more experienced souls than I am, submit a proposal for TR2... (Or am I just dreaming?) Any comments very welcome. Grateful for an awesome experience, Bernhard

3 2