|
template<domain D :shared2p > |
D uint | sum (D bool[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D uint8 | sum (D uint8[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D uint16 | sum (D uint16[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D uint32 | sum (D uint32[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D uint | sum (D uint[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D int8 | sum (D int8[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D int16 | sum (D int16[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D int32 | sum (D int32[[1]] vec, uint k) |
|
template<domain D :shared2p > |
D int | sum (D int[[1]] vec, uint k) |
|
Function for finding the sum of all elements in the input vector in specified parts.
- Note
- D - shared2p protection domain
-
Supported types - bool / uint8 / uint16 / uint32 / uint / int8 / int16 / int32 / int
- Precondition
- the length of the input array must be a multiple of k
- Parameters
-
vec | - The input array of subarrays to sum. The subarrays are stacked one after another and are all of the same size. |
k | - The number of subarrays in the input array. |
- Returns
- The array of subarrayCount number of sums, each corresponding to respective subarray in the input array vec.
◆ sum() [1/9]
D uint sum |
( |
D bool[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [2/9]
D int16 sum |
( |
D int16[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [3/9]
D int32 sum |
( |
D int32[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [4/9]
D int8 sum |
( |
D int8[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [5/9]
D int sum |
( |
D int[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [6/9]
D uint16 sum |
( |
D uint16[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [7/9]
D uint32 sum |
( |
D uint32[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [8/9]
D uint8 sum |
( |
D uint8[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |
◆ sum() [9/9]
D uint sum |
( |
D uint[[1]] |
vec, |
|
|
uint |
k |
|
) |
| |