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

  • Home
  • SEARCH
  • 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 9026051
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 16, 20262026-06-16T06:25:36+00:00 2026-06-16T06:25:36+00:00

Is it possible to seek a std::string::iterator safely to a given position? std::string::iterator has

  • 0

Is it possible to seek a std::string::iterator safely to a given position?

std::string::iterator has a offset access operator (operator []), but it exists in the category defined by some people as undefined behavior, like it + 3.

cplusplus.com reference

  • 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-06-16T06:25:37+00:00Added an answer on June 16, 2026 at 6:25 am

    std::string::iterator has a offset access operator (operator []), but it exists in the category defined by some people as undefined behavior, like it + 3.

    I don’t understand this statement. There is no such category. std::basic_string<>::iterator is a random access iterator and as such you can seek by just adding or subtracting an offset to / from it (which is consistent with the documentation you linked to):

    auto new_it = it + offset;
    

    What’s undefined is seeking past the end() iterator of the associated container, or before its beginning. That is, the following is undefined behaviour:

    std::string str = "hi";
    auto it1 = str.begin() + 2; // OK.
    assert(it1 == str.end());
    auto it2 = str.begin() + 3; // UB!
    // At this point we cannot assert anything about it2
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Is it possible to get and set seek position of a swf file (either
Given a matrix M and smaller matrices with different possible values, I seek to
Possible Duplicate: && operator in Javascript In the sample code of the ExtJS web
I've been using std::istream and ostream as a polymorphic interface for random-access binary I/O
I have a feeling its not possible; but is there a way to set
Possible Duplicate: Why is Java's Iterator not an Iterable? We all know java's extended
I want to implement something similar to android seek bar.But not in a linear
I'm not sure if this is possible but I want to be able to
Is it possible to seek to a particular point in html5 video displayed in
Is it possible to open a file in .NET with non exclusive write access?

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.