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 // difference_type length() 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 assert(sm.length() == 0); 26 const CharT s[] = {'1', '2', '3', 0}; 27 sm.first = s; 28 sm.second = s + 3; 29 sm.matched = true; 30 assert(sm.length() == 3); 31 } 32 { 33 typedef wchar_t CharT; 34 typedef std::sub_match<const CharT*> SM; 35 SM sm = SM(); 36 assert(sm.length() == 0); 37 const CharT s[] = {'1', '2', '3', 0}; 38 sm.first = s; 39 sm.second = s + 3; 40 sm.matched = true; 41 assert(sm.length() == 3); 42 } 43 } 44
