|
|
|
size_type find(const basic_string& str, size_type pos=0)const; | (1) | (noexcept since C++11) (constexpr since C++20) |
size_type find(const CharT* s, size_type pos, size_type count)const; | (2) | (constexpr since C++20) |
size_type find(const CharT* s, size_type pos=0)const; | (3) | (constexpr since C++20) |
size_type find( CharT ch, size_type pos=0)const; | (4) | (noexcept since C++11) (constexpr since C++20) |
template<class StringViewLike> size_type find(const StringViewLike& t, | (5) | (since C++17) (constexpr since C++20) |
Finds the first substring equal to the given character sequence. Search begins atpos, i.e. the found substring must not begin in a position precedingpos.
[
s,
s+ count)
. This range may contain null characters.[
s,
s+ count)
is not avalid range, the behavior is undefined.[
s,
s+ Traits::length(s))
is not avalid range, the behavior is undefined.Formally, a substringstr is said to befound at positionxpos if all of the following aretrue:
In particular, this implies that
Contents |
str | - | string to search for |
pos | - | position at which to start the search |
count | - | length of substring to search for |
s | - | pointer to a character string to search for |
ch | - | character to search for |
t | - | object (convertible tostd::basic_string_view) to search for |
Position of the first character of the found substring ornpos if no such substring is found.
If an exception is thrown for any reason, this function has no effect (strong exception safety guarantee).
#include <iomanip>#include <iostream>#include <string> void print(int id, std::string::size_type n,std::stringconst& s){std::cout<< id<<") ";if(std::string::npos== n)std::cout<<"not found! n == npos\n";elsestd::cout<<"found @ n = "<< n<<", substr("<< n<<") = "<<std::quoted(s.substr(n))<<'\n';} int main(){ std::string::size_type n;std::stringconst s="This is a string";/* ^ ^ ^ 1 2 3 */ // search from beginning of string n= s.find("is"); print(1, n, s); // search from position 5 n= s.find("is",5); print(2, n, s); // find a single character n= s.find('a'); print(3, n, s); // find a single character n= s.find('q'); print(4, n, s);}
Output:
1) found @ n = 2, substr(2) = "is is a string"2) found @ n = 5, substr(5) = "is a string"3) found @ n = 8, substr(8) = "a string"4) not found! n == npos
The following behavior-changing defect reports were applied retroactively to previously published C++ standards.
DR | Applied to | Behavior as published | Correct behavior |
---|---|---|---|
LWG 847 | C++98 | there was no exception safety guarantee | added strong exception safety guarantee |
LWG 2064 | C++11 | overloads(3,4) were noexcept | removed |
LWG 2946 | C++17 | overload(5) caused ambiguity in some cases | avoided by making it a template |
P1148R0 | C++11 C++17 | noexcept for overloads(4,5) were accidently dropped by LWG2064/LWG2946 | restored |
finds the first occurrence of a substring of characters (function)[edit] | |
finds the first occurrence of a wide string within another wide string (function)[edit] | |
finds the first occurrence of a character (function)[edit] | |
finds the first occurrence of a wide character in a wide string (function)[edit] | |
find the last occurrence of a substring (public member function)[edit] | |
find first occurrence of characters (public member function)[edit] | |
find first absence of characters (public member function)[edit] | |
find last occurrence of characters (public member function)[edit] | |
find last absence of characters (public member function)[edit] | |
find characters in the view (public member function of std::basic_string_view<CharT,Traits> )[edit] | |
searches for the first occurrence of a range of elements (function template)[edit] |