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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 5, 20262026-06-05T05:11:51+00:00 2026-06-05T05:11:51+00:00

map<string ,vector<string> > hashes; hashes.insert(pair<string,vector<string> > (a,b )); //error coming What is the problem

  • 0
map<string ,vector<string> > hashes;

hashes.insert(pair<string,vector<string> > (a,b ));  //error coming

What is the problem coming when i am using the above statement in C++, where a and b are strings?
How does the insertion takes place in this type (i.e. one container containing more container) of associative container?

Many many thanx in advance

  • 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-05T05:11:54+00:00Added an answer on June 5, 2026 at 5:11 am

    You probably want

    hashes[a].push_back(b)
    

    That’s if you want b to be appended to the present vector. If you want it to replace it, use

    hashes[a].assign(1, b)
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I want to insert a pair< string, vector<float> > into a map, first it
If I have a vector<string*> *vect or a map<pair<string*, int*>, string*> *map , how
Another small question about STL: i have Dictionary: map <string,vector <Wordy> > Dictionary; using
I want to have a data structure of following type in c++. map<string,pair<string,vector>>. Any
I have this map<string, vector <pair<int, int> > > variable and I'm pushing back
I am initializing map<string, vector<string> > as follows: map <string, vector<string> > dict; dict[USA].push_back(NYC);
In code below: map<string,vector<int>> create(ifstream& in, const vector<string>& vec) { /*holds string and line
I've created a map of vectors that looks like this: map<string, vector<char> > myMap;
I have a map<string,vector<string> > called dict mapping a string to a list of
Here is my code. class xyz. #include <iostream> #include <vector> #include <map> using namespace

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.