Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include"hash_map.h"
- using namespace std;
- int main() {
- HashMap<int,int> petr{};
- petr[3] = 5;
- petr[2] = 1;
- petr[0] = 7;
- petr.print();
- auto it = petr.find(0);
- if (it != petr.end()) {
- cout << it->second<< "\n" ;
- } else {
- cout << -1 << "\n";
- }
- petr.erase(0);
- petr.print();
- cout << petr[0] << "\n";
- cout << petr.Table[0].first->first << " " << petr.Table[0].first->second;
- /*auto it1 = petr.find(0);
- if (it != petr.end()) {
- cout << it->second << "\n";
- } else {
- cout << -1 << "\n";
- }
- auto it2 = petr.find(2);
- if (it != petr.end()) {
- cout << it->second << "\n";
- } else {
- cout << -1 << "\n";
- }
- petr[8] = -4;
- for (auto i = petr.begin(); i!=petr.end(); ++i){
- cout << i->first << " " << i->second << "\n";
- }
- petr.clear();
- auto it3 = petr.find(3);
- if (it != petr.end()) {
- cout << it->second << "\n";
- } else {
- cout << -1 << "\n";
- }
- petr[3] = 5;
- auto it4 = petr.find(3);
- if (it != petr.end()) {
- cout << it->second << "\n";
- } else {
- cout << -1 << "\n";
- }*/
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement