Search results
Create the page "TIA Functions" on this wiki! See also the search results found.
- procedure TIARemoveEx(var TIA: TIntArray; const Int: Integer; const All: Boolean); ...occurrence of a given [[Integer|integer]] '''Int''' in a [[TIntArray]] '''TIA''' if '''All''' is [[false]]. If '''All''' is [[true]], it will remove ever754 bytes (85 words) - 17:43, 23 April 2012
- TIA: TIntArray; TIA := TIAIntersect([0, 5, 7, 1, 6, 4], [1, 8, 2, 7, 3]);594 bytes (64 words) - 14:44, 10 November 2012
- TIA: TIntArray; TIA := [2, 4, 6, 8, 10];1 KB (145 words) - 13:14, 16 November 2011
- TIA: TIntArray; SetLength(TIA, 5);845 bytes (96 words) - 13:16, 16 November 2011
- function TIAEmpty(const TIA: TIntArray): Boolean; Returns [[true]] if the length of the given [[TIntArray]] '''TIA''' is 0.450 bytes (49 words) - 13:22, 23 April 2012
- function TIAMax(const TIA: TIntArray): Integer; ...given '''TIA'''. The function throws an exception if the size of the given TIA is 0. An extended function with additional functionality is available as [[684 bytes (79 words) - 17:54, 12 December 2012
- function TIAMin(const TIA: TIntArray): Integer; ...given '''TIA'''. The function throws an exception if the size of the given TIA is 0. An extended function with additional functionality is available as [[685 bytes (79 words) - 17:54, 12 December 2012
- function TIAMaxEx(const TIA: TIntArray; out Index: Integer): Integer; ...nd in '''Idx'''. The function throws an exception if the size of the given TIA is 0.707 bytes (88 words) - 17:54, 12 December 2012
- function TIAMinEx(const TIA: TIntArray; out Index: Integer): Integer; ...nd in '''Idx'''. The function throws an exception if the size of the given TIA is 0.708 bytes (88 words) - 17:54, 12 December 2012
- function TIAInsert(var TIA: TIntArray; const Index, Int: Integer): Integer; [[Category:Functions]]1 KB (131 words) - 17:48, 23 April 2012
- [[Category:Functions]] [[Category:TIA Functions]]100 bytes (10 words) - 18:47, 10 December 2012
- procedure TIAAdd(var TIA: TIntArray; const Value: Integer); Adds a given value '''Value''' to every value in the [[TIntArray]] '''TIA'''. A function with extended functionality is available as [[TIAAddEx]].743 bytes (82 words) - 17:34, 12 December 2012
- [[Category:Functions]] [[Category:TIA Functions]]553 bytes (61 words) - 14:06, 26 November 2012
- [[Category:Functions]] [[Category:TIA Functions]]560 bytes (64 words) - 14:46, 21 November 2012
- [[Category:Functions]] [[Category:TIA Functions]]814 bytes (101 words) - 14:46, 21 November 2012
- procedure TIAFreq(const TIA: TIntArray; out Values, Frequencies: TIntArray); ...absolute frequency of all [[Integer|integer]] values in the given array '''TIA'''. The unique values are returned in '''Values''' and their corresponding1 KB (123 words) - 13:44, 8 December 2012
- procedure TIAAddEx(var TIA: TIntArray; const Values: TIntArray); ...ernates between the values in '''Values'''. When '''Values''' is empty, '''TIA''' remains unchanged.1,022 bytes (99 words) - 17:34, 12 December 2012
- ...pe based on the [[Integer]] type. There are [[:Category:TIA_Functions|many functions]] available to process these arrays. TIA: TIntArray;679 bytes (76 words) - 17:07, 12 December 2012
- procedure FillTIA(var TIA: TIntArray; const Value: Integer); Fills a given [[TIntArray]] '''TIA''' with '''Value'''. A function with extended functionality is available as592 bytes (65 words) - 20:26, 10 December 2012
- procedure FillTIAEx(var TIA: TIntArray; const Values: TIntArray); ...Array]] '''TIA''' with the values from the [[TIntArray]] '''Values'''. The functions alternates between the values in '''Values'''. When '''Values''' is empty,690 bytes (78 words) - 20:28, 10 December 2012