public member function
<set>

std::multiset::find

iterator find (const value_type& val) const;
const_iterator find (const value_type& val) const;iterator       find (const value_type& val);
Get iterator to element
Searches the container for an element equivalent to val and returns an iterator to it if found, otherwise it returns an iterator to multiset::end.

Notice that this function returns an iterator to a single element (of the possibly multiple equivalent elements). To obtain the entire range of equivalent elements, see multiset::equal_range.

Two elements of a multiset are considered equivalent if the container's comparison object returnsfalsereflexively (i.e., no matter the order in which the elements are passed as arguments).

参数

val
Value to be searched for.
成员类型value_typeis the type of the elements in the container, defined in multiset as an alias of its first template parameter (T).

返回值

An iterator to the element, if val is found, or multiset::end otherwise.

成员类型iteratorconst_iteratorare bidirectional iterator types pointing to elements.

示例

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
// multiset::find
#include <iostream>
#include <set>

int main ()
{
  std::multiset<int> mymultiset;
  std::multiset<int>::iterator it;

  // set some initial values:
  for (int i=1; i<=5; i++) mymultiset.insert(i*10);   // 10 20 30 40 50

  it=mymultiset.find(20);
  mymultiset.erase (it);
  mymultiset.erase (mymultiset.find(40));

  std::cout << "mymultiset contains:";
  for (it=mymultiset.begin(); it!=mymultiset.end(); ++it)
    std::cout << ' ' << *it;
  std::cout << '\n';

  return 0;
}

输出
mymultiset contains: 10 30 50


复杂度

Logarithmic in size.

迭代器有效性

没有变化。

数据竞争

访问容器(const 和非 const 版本都不会修改容器)。
同时访问 multiset 的元素是安全的。

异常安全

强保证:如果抛出异常,容器没有发生变化。

另见