std::memchr in C++

C++ offers various standard template libraries to be used. One of them is memchr() function which will search for the first occurrence of a character in a specified number of characters.
Template

const void* memchr( const void* ptr, int ch, std::size_t count );
Parameters : 
ptr : Pointer to the object to be searched for.
ch : Character to search for.
count : Number of character to be searched for.

Return value:
If the character is found, the memchr() function returns a pointer to 
the location of the character, otherwise returns null pointer.
// CPP program to illustrate memchr()
#include <cstring>
#include <iostream>
  
using namespace std;
  
int main()
{
    char sr[] = "This is a sample";
    char ch = 's';
    int count = 13;
  
    if (memchr(sr, ch, count))
        cout << ch << " is present in first "
             << count << " characters of \"" << sr << "\"";
    else
        cout << ch << " is not present in first "
             << count << " characters of \"" << sr << "\"";
  
    return 0;
}

Output:

s is present in first 13 characters of "This is a sample"

Example:

// CPP program to illustrate memchr()
#include <iostream>
#include <cstring>
  
int main()
{
    char arr[] = { 'b', 'a', 'd', 'e', 'f', 'A', 'g' };
    char* pc = (char*)std::memchr(arr, 'g', sizeof arr);
    if (pc != NULL)
        std::cout << "search character found\n";
    else
        std::cout << "search character not found\n";
}

Output:

search character found

This article is contributed by Pranav. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



My Personal Notes arrow_drop_up


Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.