Douglas Gregor wrote:
On Saturday 04 January 2003 11:53 am, Vladimir Prus wrote:
I was just going to use the class named in the subject. Unfortunately,
it can't be found anywhere. Here what grep on an up-to-date CVS tree gives:
You probably want iterator_property_map, which takes a
I think that BGL concept docs are a little bit out of sync with
the concept cheking code. I've corrected some of problems and
attach a patch. Is it OK to apply it?
Another issue is that doc talk about MutablePropertyGraphConcept,
while code has LvaluePropertyGraphConcept. I'm not sure which one
Aleksey Gurtovoy [EMAIL PROTECTED] writes:
David Abrahams wrote:
Aleksey Gurtovoy [EMAIL PROTECTED] writes:
So, now the question is, how to name the adaptor? :) Does
'unroll_args' sound right/good enough?
Neat idea! How about unary or unaryize?
I like the latter, but it doesn't
That sounds like a smart move. It should be easy enough if we can
encode that feature into the toolsets. Can you take care of that part
of the job? If so, it would be very easy for me to update testing.jam
and we'd be done.
Not easily, I don't currently have access to those compilers
John Maddock [EMAIL PROTECTED] writes:
That sounds like a smart move. It should be easy enough if we can
encode that feature into the toolsets. Can you take care of that part
of the job? If so, it would be very easy for me to update testing.jam
and we'd be done.
Not easily, I don't
Hi.
I've tried to compile something which uses std::wstring on GCC 3.2 (MinGW),
but I get the following error at link-time:
undefined reference to `std::basic_stringwchar_t,
std::char_traitswchar_t, std::allocatorwchar_t ::basic_string()'
Using std::string works fine. Doesn't GCC 3.2 support
I'm in a need of a container, which:
- is sorted
- has iterators which are not invalidated on
'insert'
- keeps no more than k elements. If more elements are
inserted, the smallest ones should be erased.
I'm considering writing a wrapper over std::multiset for this purpose.
But before I
Yitzhak Sapir [EMAIL PROTECTED] writes:
D A while ago there was a call for license reviews. Various licenses were
listed at:
http://www.crystalclearsoftware.com/cgi-bin/boost_wiki/wiki.pl?Boost_License
for review. The STLPort license, which is available at:
Vladimir Prus [EMAIL PROTECTED] writes:
I'm in a need of a container, which:
- is sorted
- has iterators which are not invalidated on
'insert'
- keeps no more than k elements. If more elements are
inserted, the smallest ones should be erased.
I'm considering writing a wrapper over
Terje Slettebø [EMAIL PROTECTED] writes:
| Hi.
|
| I've tried to compile something which uses std::wstring on GCC 3.2 (MinGW),
| but I get the following error at link-time:
Gcc 3.2 have wstring... could the problem be how MinGW is configured?
--
Lgb
David Abrahams wrote:
...although now the only expected failure tests we have left are
compile-fail. So I don't know what to do with the others.
Could we introduce a third result. Pass and fail we know, 'error' would
the test could not actually be run. This would reflect a compile fail
for
Hi,
I have never used these two macros, but is the following code, from
boost/preprocessor/punctuation/paren.hpp, correct?
# /* BOOST_PP_LPAREN */
#
# define BOOST_PP_LPAREN() (
#
# /* BOOST_PP_RPAREN */
#
# define BOOST_PP_RPAREN() (
By the way, I think that the copyright on this file (and
David Abrahams wrote:
Vladimir Prus [EMAIL PROTECTED] writes:
I'm in a need of a container, which:
- is sorted
- has iterators which are not invalidated on
'insert'
- keeps no more than k elements. If more elements are
inserted, the smallest ones should be erased.
I'm considering
From: Lars Gullik Bjønnes [EMAIL PROTECTED]
Terje Slettebø [EMAIL PROTECTED] writes:
| I've tried to compile something which uses std::wstring on GCC 3.2
(MinGW),
| but I get the following error at link-time:
Gcc 3.2 have wstring... could the problem be how MinGW is configured?
It could
David Abrahams wrote:
thought, I am not sure if it's a good choice. Does
apply unarizeF, listint,long ::type
convey the discussed meaning for you?
No, but I'm not sure that unroll_args does either.
unroll_args doesn't, in fact, unroll arguments. It's a metafunction
adapter. Unroll is
Hi,
A typical use of the C preprocessor is to use object-like macros as flags
for controlling code expansion:
#if defined(OBJECT_LIKE_MACRO)
EXPANDED_IF_DEFINED
#else
EXPANDED_IF_NOT_DEFINED
#endif
The OBJECT_LIKE_MACRO is usually defined either in some configuration
header, or it
At 10:02 AM 1/5/2003, Peter Dimov wrote:
From: Beman Dawes [EMAIL PROTECTED]
At first glance eliminating the dependency on path seems like a win,
but
I'm worried about the future.
I think there is at least some chance that path can be expanded to
include the ability to handle wide
- Original Message -
From: Vesa Karvonen [EMAIL PROTECTED]
Hi,
I have never used these two macros, but is the following code, from
boost/preprocessor/punctuation/paren.hpp, correct?
# define BOOST_PP_RPAREN() (
Yeah, I fixed it. Oops.
By the way, I think that the copyright on
- Original Message -
From: David Abrahams [EMAIL PROTECTED]
Vesa Karvonen [EMAIL PROTECTED] writes:
I'd like to propose adding suitable predicate macros, in particular
BOOST_PP_IS_EMPTY(X), BOOST_PP_IS_1(X), BOOST_PP_IS_EMPTY_OR_1(X),
I like them (and I like the implementations)!
- Original Message -
From: Vesa Karvonen [EMAIL PROTECTED]
Vesa, I hack this up so it works on all compilers and then add it to the
CVS. The main problem is that the implementation relies on expansion order.
That is another name for VC and Metrowerks bugs. I don't see why they
can't be
Alisdair Meredith [EMAIL PROTECTED] writes:
David Abrahams wrote:
...although now the only expected failure tests we have left are
compile-fail. So I don't know what to do with the others.
Could we introduce a third result. Pass and fail we know, 'error' would
the test could not actually
- Original Message -
From: Paul Mensonides [EMAIL PROTECTED]
Vesa, I hack this up so it works on all compilers and then add it to the
CVS. The main problem is that the implementation relies on expansion
order.
That is another name for VC and Metrowerks bugs. I don't see why they
Paul Mensonides [EMAIL PROTECTED] writes:
Vesa, I can get it to work on VC and Metrowerks if I alter the semantics
slightly. Namely by doing this:
#define IS_ZERO(x) IS_ZERO_I( CHECK x () )
// ...
#define CHECK() 1
The semantic change is that 'x' must not be a function-like macro. What
Vesa Karvonen [EMAIL PROTECTED] writes:
David Abrahams:
Paul Mensonides:
The semantic change is that 'x' must not be a function-like macro. What do
you think?
I think that rules out most of the use-cases Vesa was interested in
addressing with this :(
Well, it does rule out some
- Original Message -
From: David Abrahams [EMAIL PROTECTED]
Well, it does rule out some use-cases, and it is not ideal to have such
limitations, but it should
still be useful for testing whether an object-like macro, such as an
include guard, or a config
macro, has been defined. I
- Original Message -
From: Vesa Karvonen [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Sent: Sunday, January 05, 2003 3:45 PM
Subject: Re: [boost] Boost.Preprocessor: Alternatives to defined(x)
David Abrahams:
Paul Mensonides:
The semantic change is that 'x' must not be a
- Original Message -
From: Paul Mensonides [EMAIL PROTECTED]
Anyway, I might still be able to make the original ideal work with VC and
Metrowerks. (You wouldn't believe how sick I am of those two compilers!)
Give me some time
Actually it is not possible anyway. Not necessarily
Alberto Barbati wrote:
* a comprehensive test suite (with Jamfile)
I almost forgot! The test suite requires the filesystem library. Special
thanks to Beman Dawes for it!
Alberto
___
Unsubscribe other changes:
28 matches
Mail list logo
