what is the performance issue using std::vector

Question

1.29/5 (3 votes)

See more:

C++

Windows

Hi,

what is the performance penalty using std::vector?

Regards,
Ranjith

Posted 5-Mar-14 7:02am

ranjithkumar81

Add a Solution

Comments

jeron1 5-Mar-14 13:14pm

There shouldn't be much , if any, if used correctly. See this[^] discussion, it might help.

Sergey Alexandrovich Kryukov 5-Mar-14 14:13pm

No, you please tell us: did you have any performance problem? :-)
—SA

[no name] 6-Mar-14 0:53am

Performance penalty compared with what?

3 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Stefan_Lang · Answer 1 · 2014-03-05T23:16:00

1. There is no performance issue until you have an actual application that runs too slowly.

2. There is no performance issue with std::vector until you have an application that runs too slowly, and can prove that std:: vector is taking up a significant amount of the processing time.

3. I am not aware of any such real world application suffering from that specific problem.

4. Caveat: nothing stops you from using std::vector inappropriately, or using std::vector when you should have been using e. g. std::list or std::map instead! In my above statements I am assuming you are using the type for data that don't require you to insert or remove elements in the midst of the array, at least not on a regular basis.

«_Superman_» · Answer 2 · 2014-03-05T18:32:00

std::vector is ideal for insertions and deletions at the end of the collection and also for random read access.
The documentation talks more about it - vector Class[^]

Here are some excerpts from the documentation -

They should be the preferred container for a sequence when random-access performance is at a premium.

Vectors allow constant time insertions and deletions at the end of the sequence. Inserting or deleting elements in the middle of a vector requires linear time. The performance of the deque Class container is superior with respect to insertions and deletions at the beginning and end of a sequence. The list Class container is superior with respect to insertions and deletions at any location within a sequence.

chandanadhikari · Answer 3 · 2014-03-05T18:45:00

Solution 2

hi,
I never faced any noticeable performance hits, but for a second opinion take a look at this link[^]
specially the part where 'reserve' is explained.

cheers!

Posted 5-Mar-14 18:45pm

chandanadhikari

what is the performance issue using std::vector

3 solutions

Solution 3

Solution 1

Solution 2

Add your solution here

Preview 0