Move test into test/std subdirectory.
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@224658 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
43
test/std/re/re.submatch/re.submatch.members/length.pass.cpp
Normal file
43
test/std/re/re.submatch/re.submatch.members/length.pass.cpp
Normal file
@@ -0,0 +1,43 @@
|
||||
//===----------------------------------------------------------------------===//
|
||||
//
|
||||
// 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>
|
||||
|
||||
// template <class BidirectionalIterator> class sub_match;
|
||||
|
||||
// difference_type length() const;
|
||||
|
||||
#include <regex>
|
||||
#include <cassert>
|
||||
|
||||
int main()
|
||||
{
|
||||
{
|
||||
typedef char CharT;
|
||||
typedef std::sub_match<const CharT*> SM;
|
||||
SM sm = SM();
|
||||
assert(sm.length() == 0);
|
||||
const CharT s[] = {'1', '2', '3', 0};
|
||||
sm.first = s;
|
||||
sm.second = s + 3;
|
||||
sm.matched = true;
|
||||
assert(sm.length() == 3);
|
||||
}
|
||||
{
|
||||
typedef wchar_t CharT;
|
||||
typedef std::sub_match<const CharT*> SM;
|
||||
SM sm = SM();
|
||||
assert(sm.length() == 0);
|
||||
const CharT s[] = {'1', '2', '3', 0};
|
||||
sm.first = s;
|
||||
sm.second = s + 3;
|
||||
sm.matched = true;
|
||||
assert(sm.length() == 3);
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user