std::unordered_map::equal_range
来自cppreference.com
< cpp | container | unordered map
该页由英文版wiki使用Google Translate机器翻译而来。
该翻译可能存在错误或用词不当。鼠标停留在文本上可以看到原版本。你可以帮助我们修正错误或改进翻译。参见说明请点击这里. |
std::pair<iterator,iterator> equal_range( const Key& key ); |
||
std::pair<const_iterator,const_iterator> equal_range( const Key& key ) const; |
||
返回含有所有元素的范围内,与在容器中的关键
key
。 The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.原文:
Returns a range containing all elements with key
key
in the container. The range is defined by two iterators, the first pointing to the first element of the wanted range and the second pointing past the last element of the range.目录 |
[编辑] 参数
key | - | 关键值进行比较的元素
原文: key value to compare the elements to |
[编辑] 返回值
std::pair containing a pair of iterators defining the wanted range. If there are no such elements, past-the-end (see end()
) iterators are returned as both elements of the pair.
[编辑] 复杂性
Average case constant, worst case linear in the size of the container.
[编辑] 另请参阅
发现与特定键的元素 (公共成员函数) |