Remy Blank wrote:
I checked out dynamic_any from CVS but the function... syntax seems to
be missing, so I replaced it by function1 Is there something missing
in the repository?
Yes, you are right, it's missing. I have not enough time to implement all
features. Currently only functionN
Yes, I agree about the name change. Sorry if the previous post seemed a
bit abrupt, I just dashed it off while waiting for a compile and it didn't
come out exactly as I intended. I was just trying to make the point that a
general comparison function which does the right thing is actually a
more
Yes, this would be fantastic! At our company we have roled our own test
suite, but a reference implementation of this test would come in very
useful, and perhaps at some point we could switch over to using Boost.Test
(although our test framework appears to be quite incompatible)
Cheers
Ben
---
On Mon, Nov 25, 2002 at 11:57:25AM -0500, Alexei Novakov wrote:
Pavol Droba [EMAIL PROTECTED] wrote in message
[EMAIL PROTECTED]">news:[EMAIL PROTECTED]...
Well, in the current state, the string_algo library provides a generic set
of string
related algorithm. There are many reasons I
Date: Mon, 25 Nov 2002 05:14:23 -0500
From: Gennadiy Rozental [EMAIL PROTECTED]
5.2 registration - A brief recap:
You did not comment on my Issue 1 and proposition to completely separate
registration into template parameter. This way you won't need any macro.
The
user will choose what
David A. Greene wrote:
I do need to be able to start at various points within the sequence.
Your second solution fleshes out the design I had in mind, but I
was out of town over the weekend so you beat me to the punch. :)
Actually, I wrote too much code in that solution ;). Just this would be
David Abrahams wrote:
Well I hope that was all instructive, but it was probably way more
complicated than neccessary. I think it would actually be far superior
to build a solution around an mpl iterator adaptor like this one:
template class IteratorSeq struct zip_iterator
{
On Thu, 21 Nov 2002 19:15:21 -0500, David Abrahams
[EMAIL PROTECTED] wrote:
Thoughts?
This is one... A nice thing about the problem you are talking about is
that any function having a parameter of type T is in fact a general
detector of convertibility to T (It's also worth noting that it
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]]
assert takes an int as parameter, on 64bit platforms this will othen
mean a 64-32 conversion.
This patch fixes a couple of problems in Boost.Format.
Applied, thanks!
Bjorn
___
Unsubscribe
Aleksey Gurtovoy wrote:
I am not sure how these particular type_traits failuers related to the MPL
status one one or another platform ;).
type_trait / lambda push the template processing of the compiler, as
does MPL, so I jumped headlong into a conclusion g
BTW, most lambda failures seem to
From: Jim Grandy [EMAIL PROTECTED]
From: Peter Dimov [EMAIL PROTECTED]
[...]
OK, here is the one-line solution:
templateclass T intrusive_ptrT dont_addref(T * p)
{
intrusive_ptrT pt(p);
intrusive_ptr_release(p);
return pt;
}
I'm not sure this addresses the efficiency
Just wanted to post a brief note to mention that we have released version
3.4 of the C++ Database Template Library.
Main new features:
1. Support for more platforms / compilers. We now support:
Borland, MSVC, gcc, aCC, and Sun Workshop along with the platforms
NT, Cygwin, Linux, HPUX and
Sean Parent wrote:
[...]
Dealing with copyright and patent issues in IP is all about risk management
for a corporation and limiting their exposure. The deeper the corporate
pockets the more conservative a stance the organization will tend to take.
Right.
What Adobe looks for is that:
Not just ignorant but stupid as well - me that this.
I see now the point you are making is that each ( virtual ) function
call must do some IO and the overhead of that IO is significant.
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]
On Behalf Of Matthias
David Abrahams [EMAIL PROTECTED] wrote in message
[EMAIL PROTECTED]">news:[EMAIL PROTECTED]...
Consider applying the fold algorithm to the first sequence, using an
adapted binary operation, something like:
// * Untested!
// A dummy iterator that prevents us running off the end
Le mer 13/11/2002 à 23:58, Alisdair Meredith a écrit :
I'm not sure what BOOST macros might otherwise cover these same issues,
or what to change in config.
I don't know either.
the problem seems to come from the situation schemed below, and unless a
booster points me to a specific boost.config
Sean Parent [EMAIL PROTECTED] writes:
2. That the terms of the license state clearly what the rights granted are
with respect to:
Reproduction
Producing Derivative Works
Perform Publicly
Display Publicly
Sean,
Does the usual Boost copyright notice do this part already, or is it
Robert Ramey wrote:
We should discuss whether to use short, int, long ... as the primitive
types or int8_t, int16_t, int32_t, int64_t. The latter makes it easier
to write portable archives, the former seems more natural. I can
accept both choices but we should not mix the two as is done now.
Dirk Gerrits [EMAIL PROTECTED] writes:
David Abrahams wrote:
make_tuple(ref(x1), ref(y1), ref(z1)) ...
Isn't this equivalent to
tie(x1, y1, z1) tie(x2, y2, z2)
?
I think so!
--
David Abrahams
[EMAIL PROTECTED] * http://www.boost-consulting.com
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]On Behalf Of Darryl Green
Sent: Tuesday, November 26, 2002 1:55 AM
To: Boost mailing list
Subject: RE: [boost] Re: Socket errors
[...]
It is important to remember that SSL/TLS do not assume TCP or any
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]On Behalf Of Hamish Mackenzie
Sent: Tuesday, November 26, 2002 1:34 AM
To: Boost mailing list
Subject: RE: [boost] Re: AW: Re: AW: Sockets
On Mon, 2002-11-25 at 23:56, Boris Schäling wrote:
This looks like a
David Abrahams wrote:
Alexander Terekhov [EMAIL PROTECTED] writes:
Sean Parent wrote:
[...]
Dealing with copyright and patent issues in IP is all about risk management
for a corporation and limiting their exposure. The deeper the corporate
pockets the more conservative a stance the
Alexander Terekhov [EMAIL PROTECTED] writes:
David Abrahams wrote:
Alexander Terekhov [EMAIL PROTECTED] writes:
Sean Parent wrote:
[...]
Dealing with copyright and patent issues in IP is all about risk management
for a corporation and limiting their exposure. The deeper the
Le jeu 14/11/2002 à 16:31, Alisdair Meredith a écrit :
I beleive this is some test code that does roughly something similar to
the library implementation:
right, this code is equivalent to what format does, for some
format-string.
int main()
{
std::cout.setf( std::ios::showbase );
1. getaddrinfo is thread-safe. And not all OS provide those
functions like gethostbyname_r
2. getaddrinfo resovle one name to multiaddresses, especially a
name with both IPv4 addresses, and IPv6 addresses.
Just as a side note. getaddrinfo is only supported on Windows XP and
Samuel Krempp wrote:
Is it really enough to get boost.format to compile with BCB 5 ?
With this in place, all seems fine for me apart from the 'internal
padding' issue referred to elsewhere. Don't know if either issue is
addressed in BCB6 [upgrade due end of December, I'll confirm then if
Does the as is really add anything that the sentence doesn't already state?
This software is provided without express or implied warranty,
and with no claim as to its suitability for any purpose.
seems clear enough as is!
Paul
Paul A Bristow, Prizet Farmhouse, Kendal, Cumbria, LA8 8AB UK
Paul A. Bristow [EMAIL PROTECTED] wrote in message
[EMAIL PROTECTED]">news:[EMAIL PROTECTED]...
Does the as is really add anything that the sentence doesn't already
state?
This software is provided without express or implied warranty,
and with no claim as to its suitability for any purpose.
- Original Message -
From: Rozental, Gennadiy [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Monday, November 25, 2002 4:17 AM
Subject: RE: [boost] Factoring out Test Library wrapstrstream
My tests are already arranged in a way that 'test/minimal.hpp' offers
too
little functionality
David Abrahams wrote:
[...]
What makes the IBM license more worthy of consideration than, say,
the BSD license?
Well, a sort of comparison/commentary w.r.t. quite a few most common
OSS licenses that I have isn't public -- I can't tell you; you will
have to ask your lawyer, I guess.
regards,
(3) fully included
The problem with this is that I put the burden of doing so to
the user.
I do not get it. In this case you are the user (of Boost.Test library). To
use fully included version you are using
#include boost/test/included/test_exec_monitor.hpp
And that's it. No need for
Very perceptive :-). Actually that is the one major feature we are still
missing that I would like to add. In fact, a big obstacle to adding
random-access type iterators is that I have not yet figured out the
right way to design them. It is actually a bit tricky. Here is the
problem. In ODBC
make_tuple(ref(x1), ref(y1), ref(z1)) ...
Isn't this equivalent to
tie(x1, y1, z1) tie(x2, y2, z2)
?
I think so!
It is.
/Jaakko
___
Unsubscribe other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
From: Boris Schäling [mailto:[EMAIL PROTECTED]]
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]On Behalf Of Hugo Duncan
[...]
* a multiplexing library should cope with:
files,
How should files be supported by a multiplexing library? In Unix/Linux
file
access never blocks?
-Original Message-
From: Boris Schäling [mailto:[EMAIL PROTECTED]]
Sent: Wednesday, 27 November 2002 3:12 AM
To: Boost mailing list
Subject: RE: [boost] Re: Socket errors
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]On Behalf Of Darryl
From: Boris Schäling [mailto:[EMAIL PROTECTED]]
Sent: Wednesday, 27 November 2002 3:12 AM
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]]On Behalf Of Hamish Mackenzie
How does the multiplexor know what to pass to write the second time?
The multiplexor doesn't know but the stream
On c.l.c++.m, I argue that operator=() should not use the swap idiom
(largely based on comments I've seen Dave Abrahams make), but
that a named assignment function should instead provide assignment
with the strong guarantee. Since this is such a trivial function, I thought
it would be nice to
37 matches
Mail list logo
