const char* strstr( const char* haystack, const char* needle );
 char* strstr( char* haystack, const char* needle );
Finds the first occurrence of the byte string needle in the byte string pointed to by haystack. The terminating null characters are not compared.
[edit] Parameters haystack - pointer to the null-terminated byte string to examine needle - pointer to the null-terminated byte string to search for [edit] Return valuePointer to the first character of the found substring in haystack, or a null pointer if no such character is found. If needle points to an empty string, haystack is returned.
[edit] Example#include <cstring> #include <iomanip> #include <iostream> int main() { const char* str = "Try not. Do, or do not. There is no try."; const char* target = "not"; for (const char* result = str; (result = std::strstr(result, target)); ++result) std::cout << "Found " << std::quoted(target) << " starting at (" << result - str << "): " << std::quoted(result) << '\n'; }
Output:
Found "not" starting at (4): "not. Do, or do not. There is no try." Found "not" starting at (19): "not. There is no try."[edit] See also finds the first occurrence of the given substring
std::basic_string<CharT,Traits,Allocator>
) [edit] finds the first occurrence of a wide string within another wide string
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4