#include <iostream>#include <map>#include <string>using namespace std;struct Thing{  string name;  int weight;  int cost;};int main(){    // This is a map. The first template parameter is the key type, used  // to retrieve the value. The second parameter is the value type, the  // type of object to be stored.    map<string, Thing> database;    // The following user interface does no input validation, but this is just  // an example. Normally you'd wrap this stuff into tidy little functions.    while (1)  {    // For this example I use a temporary that can be    // copied into the map.        Thing temp;        cout << "\nEnter a Thing name (or 'quit'): ";    cin >> temp.name;        if ( temp.name == "quit" ) break;        // Search the map using its find function which returns an iterator.    // (an iterator is like a special kind of pointer for containers)        map<string, Thing>::iterator iter = database.find(temp.name);        // iter now either points to the matching element,    // or it points to the end() if it found no match        if ( iter == database.end() )    {      cout << temp.name << " not found. A new database entry will be created.\n";            cout << "Enter a number for the weight: ";      cin >> temp.weight;            cout << "Enter a number for the cost: ";      cin >> temp.cost;            // Copy temp into the map, using the name as the key...        database[temp.name] = temp;        cout << "New data recorded. Thank you.";    }    else    {      cout << temp.name << " was found in the database. Here it is...";            // iter points to a std::pair object where first is the key and second is      // the value. We'll just create a local reference to second.            const Thing& found = (*iter).second;            cout << "\nName: "   << found.name            << "\nWeight: " << found.weight           << "\nCost: "   << found.cost;    }        cout << endl;      }    cout << "Goodbye." << endl;  }