Overload List
| # | Signature | Description |
|---|---|---|
| 1 | TVec *SortAscend(); | Sorts vector elements in ascending order. |
| 2 | TVec *SortAscend(int Index, int Len); | Sort calling vector elements [Index]..[Index+Len-1]. |
| 3 | TVec *SortAscend(int Index, int Len, TVecInt *IndexVec); | Sort calling vector elements [Index]..[Index+Len-1]. |
| 4 | TVec *SortAscend(TVecInt *IndexVec); | Sort all calling vector elements. |
Overload 1: TVec *SortAscend();
Sorts vector elements in ascending order.
Sort all calling vector elements.
Note
If the vector is complex, the complex values are first compared by the absolute value and then (if absolute value is equal) by the argument.
Overload 2: TVec *SortAscend(int Index, int Len);
Sort calling vector elements [Index]..[Index+Len-1].
| # | Name | Type | Description |
|---|---|---|---|
| 1 | Index | int | |
| 2 | Len | int |
An exception is raised if TVec::ConditionCheck is True and array borders are overrun.
Overload 3: TVec *SortAscend(int Index, int Len, TVecInt *IndexVec);
Sort calling vector elements [Index]..[Index+Len-1].
| # | Name | Type | Description |
|---|---|---|---|
| 1 | Index | int | |
| 2 | Len | int | |
| 3 | IndexVec | TVecInt * |
An exception is raised if TVec::ConditionCheck is True and array borders are overrun.
IndexVec contains the new order of elements. The order is stored in an array of integers which are accessible via the IValues property.
Overload 4: TVec *SortAscend(TVecInt *IndexVec);
Sort all calling vector elements.
| # | Name | Type | Description |
|---|---|---|---|
| 1 | IndexVec | TVecInt * |
IndexVec contains the new (zero based) order of elements. The order is stored in an array of integers which are accessible via the IValues property.