#include <iostream>
#include <tr1/memory>
#include <tr1/unordered_map>

using namespace std;

// key to be stored in unordered_map
class data {
    public:
    char c;
    int i;
    data(char cc,int ii) {
       c=cc;i=ii;
    }
};

struct myequal
{
bool operator()(const std::tr1::shared_ptr<data>& lhs, const   std::tr1::shared_ptr<data>& rhs) const
  {
    return lhs->c == rhs->c;
  }
};

class myhash {
    public:
    size_t operator()(const std::tr1::shared_ptr<data> d1 ) const { 
        std::cout << ">" <<  std::tr1::hash<int>()(d1->c) << std::endl; 
        return std::tr1::hash<int>()(d1->c); 
    }
};

int main() {
    std::tr1::unordered_map<std::tr1::shared_ptr<data>, char, myhash, myequal> umap;
    //build map
    std::tr1::shared_ptr<data> d1( new data('A',1));
    umap[d1]='C';
    std::tr1::shared_ptr<data> d2( new data('B',1));
    umap[d2]='C';
    std::tr1::shared_ptr<data> d3(new data('C',1));
    umap[d3]='F';
    std::tr1::shared_ptr<data> d4(new data('D',1));
    umap[d4]='E';
    std::tr1::shared_ptr<data> d5(new data('E',1));
    umap[d5]='F';
    std::tr1::shared_ptr<data> d6(new data('F',1));
    umap[d6]='F';

    std::cout << "--------------" << std::endl;

    for(std::tr1::unordered_map<std::tr1::shared_ptr<data>, char,myhash>::iterator itr = umap.begin(); itr!=umap.end(); itr++) {
        if(itr->first->c == itr->second) 
            continue;
        std::tr1::shared_ptr<data> d11( new data(itr->second,0));
        std::tr1::unordered_map<std::tr1::shared_ptr<data>, char,myhash>::iterator index = umap.find(d11);
        if(index != umap.end())
            index->first->i += itr->first->i;
        else
            std::cout << "NULL" << std::endl;
    }

    for(std::tr1::unordered_map<std::tr1::shared_ptr<data>, char,myhash>::iterator itr = umap.begin(); itr!=umap.end(); itr++) 
        std::cout << itr->first->c << " " << itr->first->i << std::endl;
}