Resizing Vector of shared pointers

[joe]

Brain Block.

I thought there was a way to do this in less lines (1 line?):

std::vector<boost::shared_ptr<T m_vec;

for (int i =0; i<totalSize; ++i)
{
m_vec.push_back(new T);
}

but my brain isn't letting me remember how right now. Anyone out
there want to help?

Joe C

[acehreli]

On Oct 15, 9:28*am, joe <[e-mail]:

I thought there was a way to do this in less lines (1 line?):

std::vector<boost::shared_ptr<T m_vec;

for (int i =0; i<totalSize; ++i)
{
* *m_vec.push_back(new T);

}

m_vec.resize(totalSize);

Ali

[Thomas J. Gritzan]

ac******@gmail.com schrieb:

On Oct 15, 9:28 am, joe <[e-mail]:

>I thought there was a way to do this in less lines (1 line?):

std::vector<boost::shared_ptr<T m_vec;

for (int i =0; i<totalSize; ++i)
{
m_vec.push_back(new T);

}

m_vec.resize(totalSize);

This will fill the vector with empty shared_ptr, while the above loop
will fill the vector with allocated objects. So they won't do the same.

--
Thomas

[Bo Persson]

joe wrote:

Brain Block.

I thought there was a way to do this in less lines (1 line?):

std::vector<boost::shared_ptr<T m_vec;

for (int i =0; i<totalSize; ++i)
{
m_vec.push_back(new T);
}

but my brain isn't letting me remember how right now. Anyone out
there want to help?

It depends somewhat on T, and what you are doing with it. If you
want/need to have a certain number of distinct Ts, you just need to
use 'new' that number of times. If it is ok to share a single T, you
can do that in the constructor.
Bo Persson

[joseph cook]

It depends somewhat on T, and what you are doing with it. If you
want/need to have a certain number of distinct Ts, you just need to
use 'new' that number of times. If it is ok to share a single T, you
can do that in the constructor.

Bo Persson

Oh, well, I thought somehow I could create distinct T's in a
constructor line...I must have had too much pumpkin wine.

Joe C

[Stephen Horne]

On Wed, 15 Oct 2008 09:28:01 -0700 (PDT), joe <jo******@mail.com>
wrote:

>std::vector<boost::shared_ptr<T m_vec;

for (int i =0; i<totalSize; ++i)
{
m_vec.push_back(new T);
}

but my brain isn't letting me remember how right now. Anyone out
there want to help?

I can do the loop in one line, but you won't like it...

while (m_vec.size () < totalSize) m_vec.push_back (new T);

I said you wouldn't like it ;-)

[James Kanze]

On Oct 15, 6:28 pm, joe <[e-mail]:

I thought there was a way to do this in less lines (1 line?):

std::vector<boost::shared_ptr<T m_vec;

for (int i =0; i<totalSize; ++i)
{
m_vec.push_back(new T);
}

but my brain isn't letting me remember how right now. Anyone
out there want to help?

How about std::fill_n with a back inserter and a
boost::function_output_iterator. For that matter, I'm pretty
sure that I saw an iterator adapter somewhere which stopped
after a maximum of n times; use that with the
function_output_iterator, and you should be able to use the two
iterator form of the constructor directly.

--
James Kanze (GABI Software) email:ja*********@gmail.com
Conseils en informatique orientée objet/
Beratung in objektorientierter Datenverarbeitung
9 place Sémard, 78210 St.-Cyr-l'École, France, [phone]

[Jeff Schwab]

James Kanze wrote:

I'm pretty
sure that I saw an iterator adapter somewhere which stopped
after a maximum of n times

I've always wondered why there is no counting_iterator in the standard
library. It's very handy.