ArrayDyn.hx 6.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262
  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 hl.types.ArrayBase;
  24. import haxe.iterators.ArrayIterator;
  25. import haxe.iterators.ArrayKeyValueIterator;
  26. class ArrayDynIterator extends ArrayIterator<Dynamic> {
  27. var a:ArrayBase;
  28. public function new(a) {
  29. super((null:Dynamic));
  30. this.a = a;
  31. }
  32. override public function hasNext() {
  33. return current < a.length;
  34. }
  35. override public function next() {
  36. return a.getDyn(current++);
  37. }
  38. }
  39. class ArrayDynKeyValueIterator extends ArrayKeyValueIterator<Dynamic> {
  40. var a : ArrayBase;
  41. public function new(a) {
  42. super((null:Dynamic));
  43. this.a = a;
  44. }
  45. override public function hasNext() {
  46. return current < a.length;
  47. }
  48. override public function next() {
  49. var v = a.getDyn(current);
  50. return {key:current++, value:v};
  51. }
  52. }
  53. @:keep
  54. class ArrayDyn extends ArrayAccess {
  55. public var length(get, never):Int;
  56. var array:ArrayBase;
  57. var allowReinterpret:Bool;
  58. public function new() {
  59. array = new ArrayObj<Dynamic>();
  60. allowReinterpret = true;
  61. }
  62. inline function get_length()
  63. return array.length;
  64. override function getDyn(i) {
  65. return array.getDyn(i);
  66. }
  67. override function setDyn(pos:Int, value:Dynamic) {
  68. array.setDyn(pos, value);
  69. }
  70. override function blit(pos:Int, src:ArrayAccess, srcpos:Int, len:Int):Void {
  71. array.blit(pos, src, srcpos, len);
  72. }
  73. public function concat(a:ArrayDyn):ArrayDyn {
  74. var a1 = array;
  75. var a2 = a.array;
  76. var alen = a1.length;
  77. var anew = new NativeArray<Dynamic>(alen + a2.length);
  78. for (i in 0...alen)
  79. anew[i] = a1.getDyn(i);
  80. for (i in 0...a2.length)
  81. anew[i + alen] = a2.getDyn(i);
  82. return alloc(ArrayObj.alloc(anew), true);
  83. }
  84. public function join(sep:String):String {
  85. return array.join(sep);
  86. }
  87. public function pop():Null<Dynamic> {
  88. return array.popDyn();
  89. }
  90. public function push(x:Dynamic):Int {
  91. return array.pushDyn(x);
  92. }
  93. public function reverse():Void {
  94. array.reverse();
  95. }
  96. public function resize(len:Int) {
  97. array.resize(len);
  98. }
  99. public function shift():Null<Dynamic> {
  100. return array.shiftDyn();
  101. }
  102. public function slice(pos:Int, ?end:Int):ArrayDyn {
  103. return alloc(array.slice(pos, end), true);
  104. }
  105. public function sort(f:Dynamic->Dynamic->Int):Void {
  106. array.sortDyn(f);
  107. }
  108. public function splice(pos:Int, len:Int):ArrayDyn {
  109. return alloc(array.splice(pos, len), true);
  110. }
  111. public function toString():String {
  112. return array.toString();
  113. }
  114. public function unshift(x:Dynamic):Void {
  115. array.unshiftDyn(x);
  116. }
  117. public function insert(pos:Int, x:Dynamic):Void {
  118. array.insertDyn(pos, x);
  119. }
  120. public function contains(x:Dynamic):Bool {
  121. return array.containsDyn(x);
  122. }
  123. public function remove(x:Dynamic):Bool {
  124. return array.removeDyn(x);
  125. }
  126. public function indexOf(x:Dynamic, ?fromIndex:Int):Int {
  127. var i:Int = fromIndex;
  128. var length = length;
  129. var array = array;
  130. while (i < length) {
  131. if (array.getDyn(i) == x)
  132. return i;
  133. i++;
  134. }
  135. return -1;
  136. }
  137. public function lastIndexOf(x:Dynamic, ?fromIndex:Int):Int {
  138. var len = length;
  139. var i:Int = fromIndex != null ? fromIndex : len - 1;
  140. if (i >= len)
  141. i = len - 1;
  142. else if (i < 0)
  143. i += len;
  144. while (i >= 0) {
  145. if (array.getDyn(i) == x)
  146. return i;
  147. i--;
  148. }
  149. return -1;
  150. }
  151. public function copy():ArrayDyn {
  152. var a = new NativeArray<Dynamic>(length);
  153. for (i in 0...length)
  154. a[i] = array.getDyn(i);
  155. return alloc(ArrayObj.alloc(a), true);
  156. }
  157. public function iterator():ArrayIterator<Dynamic> {
  158. return new ArrayDynIterator(array);
  159. }
  160. public function keyValueIterator() : ArrayKeyValueIterator<Dynamic> {
  161. return new ArrayDynKeyValueIterator(array);
  162. }
  163. public function map(f:Dynamic->Dynamic):ArrayDyn {
  164. var a = new NativeArray<Dynamic>(length);
  165. for (i in 0...length)
  166. a[i] = f(array.getDyn(i));
  167. return alloc(ArrayObj.alloc(a), true);
  168. }
  169. public function filter(f:Dynamic->Bool):ArrayDyn {
  170. var a = new ArrayObj<Dynamic>();
  171. for (i in 0...length) {
  172. var v = array.getDyn(i);
  173. if (f(v))
  174. a.push(v);
  175. }
  176. return alloc(a, true);
  177. }
  178. function __get_field(fid:Int):Dynamic {
  179. if (fid == untyped $hash("length"))
  180. return length;
  181. return null;
  182. }
  183. function __cast(t:Type):Dynamic {
  184. if (t == Type.getDynamic(array))
  185. return array;
  186. if (!allowReinterpret)
  187. return null;
  188. if (t == Type.get((null : ArrayBytes.ArrayI32))) {
  189. var a:BytesAccess<Int> = null;
  190. a = new Bytes(array.length << a.sizeBits);
  191. for (i in 0...array.length)
  192. a[i] = array.getDyn(i);
  193. var arr = ArrayBase.allocI32(a, array.length);
  194. array = arr;
  195. allowReinterpret = false;
  196. return arr;
  197. }
  198. if (t == Type.get((null : ArrayBytes.ArrayF64))) {
  199. var a:BytesAccess<Float> = null;
  200. a = new Bytes(array.length << a.sizeBits);
  201. for (i in 0...array.length)
  202. a[i] = array.getDyn(i);
  203. var arr = ArrayBase.allocF64(a, array.length);
  204. array = arr;
  205. allowReinterpret = false;
  206. return arr;
  207. }
  208. return null;
  209. }
  210. @:keep function __compare(a:Dynamic):Int {
  211. return a == array ? 0 : hl.Api.comparePointer(this, a);
  212. }
  213. public static function alloc(a:ArrayBase, allowReinterpret = false):ArrayDyn {
  214. var arr:ArrayDyn = untyped $new(ArrayDyn);
  215. arr.array = a;
  216. arr.allowReinterpret = allowReinterpret;
  217. return arr;
  218. }
  219. }