mirror of https://github.com/llvm-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.
39 lines
1.2 KiB
C++
39 lines
1.2 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_token_iterator(BidirectionalIterator a, BidirectionalIterator b,
|
|
// const regex_type&& re,
|
|
// initializer_list<int> submatches,
|
|
// regex_constants::match_flag_type m =
|
|
// regex_constants::match_default);
|
|
|
|
#include <__config>
|
|
|
|
#if _LIBCPP_STD_VER <= 11
|
|
#error
|
|
#else
|
|
|
|
#include <regex>
|
|
#include <cassert>
|
|
|
|
int main()
|
|
{
|
|
{
|
|
std::regex phone_numbers("\\d{3}-(\\d{4})");
|
|
const char phone_book[] = "start 555-1234, 555-2345, 555-3456 end";
|
|
std::cregex_token_iterator i(std::begin(phone_book), std::end(phone_book)-1,
|
|
std::regex("\\d{3}-\\d{4}"), {-1, 0, 1});
|
|
}
|
|
}
|
|
#endif
|