Re: Is there an STL algo to fill a vector with product of 2 other vectors?

From:

Pete Becker <pete@versatilecoding.com>

Newsgroups:

comp.lang.c++

Date:

Wed, 10 Dec 2008 07:35:18 -0500

Message-ID:

<2008121007351816807-pete@versatilecodingcom>

On 2008-12-10 04:43:10 -0500, James Kanze <james.kanze@gmail.com> said:

On Dec 10, 12:16 am, Pete Becker <p...@versatilecoding.com> wrote:

On 2008-12-09 17:28:15 -0500, Steve555 <foursh...@btinternet.com> said:

(OK, it's not so much trouble to add it, but it does seem
like adding the redundant instruction DontCrash() ;) )

It's not redundant.

STL algorithms write their output to sequences. An output
sequence is designated by a single iterator. If that iterator
points to the beginning of a vector or an array you can write
onto the elements of the vector without having to change its
size, provided it's at least as large as the number of things
you're going to write. But the iterator can also be an insert
iterator, in which case it inserts new elements into a
container.

And not to forget: there are three different types of insertion
iterator.

Yes, I deliberately left that unsaid to encourage discovery.

--
Pete
Roundhouse Consulting, Ltd. (www.versatilecoding.com) Author of "The
Standard C++ Library Extensions: a Tutorial and Reference
(www.petebecker.com/tr1book)