54 lines
1.4 KiB
C++
54 lines
1.4 KiB
C++
|
//===----------------------------------------------------------------------===//
|
||
|
|
//
|
||
|
|
// 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 sub_match;
|
||
|
|
|
||
|
|
// int compare(const sub_match& s) const;
|
||
|
|
|
||
|
|
#include <regex>
|
||
|
|
#include <cassert>
|
||
|
|
|
||
|
|
int main()
|
||
|
|
{
|
||
|
|
{
|
||
|
|
typedef char CharT;
|
||
|
|
typedef std::sub_match<const CharT*> SM;
|
||
|
|
SM sm = SM();
|
||
|
|
SM sm2 = SM();
|
||
|
|
assert(sm.compare(sm2) == 0);
|
||
|
|
const CharT s[] = {'1', '2', '3', 0};
|
||
|
|
sm.first = s;
|
||
|
|
sm.second = s + 3;
|
||
|
|
sm.matched = true;
|
||
|
|
assert(sm.compare(sm2) > 0);
|
||
|
|
sm2.first = s;
|
||
|
|
sm2.second = s + 3;
|
||
|
|
sm2.matched = true;
|
||
|
|
assert(sm.compare(sm2) == 0);
|
||
|
|
}
|
||
|
|
{
|
||
|
|
typedef wchar_t CharT;
|
||
|
|
typedef std::sub_match<const CharT*> SM;
|
||
|
|
SM sm = SM();
|
||
|
|
SM sm2 = SM();
|
||
|
|
assert(sm.compare(sm2) == 0);
|
||
|
|
const CharT s[] = {'1', '2', '3', 0};
|
||
|
|
sm.first = s;
|
||
|
|
sm.second = s + 3;
|
||
|
|
sm.matched = true;
|
||
|
|
assert(sm.compare(sm2) > 0);
|
||
|
|
sm2.first = s;
|
||
|
|
sm2.second = s + 3;
|
||
|
|
sm2.matched = true;
|
||
|
|
assert(sm.compare(sm2) == 0);
|
||
|
|
}
|
||
|
|
}
|