EReg.hx 4.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183
  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 lua.Table;
  23. import lua.Lib;
  24. import lua.lib.lrexlib.Rex;
  25. // Note - lrexlib gives ascii-based offsets. Use native string tools.
  26. import lua.NativeStringTools;
  27. @:coreApi
  28. class EReg {
  29. var r:Rex; // the Rex extern instance.
  30. var global:Bool; // whether the regex is in global mode.
  31. var s:String; // the last matched string
  32. var m:Table<Int, Int>; // the [start:Int, end:Int, and submatches:String (matched groups)] as a single table.
  33. static var FLAGS:Table<String, Int> = Rex.flags();
  34. public function new(r:String, opt:String):Void {
  35. var ropt = 0;
  36. for (i in 0...opt.length) {
  37. switch (opt.charAt(i)) {
  38. case "i":
  39. ropt |= FLAGS.CASELESS;
  40. case "m":
  41. ropt |= FLAGS.MULTILINE;
  42. case "s":
  43. ropt |= FLAGS.DOTALL;
  44. case "g":
  45. global = true;
  46. default:
  47. null;
  48. }
  49. }
  50. ropt |= FLAGS.UTF8; // always check validity of utf8 string
  51. ropt |= FLAGS.UCP; // always enable utf8 character properties
  52. if (global == null)
  53. global = false;
  54. this.r = Rex.create(r, ropt);
  55. }
  56. public function match(s:String):Bool {
  57. if (s == null)
  58. return false;
  59. this.m = lua.TableTools.pack(r.exec(s));
  60. this.s = s;
  61. return m[1] != null;
  62. }
  63. public function matched(n:Int):String {
  64. if (m[1] == null || n < 0)
  65. throw "EReg::matched";
  66. else if (n == 0) {
  67. var k = NativeStringTools.sub(s, m[1], m[2]).match;
  68. return k;
  69. } else if (Std.is(m[3], lua.Table)) {
  70. var mn = 2 * (n - 1);
  71. if (Std.is(untyped m[3][mn + 1], Bool))
  72. return null;
  73. return NativeStringTools.sub(s, untyped m[3][mn + 1], untyped m[3][mn + 2]).match;
  74. } else {
  75. throw "EReg:matched";
  76. }
  77. }
  78. public function matchedLeft():String {
  79. if (m[1] == null)
  80. throw "No string matched";
  81. return NativeStringTools.sub(s, 1, m[1] - 1).match;
  82. }
  83. public function matchedRight():String {
  84. if (m[1] == null)
  85. throw "No string matched";
  86. return NativeStringTools.sub(s, m[2] + 1).match;
  87. }
  88. public function matchedPos():{pos:Int, len:Int} {
  89. var left = matchedLeft();
  90. var matched = matched(0);
  91. if (m[1] == null)
  92. throw "No string matched";
  93. return {
  94. pos: left.length,
  95. len: matched.length
  96. }
  97. }
  98. public function matchSub(s:String, pos:Int, len:Int = -1):Bool {
  99. var ss = s.substr(0, len < 0 ? s.length : pos + len);
  100. if (global) {
  101. m = lua.TableTools.pack(r.exec(ss, pos + 1));
  102. var b = m[1] != null;
  103. if (b) {
  104. this.s = s;
  105. }
  106. return b;
  107. } else {
  108. m = lua.TableTools.pack(r.exec(ss, pos + 1));
  109. var b = m[1] != null;
  110. if (b) {
  111. this.s = s;
  112. }
  113. return b;
  114. }
  115. }
  116. public function split(s:String):Array<String> {
  117. if (global) {
  118. return Lib.fillArray(Rex.split(s, r));
  119. } else {
  120. // we can't use directly Rex.split because it's ignoring the 'g' flag
  121. var d = "#__delim__#";
  122. return Lib.fillArray(Rex.split(replace(s, d), d));
  123. }
  124. }
  125. public function replace(s:String, by:String):String {
  126. var chunks = by.split("$$");
  127. chunks = [for (chunk in chunks) Rex.gsub(chunk, "\\$(\\d)", "%%%1", 1)];
  128. by = chunks.join("$");
  129. return Rex.gsub(s, r, by, global ? null : 1);
  130. }
  131. public function map(s:String, f:EReg->String):String {
  132. var offset = 0;
  133. var buf = new StringBuf();
  134. do {
  135. if (offset >= s.length) {
  136. break;
  137. } else if (!matchSub(s, offset)) {
  138. buf.add(s.substr(offset));
  139. break;
  140. }
  141. var p = matchedPos();
  142. buf.add(s.substr(offset, p.pos - offset));
  143. buf.add(f(this));
  144. if (p.len == 0) {
  145. buf.add(s.substr(p.pos, 1));
  146. offset = p.pos + 1;
  147. } else
  148. offset = p.pos + p.len;
  149. } while (global);
  150. if (!global && offset > 0 && offset < s.length)
  151. buf.add(s.substr(offset));
  152. return buf.toString();
  153. }
  154. public static function escape(s:String):String {
  155. return escapeRegExpRe.map(s, function(r) return "\\" + r.matched(0));
  156. }
  157. static var escapeRegExpRe = ~/[\[\]{}()*+?.\\\^$|]/g;
  158. static function __init__():Void {
  159. if (Rex == null) {
  160. throw "Rex is missing. Please install lrexlib-pcre.";
  161. }
  162. }
  163. }