realloc() and new

Quote:

---

Originally Posted by Paul McKenzie

Using new[]/realloc/delete[] is a dynamic array, even if the OP didn't call these sequence of operations a "dynamic array".

---

No. The first post did not say the new[]/delete[] stuff. They were introduced by you. ;)

Quote:

---

Originally Posted by dunakl

No. The first post did not say the new[]/delete[] stuff. They were introduced by you. ;)

---

??

Quote:

---

How to increase memory size when new/delete are used?

---

Regards,

Paul McKenzie

hmm..,

Quote:

---

Quote:

---

How to increase memory size when new/delete are used?

---

---

Sorry, I still see it is for a general case, not specifically for list of variables.
;)

Quote:

---

Originally Posted by dunakl

No. The first post did not say the new[]/delete[] stuff. They were introduced by you.

---

And...

Quote:

---

Originally Posted by dunakl

Sorry, I still see it is for a general case, not specifically for list of variables.

---

May be you forgot to read this -

Quote:

---

Originally Posted by Funt

I already have implementation of resizing with new[]/delete[] in way you have described.
In my program I should resize memory only one or few times.

---

In any case, when you attempt to solve the problem, you will understand the solutions presented above... ;)

What is the difference? Internally, there is no difference. When you call

Code:

---

new T[n];

---

you are allocating a contiguous block of n sets of T's. When you say

Code:

---

std::vector<T>(n)

---

you are allocating a contiguous block of n sets of T.

The code to std::resize() is roughly equivalent to the code you would need to do with realloc() (by roughly, I mean vector is more efficient, but does the same thing).

Regards,

Paul McKenzie