和 find_end() 算法一样,它也有两个版本,第二个版本接受用来比较元素的谓词作为第 5 个参数。可以用 search() 来验证前面使用 find_end() 搜索的结果。 如何改变每次遍历搜索的具体范围是它们的主要不同之处。下面是一个示例:
string text {"Smith,where Jones had had \"had\",had had \"had had\"."" \"Had had\" had had the examiners\' approval."}; std::cout << text << std::endl; string phrase {"had had"}; size_t count {}; auto iter = std::begin(text); auto end_iter = end(text); while((iter = std::search(iter,end_iter,std::begin(phrase),std::end (phrase),[](char ch1,char ch2) { return std::toupper (ch1) == std:: toupper (ch2); })) != end_iter) { ++count; std::advance(iter,phrase.size()); // Move to beyond end of subsequence found } std::cout << "\n\""<< phrase << "\" was found "<< count << " times." << std::endl;这段代码执行后会输出下面的内容:
Smith,where Jones had had "had",had had "had had". "Had had" had had the examiners' approval.
"had had" was found 5 times.
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 dio@foxmail.com 举报,一经查实,本站将立刻删除。