Overload List
| # | Signature | Description |
|---|---|---|
| 1 | function Min: Integer; | Minimum value. |
| └ indexed: function Min(const Index: Integer; const Len: Integer): Integer; | ||
| 2 | function Min(out aIndex: Integer): Integer; | Calculate the minimum value of all calling object elements. |
| └ indexed: function Min(out aIndex: Integer; const Index: Integer; const Len: Integer): Integer; |
Overload 1: function Min: Integer;
Minimum value.
Returns: Int32 - The minimum value of all calling object elements. The result is an integer value.
Examples
var a: MatrixInt;
b: integer;
begin
a := [1,2,3,4];
b := a.Min; // 1
end;See Also: MatrixInt.Max
Indexed: function Min(const Index: Integer; const Len: Integer): Integer;
Calculate the minimum value from calling object elements [Index]..[Index+Len-1].
| # | Name | Type | Description |
|---|---|---|---|
| 1 | Index | Integer | start index |
| 2 | Len | Integer | element count |
Returns: Int32
Remarks:
The result is an integer value. An exception is raised if array borders are overrun.
Overload 2: function Min(out aIndex: Integer): Integer;
Calculate the minimum value of all calling object elements.
| # | Name | Description |
|---|---|---|
| 1 | aIndex | Stores minimum value index. |
Returns: Int32 - the minimum of all calling vector integer elements in-place.
Examples
Uses MtxExprInt;
procedure Example;
var a: MatrixInt;
min, ind: integer;
begin
a := [[1,2],[3,4]];
min := a.Min(ind); //min=1, ind = 0
end;See Also: MatrixInt.Max
Indexed: function Min(out aIndex: Integer; const Index: Integer; const Len: Integer): Integer;
Calculate the maximum value of calling object elements [Index..Index+Len-1].
| # | Name | Description |
|---|---|---|
| 1 | aIndex | Returns minimum value index. |
| 2 | Index | The starting index at which to start the search. |
| 3 | Len | The number of elements to search starting from Index. |
Returns: Int32 - the minimum of calling vector integer elements [Index..Index+Len-1].
Remarks:
An exception is raised if array borders are overrun/underrun.