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...

Leet Code: Problem: 355. Design Twitter

Problem Statement: Design basic twitter which lets user follow and unfollow other users and show the latest new feed related to the current user and the user followers. Implement the following APIs void postTweet(int userId, int tweetId):     Stores the tweetId against the user ID. void follow(int followerId, int followeeId):     Marks that follower ID as following followee ID void unfollow(int followerId, int followeeId):     Marks that follower ID as unfollowing followee ID vector<int> getNewsFeed(int userId):     Returns the set of the latest 10 tweetIDs which include the current user tweetIDs and tweetIDs of the user that the follower if following. Approach to the problem: First we need to store the user IDs of the people a particular user is following To store that we can use map. To optimize things instead of storing list of followers, it is better to store them in a set for quicker access. So the followers data str...

LeetCode: Problem #1402. Reducing Dishes

Problem Statement: A chef has collected the data on the review for his dishes. Our Chef will take just 1 unit of time to prepare a dish. Our job is to tell him the dishes he has to make in the order to achieve maximum benefit. The maximum benefit is calculated using the formula time[i] * (review ratings). Example 1: Input: reviews = [-1, -10, -9, 0, 5] Output: 14 Explanation: Considering the dishes in the order of -1, 0 ,5 the calculation will be (-1 * 1 + 0 * 2 + 5 * 3) = 14 Example 2: Input: reviews = [6,5,4] Output: 32 Explanation: Considering the dishes in the order of 4, 5, 6 the calculation will be (4 * 1 + 5 * 2 + 6 * 3) = 32 Approach to the solution: Sort the given reviews so that we can concentrate only on maximum benefited reviews. Make cumulative sums from the end. This will help in deciding till which we have to consider the summation. Now start from the end at add the previous array of cumulative sums until a negative number is encountered. We have to iterate in reverse or...