Boost logo

Boost :

From: Kevin S. Van Horn (kevin.vanhorn_at_[hidden])
Date: 2001-10-26 11:46:59

> > or
> >
> > copy(src, count(n), dst); // copy n characters
> But note that algorithms that take ranges don't usually impose any traversal
> requirements (in the general case), i.e. they don't travel sequentially
> forward from 'first' until a predicate hits (at least conceptually.)

Yes, it would only be appropriate to use count(n) with algorithms that
take an input iterator and guarantee to only check for end-of-range once
before each increment of the iterator.

Boost list run by bdawes at, gregod at, cpdaniel at, john at