hash_map::hash_map (STL/CLR)

构造容器对象。

    hash_map();
    explicit hash_map(key_compare^ pred);
    hash_map(key_compare^ pred, hasher^ hashfn);
    hash_map(hash_map<Key, Mapped>% right);
    hash_map(hash_map<Key, Mapped>^ right);
    template<typename InIter>
        hash_maphash_map(InIter first, InIter last);
    template<typename InIter>
        hash_map(InIter first, InIter last,
            key_compare^ pred);
    template<typename InIter>
        hash_map(InIter first, InIter last,
            key_compare^ pred, hasher^ hashfn);
    hash_map(System::Collections::Generic::IEnumerable<GValue>^ right);
    hash_map(System::Collections::Generic::IEnumerable<GValue>^ right,
        key_compare^ pred);
    hash_map(System::Collections::Generic::IEnumerable<GValue>^ right,
        key_compare^ pred, hasher^ hashfn);

参数

• 首先
  范围开头插入的。

• hashfn
  映射的键哈希函数到存储桶。

• last
  范围的末尾插入的。

• pred
  控件序列的排序的性质。

• right
  对象或范围插入。

备注

构造函数:

hash_map();

初始化控件序列没有元素，其默认值为排序的谓词 key_compare()和使用默认哈希函数。使用它指定空的初始控件序列，其默认值为排序的特性和哈希函数。

构造函数:

explicit hash_map(key_compare^ pred);

初始化控件序列没有元素，与排序的谓词 pred和使用默认哈希函数。使用它指定空的初始控件序列，与指定的排序的特性和默认哈希函数。

构造函数:

hash_map(key_compare^ pred, hasher^ hashfn);

初始化控件序列没有元素，与排序的谓词 pred和使用哈希函数 hashfn。使用它指定空的初始控件序列，与指定的排序的特性和哈希函数。

构造函数:

hash_map(hash_map<Key, Mapped>% right);

初始化控件序列与该序列 [right.hash_map::begin (STL/CLR)(),right.hash_map::end (STL/CLR)())，其默认值为排序的特性和使用默认哈希函数。将它指定为的复制序列控件是使用默认的排序的特性和哈希函数的 hash_map 对象 right，的初始控件序列。

构造函数:

hash_map(hash_map<Key, Mapped>^ right);

初始化控件序列与该序列 [right->hash_map::begin (STL/CLR)(),right->hash_map::end (STL/CLR)())，其默认值为排序的特性和使用默认哈希函数。将它指定为的复制序列控件是使用默认的排序的特性和哈希函数的 hash_map 对象 right，的初始控件序列。

构造函数:

template<typename InIter>

hash_map(InIter first, InIter last);

初始化控件序列与该序列 [first,last)，其默认值为排序的特性和使用默认哈希函数。使用它使控件序列复制另一个序列，其默认值为排序的特性和哈希函数。

构造函数:

template<typename InIter>

hash_map(InIter first, InIter last,

key_compare^ pred);

初始化控件序列与该序列 [first,last)，与排序的谓词 pred和使用默认哈希函数。使用它使控件序列复制另一个序列，与指定的排序的特性和默认哈希函数。

构造函数:

template<typename InIter>

hash_map(InIter first, InIter last,

key_compare^ pred, hasher^ hashfn);

初始化控件序列与该序列 [first,last)，与排序的谓词 pred和使用哈希函数 hashfn。使用它使控件序列复制另一个序列，与指定的排序的特性和哈希函数。

构造函数:

hash_map(System::Collections::Generic::IEnumerable<Key>^ right);

初始化控件序列与枚举数指定的顺序 right，其默认值为排序的特性和使用默认哈希函数。使用它使控件序列枚举数描述的副本另一个序列，具有默认排序的特性和哈希函数的。

构造函数:

hash_map(System::Collections::Generic::IEnumerable<Key>^ right,

key_compare^ pred);

初始化控件序列与枚举数指定的顺序 right，与排序的谓词 pred和使用默认哈希函数。使用它使控件序列枚举数描述的副本另一个序列，具有指定的排序的特性和默认哈希函数的。

构造函数:

hash_map(System::Collections::Generic::IEnumerable<Key>^ right,

key_compare^ pred, hasher^ hashfn);

初始化控件序列与枚举数指定的顺序 right，与排序的谓词 pred和使用哈希函数 hashfn。使用它使控件序列枚举数描述的副本另一个序列，具有指定的排序的特性和哈希函数的。

示例

// cliext_hash_map_construct.cpp 
// compile with: /clr 
#include <cliext/hash_map> 
 
int myfun(wchar_t key) 
    { // hash a key 
    return (key ^ 0xdeadbeef); 
    } 
 
typedef cliext::hash_map<wchar_t, int> Myhash_map; 
int main() 
    { 
// construct an empty container 
    Myhash_map c1; 
    System::Console::WriteLine("size() = {0}", c1.size()); 
 
    c1.insert(Myhash_map::make_value(L'a', 1)); 
    c1.insert(Myhash_map::make_value(L'b', 2)); 
    c1.insert(Myhash_map::make_value(L'c', 3)); 
    for each (Myhash_map::value_type elem in c1) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
 
// construct with an ordering rule 
    Myhash_map c2 = cliext::greater_equal<wchar_t>(); 
    System::Console::WriteLine("size() = {0}", c2.size()); 
 
    c2.insert(c1.begin(), c1.end()); 
    for each (Myhash_map::value_type elem in c2) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
 
// construct with an ordering rule and hash function 
    Myhash_map c2h(cliext::greater_equal<wchar_t>(), 
        gcnew Myhash_map::hasher(&myfun)); 
    System::Console::WriteLine("size() = {0}", c2h.size()); 
 
    c2h.insert(c1.begin(), c1.end()); 
    for each (Myhash_map::value_type elem in c2h) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
    System::Console::WriteLine(); 
 
// construct with an iterator range 
    Myhash_map c3(c1.begin(), c1.end()); 
    for each (Myhash_map::value_type elem in c3) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
 
// construct with an iterator range and an ordering rule 
    Myhash_map c4(c1.begin(), c1.end(), 
        cliext::greater_equal<wchar_t>()); 
    for each (Myhash_map::value_type elem in c4) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
 
// construct with an iterator range and an ordering rule and hash function 
    Myhash_map c4h(c1.begin(), c1.end(), 
        cliext::greater_equal<wchar_t>(), 
        gcnew Myhash_map::hasher(&myfun)); 
    for each (Myhash_map::value_type elem in c4h) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
    System::Console::WriteLine(); 
 
// construct with an enumeration 
    Myhash_map c5(   // NOTE: cast is not needed 
        (System::Collections::Generic::IEnumerable< 
            Myhash_map::value_type>^)%c3); 
    for each (Myhash_map::value_type elem in c5) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
 
// construct with an enumeration and an ordering rule 
    Myhash_map c6(   // NOTE: cast is not needed 
        (System::Collections::Generic::IEnumerable< 
            Myhash_map::value_type>^)%c3, 
                cliext::greater_equal<wchar_t>()); 
    for each (Myhash_map::value_type elem in c6) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
 
// construct with an enumeration and an ordering rule and hash function 
    Myhash_map c6h(   // NOTE: cast is not needed 
        (System::Collections::Generic::IEnumerable< 
            Myhash_map::value_type>^)%c3, 
                cliext::greater_equal<wchar_t>(), 
                gcnew Myhash_map::hasher(&myfun)); 
    for each (Myhash_map::value_type elem in c6h) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
    System::Console::WriteLine(); 
 
// construct by copying another container 
    Myhash_map c7(c4); 
    for each (Myhash_map::value_type elem in c7) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
 
// construct by copying a container handle 
    Myhash_map c8(%c3); 
    for each (Myhash_map::value_type elem in c8) 
        System::Console::Write(" [{0} {1}]", elem->first, elem->second); 
    System::Console::WriteLine(); 
    return (0); 
    } 
 

要求

标题: <cliext/hash_map>

命名空间: cliext

请参见

参考

hash_map (STL/CLR)

hash_map::generic_container (STL/CLR)

hash_map::operator= (STL/CLR)