Sylvain Pion <[EMAIL PROTECTED]> writes:
>> I'm guessing "..." is something like, "if default-constructed standard
>> container iterators were non-singular and guaranteed to be unequal to
>> any iterator obtained by other means".
>
> That would be something more like "if default-constructed standa
I am extremely interested in expression templates and related technologies.
Lambda expressions and higher-order functions/functors are fascinating as
they allow you to completely rethink the way you design and structure a
program.
I have recently learned Haskell at the University I am studying
> > Likewise, for me a container is simply one form of range, but I can
> > imagine many others. Perhaps I should take a look at the Views
> > library? To phrase the library in terms of containers seems to limit
> > it, to me.
>
> I like your approach, FWIW. It's easy enough to get an iterator
Guillaume Melquiond wrote:
> This is a patch to the library, until I can get CVS working. It adds
several
> new features:
Since this library seems to offer an interesting way to deal with interval
display, I wanted to give a try. Unfortunately, the zip file does not
contain all the needed files
On Sun, 11 May 2003, Guillaume Melquiond wrote:
> The default configuration defines BOOST_NO_STDC_NAMESPACE for this
> compiler. So the library expects to find standard C math functions (the
> ones in ) in the global namespace. Unfortunately, they are where
> they are supposed to be: in the std na
On Sun, May 11, 2003 at 01:47:00PM -0400, David Abrahams wrote:
> > I have a suggestion for another "orthogonal" feature of iterators, which is
> > available for plain pointers : NULL. More precisely, the fact that the
> > default initialized iterator is a unique (singular) value which you can
> >
Sylvain Pion <[EMAIL PROTECTED]> writes:
> Dave, Jeremy, and Thomas,
>
> I have a suggestion for another "orthogonal" feature of iterators, which
> is available for plain pointers : NULL.
> More precisely, the fact that the default initialized iterator is a unique
> (singular) value which you can
>Also, is there a background paper describing the motivation for this
>library anywhere? I am currently making big assumptions about its
>intent (you may have noticed!) so that might correct some of my
>misconceptions :¬ )
when I come to think of it, it was also nice to be able to treat arrays,
i
"David Abrahams" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
> Alisdair Meredith <[EMAIL PROTECTED]> writes:
>
> > This is clear when we look at algorithms that take a range for input and
> > an output iterator, eg transform. Where I see a range and an iterator,
> > your library tr
"Alisdair Meredith" :
>Hmmm, it looks like we are trying to achieve slightly different things.
>From my perspective, the standard library works with semi-open ranges
>and iterators. I am not trying to change that, merely make more
>explicit when a pair of iterators in the parameter list form the b
"Guillaume Melquiond" <[EMAIL PROTECTED]> wrote in message
news:[EMAIL PROTECTED]
> Hi,
>
> I found a bug in the interval library. but when I corrected it, I stumbled
> over another problem: this bug was ironically what allowed the library to
> be correctly compiled with my version of the compiler
Hi,
I found a bug in the interval library. but when I corrected it, I stumbled
over another problem: this bug was ironically what allowed the library to
be correctly compiled with my version of the compiler (Intel compiler 7.1
for Linux). When I remove it, the library no longer works...
The defau
A last_write_time() function has been added to
It is based on suggestions from Richard Fanta, Ben Hutchings, and Peter
Dimov,
CVS has been updated.
--Beman
___
Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost
On Sat, 10 May 2003, David Abrahams wrote:
> Douglas Gregor <[EMAIL PROTECTED]> writes:
> > Here's the projection_property_map class template. Anyone need it in
> > boost/property_map.hpp?
>
> Boost property_map_adaptors library anyone?
Sure. Have a few more to donate?
Doug
_
Dave, Jeremy, and Thomas,
I have a suggestion for another "orthogonal" feature of iterators, which
is available for plain pointers : NULL.
More precisely, the fact that the default initialized iterator is a unique
(singular) value which you can reliably test equality with.
It is very useful to ha
15 matches
Mail list logo
