|
template<domain D :shared3p > |
D uint8 | min (D uint8[[1]] x, uint k) |
|
template<domain D :shared3p > |
D uint16 | min (D uint16[[1]] x, uint k) |
|
template<domain D :shared3p > |
D uint32 | min (D uint32[[1]] x, uint k) |
|
template<domain D :shared3p > |
D uint | min (D uint[[1]] x, uint k) |
|
template<domain D :shared3p > |
D int8 | min (D int8[[1]] x, uint k) |
|
template<domain D :shared3p > |
D int16 | min (D int16[[1]] x, uint k) |
|
template<domain D :shared3p > |
D int32 | min (D int32[[1]] x, uint k) |
|
template<domain D :shared3p > |
D int | min (D int[[1]] x, uint k) |
|
Function for finding the minimum element in the specified parts of the vector.
- Note
- D - shared3p protection domain
-
Supported types - uint8 / uint16 / uint32 / uint / int8 / int16 / int32 / int
- Parameters
-
x | - input vector |
k | - an uint type value, which specifies into how many subarrays must the input array be divided |
- Returns
- a vector with all the minimum elements of all the subarrays specified by k
- Precondition
- input vector is not empty
-
the size of the input array is dividable by k
- Leakage
- None
◆ min() [1/8]
D int16 min |
( |
D int16[[1]] |
x, |
|
|
uint |
k |
|
) |
| |
◆ min() [2/8]
D int32 min |
( |
D int32[[1]] |
x, |
|
|
uint |
k |
|
) |
| |
◆ min() [3/8]
D int8 min |
( |
D int8[[1]] |
x, |
|
|
uint |
k |
|
) |
| |
◆ min() [4/8]
D int min |
( |
D int[[1]] |
x, |
|
|
uint |
k |
|
) |
| |
◆ min() [5/8]
D uint16 min |
( |
D uint16[[1]] |
x, |
|
|
uint |
k |
|
) |
| |
◆ min() [6/8]
D uint32 min |
( |
D uint32[[1]] |
x, |
|
|
uint |
k |
|
) |
| |
◆ min() [7/8]
D uint8 min |
( |
D uint8[[1]] |
x, |
|
|
uint |
k |
|
) |
| |
◆ min() [8/8]
D uint min |
( |
D uint[[1]] |
x, |
|
|
uint |
k |
|
) |
| |