- Boost - lists.boost.org

Gender neutral documentation (was RE: [ANN] Phoen ix-2 prerelease)
by Martin Bonner 05 Nov '05

05 Nov '05

David Abrahams <dave(a)boost-consulting.com> writes: > Joel de Guzman <joel(a)boost-consulting.com> writes: >> This means for example that the >> client can completely discard Bind if she does not need it; or > ^ > that should be a comma > >> perhaps take out Operator and Statement and just use Function, which > ^^^^^^^^^^^^ > "she can leave" Is there a boost convention on gender neutral language? I approve of the sentiment behind using "she" (there aren't enough women in technical roles), but I do find myself stumbling every time I read it. My personal preference is to use "they" as the first person singular gender-neutral pronoun. This will be /intensely/ irritating to grammar purists, but does seem to be the way the language is evolving. -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 441434

7 8

Boost File Vault broken
by Jose 04 Nov '05

04 Nov '05

http://www.boost-consulting.com/vault/ The html in the page is broken (see near search box). Also, the site is incredibly slow (either the website or the PHP pages) Can anybody fix this ?

3 4

Re: [boost] [ANN] Phoenix-2 prerelease (supported operators)
by David Abrahams 04 Nov '05

04 Nov '05

Joel de Guzman <joel(a)boost-consulting.com> writes: > Comments, feedback very welcome! > Supported operators Style tip: every section should have some introductory text before its first subsection. Every subsection should have at least one sibling. > Unary operators > > prefix: ~, !, -, +, ++, --, & (reference), * (dereference) > postfix: ++, -- > > Binary operators > > =, [], +=, -=, *=, /=, %=, &=, |=, ^=, <<=, >>= > +, -, *, /, %, &, |, ^, <<, >> > ==, !=, <, >, <=, >= > &&, ||, ->* > > Ternary operator > > if_else(c, a, b) > > The ternary operator deserves special mention. Since C++ does not > allow us to overload the conditional expression: c ? a : b, the > if_else pseudo function is provided for this purpose. The behavior > is identical, albeit in a lazy manner. Does it deserve special support? Why not just use if_(c)[a].else[b] ? > Member pointer operator > > a->*member_object_pointer > a->*member_function_pointer > > The left hand side of the member pointer operator must be an actor > returning a pointer type. The right hand side of the member pointer > operator may be either a pointer to member object or pointer to > member function. > > > If the right hand side is a member object pointer, the result is a > composite providing lazy access to that member. "an actor that, when invoked, returns a reference to that member." > For example: > > struct A > { > int member; > }; > > A* a = new A; > ... > > (arg1->*&A::member)(a); // returns member a->member > > If the right hand side is a member function pointer, the result is a > delayed function call. The arguments to this call are then bound to > the returned composite. The wording is confusing. "Delayed function call" has not been defined. Why not just say that "the result is an actor that, when invoked, calls the specified member function?" Is that inaccurate? -- Dave Abrahams Boost Consulting www.boost-consulting.com

2 1

Re: [boost] [ANN] Phoenix-2 prerelease (Operators)
by David Abrahams 04 Nov '05

04 Nov '05

Joel de Guzman <joel(a)boost-consulting.com> writes: > Comments, feedback very welcome! > Operator > > Lazy operators... ^^^^^^^^^^^^^^^^^ What is this doing here? What is the ellipsis for? > This facility provides a mechanism for lazily evaluating > operators. Syntactically, a lazy operator looks and feels like an > ordinary C/C++ infix, prefix or postfix operator. The operator > application looks the same. However, unlike ordinary operators, the > actual operator execution is deferred. Samples: > > arg1 + arg2 > 1 + arg1 * arg2 > 1 / -arg1 > arg1 < 150 > > We have seen the lazy operators in action (see Quick Start). Let's > go back and examine it a little bit further: ^^ "them" > > find_if(c.begin(), c.end(), arg1 % 2 == 1) > > Through operator overloading, the expression arg1 % 2 == 1 actually > generates a composite. The fact that it's a composite (as opposed to a primitive) is of no interest at all to the user at this point. I would say "a function object" or "an actor." There's way too much emphasis on this whole composite/primitive distinction. > This composite object is passed on to STL's > find_if function. This is a place where you really see how not using any qualification hurts. Should be std::find_if, to distinguish it from the library's lazy find_if that can be passed to higher-order functions. > In the viewpoint of STL, the composite is simply a ^^ "From" > function object expecting a single argument > , the container's element. ^^^^^^^^^^^^^^^^^^^^^^^ "of the container's value_type." > For each element in the container c, the element is passed ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ "Each element in c" > on as an argument arg1 to the composite (function object). The ^^^^ strike. That is not the name of the argument. > composite checks if this is an odd value based on the expression > arg1 % 2 == 1 where arg1 is iteratively replaced by the container's ^^^^^^^^^^^ ??? > element. > > A set of classes implement all the C++ free operators. ^^^^^^^ Really, the operators are implemented by a set of classes? Seems bizarre. Also seems irrelevant to the reader. > Like lazy functions (see function), lazy operators are not > immediately executed when invoked. Instead, a composite (see > composite) object is created and returned to the caller. Example: > > (arg1 + arg2) * arg3 > > does nothing more than return a composite. A second function call will evaluate the actual operators. Example: > > int i = 4, j = 5, k = 6; > cout << ((arg1 + arg2) * arg3)(i, j, k); > > will print out "54". > > Arbitrarily complex expressions can be lazily evaluated following > three simple rules: That sentence doesn't make sense to me. "Can be" would apply to what the user can do, but the rules describe what the library does. Maybe "...are lazily evaluated according to these three rules:" I'm not sure that "Arbitrarily complex" adds anything. It would make sense in the context of what the user can do: "Arbitrarily complex epressions can be made lazy by following..." but then, that's incompatible with what follows. > 1. Lazy evaluated binary operators apply when at least one of the > operands is an actor object (see actors, primitives and > composite). Consequently, if one of the operands is not an actor > object, it is implicitly converted, by default, to a value (see > values). > 2. Lazy evaluated unary operators apply only to operands which > are actor objects. > 3. The result of a lazy operator is a composite actor object that > can in turn apply to rule 1 and 2. The actor applies to the rules, or the rules apply to the actor? This may seem like nitpicking, but the above can only make sense if you already know what it's saying, because you'll overlook the logical inconsistencies. It won't help the person who's trying to understand the library from the outside. > The one exception is the member pointer operator ->*, as we shall > see later. As long as you're spelling out the rules in detail, you should add the one exception immediately, so the user can read them all in one place. > Example: > > -(arg1 + 3 + 6) > > 1. Following rule 1, lazy evaluation is triggered since arg1 is > an actor (see primitives). You have to say what part of the expression is being evaluated! In this case, arg1 + 3 > 2. The immediate right operand: 3 is implicitly converted to a > value. Still following rule 1. > > 3. The result of this arg1 + 3 expression is a composite object, > following rule 3. > > 4. Now since arg1 + 3 is a composite, following rule 1 again, its > right operand: 6 is implicitly converted to a value. > > 5. Continuing, the result of arg1 + 3 ... + 6 is again another > composite. Rule 3. > > 6. The expression arg1 + 3 + 6 being a composite, is the operand > of the unary operator -. Following rule 2, the result is an actor > object. > 7. Following rule 3, the whole thing -(arg1 + 3 + 6) is a composite. > > Confused? If so, it's because you're exposing way more detail than the user needs, IMO. All this stuff could be better explained by a section titled How to know when the result of an expression is an actor > well, when in doubt, just wrap the operands in ref(x), val(x) or > cref(x) appropriately and you'll be ok: > > -(arg1 + val(3) + val(6)) How does the above help unconfuse the reader? > Lazy-operator application is highly contagious. In most cases, a ^^^^^^^^^^^^^^^^^^^^^^^^^ "Laziness" > single argN actor infects all its immediate neighbors within a group > (first level or parenthesized expression). > > > Take note that although at least one of the operands of what? > must be a valid actor class in order for lazy evaluation to take > effect, if this is not the case and we still want to lazily evaluate > an expression, we can use ref(x), val(x) or cref(x) to transform the > operand into a valid action object (see primitives). Example: ^^^^^^ actor > > val(1) << 3; Note that at least one operand of any operator must be a valid actor for lazy evaluation to take effect. To force lazy evaluation of an ordinary expression, we can use ref(x), val(x) or cref(x) to transform an operand into a valid actor object. For example, val(1) << 3; -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

Re: [boost] Gender neutral documentation
by Martin Bonner 04 Nov '05

04 Nov '05

----Original Message---- From: Angus Leeming [mailto:angus.leeming@btopenworld.com] Sent: 04 November 2005 11:13 To: boost(a)lists.boost.org Subject: Re: [boost] Gender neutral documentation > Anthony Williams wrote: >> The use of "she" implies the person in question is female. Though >> "he" technically also has the implication that the person is male, >> it is general usage that "he" is used as a stand in for "he or she". >> If we really want to be gender neutral, we should write "he or she", >> which is what we really mean. Sometimes this is abbreviated "s/he", >> but that's an ugly kludge. Better would be to rewrite the sentence >> to avoid the issue. > >>> My personal preference is to use "they" as the first person >>> singular gender-neutral pronoun. This will be /intensely/ >>> irritating to grammar purists, but does seem to be the way the >>> language is evolving. > >> I don't like this, but it is preferable to "she". > > We do have a pronoun for just such a usage, albeit one that appears to > be used today only by the British royal family. Perhaps it sounds > archaic, but one understands what one is talking about when one uses > the correct language. We do. However what one *meant* to write was: One's personal preference is to use "they" as the *THIRD* person singular gender-neutral pronoun. As used by the British royal family, "one" is a first person singular pronoun. > Regards from yet another Brit, :-) -- Martin Bonner Martin.Bonner(a)Pitechnology.com Pi Technology, Milton Hall, Ely Road, Milton, Cambridge, CB4 6WZ, ENGLAND Tel: +44 (0)1223 441434

3 2

Re: [boost] Feature Request
by Victor A. Wagner Jr. 04 Nov '05

04 Nov '05

At 22:40 2005-11-03, Abajyan, Hambardzum wrote: >Hi >(I've already been subscribed my address as you told me to do.) > >I would like to now why there isn't an implementation of TCP(UDP) >Sockets ? >I think it's possible to write a good platform-independent architecture >based on Berkeley socket interface (supporting asynchronous >(non-blocking) sockets), because both Linux and Windows systems support >that architecture. >There are many libraries like that: e.g. Boost.Thread library which is >also platform-independent. In my opinion, this feature is very usefull >as with it programmers can develop network applications on Boost. >Thanks I like the approach these guys are taking: http://www.dtilib.dk/ that actually would be 3 libraries, but I like them all. > >Best Regards Hambik > >_______________________________________________ >Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost Victor A. Wagner Jr. http://rudbek.com The five most dangerous words in the English language: "There oughta be a law"

3 2

Re: [boost] [ANN] Phoenix-2 prerelease (Functions)
by David Abrahams 04 Nov '05

04 Nov '05

Joel de Guzman <joel(a)boost-consulting.com> writes: > Comments, feedback very welcome! > Function > > Lazy functions... > > #include <boost/spirit/phoenix/function/function.hpp> > > The function template class provides a mechanism for lazily ^^^^^^^^^^^^^^ class template > evaluating functions. Syntactically, a lazy function looks like an > ordinary C/C++ function. The function call looks familiar and feels > the same as ordinary C++ functions. Except you can't use ADL. > However, unlike ordinary > functions, the actual function execution is deferred. For example > here are sample factorial function calls: Whoa, where did factorial come from? > factorial(4) > factorial(arg1) > factorial(arg1 * 6 / factorial(ref(i))) > > These functions are automatically lazily bound Really? Even the first one? > unlike ordinary function pointers or functor objects that need to be > explicitly bound through the bind function (see Bind). > > A lazy function works in conjunction with a user defined function > object (as usual with a member operator()). I'm lost. What do you mean "in conjunction with?" > Only special forms of function objects are allowed. Even more lost! Allowed where? > This is required to enable true polymorphism I happen to have a clue as to what you mean, but most won't. Probably anyplace you mention polymorphism in this doc, you should link to the discussion of its use in this context. > (STL style monomorphic functors and function pointers can still be > used through the bind facility (see Bind)). > > > This special function object is expected to have a nested template > class apply<T0...TN> (where N is the number of arguments of its > operator()). The nested template class result should have a typedef > type that reflects the return type of its operator(). I guess you might be describing the Eval concept. It's not obvious though. This section needs to be reworked for clarity. > There is a special case Of what? > for functors that accept no arguments. Such nullary functors are > only required By what? > to define a typedef result_type that reflects the > return type of its operator(). > > > Here's an example of a simple functor that computes the factorial of > a number: I would avoid "functor" except as a parenthesized note remarking that function objects are often called functors in the C++ community. That usage of "functor" is sorta deprecated and probably never should have arisen, considering its prior use with other meanings. > struct factorial_impl > { > template <typename Arg> > struct apply > { > typedef Arg type; > }; > > template <typename Arg> > Arg operator()(Arg n) const > { > return (n <= 0) ? 1 : n * this->operator()(n-1); > } > }; > > (See factorial.cpp) Oh, here it is. Way too late. Or mentioned too early. > The functor is polymorphic. Its arguments and return type are not > fixed to a particular type. The example above can handle any Arg > type as long as it can carry out the required operations (i.e. <=, * > and - ). > > We can declare and instantiate a lazy factorial function this way: > > function<factorial_impl> factorial; Oh, this is the point of the section? Then why is it called "Function" set in normal type, instead of "function" set in code font? > Invoking a lazy function factorial does not immediately execute the function object factorial_impl. Instead, a composite object is created and returned to the caller. Example: > > factorial(arg1) Even in factorial(4) ? > does nothing more than return a composite. A second function call > will invoke the actual factorial function. Example: > > int i = 4; > cout << factorial(arg1)(i); > > will print out "24". > > Take note that in certain cases (e.g. for function objects with > state), an instance of the functor may be passed on to the > constructor. Example: > > function<factorial_impl> factorial(ftor); > > where ftor is an instance of factorial_impl (this is not necessary ^^^^ needs antecedent > in this case since factorial is a simple stateless functor). Take ^^^^ too many "this"es. Eliminate the first. > care though when using functors with state because the functors are ^^^^^^ ^ strike , > held by value. I don't think you mean that. I think you mean "Functors are often copied repeatedly, and the state may be changed in one or more copies, rather than in the original." > It is best to keep the data manipulated by a functor > outside the functor itself and keep a reference to this data inside > the functor. Also, it is best to keep functors as small as possible. > -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

Re: [boost] [ANN] Phoenix-2 prerelease
by David Abrahams 04 Nov '05

04 Nov '05

Joel de Guzman <joel(a)boost-consulting.com> writes: > Comments, feedback very welcome! > Values > > #include <boost/spirit/phoenix/core/value.hpp> > > Whenever we see a constant in a partially applied function, an > > actor<value<T> > > > (where T is the type of the constant) is automatically created by > default for us. > For instance: > > add(arg1, 6) > > Passing a second argument, 6, an actor<value<int> > is implicitly > created behind the scenes. This is also equivalent to: > > add(arg1, val(6)) > > val(x) generates an actor<value<T> > where T is the type of x. I think the use of "us" here is awkward. "You" would be better. "automatically by default" is confusing language. If you're not prepared to tell people what happens when the default is not taken, you probably shouldn't mention that it's a default at all. Also, I doubt that it's really _wherever_ a constant appears in a partially applied function: foo<2>() + arg1 I suggest: To represent a value of type T as an actor, we can use the value template. actor<value<T> >(x) is an actor that returns x when invoked. For instance, actor<value<int> >(6) is equivalent to val(6) an actor that, when invoked, returns the value 6. In expressions combining actors with values, the val() function is invoked implicitly, so add(arg1, 6) is equivalent to add(arg1, val(6)) an actor that adds 6 to its first argument. > In most cases, there's really no need to explicitly use val. There ^^^^^^ strike > are situations though, as we'll see later on, where this is > unavoidable. ..., but as we'll see later on, there are situations where it is unavoidable. -- Dave Abrahams Boost Consulting www.boost-consulting.com

1 0

Boost regression notification (2005-11-04 [RC_1_33_0])
by Douglas Gregor 04 Nov '05

04 Nov '05

Boost regression test failures ------------------------------ Report time: 2005-11-04T14:47:07Z This report lists all regression test failures on release platforms. Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-RC_1_33_0/developer/i… 0 failure in 0 library:

1 0

Boost regression notification (2005-11-04 [HEAD])
by Douglas Gregor 04 Nov '05

04 Nov '05

Boost regression test failures ------------------------------ Report time: 2005-11-04T06:00:10Z This report lists all regression test failures on release platforms. WARNING: The following libraries have failing regression tests but do not have a maintainer on file. Once a maintainer is found, add an entry to libs/maintainers.txt to eliminate this message. io Detailed report: http://engineering.meta-comm.com/boost-regression/CVS-HEAD/developer/issues… 294 failures in 13 libraries: bind (7) concept_check (12) graph (2) io (1) mpl (1) serialization (30) spirit (8) thread (4) tr1 (147) tuple (1) type_traits (58) typeof (18) xpressive (5) |bind| bind_dm3_test: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 |concept_check| stl_concept_covering: cw-9_4 gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin intel-win32-9_0 intel-win32-9_0 mingw-3_4_2 vc-7_1 |graph| graphviz_test: vc-7_1 layout_test: intel-win32-9_0 |io| ios_state_unit_test: intel-win32-9_0 |mpl| size_t: gcc-4_0-darwin |serialization| test_class_info_load_binary_archive: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_binary_archive_dll: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_text_archive: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_text_archive_dll: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_text_warchive: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_text_warchive_dll: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_xml_archive: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_xml_archive_dll: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_xml_warchive: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin test_class_info_load_xml_warchive_dll: gcc-3_3-darwin gcc-3_4_3-sunos gcc-4_0-darwin |spirit| action_tests_debug: gcc-3_4_3-sunos distinct_tests_debug: gcc-3_4_3-sunos escape_char_parser_tests_debug: gcc-3_4_3-sunos grammar_def_test_debug: gcc-3_4_3-sunos switch_problem_debug: gcc-3_4_3-sunos switch_tests_single_debug: gcc-3_4_3-sunos traverse_tests: intel-win32-9_0 traverse_tests_debug: intel-win32-9_0 |thread| test_condition: gcc-3_4_3-sunos test_mutex: gcc-3_4_3-sunos test_tss: gcc-3_4_3-sunos gcc-3_4_3-sunos |tr1| run_complex_overloads: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.4.4-linux run_random: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.4.4-linux std_test_array: gcc-2.95.3-linux std_test_array_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 std_test_bind: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 std_test_bind_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 std_test_boost: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux std_test_complex: gcc-2.95.3-linux std_test_function: gcc-2.95.3-linux std_test_function_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 std_test_hash: gcc-2.95.3-linux std_test_mem_fn: gcc-2.95.3-linux std_test_mem_fn_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 std_test_random: gcc-2.95.3-linux std_test_reference_wrapper: gcc-2.95.3-linux std_test_reference_wrapper_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 std_test_regex: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.4.4-linux std_test_result_of: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux std_test_shared_ptr: gcc-2.95.3-linux std_test_tr1_include: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux std_test_tuple: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux std_test_tuple_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 std_test_type_traits: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3_3-darwin test_algorithm: gcc-2.95.3-stlport-4.6.2-linux test_array_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 test_bind: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 test_bind_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 test_complex: gcc-2.95.3-linux test_exception: gcc-2.95.3-stlport-4.6.2-linux test_function_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 test_functional: gcc-2.95.3-linux test_hash: gcc-2.95.3-linux test_mem_fn_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 test_memory: gcc-2.95.3-linux test_new: gcc-2.95.3-stlport-4.6.2-linux test_reference_wrapper_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 test_regex: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.4.4-linux test_result_of: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux test_tr1_include: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux test_tuple: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux test_tuple_tricky: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3.4.4-linux gcc-3_3-darwin intel-win32-9_0 vc-7_1 test_type_traits: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3_3-darwin test_utility: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux |tuple| tuple_test_bench: gcc-3_4_3-sunos |type_traits| tr1_add_const_test: gcc-2.95.3-linux tr1_add_cv_test: gcc-2.95.3-linux tr1_add_pointer_test: gcc-2.95.3-linux tr1_add_reference_test: gcc-2.95.3-linux tr1_add_volatile_test: gcc-2.95.3-linux tr1_aligned_storage_test: gcc-2.95.3-linux tr1_alignment_of_test: gcc-2.95.3-linux tr1_extent_test: gcc-2.95.3-linux tr1_has_nothrow_assign_test: gcc-2.95.3-linux tr1_has_nothrow_constr_test: gcc-2.95.3-linux tr1_has_nothrow_copy_test: gcc-2.95.3-linux tr1_has_trivial_assign_test: gcc-2.95.3-linux tr1_has_trivial_constr_test: gcc-2.95.3-linux tr1_has_trivial_copy_test: gcc-2.95.3-linux tr1_has_trivial_destructor_test: gcc-2.95.3-linux tr1_has_virtual_destructor_test: gcc-2.95.3-linux tr1_is_abstract_test: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux gcc-3.3.6-linux gcc-3_3-darwin tr1_is_arithmetic_test: gcc-2.95.3-linux tr1_is_array_test: gcc-2.95.3-linux tr1_is_base_of_test: gcc-2.95.3-linux tr1_is_class_test: gcc-2.95.3-linux tr1_is_compound_test: gcc-2.95.3-linux tr1_is_const_test: gcc-2.95.3-linux tr1_is_convertible_test: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux tr1_is_empty_test: gcc-2.95.3-linux tr1_is_enum_test: gcc-2.95.3-linux tr1_is_floating_point_test: gcc-2.95.3-linux tr1_is_function_test: gcc-2.95.3-linux tr1_is_fundamental_test: gcc-2.95.3-linux tr1_is_integral_test: gcc-2.95.3-linux tr1_is_member_func_test: gcc-2.95.3-linux tr1_is_member_obj_test: gcc-2.95.3-linux tr1_is_member_pointer_test: gcc-2.95.3-linux tr1_is_object_test: gcc-2.95.3-linux tr1_is_pod_test: gcc-2.95.3-linux tr1_is_pointer_test: gcc-2.95.3-linux tr1_is_polymorphic_test: gcc-2.95.3-linux gcc-2.95.3-stlport-4.6.2-linux tr1_is_reference_test: gcc-2.95.3-linux tr1_is_same_test: gcc-2.95.3-linux tr1_is_scalar_test: gcc-2.95.3-linux tr1_is_signed_test: gcc-2.95.3-linux tr1_is_union_test: gcc-2.95.3-linux tr1_is_unsigned_test: gcc-2.95.3-linux tr1_is_void_test: gcc-2.95.3-linux tr1_is_volatile_test: gcc-2.95.3-linux tr1_rank_test: gcc-2.95.3-linux tr1_remove_all_extents_test: gcc-2.95.3-linux tr1_remove_const_test: gcc-2.95.3-linux tr1_remove_cv_test: gcc-2.95.3-linux tr1_remove_extent_test: gcc-2.95.3-linux tr1_remove_pointer_test: gcc-2.95.3-linux tr1_remove_reference_test: gcc-2.95.3-linux tr1_remove_volatile_test: gcc-2.95.3-linux |typeof| data_member_native: cw-9_4 function_native: cw-9_4 function_ptr_native: cw-9_4 function_ref_native: cw-9_4 lvalue_native: cw-9_4 member_function_native: cw-9_4 modifiers_emulation: cw-9_4 modifiers_native: cw-9_4 noncopyable_native: cw-9_4 std_emulation: cw-9_4 std_native: cw-9_4 template_dependent_native: cw-9_4 template_enum_native: cw-9_4 template_int_native: cw-9_4 template_multiword_native: cw-9_4 template_tpl_native: cw-9_4 template_type_native: cw-9_4 type_native: cw-9_4 |xpressive| test3u: gcc-3_3-darwin test4u: gcc-3_3-darwin test5u: gcc-3_3-darwin test6u: gcc-3_3-darwin test9u: gcc-3_3-darwin

1 0