HaxeFoundation.haxe/std/cs/_std/Array.hx

/*
 * Copyright (C)2005-2019 Haxe Foundation
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

import cs.NativeArray;

#if core_api_serialize
@:meta(System.Serializable)
#end
final class Array<T> implements ArrayAccess<T> {
	public var length(default, null):Int;

	private var __a:NativeArray<T>;

	@:skipReflection static var __hx_toString_depth = 0;
	@:skipReflection static inline final __hx_defaultCapacity = 4;

	#if erase_generics
	inline private static function ofNative<X>(native:NativeArray<Dynamic>):Array<X> {
		return new Array(native);
	}
	#else
	inline private static function ofNative<X>(native:NativeArray<X>):Array<X> {
		return new Array(native);
	}
	#end

	inline private static function alloc<Y>(size:Int):Array<Y> {
		return new Array(new NativeArray(size));
	}

	@:overload public function new():Void {
		this.length = 0;
		this.__a = new NativeArray(0);
	}

	#if erase_generics
	@:overload private function new(native:NativeArray<Dynamic>) {
		this.length = native.Length;
		this.__a = untyped native;
	}
	#else
	@:overload private function new(native:NativeArray<T>) {
		this.length = native.Length;
		this.__a = native;
	}
	#end

	public function concat(a:Array<T>):Array<T> {
		var len = length + a.length;
		var retarr = new NativeArray(len);
		cs.system.Array.Copy(__a, 0, retarr, 0, length);
		cs.system.Array.Copy(a.__a, 0, retarr, length, a.length);

		return ofNative(retarr);
	}

	private function concatNative(a:NativeArray<T>):Void {
		var __a = __a;
		var len = length + a.Length;
		if (__a.Length >= len) {
			cs.system.Array.Copy(a, 0, __a, length, length);
		} else {
			var newarr = new NativeArray(len);
			cs.system.Array.Copy(__a, 0, newarr, 0, length);
			cs.system.Array.Copy(a, 0, newarr, length, a.Length);

			this.__a = newarr;
		}

		this.length = len;
	}

	public function indexOf(x:T, ?fromIndex:Int):Int {
		var len = length, i:Int = (fromIndex == null) ? 0 : fromIndex;
		if (i < 0) {
			i += len;
			if (i < 0)
				i = 0;
		} else if (i >= len) {
			return -1;
		}
		return cs.system.Array.IndexOf(__a, x, i, len - i);
	}

	public function lastIndexOf(x:T, ?fromIndex:Int):Int {
		var len = length, i:Int = (fromIndex == null) ? len - 1 : fromIndex;
		if (i >= len) {
			i = len - 1;
		} else if (i < 0) {
			i += len;
			if (i < 0)
				return -1;
		}
		return cs.system.Array.LastIndexOf(__a, x, i, i + 1);
	}

	public function join(sep:String):String {
		var buf = new StringBuf();
		var i = -1;

		var first = true;
		var length = length;
		while (++i < length) {
			if (first)
				first = false;
			else
				buf.add(sep);
			buf.add(__a[i]);
		}

		return buf.toString();
	}

	public function pop():Null<T> {
		var __a = __a;
		var length = length;
		if (length > 0) {
			var val = __a[--length];
			__a[length] = null;
			this.length = length;

			return val;
		} else {
			return null;
		}
	}

	public function push(x:T):Int {
		if (length >= __a.Length) {
			var newLen = length == 0 ? __hx_defaultCapacity : (length << 1);
			var newarr = new NativeArray(newLen);
			__a.CopyTo(newarr, 0);

			this.__a = newarr;
		}

		__a[length] = x;
		return ++length;
	}

	public function reverse():Void {
		var i = 0;
		var l = this.length;
		var a = this.__a;
		var half = l >> 1;
		l -= 1;
		while (i < half) {
			var tmp = a[i];
			a[i] = a[l - i];
			a[l - i] = tmp;
			i += 1;
		}
	}

	public function shift():Null<T> {
		var l = this.length;
		if (l == 0)
			return null;

		var a = this.__a;
		var x = a[0];
		l -= 1;
		cs.system.Array.Copy(a, 1, a, 0, length - 1);
		a[l] = null;
		this.length = l;

		return x;
	}

	public function slice(pos:Int, ?end:Int):Array<T> {
		if (pos < 0) {
			pos = this.length + pos;
			if (pos < 0)
				pos = 0;
		}
		if (end == null)
			end = this.length;
		else if (end < 0)
			end = this.length + end;
		if (end > this.length)
			end = this.length;
		var len = end - pos;
		if (len < 0)
			return new Array();

		var newarr = new NativeArray(len);
		cs.system.Array.Copy(__a, pos, newarr, 0, len);

		return ofNative(newarr);
	}

	public function sort(f:T->T->Int):Void {
		if (length == 0)
			return;
		quicksort(0, length - 1, f);
	}

	private function quicksort(lo:Int, hi:Int, f:T->T->Int):Void {
		var buf = __a;
		var i = lo, j = hi;
		var p = buf[(i + j) >> 1];
		while (i <= j) {
			while (i < hi && f(buf[i], p) < 0)
				i++;
			while (j > lo && f(buf[j], p) > 0)
				j--;
			if (i <= j) {
				var t = buf[i];
				buf[i++] = buf[j];
				buf[j--] = t;
			}
		}

		if (lo < j)
			quicksort(lo, j, f);
		if (i < hi)
			quicksort(i, hi, f);
	}

	public function splice(pos:Int, len:Int):Array<T> {
		if (len < 0)
			return new Array();
		if (pos < 0) {
			pos = this.length + pos;
			if (pos < 0)
				pos = 0;
		}
		if (pos > this.length) {
			pos = 0;
			len = 0;
		} else if (pos + len > this.length) {
			len = this.length - pos;
			if (len < 0)
				len = 0;
		}
		var a = this.__a;

		var ret = new NativeArray(len);
		cs.system.Array.Copy(a, pos, ret, 0, len);
		var ret = ofNative(ret);

		var end = pos + len;
		cs.system.Array.Copy(a, end, a, pos, this.length - end);
		this.length -= len;
		while (--len >= 0)
			a[this.length + len] = null;
		return ret;
	}

	private function spliceVoid(pos:Int, len:Int):Void {
		if (len < 0)
			return;
		if (pos < 0) {
			pos = this.length + pos;
			if (pos < 0)
				pos = 0;
		}
		if (pos > this.length) {
			pos = 0;
			len = 0;
		} else if (pos + len > this.length) {
			len = this.length - pos;
			if (len < 0)
				len = 0;
		}
		var a = this.__a;

		var end = pos + len;
		cs.system.Array.Copy(a, end, a, pos, this.length - end);
		this.length -= len;
		while (--len >= 0)
			a[this.length + len] = null;
	}

	public function toString():String {
		if (__hx_toString_depth >= 5) {
			return "...";
		}
		++__hx_toString_depth;
		try {
			var s = __hx_toString();
			--__hx_toString_depth;
			return s;
		} catch (e:Dynamic) {
			--__hx_toString_depth;
			throw(e);
		}
	}

	@:skipReflection
	function __hx_toString():String {
		var ret = new StringBuf();
		var a = __a;
		ret.add("[");
		var first = true;
		for (i in 0...length) {
			if (first)
				first = false;
			else
				ret.add(",");
			ret.add(a[i]);
		}

		ret.add("]");
		return ret.toString();
	}

	public function unshift(x:T):Void {
		var __a = __a;
		var length = length;
		if (length >= __a.Length) {
			var newLen = (length << 1) + 1;
			var newarr = new NativeArray(newLen);
			cs.system.Array.Copy(__a, 0, newarr, 1, length);

			this.__a = newarr;
		} else {
			cs.system.Array.Copy(__a, 0, __a, 1, length);
		}

		this.__a[0] = x;
		++this.length;
	}

	public function insert(pos:Int, x:T):Void {
		var l = this.length;
		if (pos < 0) {
			pos = l + pos;
			if (pos < 0)
				pos = 0;
		}
		if (pos >= l) {
			this.push(x);
			return;
		} else if (pos == 0) {
			this.unshift(x);
			return;
		}

		if (l >= __a.Length) {
			var newLen = (length << 1) + 1;
			var newarr = new NativeArray(newLen);
			cs.system.Array.Copy(__a, 0, newarr, 0, pos);
			newarr[pos] = x;
			cs.system.Array.Copy(__a, pos, newarr, pos + 1, l - pos);

			this.__a = newarr;
			++this.length;
		} else {
			var __a = __a;
			cs.system.Array.Copy(__a, pos, __a, pos + 1, l - pos);
			cs.system.Array.Copy(__a, 0, __a, 0, pos);
			__a[pos] = x;
			++this.length;
		}
	}

	public function remove(x:T):Bool {
		var __a = __a;
		var i = -1;
		var length = length;
		while (++i < length) {
			if (__a[i] == x) {
				cs.system.Array.Copy(__a, i + 1, __a, i, length - i - 1);
				__a[--this.length] = null;

				return true;
			}
		}

		return false;
	}

	public inline function map<S>(f:T->S):Array<S> {
		var ret = alloc(length);
		for (i in 0...length)
			ret.__unsafe_set(i, f(__unsafe_get(i)));
		return ret;
	}

	public inline function filter(f:T->Bool):Array<T> {
		var ret = [];
		for (i in 0...length) {
			var elt = __unsafe_get(i);
			if (f(elt))
				ret.push(elt);
		}
		return ret;
	}

	public function copy():Array<T> {
		var len = length;
		var __a = __a;
		var newarr = new NativeArray(len);
		cs.system.Array.Copy(__a, 0, newarr, 0, len);
		return ofNative(newarr);
	}

	public inline function iterator():haxe.iterators.ArrayIterator<T> {
		return new haxe.iterators.ArrayIterator(this);
	}

	public function resize(len:Int):Void {
		if (length < len) {
			if (__a.length < len) {
				cs.system.Array.Resize(__a, len);
			}
			this.length = len;
		} else if (length > len) {
			spliceVoid(len, length - len);
		}
	}

	private function __get(idx:Int):T {
		return if ((cast idx : UInt) >= length) null else __a[idx];
	}

	private function __set(idx:Int, v:T):T {
		var idx:UInt = idx;
		var __a = __a;
		if (idx >= __a.Length) {
			var len = idx + 1;
			if (idx == __a.Length)
				len = (idx << 1) + 1;
			var newArr = new NativeArray<T>(len);
			__a.CopyTo(newArr, 0);
			this.__a = __a = newArr;
		}

		if (idx >= length)
			this.length = idx + 1;

		return __a[idx] = v;
	}

	private inline function __unsafe_get(idx:Int):T {
		return __a[idx];
	}

	private inline function __unsafe_set(idx:Int, val:T):T {
		return __a[idx] = val;
	}
}