forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
46 lines
1.4 KiB
C++
46 lines
1.4 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <regex>
|
|
|
|
// class regex_iterator<BidirectionalIterator, charT, traits>
|
|
|
|
// regex_iterator(BidirectionalIterator a, BidirectionalIterator b,
|
|
// const regex_type& re,
|
|
// regex_constants::match_flag_type m = regex_constants::match_default);
|
|
|
|
#include <regex>
|
|
#include <cassert>
|
|
#include "test_macros.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
std::regex phone_numbers("\\d{3}-\\d{4}");
|
|
const char phone_book[] = "555-1234, 555-2345, 555-3456";
|
|
std::cregex_iterator i(std::begin(phone_book), std::end(phone_book), phone_numbers);
|
|
assert(i != std::cregex_iterator());
|
|
assert(i->size() == 1);
|
|
assert(i->position() == 0);
|
|
assert(i->str() == "555-1234");
|
|
++i;
|
|
assert(i != std::cregex_iterator());
|
|
assert(i->size() == 1);
|
|
assert(i->position() == 10);
|
|
assert(i->str() == "555-2345");
|
|
++i;
|
|
assert(i != std::cregex_iterator());
|
|
assert(i->size() == 1);
|
|
assert(i->position() == 20);
|
|
assert(i->str() == "555-3456");
|
|
++i;
|
|
assert(i == std::cregex_iterator());
|
|
}
|
|
}
|