![](\"https://raw.github.com/ianharrigan/haxeui-test-app/master/docs/screenshots/main.jpg\")
\n![](\"https://raw.github.com/ianharrigan/haxeui-test-app/master/docs/screenshots/extended.jpg\")
\n\nDemos (May be out of date):\n![](\".//haxe.png\"/)
class Array<T>
Available on all platforms
An Array is a storage for values. You can access it using indexes or\nwith its API.
Instance Fields
function concat(a:Array<T>):Array<T>
Returns a new Array by appending the elements of a to the elements of\nthis Array.
This operation does not modify this Array.
If a is the empty Array [], a copy of this Array is returned.
The length of the returned Array is equal to the sum of this.length\nand a.length.
If a is null, the result is unspecified.
Returns a shallow copy of this Array.
The elements are not copied and retain their identity, so\na[i] == a.copy()[i] is true for any valid i. However,\na == a.copy() is always false.
function filter(f:T ->Bool):Array<T>
Returns an Array containing those elements of this for which f\nreturned true.
The individual elements are not duplicated and retain their identity.
\nIf f is null, the result is unspecified.
function indexOf(x:T, ?fromIndex:Int):Int
Returns position of the first occurense of x in this Array, searching front to back.
If x is found by checking standard equality, the function returns its index.
If x is not found, the function returns -1.
If fromIndex is specified, it will be used as the starting index to search from,\notherwise search starts with zero index. If it is negative, it will be taken as the\noffset from the end of this Array to compute the starting index. If given or computed\nstarting index is less than 0, the whole array will be searched, if it is greater than\nor equal to the length of this Array, the function returns -1.
function insert(pos:Int, x:T):Void
Inserts the element x at the position pos.
This operation modifies this Array in place.
The offset is calculated like so:
- If
posexceedsthis.length, the offset isthis.length. - \n
If
posis negative, the offset is calculated from the end ofthis\n Array, i.e.this.length + pos. If this yields a negative value, the\n offset is 0. - Otherwise, the offset is
pos.
If the resulting offset does not exceed this.length, all elements from\nand including that offset to the end of this Array are moved one index\nahead.
function join(sep:String):String
Returns a string representation of this Array, with sep separating\neach element.
The result of this operation is equal to Std.string(this[0]) + sep +\nStd.string(this[1]) + sep + ... + sep + Std.string(this[this.length-1])
If this is the empty Array [], the result is the empty String \"\".\nIf this has exactly one element, the result is equal to a call to\nStd.string(this[0]).
If sep is null, the result is unspecified.
function lastIndexOf(x:T, ?fromIndex:Int):Int
Returns position of the last occurense of x in this Array, searching back to front.
If x is found by checking standard equality, the function returns its index.
If x is not found, the function returns -1.
If fromIndex is specified, it will be used as the starting index to search from,\notherwise search starts with the last element index. If it is negative, it will be\ntaken as the offset from the end of this Array to compute the starting index. If\ngiven or computed starting index is greater than or equal to the length of this Array,\nthe whole array will be searched, if it is less than 0, the function returns -1.
function map<S>(f:T ->S):Array<S>
Creates a new Array by applying function f to all elements of this.
The order of elements is preserved.
\nIf f is null, the result is unspecified.
Removes the last element of this Array and returns it.
This operation modifies this Array in place.
If this has at least one element, this.length will decrease by 1.
If this is the empty Array [], null is returned and the length\nremains 0.
Adds the element x at the end of this Array and returns the new\nlength of this Array.
This operation modifies this Array in place.
this.length increases by 1.
Removes the first occurence of x in this Array.
This operation modifies this Array in place.
If x is found by checking standard equality, it is removed from this\nArray and all following elements are reindexed acoordingly. The function\nthen returns true.
If x is not found, this Array is not changed and the function\nreturns false.
Reverse the order of elements of this Array.
This operation modifies this Array in place.
If this.length < 2, this remains unchanged.
Removes the first element of this Array and returns it.
This operation modifies this Array in place.
If this has at least one element, this.length and the index of each\nremaining element is decreased by 1.
If this is the empty Array [], null is returned and the length\nremains 0.
function slice(pos:Int, ?end:Int):Array<T>
Creates a shallow copy of the range of this Array, starting at and\nincluding pos, up to but not including end.
This operation does not modify this Array.
The elements are not copied and retain their identity.
\nIf end is omitted or exceeds this.length, it defaults to the end of\nthis Array.
If pos or end are negative, their offsets are calculated from the\nend\tof this Array by this.length + pos and this.length + end\nrespectively. If this yields a negative value, 0 is used instead.
If pos exceeds this.length or if end exceeds or equals pos,\nthe result is [].
function sort(f:T ->T ->Int):Void
Sorts this Array according to the comparison function f, where\nf(x,y) returns 0 if x == y, a positive Int if x > y and a\nnegative Int if x < y.
This operation modifies this Array in place.
The sort operation is not guaranteed to be stable, which means that the\norder of equal elements may not be retained. For a stable Array sorting\nalgorithm, haxe.ds.sort.MergeSort.sort() can be used instead.
If f is null, the result is unspecified.
function splice(pos:Int, len:Int):Array<T>
Removes len elements from this Array, starting at and including\npos, an returns them.
This operation modifies this Array in place.
If len is < 0 or pos exceeds this.length, the result is the empty\nArray [].
If pos is negative, its value is calculated from the end\tof this\nArray by this.length + pos. If this yields a negative value, 0 is\nused instead.
If the sum of the resulting values for len and pos exceed\nthis.length, this operation will affect the elements from pos to the\nend of this Array.
The length of the returned Array is equal to the new length of this\nArray subtracted from the original length of this Array. In other\nwords, each element of the original this Array either remains in\nthis Array or becomes an element of the returned Array.
![](\"./triangle-closed.png\")
![](\"..//haxe.png\"/)
![](\"../triangle-closed.png\")
![](\"..//triangle-closed.png\")
![](\"../..//haxe.png\"/)
![](\"../..//triangle-closed.png\")
![](\"../../triangle-closed.png\")
![](\"../../..//haxe.png\"/)
![](\"../../..//triangle-closed.png\")
![](\"../../../triangle-closed.png\")
![](\"../../../..//haxe.png\"/)
![](\"../../../../..//haxe.png\"/)
![](\"../../../../..//triangle-closed.png\")
![](\"../../../..//triangle-closed.png\")
![](\"../../../../triangle-closed.png\")
![](\"../../../../../triangle-closed.png\")
![](\"::rootPath::triangle-closed.png\"/)
![](\"::api.config.rootPath::/haxe.png\"/)
![](\"::api.config.rootPath::triangle-closed.png\"/)
\n\t\t\t\t![](\"::api.config.rootPath::/triangle-closed.png\")
\n\t\t\t\t![](\"::api.config.rootPath::triangle-closed.png\")
\n\t\t\t\t