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 19 int main() 20 { 21 { 22 typedef char CharT; 23 typedef std::sub_match<const CharT*> SM; 24 SM sm = SM(); 25 SM sm2 = 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 SM sm2 = SM(); 39 assert(sm.compare(L"") == 0); 40 const CharT s[] = {'1', '2', '3', 0}; 41 sm.first = s; 42 sm.second = s + 3; 43 sm.matched = true; 44 assert(sm.compare(L"") > 0); 45 assert(sm.compare(L"123") == 0); 46 } 47 } 48
