Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6603931
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 25, 20262026-05-25T19:05:00+00:00 2026-05-25T19:05:00+00:00

Supposedly: for (vector<int>::iterator iter = ivec.begin(); iter != ivec.end(); ++iter) {} I do understand

  • 0

Supposedly:

for (vector<int>::iterator iter = ivec.begin(); iter != ivec.end(); ++iter)
{}

I do understand the difference when it comes to pre/post increment for built-in types like int etc but in terms of an iterator, what’s the difference here between ++iter and iter++? (Bear in mind that I do know that both yield the same result here).

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-25T19:05:01+00:00Added an answer on May 25, 2026 at 7:05 pm

    The difference is they do not yield the same result, while this particular example will do the same regardless of the increment form used. The pre-increment form first increments the value, and then returns it; while the post-increment form increments the result but returns the value previous to incrementation. This is usually a no cost for fundamental types, but for things like iterators it requires creating a temporary value to hold the non-incremented value, in order to be later returned.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

#include <vector> std::vector<long int> as; long int a(size_t n){ if(n==1) return 1; if(n==2) return
I have a need to wrap a vector iterator, but don't like the idea
Consider the following code: #include <vector> struct S { int a; double b; };
Consider following piece of code void foo( bool forwad ) { vector<MyObject>::iterator it, end_it;
Supposedly, it is possible to get this from Google Maps or some such service.
Supposedly normalization reduces redundancy of data and increases performance. What is the reason for
This supposedly easy task gave me some headache. I simply want to let the
I have a database (NexusDB (supposedly SQL-92 compliant)) which contains and Item table, a
I want to drop a now supposedly redundant file in SQL Server (2005), but
I've read that it's supposedly a good idea to split an aggregator project (the

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.