ArrayObj.hx 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278
  1. /*
  2. * Copyright (C)2005-2016 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. package hl.types;
  23. @:keep
  24. class ArrayObj<T> extends ArrayBase {
  25. var array : hl.types.NativeArray<Dynamic>;
  26. public function new() {
  27. length = 0;
  28. array = new NativeArray<Dynamic>(0);
  29. }
  30. public function concat( a : ArrayObj<T> ) : ArrayObj<T> {
  31. var arr = new hl.types.NativeArray(length + a.length);
  32. arr.blit(0, array, 0, length);
  33. arr.blit(length, a.array, 0, a.length);
  34. return alloc(cast arr);
  35. }
  36. override function join( sep : String ) : String {
  37. var b = new StringBuf();
  38. for( i in 0...length ) {
  39. if( i > 0 ) b.add(sep);
  40. b.add(array[i]);
  41. }
  42. return b.toString();
  43. }
  44. public function pop() : Null<T> {
  45. if( length == 0 )
  46. return null;
  47. length--;
  48. var v = array[length];
  49. array[length] = null;
  50. return v;
  51. }
  52. public function push(x : T) : Int {
  53. var len = length;
  54. if( array.length == len )
  55. __expand(len);
  56. else
  57. length++;
  58. array[len] = x;
  59. return length;
  60. }
  61. override function reverse() : Void {
  62. for( i in 0...length >> 1 ) {
  63. var k = length - 1 - i;
  64. var tmp = array[i];
  65. array[i] = array[k];
  66. array[k] = tmp;
  67. }
  68. }
  69. public function shift() : Null<T> {
  70. if( length == 0 )
  71. return null;
  72. length--;
  73. var v = array[0];
  74. array.blit(0, array, 1, length);
  75. array[length] = null;
  76. return v;
  77. }
  78. override function slice( pos : Int, ?end : Int ) : ArrayObj<T> {
  79. if( pos < 0 ) {
  80. pos = this.length + pos;
  81. if( pos < 0 )
  82. pos = 0;
  83. }
  84. var pend : Int;
  85. if( end == null )
  86. pend = this.length;
  87. else {
  88. pend = end;
  89. if( pend < 0 )
  90. pend += this.length;
  91. if( pend > this.length )
  92. pend = this.length;
  93. }
  94. var len = pend - pos;
  95. if( len < 0 )
  96. return new ArrayObj();
  97. return alloc(array.sub(pos,len));
  98. }
  99. public function sort( f : T -> T -> Int ) : Void {
  100. // TODO : use native call ?
  101. haxe.ds.ArraySort.sort(cast this, f);
  102. }
  103. override function splice( pos : Int, len : Int ) : ArrayObj<T> {
  104. if( len < 0 ) return new ArrayObj();
  105. if( pos < 0 ){
  106. pos = this.length + pos;
  107. if( pos < 0 ) pos = 0;
  108. }
  109. if( pos > this.length ) {
  110. pos = 0;
  111. len = 0;
  112. } else if( pos + len > this.length ) {
  113. len = this.length - pos;
  114. if( len < 0 ) len = 0;
  115. }
  116. var a = this.array;
  117. var ret : ArrayObj<T> = alloc(cast a.sub(pos,len));
  118. var end = pos + len;
  119. a.blit(pos,a,end,this.length-end);
  120. this.length -= len;
  121. while( --len >= 0 )
  122. a[this.length + len] = null;
  123. return ret;
  124. }
  125. override function toString() : String {
  126. var b = new StringBuf();
  127. b.addChar("[".code);
  128. for( i in 0...length ) {
  129. if( i > 0 ) b.addChar(",".code);
  130. b.add(array[i]);
  131. }
  132. b.addChar("]".code);
  133. return b.toString();
  134. }
  135. public function unshift( x : T ) : Void {
  136. if( length == array.length ) __expand(length) else length++;
  137. array.blit(1, array, 0, length - 1);
  138. array[0] = x;
  139. }
  140. public function insert( pos : Int, x : T ) : Void {
  141. if( pos < 0 ) {
  142. pos = length + pos;
  143. if( pos < 0 ) pos = 0;
  144. } else if( pos > length ) pos = length;
  145. if( length == array.length ) __expand(length) else length++;
  146. array.blit(pos + 1, array, pos, length - pos - 1);
  147. array[pos] = x;
  148. }
  149. public function remove( x : T ) : Bool {
  150. var i = indexOf(x);
  151. if( i < 0 ) return false;
  152. length--;
  153. array.blit(i,array,i+1,length - i);
  154. array[length] = null;
  155. return true;
  156. }
  157. public function indexOf( x : T, ?fromIndex:Int ) : Int {
  158. var i : Int = fromIndex;
  159. if( i < 0 ) {
  160. i += length;
  161. if( i < 0 ) i = 0;
  162. }
  163. var length = length;
  164. var array = array;
  165. while( i < length ) {
  166. if( array[i] == x )
  167. return i;
  168. i++;
  169. }
  170. return -1;
  171. }
  172. public function lastIndexOf( x : T, ?fromIndex:Int ) : Int {
  173. var len = length;
  174. var i:Int = fromIndex != null ? fromIndex : len - 1;
  175. if( i >= len )
  176. i = len - 1;
  177. else if( i < 0 )
  178. i += len;
  179. while( i >= 0 ) {
  180. if( array[i] == x )
  181. return i;
  182. i--;
  183. }
  184. return -1;
  185. }
  186. public function copy() : ArrayObj<T> {
  187. var n = new NativeArray<Dynamic>(length);
  188. n.blit(0, array, 0, length);
  189. return alloc(n);
  190. }
  191. public function iterator() : Iterator<T> {
  192. var n = new NativeArray.NativeArrayIterator<T>(cast array);
  193. @:privateAccess n.length = length;
  194. return n;
  195. }
  196. public function map<S>( f : T -> S ) : ArrayDyn {
  197. var a = new ArrayObj();
  198. if( length > 0 ) a.__expand(length - 1);
  199. for( i in 0...length )
  200. a.array[i] = f(array[i]);
  201. return ArrayDyn.alloc(a,true);
  202. }
  203. public function filter( f : T -> Bool ) : ArrayObj<T> {
  204. var a = new ArrayObj();
  205. for( i in 0...length ) {
  206. var v = array[i];
  207. if( f(v) ) a.push(v);
  208. }
  209. return a;
  210. }
  211. // called by compiler when accessing the array outside of its bounds, might trigger resize
  212. function __expand( index : Int ) {
  213. if( index < 0 ) throw "Invalid array access";
  214. var newlen = index + 1;
  215. var size : Int = array.length;
  216. if( newlen > size ) {
  217. var next = (size * 3) >> 1;
  218. if( next < newlen ) next = newlen;
  219. var arr2 = new hl.types.NativeArray<Dynamic>(next);
  220. arr2.blit(0,array,0,length);
  221. array = arr2;
  222. }
  223. length = newlen;
  224. }
  225. override function getDyn( pos : Int ) : Dynamic {
  226. var pos : UInt = pos;
  227. if( pos >= length )
  228. return null;
  229. return array[pos];
  230. }
  231. override function setDyn( pos : Int, v : Dynamic ) {
  232. var pos : UInt = pos;
  233. if( pos >= length )
  234. __expand(pos);
  235. array[pos] = Api.safeCast(v,array.getType());
  236. }
  237. override function pushDyn( v : Dynamic ) return push(v);
  238. override function popDyn() : Null<Dynamic> return pop();
  239. override function shiftDyn() : Null<Dynamic> return shift();
  240. override function unshiftDyn( v : Dynamic ) unshift(v);
  241. override function insertDyn( pos : Int, v : Dynamic ) insert(pos, v);
  242. override function removeDyn( v : Dynamic ) return remove(v);
  243. override function sortDyn( f : Dynamic -> Dynamic -> Int ) sort(f);
  244. public static function alloc<T>( a : hl.types.NativeArray<T> ) : ArrayObj<T> {
  245. var arr : ArrayObj<T> = untyped $new(ArrayObj);
  246. arr.array = a;
  247. arr.length = a.length;
  248. return arr;
  249. }
  250. }