Update Files
This commit is contained in:
91
Kha/Tools/macos/std/hl/_std/haxe/ds/IntMap.hx
Normal file
91
Kha/Tools/macos/std/hl/_std/haxe/ds/IntMap.hx
Normal file
@ -0,0 +1,91 @@
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
package haxe.ds;
|
||||
|
||||
@:coreApi
|
||||
class IntMap<T> implements haxe.Constraints.IMap<Int, T> {
|
||||
var h:hl.types.IntMap;
|
||||
|
||||
public function new():Void {
|
||||
h = new hl.types.IntMap();
|
||||
}
|
||||
|
||||
public function set(key:Int, value:T):Void {
|
||||
@:privateAccess h.set(key, value);
|
||||
}
|
||||
|
||||
public function get(key:Int):Null<T> {
|
||||
return @:privateAccess h.get(key);
|
||||
}
|
||||
|
||||
public function exists(key:Int):Bool {
|
||||
return @:privateAccess h.exists(key);
|
||||
}
|
||||
|
||||
public function remove(key:Int):Bool {
|
||||
return @:privateAccess h.remove(key);
|
||||
}
|
||||
|
||||
public function keys():Iterator<Int> {
|
||||
return new hl.NativeArray.NativeArrayIterator<Int>(h.keysArray());
|
||||
}
|
||||
|
||||
public function iterator():Iterator<T> {
|
||||
return h.iterator();
|
||||
}
|
||||
|
||||
@:runtime public inline function keyValueIterator():KeyValueIterator<Int, T> {
|
||||
return new haxe.iterators.MapKeyValueIterator(this);
|
||||
}
|
||||
|
||||
public function copy():IntMap<T> {
|
||||
var copied = new IntMap();
|
||||
for (key in keys())
|
||||
copied.set(key, get(key));
|
||||
return copied;
|
||||
}
|
||||
|
||||
public function toString():String {
|
||||
var s = new StringBuf();
|
||||
var keys = h.keysArray();
|
||||
var values = h.valuesArray();
|
||||
s.addChar('{'.code);
|
||||
for (i in 0...keys.length) {
|
||||
if (i > 0)
|
||||
s.add(", ");
|
||||
s.add(keys[i]);
|
||||
s.add(" => ");
|
||||
s.add(values[i]);
|
||||
}
|
||||
s.addChar('}'.code);
|
||||
return s.toString();
|
||||
}
|
||||
|
||||
public function clear():Void {
|
||||
#if (hl_ver >= version("1.11.0"))
|
||||
@:privateAccess h.clear();
|
||||
#else
|
||||
h = new hl.types.IntMap();
|
||||
#end
|
||||
}
|
||||
}
|
||||
91
Kha/Tools/macos/std/hl/_std/haxe/ds/ObjectMap.hx
Normal file
91
Kha/Tools/macos/std/hl/_std/haxe/ds/ObjectMap.hx
Normal file
@ -0,0 +1,91 @@
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
package haxe.ds;
|
||||
|
||||
@:coreApi
|
||||
class ObjectMap<K:{}, T> implements haxe.Constraints.IMap<K, T> {
|
||||
var h:hl.types.ObjectMap;
|
||||
|
||||
public function new():Void {
|
||||
h = new hl.types.ObjectMap();
|
||||
}
|
||||
|
||||
public function set(key:K, value:T):Void {
|
||||
@:privateAccess h.set(key, value);
|
||||
}
|
||||
|
||||
public function get(key:K):Null<T> {
|
||||
return @:privateAccess h.get(key);
|
||||
}
|
||||
|
||||
public function exists(key:K):Bool {
|
||||
return @:privateAccess h.exists(key);
|
||||
}
|
||||
|
||||
public function remove(key:K):Bool {
|
||||
return @:privateAccess h.remove(key);
|
||||
}
|
||||
|
||||
public function keys():Iterator<K> {
|
||||
return new hl.NativeArray.NativeArrayIterator<K>(cast h.keysArray());
|
||||
}
|
||||
|
||||
public function iterator():Iterator<T> {
|
||||
return h.iterator();
|
||||
}
|
||||
|
||||
@:runtime public inline function keyValueIterator():KeyValueIterator<K, T> {
|
||||
return new haxe.iterators.MapKeyValueIterator(this);
|
||||
}
|
||||
|
||||
public function copy():ObjectMap<K, T> {
|
||||
var copied = new ObjectMap();
|
||||
for (key in keys())
|
||||
copied.set(key, get(key));
|
||||
return copied;
|
||||
}
|
||||
|
||||
public function toString():String {
|
||||
var s = new StringBuf();
|
||||
var keys = h.keysArray();
|
||||
var values = h.valuesArray();
|
||||
s.addChar('{'.code);
|
||||
for (i in 0...keys.length) {
|
||||
if (i > 0)
|
||||
s.add(", ");
|
||||
s.add(keys[i]);
|
||||
s.add(" => ");
|
||||
s.add(values[i]);
|
||||
}
|
||||
s.addChar('}'.code);
|
||||
return s.toString();
|
||||
}
|
||||
|
||||
public function clear():Void {
|
||||
#if (hl_ver >= version("1.11.0"))
|
||||
@:privateAccess h.clear();
|
||||
#else
|
||||
h = new hl.types.ObjectMap();
|
||||
#end
|
||||
}
|
||||
}
|
||||
119
Kha/Tools/macos/std/hl/_std/haxe/ds/StringMap.hx
Normal file
119
Kha/Tools/macos/std/hl/_std/haxe/ds/StringMap.hx
Normal file
@ -0,0 +1,119 @@
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
package haxe.ds;
|
||||
|
||||
private class StringMapKeysIterator {
|
||||
var arr:hl.NativeArray<hl.Bytes>;
|
||||
var pos:Int;
|
||||
var length:Int;
|
||||
|
||||
public inline function new(h:hl.types.BytesMap) {
|
||||
this.arr = h.keysArray();
|
||||
pos = 0;
|
||||
length = arr.length;
|
||||
}
|
||||
|
||||
public inline function hasNext() {
|
||||
return pos < length;
|
||||
}
|
||||
|
||||
public inline function next() @:privateAccess {
|
||||
var b = arr[pos++];
|
||||
return String.fromUCS2(b);
|
||||
}
|
||||
}
|
||||
|
||||
@:coreApi
|
||||
class StringMap<T> implements haxe.Constraints.IMap<String, T> {
|
||||
var h:hl.types.BytesMap;
|
||||
|
||||
public function new():Void {
|
||||
h = new hl.types.BytesMap();
|
||||
}
|
||||
|
||||
public function set(key:String, value:T):Void {
|
||||
@:privateAccess h.set(key.bytes, value);
|
||||
}
|
||||
|
||||
public function get(key:String):Null<T> {
|
||||
if (key == null)
|
||||
return null;
|
||||
return @:privateAccess h.get(key.bytes);
|
||||
}
|
||||
|
||||
public function exists(key:String):Bool {
|
||||
if (key == null)
|
||||
return false;
|
||||
return @:privateAccess h.exists(key.bytes);
|
||||
}
|
||||
|
||||
public function remove(key:String):Bool {
|
||||
if (key == null)
|
||||
return false;
|
||||
return @:privateAccess h.remove(key.bytes);
|
||||
}
|
||||
|
||||
public function keys():Iterator<String> {
|
||||
return new StringMapKeysIterator(h);
|
||||
}
|
||||
|
||||
public function iterator():Iterator<T> {
|
||||
return h.iterator();
|
||||
}
|
||||
|
||||
@:runtime public inline function keyValueIterator():KeyValueIterator<String, T> {
|
||||
return new haxe.iterators.MapKeyValueIterator(this);
|
||||
}
|
||||
|
||||
public function copy():StringMap<T> {
|
||||
var copied = new StringMap();
|
||||
for (key in keys())
|
||||
copied.set(key, get(key));
|
||||
return copied;
|
||||
}
|
||||
|
||||
public function toString():String {
|
||||
var s = new StringBuf();
|
||||
var keys = h.keysArray();
|
||||
var values = h.valuesArray();
|
||||
s.addChar('{'.code);
|
||||
for (i in 0...keys.length) {
|
||||
if (i > 0)
|
||||
s.add(", ");
|
||||
var k = keys[i];
|
||||
@:privateAccess s.__add(k, 0, (@:privateAccess k.ucs2Length(0)) << 1);
|
||||
s.add(" => ");
|
||||
s.add(values[i]);
|
||||
}
|
||||
s.addChar('}'.code);
|
||||
return s.toString();
|
||||
}
|
||||
|
||||
public function clear():Void {
|
||||
#if (hl_ver >= version("1.11.0"))
|
||||
@:privateAccess h.clear();
|
||||
#else
|
||||
h = new hl.types.BytesMap();
|
||||
#end
|
||||
}
|
||||
}
|
||||
90
Kha/Tools/macos/std/hl/_std/haxe/ds/Vector.hx
Normal file
90
Kha/Tools/macos/std/hl/_std/haxe/ds/Vector.hx
Normal file
@ -0,0 +1,90 @@
|
||||
/*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
package haxe.ds;
|
||||
|
||||
private typedef VectorData<T> = Array<T>
|
||||
|
||||
@:coreApi
|
||||
abstract Vector<T>(VectorData<T>) {
|
||||
public inline function new(length:Int) {
|
||||
this = [];
|
||||
if (length > 0)
|
||||
this[length - 1] = cast null;
|
||||
}
|
||||
|
||||
@:op([]) public inline function get(index:Int):T {
|
||||
return this[index];
|
||||
}
|
||||
|
||||
@:op([]) public inline function set(index:Int, val:T):T {
|
||||
return this[index] = val;
|
||||
}
|
||||
|
||||
public var length(get, never):Int;
|
||||
|
||||
inline function get_length():Int {
|
||||
return this.length;
|
||||
}
|
||||
|
||||
public static inline function blit<T>(src:Vector<T>, srcPos:Int, dest:Vector<T>, destPos:Int, len:Int):Void {
|
||||
(cast dest : hl.types.ArrayBase.ArrayAccess).blit(destPos, (cast src : hl.types.ArrayBase.ArrayAccess), srcPos, len);
|
||||
}
|
||||
|
||||
public inline function toArray():Array<T> {
|
||||
return this.copy();
|
||||
}
|
||||
|
||||
public inline function toData():VectorData<T>
|
||||
return this;
|
||||
|
||||
static public inline function fromData<T>(data:VectorData<T>):Vector<T>
|
||||
return cast data;
|
||||
|
||||
static public inline function fromArrayCopy<T>(array:Array<T>):Vector<T> {
|
||||
return cast array.copy();
|
||||
}
|
||||
|
||||
public inline function copy<T>():Vector<T> {
|
||||
return cast this.copy();
|
||||
}
|
||||
|
||||
public inline function join<T>(sep:String):String {
|
||||
return this.join(sep);
|
||||
}
|
||||
|
||||
public inline function sort(f:T->T->Int):Void {
|
||||
this.sort(f);
|
||||
}
|
||||
|
||||
public inline function map<S>(f:T->S):Vector<S> {
|
||||
var length = length;
|
||||
var r = new Vector<S>(length);
|
||||
var i = 0;
|
||||
var len = length;
|
||||
for (i in 0...len) {
|
||||
var v = f(get(i));
|
||||
r.set(i, v);
|
||||
}
|
||||
return r;
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user