#include <iostream>
#include <string>
#include <unordered_map> //hash table
#include <map>  //balanced binary search tree
using namespace std;


void showStats(unordered_map<string, double>& M)
{
	cout << "Number items: " << M.size() << endl;
	cout << "Table size: " << M.bucket_count() << endl;
	cout << "Load Factor: " << M.load_factor() << endl;
	cout << "Max load factor: " << M.max_load_factor() << endl;

	cout << endl;
}

int main()
{
	//key (string) MUST be hashable
	//value (double) can be anything
	unordered_map<string, double> gpa;

	pair<string,double> s1;
	s1.first = "Anthony";
	s1.second = 2.7;

	pair<string, double> s2;
	s2.first = "Enrigo";
	s2.second = 3.2;

	gpa.insert(s1);
	gpa.insert(s2);

	//fancy bracket notation for insert
	gpa["America"] = 2.3;
	gpa["Omar"] = 1.3;
	gpa["Marcos"] = 2.8;
	gpa["Ana"] = 3.14;
	gpa["Berry"] = 0.3;
	gpa["Erigque"] = 4;
	gpa["Joe"] = 2;

	showStats(gpa);

	return 0;
}