Search results
Create the page "TIA Functions" on this wiki! See also the search results found.
- function TIAInsert(var TIA: TIntArray; const Index, Int: Integer): Integer; ...|integer]] '''Int''' at an index '''Index''' in the given [[TIntArray]] '''TIA'''. If '''Index''' is smaller than 0 the function will append the element a985 bytes (125 words) - 17:47, 23 April 2012
- [[Category:Functions]] [[Category:TIA Functions]]589 bytes (64 words) - 20:17, 24 October 2011
- procedure TIARange(const TIA: TIntArray; out Lo, Hi: Integer); ...ion determines the lowest and highest values in the given [[TIntArray]] '''TIA''' and returns them in '''Lo''' and '''Hi'''.552 bytes (68 words) - 12:04, 21 October 2011
- procedure ReverseTIA(var TIA: TIntArray); This function reverses the order of a given [[TIntArray]] '''TIA'''.560 bytes (60 words) - 23:03, 7 September 2012
- [[Category:Functions]] [[Category:TIA Functions]]501 bytes (57 words) - 14:29, 23 October 2011
- function TIAToStr(const TIA: TIntArray): string; Converts a [[TIntArray]] '''TIA''' to a [[string]] formatted as i1;i2;...;in. You can reverse this process538 bytes (61 words) - 11:27, 30 April 2012
- [[Category:Functions]] [[Category:Conversion Functions]]808 bytes (102 words) - 11:30, 30 April 2012
- procedure TIAUnique(var TIA: TIntArray); ...oves all of the duplicate [[Integer|integers]] in a given [[TIntArray]] '''TIA'''.575 bytes (61 words) - 12:42, 21 October 2011
- [[Category:Functions]] [[Category:TIA Functions]]615 bytes (67 words) - 14:28, 23 October 2011
- procedure SortTIA(var TIA: TIntArray); Sorts a given [[TIntArray]] '''TIA''' from the smallest to the largest [[Integer|integer]] using the fast [htt765 bytes (88 words) - 21:25, 23 October 2011
- procedure SortTIAEx(var TIA: TIntArray; const Int: Integer); Sorts a given [[TIntArray]] '''TIA''' by distance from a given [[Integer|integer]] '''Int''' using the fast [h710 bytes (81 words) - 21:25, 23 October 2011
- [[Category:Functions]] [[Category:TIA Functions]]744 bytes (83 words) - 15:25, 23 October 2011
- function TIAMean(const TIA: TIntArray): Extended; *Before 3.38, the function returned 0 when '''TIA''' was empty.715 bytes (83 words) - 16:47, 12 December 2012
- function TIAContains(const TIA: TIntArray; const Int: Integer): Boolean; Returns [[true]] if the given [[TIntArray]] '''TIA''' contains the given [[Integer|integer]] '''Int'''.595 bytes (60 words) - 10:37, 24 October 2011
- function TIAPos(const TIA: TIntArray; const Int: Integer): Integer; Finds a given [[integer]] value in the given [[TIntArray]] '''TIA''' and returns the position of the integer in the array. The function retur739 bytes (88 words) - 10:39, 24 October 2011
- function TIAPosEx(const TIA: TIntArray; const Int, From: Integer): Integer; Finds a given [[integer]] value in the given [[TIntArray]] '''TIA''' starting at the index given by '''From''' and returns the position of th722 bytes (86 words) - 10:41, 24 October 2011
- function TIADelete(var TIA: TIntArray; const Index: Integer): Integer; ...eger|integer]] at a given position '''Index''' in a given [[TIntArray]] '''TIA'''. The function returns the value it deleted from the array. If the index840 bytes (104 words) - 16:42, 22 May 2012
- function TIAAppend(var TIA: TIntArray; const Int: Integer): Integer; ...s the given [[Integer|integer]] '''Int''' to end of the given TIntArray '''TIA'''. The index of the appended element is returned.698 bytes (80 words) - 17:27, 23 April 2012
- function TIASum(const TIA: TIntArray): Integer; ...ns the sum of all [[Integer|integer values]] in the given [[TIntArray]] '''TIA'''.463 bytes (52 words) - 19:49, 24 October 2011
- procedure TIARemove(var TIA: TIntArray; const Int: Integer); ...occurrence of a given [[Integer|integer]] '''Int''' in a [[TIntArray]] '''TIA'''. An extended function with additional functionality is available as [[TI713 bytes (76 words) - 17:42, 23 April 2012