zoukankan      html  css  js  c++  java
  • C++ std::unordered_multimap

    std::unordered_multimap

    template < class Key,                                    // unordered_multimap::key_type
               class T,                                      // unordered_multimap::mapped_type
               class Hash = hash<Key>,                       // unordered_multimap::hasher
               class Pred = equal_to<Key>,                   // unordered_multimap::key_equal
               class Alloc = allocator< pair<const Key,T> >  // unordered_multimap::allocator_type
               > class unordered_multimap;
    

    Unordered Multimap

    Unordered multimaps are associative containers that store elements formed by the combination of a key value and a mapped value, much like unordered_map containers, but allowing different elements to have equivalent keys.

    In an unordered_multimap, the key value is generally used to uniquely identify the element, while the mapped value is an object with the content associated to this key. Types of key and mapped value may differ.

    Internally, the elements in the unordered_multimap are not sorted in any particular order with respect to either their key or mapped values, but organized into buckets depending on their hash values to allow for fast access to individual elements directly by their key values (with a constant average time complexity on average).

    Elements with equivalent keys are grouped together in the same bucket and in such a way that an iterator (see equal_range) can iterate through all of them.

    Iterators in the container are at least forward iterators.

    Notice that this container is not defined in its own header, but shares header <unordered_map> with unordered_map.

    Reference

    cplusplus


  • 相关阅读:
    Linux安装RocketMQ
    初识SpringMVC
    事物的锁机制和七种传播行为
    Spring事物
    JdbcTemplate模板
    注解
    AOP代理工厂方式实现增强
    面试题
    Spring框架静态代理和动态代理
    Bootstrap框架(基础篇)之按钮,网格,导航栏,下拉菜单
  • 原文地址:https://www.cnblogs.com/zi-xing/p/6367692.html
Copyright © 2011-2022 走看看