使用迭代器查找字符串中的子字符串

Question

I have a substring defined by two iterators ( start and end ). I need to check if this substring is present in another string.

Is there a standard library algorithm or string member I can use or adapt to do this without creating a whole new string object ( std::string(start, end) ) just for this purpose?

eg

struct Substring
{
    std::string::const_iterator start, end;
};

auto found = std::contains(whole.begin(), whole.end(), substring.start, substring.end); // ???

Answer 1

std::search

bool found = 
    std::search(hay.begin(), hay.end(), needle.begin(), needle.end()) != hay.end();

Answer 2

You can use the std::string::find method:

auto found = (whole.find(&*substring.start, 0, substring.end - substring.start)
              != std::string::npos);

The advantage over std::search is that std::find works on strings and can be implemented using Boyer-Moore. Sadly, that is not how gcc's libstdc++ implements it.