First, very primitive, search results on one engine
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@107294 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
83
test/re/re.alg/re.alg.search/basic.pass.cpp
Normal file
83
test/re/re.alg/re.alg.search/basic.pass.cpp
Normal file
@@ -0,0 +1,83 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// The LLVM Compiler Infrastructure
|
||||
//
|
||||
// This file is distributed under the University of Illinois Open Source
|
||||
// License. See LICENSE.TXT for details.
|
||||
//
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
// <regex>
|
||||
|
||||
// template <class BidirectionalIterator, class Allocator, class charT, class traits>
|
||||
// bool
|
||||
// regex_search(BidirectionalIterator first, BidirectionalIterator last,
|
||||
// match_results<BidirectionalIterator, Allocator>& m,
|
||||
// const basic_regex<charT, traits>& e,
|
||||
// regex_constants::match_flag_type flags = regex_constants::match_default);
|
||||
|
||||
#include <regex>
|
||||
#include <cassert>
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
std::cmatch m;
|
||||
assert(!std::regex_search("a", m, std::regex()));
|
||||
assert(m.size() == 0);
|
||||
assert(m.empty());
|
||||
}
|
||||
{
|
||||
std::cmatch m;
|
||||
const char s[] = "a";
|
||||
assert(std::regex_search(s, m, std::regex("a", std::regex_constants::basic)));
|
||||
assert(m.size() == 1);
|
||||
assert(!m.empty());
|
||||
assert(!m.prefix().matched);
|
||||
assert(m.prefix().first == s);
|
||||
assert(m.prefix().second == m[0].first);
|
||||
assert(!m.suffix().matched);
|
||||
assert(m.suffix().first == m[0].second);
|
||||
assert(m.suffix().second == s+1);
|
||||
assert(m.length(0) == 1);
|
||||
assert(m.position(0) == 0);
|
||||
assert(m.str(0) == "a");
|
||||
}
|
||||
{
|
||||
std::cmatch m;
|
||||
const char s[] = "ab";
|
||||
assert(std::regex_search(s, m, std::regex("ab", std::regex_constants::basic)));
|
||||
assert(m.size() == 1);
|
||||
assert(!m.prefix().matched);
|
||||
assert(m.prefix().first == s);
|
||||
assert(m.prefix().second == m[0].first);
|
||||
assert(!m.suffix().matched);
|
||||
assert(m.suffix().first == m[0].second);
|
||||
assert(m.suffix().second == s+2);
|
||||
assert(m.length(0) == 2);
|
||||
assert(m.position(0) == 0);
|
||||
assert(m.str(0) == "ab");
|
||||
}
|
||||
{
|
||||
std::cmatch m;
|
||||
const char s[] = "ab";
|
||||
assert(!std::regex_search(s, m, std::regex("ba", std::regex_constants::basic)));
|
||||
assert(m.size() == 0);
|
||||
assert(m.empty());
|
||||
}
|
||||
{
|
||||
std::cmatch m;
|
||||
const char s[] = "aab";
|
||||
assert(std::regex_search(s, m, std::regex("ab", std::regex_constants::basic)));
|
||||
assert(m.size() == 1);
|
||||
assert(m.prefix().matched);
|
||||
assert(m.prefix().first == s);
|
||||
assert(m.prefix().second == m[0].first);
|
||||
assert(!m.suffix().matched);
|
||||
assert(m.suffix().first == m[0].second);
|
||||
assert(m.suffix().second == s+3);
|
||||
assert(m.length(0) == 2);
|
||||
assert(m.position(0) == 1);
|
||||
assert(m.str(0) == "ab");
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user