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 6865977
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T03:07:22+00:00 2026-05-27T03:07:22+00:00

So I have a smart iterator that emulates a map const_iterator, and it needs

  • 0

So I have a smart iterator that emulates a map const_iterator, and it needs to build the return type internally. Obviously, I’d like to store a pair<Key, Value> in my iterator class (since I need to modify it), but at the same time I’d like the dereference functions to present a pair<const Key, Value> (actually it would be a const pair<const Key, Value>& and const pair<const Key, Value>* respectively). The only solution I’ve come up with so far is to dynamically allocate a new pair every time change the value that my iterator class points to changes. Needless to say, this is not a good solution.

I’ve also tried *const_cast<const pair<const Key, Value> >(&value) where value is declared as pair<Key, Value>.

Any help would be greatly appreciated (as would the knowledge that it can’t be done).

EDIT

For the curious: I ended up storing a pair<const Key, Value> p in my iterator class. In order to change the pair I alter the two elements separately based on the underlying iterator (map<Key, Value>::const_iterator it), const_casting the key so that it could be altered, like this:

*const_cast<Key*>(&p.first) = it->first;
p.second = it->second;

Not a solution I’m terribly happy with, but it gets the job done, and the dereference methods are happy because I’m storing something of the correct type, which they can refer to.

  • 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-27T03:07:23+00:00Added an answer on May 27, 2026 at 3:07 am

    You can convert a value of type pair<Key,Value> to pair<const Key,Value>.

    However, reading the question carefully, you’re actually asking if, given a pair<Key,Value> you can create a pointer or reference to pair<const Key,Value> referring to the same object.

    The answer is no – the only situation where a reference or pointer to one type can refer to an object of a different type is if the object type inherits from the referenced type.

    One possibility is to return a pair of references, pair<const Key&, Value&>, created from the pair you wish to reference.

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

Sidebar

Related Questions

I have a table that looks something like this: word big expensive smart fast
I have some code i'd like to refactor that uses a C# iterator (ie
So let's say I have an iterator it that returns something of class CustomClass.
I have a container class (called Atom) that I want to store objects of
I have a function, binary_range_search , that is called like so: my $brs_iterator =
I have an STL map that contains shared pointers to objects that are manipulated
I have an iterator (actually a Source.getLines ) that's reading an infinite stream of
Can you have smart behavior for the home key in Emacs? By smart I
I have a smart client application being deployed with a CickOnce webpage. here's the
I have played around with smart phone development (windows ce), and it seemed pretty

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.