#include <unordered_set>
#include <iostream>
#include "Student.hpp"

template<typename T, typename Hash, typename Eq>
void print(std::unordered_set<T,Hash,Eq> s) {
  for(auto it = s.cbegin(); it!=s.cend(); it++) 
    std::cout << *it << " ";
  std::cout << std::endl;
}

struct HashByAEM {
  size_t operator()(const Student& st) const {
    std::hash<int> hash_int;
    return hash_int(st.getAEM());
  }
};

struct EqualToByAEM {
  bool operator() (const Student& st1, const Student& st2) const {
    return st1.getAEM() == st2.getAEM();
  }
};

int main(int argc, char *argv[]) {
  std::unordered_set<Student, HashByAEM, EqualToByAEM> students;
  
  students.emplace("Mickie Mouse", 1239);
  students.emplace("Mary Poppins", 1240);
  students.emplace("Minnie Mouse", 1234);
  students.emplace("Peter Pan",    1235);
  students.emplace("Tinker Bell",  1233);
  students.emplace("Donald Duck",  1230);
  students.emplace("Minnie Mouse", 1234);
  students.emplace("Tinker Bell",  1233);
  
  print(students);
  
  return 0;
}