"William E. Kempf" <[EMAIL PROTECTED]> writes:
> David Abrahams said:
...and if it can't be default-constructed?
>>>
>>> That's what boost::optional<> is for ;).
>>
>> Yeeeh. Once the async_call returns, you have a value, and should be able
>> to count on it. You shouldn't get back an object
"William E. Kempf" <[EMAIL PROTECTED]> writes:
> David Abrahams said:
...and if it can't be default-constructed?
>>>
>>> That's what boost::optional<> is for ;).
>>
>> Yeeeh. Once the async_call returns, you have a value, and should be able
>> to count on it. You shouldn't get back an object
> I suggest adding another boost defect: BOOST_BROKEN_ADL (or similar)
How about BOOST_LIBRARY_IMPL_VULNERABLE_TO_ADL? It's not that the
compiler's ADL implementation is broken, it's that the library
implementation isn't protected against ADL lookups where it needs to be.
Dave
_
On Friday 07 February 2003 05:58 pm, Alisdair Meredith wrote:
> I have a potential patch for the boost::array tests that will pass under
> Borland 0x561 and probably under MSVC as well [I think it is the same
> issue]
>
> I am leary of resolving an issue by patching a test, but I think the
> issue
Again, a nasty case of patching the tests rather than the library :¬ (
It appears borland ADL is not up to the task of handling the interval
library test cases. Looking at the fail lists, I suspect it is not the
only compiler to suffer.
I suggest adding another boost defect: BOOST_BROKEN_ADL (or
[2003-02-07] Alisdair Meredith wrote:
>Rene Rivera wrote:
>
>> Don't know if different people ran it or not. But it is simply that one
has
>> a different file name, from an old run, and the table is sorted strictly
on
>> the file name of the results.
>
>If the old run is no longer relevent (as run
Rene Rivera wrote:
> Count me in that "us" ;-\
> Don't know if different people ran it or not. But it is simply that one has
> a different file name, from an old run, and the table is sorted strictly on
> the file name of the results.
If the old run is no longer relevent (as run date October
I have a potential patch for the boost::array tests that will pass under
Borland 0x561 and probably under MSVC as well [I think it is the same
issue]
I am leary of resolving an issue by patching a test, but I think the
issue is comparatively minor, especially in regard to most library use,
and cur
[2003-02-07] Alisdair Meredith wrote:
>Rene Rivera wrote:
>
>> In order to make regression test browsing more pleasant for all of us. I
>> decided to work up a little script to gather up all the test results that
>> get posted to the boost.sourceforge.net site. So browse on over to:
>>
>> htt
Rene Rivera wrote:
> In order to make regression test browsing more pleasant for all of us. I
> decided to work up a little script to gather up all the test results that
> get posted to the boost.sourceforge.net site. So browse on over to:
>
> http://boost.sourceforge.net/regression-logs
>
>
>From: "Jason House" <[EMAIL PROTECTED]>
> Terje Slettebø wrote:
>
> > Regarding this project. I've got doubts about the viability of it.
>
> Well, I'm glad you've given it a greater level of thought. I really like
the idea
> of the composite_format, and probably should try to do the same :)
Tha
John Maddock wrote:
> I guess we could boilerplate this and just dump it in the config system, but
> that would mean that would end up including just about
> all the std headers for this compiler. A bit heavyweight if you just want
> to use scoped_ptr or something :-(
> Any other ideas?
We cou
Terje Slettebø wrote:
> Regarding this project. I've got doubts about the viability of it.
Well, I'm glad you've given it a greater level of thought. I really like the idea
of the composite_format, and probably should try to do the same :)
> One thing is to create something useful. Another t
Hi,
I've done some testing of matrix representations to decide what we're
going to use for a project, and I get strange results with uBLAS. What
we need is efficient memory usage, fast large sparse matrix assembly
(insertion speed) and fast large sparse matrix-vector multiply. Large here
means on
David Abrahams said:
>>> ...and if it can't be default-constructed?
>>
>> That's what boost::optional<> is for ;).
>
> Yeeeh. Once the async_call returns, you have a value, and should be able
> to count on it. You shouldn't get back an object whose invariant allows
> there to be no value.
I'm no
"William E. Kempf" <[EMAIL PROTECTED]> writes:
> Dave Abrahams said:
>> On Thursday, February 06, 2003 12:33 PM [GMT+1=CET],
>> William E. Kempf <[EMAIL PROTECTED]> wrote:
>>
> I didn't say it wasn't a result, I said that it wasn't "only" a result.
> In your case it's also the call.
OK.
>>> An
On Thu, 6 Feb 2003, Dave Abrahams wrote:
> From: "Ronald Garcia" <[EMAIL PROTECTED]>
>
> > It looks like the intel compiler still supports long long when used with
> > the -ansi option. I searched around for good specs, but could find no
> > definitive outline of what other restrictions it adds
"Peter Dimov" <[EMAIL PROTECTED]> wrote in message
008b01c2cea4$172cb700$1d00a8c0@pdimov2">news:008b01c2cea4$172cb700$1d00a8c0@pdimov2...
> David B. Held wrote:
> > I need a pointer that can store pointer or an ID.
>
> Looks like a variant. Out of curiosity, how do you use it?
Yeah, it is a varian
David B. Held wrote:
[...]
>> Maybe it would be better to use 'shifted_address> size_t>::get()' instead of 'static_cast(p)) -
>> sizeof(shifted_header)' because pointer_type does not necessarily
>> point to the beginning of the object.
>
> Sure. That was just filler until you put in the more app
Aleksey,
Thanks again for the speedy fixes. The test program works now, but there
still seems to be a quirk with fold in my main sources. I will be off to
London soon, so I don't have time for a new test program. I will get back to
you in about a week.
> day-to-day work), and I just hope you didn
Darryl Green said:
>> -Original Message-
>> From: William E. Kempf [mailto:[EMAIL PROTECTED]]
>>
>> Dave Abrahams said:
>> > Hm? How is the result not a result in my case?
>>
>> I didn't say it wasn't a result, I said that it wasn't "only" a
> result.
>> In your case it's also the call.
>
Regarding this project. I've got doubts about the viability of it.
One thing is to create something useful. Another thing is to create
something useful as a _library_ component. As has been noted regarding
application and library development, application development and library
development is typi
John Maddock wrote:
> > But this doesn't solve the unresolved externals linker
> errors (sorry
> > :-)
>
> No you're right: a (hopefully!) fixed version is attached -
> you now need to define BOOST_REGEX_NO_EXTERNAL_TEMPLATES or
> it won't work correctly.
Thanks, adding the BOOST_REGEX_NO_EXTERNA
>From: "Jason House" <[EMAIL PROTECTED]>
> Jason House wrote:
>
> > Terje Slettebø wrote:
> >
> > > Another possibility might be to have a sentry object, doing automatic
state
> > > saving and restoring in the constructor and destructor. In fact, there
are
> > > already such classes in Boost: Dary
>From: "Jason House" <[EMAIL PROTECTED]>
> Terje Slettebø wrote:
>
> > >From: "Jason House" <[EMAIL PROTECTED]>
> > > I thought of one thing that might work reasonably well.
> > >
> > > How about making ++io_format< T > save the current format in a stack.
> > > and having io_format< T>-- restore t
Andreas Huber wrote:
> In my application the argument passed to is_sequence is _never_ a
> complete type. See below for reasons.
OK, understood. The issue is fixed in the CVS.
Aleksey
___
Unsubscribe & other changes: http://lists.boost.org/mailman/listi
Alexander Terekhov wrote:
> Pavel Vasiliev wrote:
> [...]
>> I really think that having the only mutex for all short smart
>> pointer-related interlocked operations will not harm performance of
>> real-life applications in mp systems. In my code this mutex is used
>> only for really short operatio
Andreas Huber wrote:
> The attached code works like a dream on MSVC 7.1, but MSVC 7.0 again
> has its problems:
>
> Problem No. 1: Expression 1 does not seem to work, because
> Derived is an incomplete type:
> To reproduce, you might want to comment-out expression 3 and
> uncomment expression
John Maddock wrote:
>
> >Why can't I see them?? Look at:
>
> OK the implementation is:
>
> BOOST_STATIC_CONSTANT(bool, value =
> (::boost::type_traits::ice_and<
> ::boost::type_traits::ice_not< ::boost::is_union::value >::value,
> ::boost::type_traits::ice_not< ::boost::i
David B. Held wrote:
> I need a pointer that can store pointer or an ID.
Looks like a variant. Out of curiosity, how do you use it?
___
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
> But this doesn't solve the unresolved externals linker errors (sorry :-)
No you're right: a (hopefully!) fixed version is attached - you now need to
define BOOST_REGEX_NO_EXTERNAL_TEMPLATES or it won't work correctly.
John.
src.cpp
Description: Binary data
___
>Why can't I see them?? Look at:
OK the implementation is:
BOOST_STATIC_CONSTANT(bool, value =
(::boost::type_traits::ice_and<
::boost::type_traits::ice_not< ::boost::is_union::value >::value,
::boost::type_traits::ice_not< ::boost::is_scalar::value
>::value,
::bo
On Thu, 6 Feb 2003 14:51:43 -0500, "Dave Abrahams"
<[EMAIL PROTECTED]> wrote:
>On Thursday, February 06, 2003 2:43 PM [GMT+1=CET],
>Gennaro Prota <[EMAIL PROTECTED]> wrote:
>>
>> Do you mean /Za?
>
>
>We're discussing the linux compiler,
Oops, sorry. I should have noticed that.
>and yes the Wind
Dave Abrahams wrote:
there's a serious problem with it. It includes another one, which
declares find_if algorithm in namespace boost, and that causes ambiguity
with std::find_if. The following code piece illustrates it
}
The situation is that implementation of std::remove_if calls find_
On Friday, February 07, 2003 4:54 AM [GMT+1=CET],
Vladimir Prus <[EMAIL PROTECTED]> wrote:
> Hi,
> I've just tried to use the header named above, from boost sandbox.
However,
> there's a serious problem with it. It includes another one, which
> declares find_if algorithm in namespace boost, and th
I've run inspect on the boost sandbox and it produced quite a long
list of warnings. Most of them seem to be tabs in files. Don't know
what is the policy regarding sandbox is, but probably the authors would
like to know about the problems and fix them. The list is attached.
- Volodya
array_tra
Hi,
I've just tried to use the header named above, from boost sandbox. However,
there's a serious problem with it. It includes another one, which
declares find_if algorithm in namespace boost, and that causes ambiguity with
std::find_if. The following code piece illustrates it
#include
#include
> -Original Message-
> From: William E. Kempf [mailto:[EMAIL PROTECTED]]
>
> Dave Abrahams said:
> > Hm? How is the result not a result in my case?
>
> I didn't say it wasn't a result, I said that it wasn't "only" a
result.
> In your case it's also the call.
Regardless of whether it invok
Gennadiy Rozental wrote:
Did you include unit_test_suite_ex.hpp?
Aha, that did the trick. Thanks for your help!
Markus
___
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
Gennadiy Rozental wrote:
I would like to suggest the addition of the test tool
BOOST_CHECK_NO_THROW to the boost test library. It's purpose should be
obvious from the name and I think it would be quite handy when testing
construction of objects.
Why would you need that? It's already checked auto
40 matches
Mail list logo
