RE: [boost] Digest Number 620

From: Jonathan H Lundquist (jhl_at_[hidden])
Date: 2001-06-05 12:30:02

There are many algorithms that benefit from a compile-time determination as
to whether memcpy, memset, etc. can be used.  STLPort for one makes the
assumption that if the iterator is random access, and the value type is
appropriate, these can be used.  However, I think a hypothetical iterator
could support random access without representing contiguous space.  I think
a contiguous access iterator category, which is a random access iterator for
which ranges must be contiguous, should be provided.

-----Original Message-----
From: boost_at_[hidden] [mailto:boost_at_[hidden]]
Sent: Tuesday, June 05, 2001 9:45 AM
To: boost_at_[hidden]
Subject: [boost] Digest Number 620

Message: 13
   Date: Tue, 5 Jun 2001 10:47:07 -0400 (EDT)
   From: Jeremy Siek <jsiek_at_[hidden]>
Subject: Re: Re: operator[] for iterator adaptors

http://anubis.dkuug.dk/JTC1/SC22/WG21/docs/papers/2001/n1297.html

And I've just updated the code that goes with the paper. It is in the
boost/development/iterator directory (can get it through CVS). I haven't
yet updated the docs in CVS, but they will just be the same as the above
paper.

The next step will be to provide a version of iterator adaptors, and a
version of the Standard algorithms that use these new traits classes.

Cheers,
Jeremy