标准库中有子序列算法吗？

Question

I'm looking for a Standard Library function that returns true if the range [first2, last2) is present within the range [first1, last1) . Something with a name like std::is_subsequence . It seems that something like this would be obvious to be in the Standard but for some reason it's not there (or I just can't find it at the least). Is there a function or method out there that does this?

Answer 1

std::search in <algorithm>

std::search at cplusplus.com
std:: search at cppreference.com

Search range for subsequence
Searches the range [first1,last1) for the first occurrence of the sequence defined by [first2,last2), and returns an iterator to its first element, or last1 if no occurrences are found.

Answer 2

It depends on whether your sequenses are ordered and how you are going to determine that one sequence is present inside another sequence. For example for ordered sequences there is algorithm std::include . For unordered sequences you can check that one sequence is an interval of an other sequence. These are algorithms std::search and std::find_end .

Answer 3

I think there are some differences here. Substring and subsequence are different. The former requires continuity and the latter does not. std::search() can only check substrings, not subsequences