1//===----------------------------------------------------------------------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is dual licensed under the MIT and the University of Illinois Open 6// Source Licenses. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// 9 10// <regex> 11 12// template <class BidirectionalIterator> class sub_match; 13 14// int compare(const value_type* s) const; 15 16#include <regex> 17#include <cassert> 18#include "test_macros.h" 19 20int main() 21{ 22 { 23 typedef char CharT; 24 typedef std::sub_match<const CharT*> SM; 25 SM sm = SM(); 26 assert(sm.compare("") == 0); 27 const CharT s[] = {'1', '2', '3', 0}; 28 sm.first = s; 29 sm.second = s + 3; 30 sm.matched = true; 31 assert(sm.compare("") > 0); 32 assert(sm.compare("123") == 0); 33 } 34 { 35 typedef wchar_t CharT; 36 typedef std::sub_match<const CharT*> SM; 37 SM sm = SM(); 38 assert(sm.compare(L"") == 0); 39 const CharT s[] = {'1', '2', '3', 0}; 40 sm.first = s; 41 sm.second = s + 3; 42 sm.matched = true; 43 assert(sm.compare(L"") > 0); 44 assert(sm.compare(L"123") == 0); 45 } 46} 47