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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 25, 20262026-05-25T06:39:09+00:00 2026-05-25T06:39:09+00:00

Assume we have a simple structure such as the following struct T{ int x;

  • 0

Assume we have a simple structure such as the following

struct T{
  int x;
  int y;
};
T t1, t2;

Also assume that I have a map<T, int> myMap and that two structures of type T are compared using their x values only. I.e. t1 < t2 iff t1.x < t2.x. I am trying to update some of the y values of the keys over myMap. This should not affect how the map is seeing the keys. Is there any way other than removing the old element and inserting a new one?

  • 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-25T06:39:09+00:00Added an answer on May 25, 2026 at 6:39 am

    If you are sure that y does not participate in the “logical state” of your class and is merely an implementation detail, then you could declare it mutable:

    struct T
    {
      int x;
      mutable int y;
      bool operator<(const T& rhs) const { return x < rhs.x; }
    };
    

    Now you ought to be able to change y:

    for (auto it = m.begin(); it != m.end(); ++it)
    {
      it->first.y = -2; // ouch? But it won't invalidate the map's invariants.
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Assume I have two tables, Student Test Id Name TestId Type StudentId -- ----
Assuming I have a simple structure that looks like this: public class Range {
I have a very simple data structure that I have defined in Lisp: ;;Data
Assume that I have a table structure like seen below location|name ------------- NY|john London|neil
Let's we have a simple structure (POD). struct xyz { float x, y, z;
I have a simple tagging system of items with the following structure: class Item
Let's assume we have a simple internet socket, and it's going to send 10
Assume I have a class that looks like this: class Sample { public string
Assume I have the following ; def test(): while 1: a = b time.sleep(60)
assume we have : class Dictionary { int n; int *ints; char **strs; inline

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.