Skip to main content

valarray class in C++

Valarray is a class similar to vector but is efficient than vector if it comes to mathematical operations.

It provides many element-wise operations, various forms of generalized subscript operators, slicing and indirect access.
In some mathematical operations, valarrays are more efficient than vector operations.

Some of the APIs provided by valarray class are:

apply(the function that performs the operation on every element)
This API applies manipulation on the given arguments to all the array elements.

valarray<int> arr = {1,2,3,4,5,6};
arr.apply([] (int x){return x = x+ 5;});

The above code increments every element by 5

sum()
This API performs the sum of all elements in the given array

valarray<int> arr = {1,2,3,4,5};
arr.sum();

The above code sums up all the elements of the array which is 15.

min()
This API finds out the smallest element in the array.
max()
This API finds out the largest element in the array.

valarray<int> arr = {1,2,3,4,5};
arr.min();
arr.max();

First API call will return 1 and second API call will return 5

shift(amount of shift)
This API will shift elements by the given value of the amount of shift. If it is the positive value then perform and perform the left shift if it is negative.

valarray<int> arr = {1,2,3,4,5};
valarray<int> arr2;
valarray<int> arr3;
arr2 = arr.shift(2); 
arr3 = arr.shift(-2);

First API call will return the array as {3,4,5,0,0}
Second API call will return the array as {0,0,1,2,3}

cshift(number of rotations)
This API performs right-side rotation if the value is negative and left-side rotation if the value is positive.

valarray<int> arr = {1,2,3,4,5};
valarray<int> arr2;
valarray<int> arr3;
arr2 = arr.shift(2); 
arr3 = arr.shift(-2);


First API call will return the array as {3,4,5,1,2}
Second API call will return the array as {4,5,1,2,3}

swap()
This API performs swap operation on two valarrays.

valarray<int> arr1 = {1,2,3,4,5};
valarray<int> arr2 = {-1,-2,-3,-4,-5};
arr1.swap(arr2);

After the above operations, arr1 is {-1,-2,-3,-4,-5}
arr2 is {1,2,3,4,5}

Comments

Popular posts from this blog

Leet Code: Problem #710 Random Pick with Blacklist

Given a blacklist  B containing unique integers from [0, N) , write a function to return a uniform random integer from [0, N) which is NOT  in B . Optimize it such that it minimizes the call to system’s Math.random() . Note: 1 <= N <= 1000000000 0 <= B.length < min(100000, N) [0, N)  does NOT include N. See interval notation . Example 1: Input: ["Solution","pick","pick","pick"] [[1,[]],[],[],[]] Output: [null,0,0,0] Example 2: Input: ["Solution","pick","pick","pick"] [[2,[]],[],[],[]] Output: [null,1,1,1] Example 3: Input: ["Solution","pick","pick","pick"] [[3,[1]],[],[],[]] Output: [null,0,0,2] Example 4: Input: ["Solution","pick","pick","pick"] [[4,[2]],[],[],[]] Output: [null,1,3,1] Explanation of Input Syntax: The input is two lists: the subroutines called and their argume...

Creating Self Signed SSL Certificates for HTTPS Communication

Self Signed CA: Create Private Key for Self Signed CA openssl ecparam -genkey -name secp256r1 | openssl ec -out ca.key     Create CA Certificate for Self Signed CA openssl req -new -x509 -days 36500 -key ca.key -out ca.pem -subj "/C=IN/ST=Karnataka/L=Bengaluru/O=company name/OU=Prod Operations Department/CN=prodops .domain.com   Verify the content of CA certificate openssl x509 -in ca.pem -noout -text Client CERTIFICATE: CLIENT_ID="<Client-Product>" e.g. CLIENT_ID="ClientID" CLIENT_SERIAL="<Client-Release-Number>" e.g. CLIENT_SERIAL="6889" Create Private Key for Client openssl ecparam -genkey -name secp256r1 | openssl ec -out  ${CLIENT_ID}_${CLIENT_SERIAL}.key                   Generate the Certificate Signing Request CSR openssl req -new -key ${CLIENT_ID}_${CLIENT_SERIAL}.key -out ${CLIENT_ID}_${CLIENT_SERIAL}.csr -subj "/C=IN/ST=Karnataka/L=Bengalur...

Tree Data Structure related must solve programming questions: Part - 1

LeetCode Problem #687 Given a binary tree find the longest possible path with same node values. The length of the path is determined the number of edges between the node. Example 1: Input: 5 / \ 4 5 / \ \ 1 1 5 Output:  2   Example 2: Input: 1 / \ 4 5 / \ \ 4 4 5 Output:  2 Solution in C++: /**  * Definition for a binary tree node.  * struct TreeNode {  *     int val;  *     TreeNode *left;  *     TreeNode *right;  *     TreeNode() : val(0), left(nullptr), right(nullptr) {}  *     TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}  *     TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}  * };  */ class Solution ...