hx.JA_I.hx Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of jtransc-rt Show documentation
Show all versions of jtransc-rt Show documentation
JVM AOT compiler currently generating JavaScript, C++, Haxe, with initial focus on Kotlin and games.
import haxe.io.Int32Array;
import haxe.io.Bytes;
import haxe.ds.Vector;
class JA_I extends JA_0 {
public var data:Int32Array = null;
public function new(length:Int, data:Int32Array = null) {
super();
if (data == null) data = new Int32Array(length); else length = data.length;
this.data = data;
this.length = length;
this.desc = "[I";
}
override public function getElementBytesSize():Int return 4;
override public function getArrayBufferView() return data.view;
public function getTypedArray() return data;
static public function fromArray(items:Array) {
if (items == null) return null;
var out = new JA_I(items.length);
for (n in 0 ... items.length) out.set(n, items[n]);
return out;
}
static public function T(items:Array) {
return fromArray(items);
}
override public function getBytes() return data.view.buffer;
static public function fromBytes(bytes:Bytes) {
if (bytes == null) return null;
var out = new JA_I(0);
out.length = Std.int(bytes.length / 4);
for (n in 0 ... out.length) out.set(n, bytes.getInt32(n * 4));
return out;
}
inline public function get(index:Int):Int return this.data[checkBounds(index)];
inline public function set(index:Int, value:Int):Void this.data[checkBounds(index)] = value;
override public function getDynamic(index:Int):Dynamic return get(index);
override public function setDynamic(index:Int, value:Dynamic) set(index, value);
public function join(separator:String) {
var out = '';
for (n in 0 ... length) {
if (n != 0) out += separator;
out += get(n);
}
return out;
}
public override function clone() {
var out = new JA_I(length);
copy(this, out, 0, 0, length);
return out;
}
static public function copy(from:JA_I, to:JA_I, fromPos:Int, toPos:Int, length:Int) {
if (from == to && toPos > fromPos) {
var n = length;
while (--n >= 0) to.set(toPos + n, from.get(fromPos + n));
} else {
for (n in 0 ... length) to.set(toPos + n, from.get(fromPos + n));
}
}
}