EReg.hx 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162
  1. /*
  2. * Copyright (c) 2005, The haXe Project Contributors
  3. * All rights reserved.
  4. * Redistribution and use in source and binary forms, with or without
  5. * modification, are permitted provided that the following conditions are met:
  6. *
  7. * - Redistributions of source code must retain the above copyright
  8. * notice, this list of conditions and the following disclaimer.
  9. * - Redistributions in binary form must reproduce the above copyright
  10. * notice, this list of conditions and the following disclaimer in the
  11. * documentation and/or other materials provided with the distribution.
  12. *
  13. * THIS SOFTWARE IS PROVIDED BY THE HAXE PROJECT CONTRIBUTORS "AS IS" AND ANY
  14. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  15. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  16. * DISCLAIMED. IN NO EVENT SHALL THE HAXE PROJECT CONTRIBUTORS BE LIABLE FOR
  17. * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  18. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  19. * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  20. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  21. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  22. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
  23. * DAMAGE.
  24. */
  25. @:core_api class EReg {
  26. var r : Dynamic;
  27. var last : String;
  28. var global : Bool;
  29. public function new( r : String, opt : String ) : Void {
  30. var a = opt.split("g");
  31. global = a.length > 1;
  32. if( global )
  33. opt = a.join("");
  34. this.r = regexp_new_options(r, opt);
  35. }
  36. public function match( s : String ) : Bool {
  37. var p = regexp_match(r,s,0,s.length);
  38. if( p )
  39. last = s;
  40. else
  41. last = null;
  42. return p;
  43. }
  44. public function matched( n : Int ) : String {
  45. var m = regexp_matched(r,n);
  46. return m;
  47. }
  48. public function matchedLeft() : String {
  49. var p = regexp_matched_pos(r,0);
  50. return last.substr(0,p.pos);
  51. }
  52. public function matchedRight() : String {
  53. var p = regexp_matched_pos(r,0);
  54. var sz = p.pos+p.len;
  55. return last.substr(sz,last.length-sz);
  56. }
  57. public function matchedPos() : { pos : Int, len : Int } {
  58. return regexp_matched_pos(r,0);
  59. }
  60. public function split( s : String ) : Array<String> {
  61. var pos = 0;
  62. var len = s.length;
  63. var a = new Array();
  64. var first = true;
  65. do {
  66. if( !regexp_match(r,s,pos,len) )
  67. break;
  68. var p = regexp_matched_pos(r,0);
  69. if( p.len == 0 && !first ) {
  70. if( p.pos == s.length )
  71. break;
  72. p.pos += 1;
  73. }
  74. a.push(s.substr(pos,p.pos - pos));
  75. var tot = p.pos + p.len - pos;
  76. pos += tot;
  77. len -= tot;
  78. first = false;
  79. } while( global );
  80. a.push(s.substr(pos,len));
  81. return a;
  82. }
  83. public function replace( s : String, by : String ) : String {
  84. var b = new StringBuf();
  85. var pos = 0;
  86. var len = s.length;
  87. var a = by.split("$");
  88. var first = true;
  89. do {
  90. if( !regexp_match(r,s,pos,len) )
  91. break;
  92. var p = regexp_matched_pos(r,0);
  93. if( p.len == 0 && !first ) {
  94. if( p.pos == s.length )
  95. break;
  96. p.pos += 1;
  97. }
  98. b.addSub(s,pos,p.pos-pos);
  99. if( a.length > 0 )
  100. b.add(a[0]);
  101. var i = 1;
  102. while( i < a.length ) {
  103. var k = a[i];
  104. var c = k.charCodeAt(0);
  105. // 1...9
  106. if( c >= 49 && c <= 57 ) {
  107. var p = try regexp_matched_pos(r,Std.int(c)-48) catch( e : String ) null;
  108. if( p == null ){
  109. b.add("$");
  110. b.add(k);
  111. }else{
  112. b.addSub(s,p.pos,p.len);
  113. b.addSub(k,1,k.length - 1);
  114. }
  115. } else if( c == null ) {
  116. b.add("$");
  117. i++;
  118. var k2 = a[i];
  119. if( k2 != null && k2.length > 0 )
  120. b.add(k2);
  121. } else
  122. b.add("$"+k);
  123. i++;
  124. }
  125. var tot = p.pos + p.len - pos;
  126. pos += tot;
  127. len -= tot;
  128. first = false;
  129. } while( global );
  130. b.addSub(s,pos,len);
  131. return b.toString();
  132. }
  133. public function customReplace( s : String, f : EReg -> String ) : String {
  134. var buf = new StringBuf();
  135. while( true ) {
  136. if( !match(s) )
  137. break;
  138. buf.add(matchedLeft());
  139. buf.add(f(this));
  140. s = matchedRight();
  141. }
  142. buf.add(s);
  143. return buf.toString();
  144. }
  145. static var regexp_new_options : String -> String -> Dynamic = cpp.Lib.load("regexp","regexp_new_options",2);
  146. static var regexp_match : Dynamic -> String -> Int -> Int -> Dynamic = cpp.Lib.load("regexp","regexp_match",4);
  147. static var regexp_matched : Dynamic -> Int -> Dynamic = cpp.Lib.load("regexp","regexp_matched",2);
  148. static var regexp_matched_pos : Dynamic -> Int -> { pos : Int, len : Int } = cpp.Lib.load("regexp","regexp_matched_pos",2);
  149. }