EReg.hx 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187
  1. /*
  2. * Copyright (C)2005-2018 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. flags |= Pattern.UNICODE_CHARACTER_CLASS;
  46. matcher = Pattern.compile(convert(r), flags).matcher("");
  47. pattern = r;
  48. }
  49. private static function convert(r:String):String
  50. {
  51. //some references of the implementation:
  52. //http://stackoverflow.com/questions/809647/java-vs-javascript-regex-problem
  53. //http://stackoverflow.com/questions/4788413/how-to-convert-javascript-regex-to-safe-java-regex
  54. //Some necessary changes:
  55. //
  56. // \0 -> \x00
  57. // \v -> \x0b
  58. // [^] -> [\s\S]
  59. // unescaped ', " -> \', \"
  60. /* FIXME
  61. var pat = new StringBuf();
  62. var len = r.length;
  63. var i = 0;
  64. while (i < len)
  65. {
  66. var c = StringTools.fastCodeAt(r, i++);
  67. switch(c)
  68. {
  69. case '\\'.code: //escape-sequence
  70. }
  71. }
  72. */
  73. return r;
  74. }
  75. public function match( s : String ) : Bool {
  76. cur = s;
  77. matcher = matcher.reset(s);
  78. return matcher.find();
  79. }
  80. public function matched( n : Int ) : String
  81. {
  82. if (n == 0)
  83. return matcher.group();
  84. else
  85. return matcher.group(n);
  86. }
  87. public function matchedLeft() : String
  88. {
  89. return untyped cur.substring(0, matcher.start());
  90. }
  91. public function matchedRight() : String
  92. {
  93. return untyped cur.substring(matcher.end(), cur.length);
  94. }
  95. public function matchedPos() : { pos : Int, len : Int } {
  96. var start = matcher.start();
  97. return { pos : start, len : matcher.end() - start };
  98. }
  99. public function matchSub( s : String, pos : Int, len : Int = -1):Bool {
  100. matcher = matcher.reset(len < 0 ? s : s.substr(0,pos + len));
  101. cur = s;
  102. return matcher.find(pos);
  103. }
  104. public function split( s : String ) : Array<String>
  105. {
  106. if (isGlobal)
  107. {
  108. var ret = [];
  109. while(this.match(s))
  110. {
  111. ret.push(matchedLeft());
  112. s = matchedRight();
  113. }
  114. ret.push(s);
  115. return ret;
  116. } else {
  117. var m = matcher;
  118. m.reset(s);
  119. if (m.find())
  120. {
  121. return untyped [s.substring(0, m.start()), s.substring(m.end(), s.length)];
  122. } else {
  123. return [s];
  124. }
  125. }
  126. }
  127. inline function start(group:Int) : Int
  128. {
  129. return matcher.start(group);
  130. }
  131. inline function len(group:Int) : Int
  132. {
  133. return matcher.end(group) - matcher.start(group);
  134. }
  135. public function replace( s : String, by : String ) : String
  136. {
  137. matcher.reset(s);
  138. by = by.split("$$").join("\\$");
  139. return isGlobal ? matcher.replaceAll(by) : matcher.replaceFirst(by);
  140. }
  141. public function map( s : String, f : EReg -> String ) : String {
  142. var offset = 0;
  143. var buf = new StringBuf();
  144. do {
  145. if (offset >= s.length)
  146. break;
  147. else if (!matchSub(s, offset)) {
  148. buf.add(s.substr(offset));
  149. break;
  150. }
  151. var p = matchedPos();
  152. buf.add(s.substr(offset, p.pos - offset));
  153. buf.add(f(this));
  154. if (p.len == 0) {
  155. buf.add(s.substr(p.pos, 1));
  156. offset = p.pos + 1;
  157. }
  158. else
  159. offset = p.pos + p.len;
  160. } while (isGlobal);
  161. if (!isGlobal && offset > 0 && offset < s.length)
  162. buf.add(s.substr(offset));
  163. return buf.toString();
  164. }
  165. public static inline function escape( s : String ) : String {
  166. return Pattern.quote(s);
  167. }
  168. }