ArrayObj.hx 8.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370
  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. package hl.types;
  23. import haxe.iterators.ArrayIterator;
  24. import haxe.iterators.ArrayKeyValueIterator;
  25. class ArrayObjIterator<T> extends ArrayIterator<T> {
  26. var arr:ArrayObj<T>;
  27. public inline function new(arr:ArrayObj<T>) {
  28. super((null:Dynamic));
  29. this.arr = arr;
  30. }
  31. override public function hasNext():Bool {
  32. return current < arr.length;
  33. }
  34. override public function next():T {
  35. return @:privateAccess arr.array[current++];
  36. }
  37. }
  38. @:keep
  39. class ArrayObj<T> extends ArrayBase {
  40. var array:hl.NativeArray<Dynamic>;
  41. public function new() {
  42. length = 0;
  43. array = new NativeArray<Dynamic>(0);
  44. }
  45. public function concat(a:ArrayObj<T>):ArrayObj<T> {
  46. var arr = new hl.NativeArray(length + a.length);
  47. arr.blit(0, array, 0, length);
  48. arr.blit(length, a.array, 0, a.length);
  49. return alloc(cast arr);
  50. }
  51. override function join(sep:String):String {
  52. var b = new StringBuf();
  53. for (i in 0...length) {
  54. if (i > 0)
  55. b.add(sep);
  56. b.add(array[i]);
  57. }
  58. return b.toString();
  59. }
  60. override function isArrayObj() {
  61. return true;
  62. }
  63. public function pop():Null<T> {
  64. if (length == 0)
  65. return null;
  66. length--;
  67. var v = array[length];
  68. array[length] = null;
  69. return v;
  70. }
  71. public function push(x:T):Int {
  72. var len = length;
  73. if (array.length == len)
  74. __expand(len);
  75. else
  76. length++;
  77. array[len] = x;
  78. return length;
  79. }
  80. override function reverse():Void {
  81. for (i in 0...length >> 1) {
  82. var k = length - 1 - i;
  83. var tmp = array[i];
  84. array[i] = array[k];
  85. array[k] = tmp;
  86. }
  87. }
  88. public function shift():Null<T> {
  89. if (length == 0)
  90. return null;
  91. length--;
  92. var v = array[0];
  93. array.blit(0, array, 1, length);
  94. array[length] = null;
  95. return v;
  96. }
  97. override function slice(pos:Int, ?end:Int):ArrayObj<T> {
  98. if (pos < 0) {
  99. pos = this.length + pos;
  100. if (pos < 0)
  101. pos = 0;
  102. }
  103. var pend:Int;
  104. if (end == null)
  105. pend = this.length;
  106. else {
  107. pend = end;
  108. if (pend < 0)
  109. pend += this.length;
  110. if (pend > this.length)
  111. pend = this.length;
  112. }
  113. var len = pend - pos;
  114. if (len < 0)
  115. return new ArrayObj();
  116. return alloc(array.sub(pos, len));
  117. }
  118. public function sort(f:T->T->Int):Void {
  119. // TODO : use native call ?
  120. haxe.ds.ArraySort.sort(cast this, f);
  121. }
  122. override function splice(pos:Int, len:Int):ArrayObj<T> {
  123. if (len < 0)
  124. return new ArrayObj();
  125. if (pos < 0) {
  126. pos = this.length + pos;
  127. if (pos < 0)
  128. pos = 0;
  129. }
  130. if (pos > this.length) {
  131. pos = 0;
  132. len = 0;
  133. } else if (pos + len > this.length) {
  134. len = this.length - pos;
  135. if (len < 0)
  136. len = 0;
  137. }
  138. var a = this.array;
  139. var ret:ArrayObj<T> = alloc(cast a.sub(pos, len));
  140. var end = pos + len;
  141. a.blit(pos, a, end, this.length - end);
  142. this.length -= len;
  143. while (--len >= 0)
  144. a[this.length + len] = null;
  145. return ret;
  146. }
  147. @:access(Std.toStringDepth)
  148. override function toString():String {
  149. if (Std.toStringDepth >= 5)
  150. return "...";
  151. Std.toStringDepth++;
  152. var b = new StringBuf();
  153. b.addChar("[".code);
  154. try {
  155. for (i in 0...length) {
  156. if (i > 0)
  157. b.addChar(",".code);
  158. b.add(array[i]);
  159. }
  160. } catch (e:Dynamic) {
  161. Std.toStringDepth--;
  162. hl.Api.rethrow(e);
  163. }
  164. b.addChar("]".code);
  165. Std.toStringDepth--;
  166. return b.toString();
  167. }
  168. public function unshift(x:T):Void {
  169. if (length == array.length)
  170. __expand(length)
  171. else
  172. length++;
  173. array.blit(1, array, 0, length - 1);
  174. array[0] = x;
  175. }
  176. public function insert(pos:Int, x:T):Void {
  177. if (pos < 0) {
  178. pos = length + pos;
  179. if (pos < 0)
  180. pos = 0;
  181. } else if (pos > length)
  182. pos = length;
  183. if (length == array.length)
  184. __expand(length)
  185. else
  186. length++;
  187. array.blit(pos + 1, array, pos, length - pos - 1);
  188. array[pos] = x;
  189. }
  190. public function contains(x:T):Bool {
  191. return indexOf(x) != -1;
  192. }
  193. public function remove(x:T):Bool {
  194. var i = indexOf(x);
  195. if (i < 0)
  196. return false;
  197. length--;
  198. array.blit(i, array, i + 1, length - i);
  199. array[length] = null;
  200. return true;
  201. }
  202. public function indexOf(x:T, ?fromIndex:Int):Int {
  203. var i:Int = fromIndex;
  204. if (i < 0) {
  205. i += length;
  206. if (i < 0)
  207. i = 0;
  208. }
  209. var length = length;
  210. var array = array;
  211. while (i < length) {
  212. if (array[i] == x)
  213. return i;
  214. i++;
  215. }
  216. return -1;
  217. }
  218. override function blit(pos:Int, src:ArrayBase.ArrayAccess, srcpos:Int, len:Int):Void {
  219. var src = (cast src : ArrayObj<T>);
  220. if (pos < 0 || srcpos < 0 || len < 0 || pos + len > length || srcpos + len > src.length)
  221. throw haxe.io.Error.OutsideBounds;
  222. array.blit(pos, src.array, srcpos, len);
  223. }
  224. public function lastIndexOf(x:T, ?fromIndex:Int):Int {
  225. var len = length;
  226. var i:Int = fromIndex != null ? fromIndex : len - 1;
  227. if (i >= len)
  228. i = len - 1;
  229. else if (i < 0)
  230. i += len;
  231. while (i >= 0) {
  232. if (array[i] == x)
  233. return i;
  234. i--;
  235. }
  236. return -1;
  237. }
  238. public function copy():ArrayObj<T> {
  239. var n = new NativeArray<Dynamic>(length);
  240. n.blit(0, array, 0, length);
  241. return alloc(n);
  242. }
  243. public function iterator():ArrayIterator<T> {
  244. return new ArrayObjIterator(this);
  245. }
  246. public function keyValueIterator():ArrayKeyValueIterator<T> {
  247. return new ArrayKeyValueIterator<T>(cast this);
  248. }
  249. public function map<S>(f:T->S):ArrayDyn {
  250. var a = new ArrayObj();
  251. if (length > 0)
  252. a.__expand(length - 1);
  253. for (i in 0...length)
  254. a.array[i] = f(array[i]);
  255. return ArrayDyn.alloc(a, true);
  256. }
  257. public function filter(f:T->Bool):ArrayObj<T> {
  258. var a = new ArrayObj();
  259. for (i in 0...length) {
  260. var v = array[i];
  261. if (f(v))
  262. a.push(v);
  263. }
  264. return a;
  265. }
  266. override public function resize(len:Int):Void {
  267. if (length < len) {
  268. __expand(len - 1);
  269. } else if (length > len) {
  270. for (i in len...length) {
  271. array[i] = null;
  272. }
  273. this.length = len;
  274. }
  275. }
  276. // called by compiler when accessing the array outside of its bounds, might trigger resize
  277. function __expand(index:Int) {
  278. if (index < 0)
  279. throw "Invalid array index " + index;
  280. var newlen = index + 1;
  281. var size:Int = array.length;
  282. if (newlen > size) {
  283. var next = (size * 3) >> 1;
  284. if (next < newlen)
  285. next = newlen;
  286. var arr2 = new hl.NativeArray<Dynamic>(next);
  287. arr2.blit(0, array, 0, length);
  288. array = arr2;
  289. }
  290. length = newlen;
  291. }
  292. override function getDyn(pos:Int):Dynamic {
  293. var pos:UInt = pos;
  294. if (pos >= length)
  295. return null;
  296. return array[pos];
  297. }
  298. override function setDyn(pos:Int, v:Dynamic) {
  299. var pos:UInt = pos;
  300. if (pos >= length)
  301. __expand(pos);
  302. array[pos] = Api.safeCast(v, array.getType());
  303. }
  304. override function pushDyn(v:Dynamic)
  305. return push(v);
  306. override function popDyn():Null<Dynamic>
  307. return pop();
  308. override function shiftDyn():Null<Dynamic>
  309. return shift();
  310. override function unshiftDyn(v:Dynamic)
  311. unshift(v);
  312. override function insertDyn(pos:Int, v:Dynamic)
  313. insert(pos, v);
  314. override function containsDyn(v:Dynamic)
  315. return contains(v);
  316. override function removeDyn(v:Dynamic)
  317. return remove(v);
  318. override function sortDyn(f:Dynamic->Dynamic->Int)
  319. sort(f);
  320. public static function alloc<T>(a:hl.NativeArray<T>):ArrayObj<T> {
  321. var arr:ArrayObj<T> = untyped $new(ArrayObj);
  322. arr.array = a;
  323. arr.length = a.length;
  324. return arr;
  325. }
  326. }