time_static_xpressive.cpp 6.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224
  1. /*
  2. *
  3. * Copyright (c) 2002
  4. * John Maddock
  5. *
  6. * Use, modification and distribution are subject to the
  7. * Boost Software License, Version 1.0. (See accompanying file
  8. * LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
  9. *
  10. */
  11. #include "./regex_comparison.hpp"
  12. #include <map>
  13. #include <cassert>
  14. #include <boost/timer.hpp>
  15. #include <boost/xpressive/xpressive.hpp>
  16. namespace sxpr
  17. {
  18. using namespace boost::xpressive;
  19. // short matches
  20. char const * sz1 = "^([0-9]+)(\\-| |$)(.*)$";
  21. sregex rx1 = bol >> (s1= +range('0','9')) >> (s2= as_xpr('-')|' '|eol) >> (s3= *_) >> eol;
  22. char const * sz2 = "([[:digit:]]{4}[- ]){3}[[:digit:]]{3,4}";
  23. sregex rx2 = bol >> repeat<3>(s1= repeat<4>(set[digit]) >> (set='-',' ')) >> repeat<3,4>(set[digit]);
  24. char const * sz3 = "^([a-zA-Z0-9_\\-\\.]+)@((\\[[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\.)|(([a-zA-Z0-9\\-]+\\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\\]?)$";
  25. sregex rx3
  26. = bol
  27. >> (s1= +set[ range('a','z') | range('A','Z') | range('0','9') | '_' | '-' | '.' ])
  28. >> '@'
  29. >> (s2=
  30. (s3= '[' >> repeat<1,3>(range('0','9')) >> '.' >> repeat<1,3>(range('0','9'))
  31. >> '.' >> repeat<1,3>(range('0','9')) >> '.'
  32. )
  33. |
  34. (s4= +(s5= +set[ range('a','z') | range('A','Z') | range('0','9') | '-' ] >> '.' ) )
  35. )
  36. >> (s6= repeat<2,4>(set[ range('a','z') | range('A','Z')]) | repeat<1,3>(range('0','9')))
  37. >> (s7= !as_xpr(']'))
  38. >> eol
  39. ;
  40. char const * sz4 = "^([a-zA-Z0-9_\\-\\.]+)@((\\[[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\.)|(([a-zA-Z0-9\\-]+\\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\\]?)$";
  41. sregex rx4 = rx3;
  42. char const * sz5 = "^([a-zA-Z0-9_\\-\\.]+)@((\\[[0-9]{1,3}\\.[0-9]{1,3}\\.[0-9]{1,3}\\.)|(([a-zA-Z0-9\\-]+\\.)+))([a-zA-Z]{2,4}|[0-9]{1,3})(\\]?)$";
  43. sregex rx5 = rx3;
  44. char const * sz6 = "^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$";
  45. sregex rx6 = bol >> repeat<1,2>(set[ range('a','z') | range('A','Z') ])
  46. >> range('0','9') >> repeat<0,1>(set[range('0','9')|range('A','Z')|range('a','z')])
  47. >> repeat<0,1>(as_xpr(' ')) >> range('0','9')
  48. >> repeat<2>(set[range('A','Z')|range('a','z')]) >> eol;
  49. char const * sz7 = "^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$";
  50. sregex rx7 = rx6;
  51. char const * sz8 = "^[a-zA-Z]{1,2}[0-9][0-9A-Za-z]{0,1} {0,1}[0-9][A-Za-z]{2}$";
  52. sregex rx8 = rx6;
  53. char const * sz9 = "^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$";
  54. sregex rx9 = bol >> repeat<1,2>(set[digit]) >> '/' >> repeat<1,2>(set[digit]) >> '/' >> repeat<4>(set[digit]) >> eol;
  55. char const * sz10 = "^[[:digit:]]{1,2}/[[:digit:]]{1,2}/[[:digit:]]{4}$";
  56. sregex rx10 = rx9;
  57. char const * sz11 = "^[-+]?[[:digit:]]*\\.?[[:digit:]]*$";
  58. sregex rx11 = bol >> !(set= '-','+') >> *set[digit] >> !as_xpr('.') >> *set[digit] >> eol ;
  59. char const * sz12 = "^[-+]?[[:digit:]]*\\.?[[:digit:]]*$";
  60. sregex rx12 = rx11;
  61. char const * sz13 = "^[-+]?[[:digit:]]*\\.?[[:digit:]]*$";
  62. sregex rx13 = rx11;
  63. // long matches
  64. char const * sz14 = "Twain";
  65. boost::xpressive::sregex rx14 = as_xpr("Twain");
  66. char const * sz15 = "Huck[[:alpha:]]+";
  67. boost::xpressive::sregex rx15 = "Huck" >> +set[alpha];
  68. char const * sz16 = "[[:alpha:]]+ing";
  69. boost::xpressive::sregex rx16 = +set[alpha] >> "ing";
  70. char const * sz17 = "^[^\n]*?Twain";
  71. boost::xpressive::sregex rx17 = bol >> -*~as_xpr('\n') >> "Twain";
  72. char const * sz18 = "Tom|Sawyer|Huckleberry|Finn";
  73. boost::xpressive::sregex rx18 = ( as_xpr("Tom") | "Sawyer" | "Huckleberry" | "Finn" );
  74. //char const * sz18 = "Tom|Sawyer|.uckleberry|Finn";
  75. //boost::xpressive::sregex rx18 = ( as_xpr("Tom") | "Sawyer" | _ >> "uckleberry" | "Finn" );
  76. char const * sz19 = "(Tom|Sawyer|Huckleberry|Finn).{0,30}river|river.{0,30}(Tom|Sawyer|Huckleberry|Finn)";
  77. boost::xpressive::sregex rx19 =
  78. (s1= as_xpr("Tom") | "Sawyer" | "Huckleberry" | "Finn" )
  79. >> repeat<0,30>(_)
  80. >> "river"
  81. |
  82. "river"
  83. >> repeat<0,30>(_)
  84. >> (s2= as_xpr("Tom") | "Sawyer" | "Huckleberry" | "Finn" );
  85. std::map< std::string, sregex > rxmap;
  86. struct map_init
  87. {
  88. map_init()
  89. {
  90. rxmap[ sz1 ] = rx1;
  91. rxmap[ sz2 ] = rx2;
  92. rxmap[ sz3 ] = rx3;
  93. rxmap[ sz4 ] = rx4;
  94. rxmap[ sz5 ] = rx5;
  95. rxmap[ sz6 ] = rx6;
  96. rxmap[ sz7 ] = rx7;
  97. rxmap[ sz8 ] = rx8;
  98. rxmap[ sz9 ] = rx9;
  99. rxmap[ sz10 ] = rx10;
  100. rxmap[ sz11 ] = rx11;
  101. rxmap[ sz12 ] = rx12;
  102. rxmap[ sz13 ] = rx13;
  103. rxmap[ sz14 ] = rx14;
  104. rxmap[ sz15 ] = rx15;
  105. rxmap[ sz16 ] = rx16;
  106. rxmap[ sz17 ] = rx17;
  107. rxmap[ sz18 ] = rx18;
  108. rxmap[ sz19 ] = rx19;
  109. }
  110. };
  111. static map_init const i = map_init();
  112. double time_match(const std::string& re, const std::string& text)
  113. {
  114. boost::xpressive::sregex const &e = rxmap[ re ];
  115. boost::xpressive::smatch what;
  116. boost::timer tim;
  117. int iter = 1;
  118. int counter, repeats;
  119. double result = 0;
  120. double run;
  121. assert(boost::xpressive::regex_match( text, what, e ));
  122. do
  123. {
  124. tim.restart();
  125. for(counter = 0; counter < iter; ++counter)
  126. {
  127. boost::xpressive::regex_match( text, what, e );
  128. }
  129. result = tim.elapsed();
  130. iter *= 2;
  131. } while(result < 0.5);
  132. iter /= 2;
  133. // repeat test and report least value for consistency:
  134. for(repeats = 0; repeats < REPEAT_COUNT; ++repeats)
  135. {
  136. tim.restart();
  137. for(counter = 0; counter < iter; ++counter)
  138. {
  139. boost::xpressive::regex_match( text, what, e );
  140. }
  141. run = tim.elapsed();
  142. result = (std::min)(run, result);
  143. }
  144. return result / iter;
  145. }
  146. struct noop
  147. {
  148. void operator()( boost::xpressive::smatch const & ) const
  149. {
  150. }
  151. };
  152. double time_find_all(const std::string& re, const std::string& text)
  153. {
  154. boost::xpressive::sregex const &e = rxmap[ re ];
  155. boost::xpressive::smatch what;
  156. boost::timer tim;
  157. int iter = 1;
  158. int counter, repeats;
  159. double result = 0;
  160. double run;
  161. do
  162. {
  163. tim.restart();
  164. for(counter = 0; counter < iter; ++counter)
  165. {
  166. boost::xpressive::sregex_iterator begin( text.begin(), text.end(), e ), end;
  167. std::for_each( begin, end, noop() );
  168. }
  169. result = tim.elapsed();
  170. iter *= 2;
  171. }while(result < 0.5);
  172. iter /= 2;
  173. if(result >10)
  174. return result / iter;
  175. // repeat test and report least value for consistency:
  176. for(repeats = 0; repeats < REPEAT_COUNT; ++repeats)
  177. {
  178. tim.restart();
  179. for(counter = 0; counter < iter; ++counter)
  180. {
  181. boost::xpressive::sregex_iterator begin( text.begin(), text.end(), e ), end;
  182. std::for_each( begin, end, noop() );
  183. }
  184. run = tim.elapsed();
  185. result = (std::min)(run, result);
  186. }
  187. return result / iter;
  188. }
  189. }