package cs.system.collections
implements ICloneable, ICollection, IEnumerable, IList
extended by ArrayList_ArrayListAdapter, ArrayList_ArrayListWrapper
Available on cs
staticAdapter(list:IList):ArrayList
staticFixedSize(list:ArrayList):ArrayList
staticFixedSize(list:IList):IList
staticReadOnly(list:ArrayList):ArrayList
staticReadOnly(list:IList):IList
staticRepeat(value:Dynamic, count:Int):ArrayList
staticSynchronized(list:ArrayList):ArrayList
staticSynchronized(list:IList):IList
finalnew()
finalnew(capacity:Int)
finalnew(c:ICollection)
Capacity:Int
read onlyCount:Int
read onlyIsFixedSize:Bool
read onlyIsReadOnly:Bool
read onlyIsSynchronized:Bool
read onlySyncRoot:Dynamic
Add(value:Dynamic):Int
AddRange(c:ICollection):Void
BinarySearch(value:Dynamic):Int
BinarySearch(index:Int, count:Int, value:Dynamic, comparer:IComparer):Int
BinarySearch(value:Dynamic, comparer:IComparer):Int
Clear():Void
Clone():Dynamic
Contains(item:Dynamic):Bool
CopyTo(array:Array):Void
CopyTo(index:Int, array:Array, arrayIndex:Int, count:Int):Void
CopyTo(array:Array, arrayIndex:Int):Void
GetEnumerator():IEnumerator
GetEnumerator(index:Int, count:Int):IEnumerator
GetRange(index:Int, count:Int):ArrayList
IndexOf(value:Dynamic):Int
IndexOf(value:Dynamic, startIndex:Int, count:Int):Int
IndexOf(value:Dynamic, startIndex:Int):Int
Insert(index:Int, value:Dynamic):Void
InsertRange(index:Int, c:ICollection):Void
LastIndexOf(value:Dynamic):Int
LastIndexOf(value:Dynamic, startIndex:Int, count:Int):Int
LastIndexOf(value:Dynamic, startIndex:Int):Int
Remove(obj:Dynamic):Void
RemoveAt(index:Int):Void
RemoveRange(index:Int, count:Int):Void
Reverse():Void
Reverse(index:Int, count:Int):Void
SetRange(index:Int, c:ICollection):Void
Sort():Void
Sort(index:Int, count:Int, comparer:IComparer):Void
Sort(comparer:IComparer):Void
ToArray():NativeArray<Dynamic>
ToArray(type:Type):Array
TrimToSize():Void
© 2005–2020 Haxe Foundation
Licensed under a MIT license.
https://api.haxe.org/cs/system/collections/ArrayList.html