【发布时间】:2015-05-28 15:50:48
【问题描述】:
创建了一个 unordered_map,键为类的 shared_ptr。定义了一个散列函数,它根据类的数据成员创建散列。我无法查找密钥。我看到在查找操作期间调用了哈希方法。
// key to be stored in unordered_map
class data {
public:
char c;
int i;
data(char cc,int ii) {
c=cc;i=ii;
}
};
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> 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()) <<<<----- its always null here. Not sure why
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;
}
【问题讨论】:
-
出于好奇,您的编译器是否能够在不包含任何标头的情况下编译代码?如果没有,你为什么将它们排除在测试用例之外?
-
在阅读您的示例代码(例如
typedef std::tr1::shared_ptr<data> data_ptr;和typedef std::tr1::unordered_map<data_ptr, char, myhash> dataptr_to_char_map;)时,我们会非常欢迎几个typedefs。