,
const allocator_type& __a = allocator_type())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_unique(...,
const allocator_type& __a = allocator_type())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_unique(...,
const allocator_type& __a = allocator_type())
: _M_ht(__n, __hf, __eql, __a)
{ _M_ht.insert_unique(..._M_ht;
}
hash_set使用演示案例
hash_set并不会对元素进行排序
下面演示在hash_set中存储字符串
#include
#include <hash_set...iter << ""; //banana plum mango apple kiwi apricot
std::cout << std::endl;
return 0;
}
下面演示在hash_set中存储