EReg.hx 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188
  1. /*
  2. * Copyright (C)2005-2019 Haxe Foundation
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a
  5. * copy of this software and associated documentation files (the "Software"),
  6. * to deal in the Software without restriction, including without limitation
  7. * the rights to use, copy, modify, merge, publish, distribute, sublicense,
  8. * and/or sell copies of the Software, and to permit persons to whom the
  9. * Software is furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
  20. * DEALINGS IN THE SOFTWARE.
  21. */
  22. import java.util.regex.*;
  23. @:coreApi class EReg {
  24. private var pattern:String;
  25. private var matcher:Matcher;
  26. private var cur:String;
  27. private var isGlobal:Bool;
  28. public function new( r : String, opt : String ) {
  29. var flags = 0;
  30. for (i in 0...opt.length)
  31. {
  32. switch(StringTools.fastCodeAt(opt, i))
  33. {
  34. case 'i'.code:
  35. flags |= Pattern.CASE_INSENSITIVE;
  36. case 'm'.code:
  37. flags |= Pattern.MULTILINE;
  38. case 's'.code:
  39. flags |= Pattern.DOTALL;
  40. case 'g'.code:
  41. isGlobal = true;
  42. }
  43. }
  44. flags |= Pattern.UNICODE_CASE;
  45. #if !android // see https://github.com/HaxeFoundation/haxe/issues/7632
  46. flags |= Pattern.UNICODE_CHARACTER_CLASS;
  47. #end
  48. matcher = Pattern.compile(convert(r), flags).matcher("");
  49. pattern = r;
  50. }
  51. private static function convert(r:String):String
  52. {
  53. //some references of the implementation:
  54. //http://stackoverflow.com/questions/809647/java-vs-javascript-regex-problem
  55. //http://stackoverflow.com/questions/4788413/how-to-convert-javascript-regex-to-safe-java-regex
  56. //Some necessary changes:
  57. //
  58. // \0 -> \x00
  59. // \v -> \x0b
  60. // [^] -> [\s\S]
  61. // unescaped ', " -> \', \"
  62. /* FIXME
  63. var pat = new StringBuf();
  64. var len = r.length;
  65. var i = 0;
  66. while (i < len)
  67. {
  68. var c = StringTools.fastCodeAt(r, i++);
  69. switch(c)
  70. {
  71. case '\\'.code: //escape-sequence
  72. }
  73. }
  74. */
  75. return r;
  76. }
  77. public function match( s : String ) : Bool {
  78. cur = s;
  79. matcher = matcher.reset(s);
  80. return matcher.find();
  81. }
  82. public function matched( n : Int ) : String
  83. {
  84. if (n == 0)
  85. return matcher.group();
  86. else
  87. return matcher.group(n);
  88. }
  89. public function matchedLeft() : String
  90. {
  91. return untyped cur.substring(0, matcher.start());
  92. }
  93. public function matchedRight() : String
  94. {
  95. return untyped cur.substring(matcher.end(), cur.length);
  96. }
  97. public function matchedPos() : { pos : Int, len : Int } {
  98. var start = matcher.start();
  99. return { pos : start, len : matcher.end() - start };
  100. }
  101. public function matchSub( s : String, pos : Int, len : Int = -1):Bool {
  102. matcher = matcher.reset(len < 0 ? s : s.substr(0,pos + len));
  103. cur = s;
  104. return matcher.find(pos);
  105. }
  106. public function split( s : String ) : Array<String>
  107. {
  108. if (isGlobal)
  109. {
  110. var ret = [];
  111. while(this.match(s))
  112. {
  113. ret.push(matchedLeft());
  114. s = matchedRight();
  115. }
  116. ret.push(s);
  117. return ret;
  118. } else {
  119. var m = matcher;
  120. m.reset(s);
  121. if (m.find())
  122. {
  123. return untyped [s.substring(0, m.start()), s.substring(m.end(), s.length)];
  124. } else {
  125. return [s];
  126. }
  127. }
  128. }
  129. inline function start(group:Int) : Int
  130. {
  131. return matcher.start(group);
  132. }
  133. inline function len(group:Int) : Int
  134. {
  135. return matcher.end(group) - matcher.start(group);
  136. }
  137. public function replace( s : String, by : String ) : String
  138. {
  139. matcher.reset(s);
  140. by = by.split("$$").join("\\$");
  141. return isGlobal ? matcher.replaceAll(by) : matcher.replaceFirst(by);
  142. }
  143. public function map( s : String, f : EReg -> String ) : String {
  144. var offset = 0;
  145. var buf = new StringBuf();
  146. do {
  147. if (offset >= s.length)
  148. break;
  149. else if (!matchSub(s, offset)) {
  150. buf.add(s.substr(offset));
  151. break;
  152. }
  153. var p = matchedPos();
  154. buf.add(s.substr(offset, p.pos - offset));
  155. buf.add(f(this));
  156. if (p.len == 0) {
  157. buf.add(s.substr(p.pos, 1));
  158. offset = p.pos + 1;
  159. }
  160. else
  161. offset = p.pos + p.len;
  162. } while (isGlobal);
  163. if (!isGlobal && offset > 0 && offset < s.length)
  164. buf.add(s.substr(offset));
  165. return buf.toString();
  166. }
  167. public static inline function escape( s : String ) : String {
  168. return Pattern.quote(s);
  169. }
  170. }