Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Convert this to Python.

Convert this to Python.

Database System Concepts
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
See similar textbooks
icon
Related questions
Question

Convert this to Python.

#include <iostream> #include <map> #include <string> #include <iterator> int main () { std::map<std::string, int> mapofWords; // Inserting data in std: :map mapofWords.insert (std::make_pair("earth", 1)); mapofwords.insert (std::make_pair ("moon", 2)); mapofWords ["sun"] = 3; // Will replace the value of already added key i.e. earth mapofWords ["earth"] = 4; // Iterate through all elements in std::map std::map<std::string, int>: :iterator it = mapofWords.begin (); while (it != mapofWords.end ( ) ) { std::cout<<it->first<<" :: "<<it->second<<std::endl; it++; } // Check if insertion is successful or not if (mapofwords.insert (std: :make_pair ("earth", 1)).second == false) { std::cout<<"Element with key 'earth' not inserted because already existed"<<std::endl; } // Searching element in std::map by key. if (mapofWords.find ("sun") != mapOfWords.end ()) std::cout<<"word 'sun' found"<<std::endl; if (mapofWords.find ("mars") mapofWords.end ()) == std::cout<<"word 'mars' not found"<<std::endl; return 0;
Transcribed Image Text:#include <iostream> #include <map> #include <string> #include <iterator> int main () { std::map<std::string, int> mapofWords; // Inserting data in std: :map mapofWords.insert (std::make_pair("earth", 1)); mapofwords.insert (std::make_pair ("moon", 2)); mapofWords ["sun"] = 3; // Will replace the value of already added key i.e. earth mapofWords ["earth"] = 4; // Iterate through all elements in std::map std::map<std::string, int>: :iterator it = mapofWords.begin (); while (it != mapofWords.end ( ) ) { std::cout<<it->first<<" :: "<<it->second<<std::endl; it++; } // Check if insertion is successful or not if (mapofwords.insert (std: :make_pair ("earth", 1)).second == false) { std::cout<<"Element with key 'earth' not inserted because already existed"<<std::endl; } // Searching element in std::map by key. if (mapofWords.find ("sun") != mapOfWords.end ()) std::cout<<"word 'sun' found"<<std::endl; if (mapofWords.find ("mars") mapofWords.end ()) == std::cout<<"word 'mars' not found"<<std::endl; return 0;
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Top down approach design
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS