Skip to main content

STL - count and count_if algorithms

One of the basic and most useful STL algorithms is algorithm which can be used to count number of elements within selected container according to specified criteria. In order to do that we can use std::count or std::count_if algorithm.

  • std::count(firstElementIterator, lastElementIterator, elementForSearch) - is function which will go through container using firstElementIterator and lastElementIterator and return number of container elements which value is equal elementForSearch
  • std::count_if(firstElementIterator, lastElementIterator, UnaryPredicateFunction) - is function which examine range from firstElementIterator to lastElementIterator and return number of container elements which fulfill UnaryPredicateFunction criteria. UnaryPredicateFunction is function having following signature: bool functionName(const Type& a). So, count_if returns number of elements where UnaryPredicateFunction returns true for.


For better understanding let's take a look on balow example: Output of this example is: In point I we are defining vector of int elements which we will examine. We are using C++11 std::initializer_list for it.

In point II we are examining all myVector elements and getting how many elements has value 6. There are 4 such elements.

Point III presents how we can examing one part region of vector. Here we are examining only first 5 elements of vector and finding how many of its have value 6. Of course there is only one such element within first 5 elements of myVector.

Point IV presents how to use std::count_if value with predefined UnaryPredicateFunction. We are defining our UnaryPredicateFunction in point IVa as isEven() function. This predicate function will examine whether its argument is even int number. We are using our isEven function within std::count_if algorithm and getting that we have 6 even numbers within myVector.

Source code of above example can be downloaded from our github account here: https://github.com/xmementoit/CppAdventureExamples/tree/master/stl/countAndCountIf

Comments

Popular posts from this blog

Blog's new layout

As you noticed this blog has new layout from today. I hope you like it. I think new layout looks better and more modern than previous one. Please, write you opinion about new layout in comments. If you have some ideas how to make this blog better, all ideas are welcomed. Enjoy new layout and blog articles.

QT - foreach algoriithm with const references performance improvement

Today I would like to show you optimal way of using foreach QT algorithm . I will show you why we should pass elements of foreach algorithm by const reference instead of passing them by value. Let me explain it on the below example: Output of this example is: In point I we are creating 3 objects of MyClass class and push them to myClasses QList element. In point II we are using QT foreach algorithm to invoke getValue() method for each object from myClasses list. As you can see on output text for that part of code we are invoking copy constructor before and destructor after invoking getValue() function. It is because we are passing each myClasses list element to foreach algorithm by value. Therefore we are copying that element at the beginning of foreach loop step and removing them (destructing) at the end. This is inefficient solution, especially when class of object being copied is big. It decreases performance. of our application. Solution for that i...

C++ in 2014 - Predictions

Today I would like to share with you interesting article about prediction of development C++ programming languages (and its well-known frameworks and libraries) in 2014. It is written by Jens Weller and I think it is very interesting for every C++ programmer and user. You can open this article by clicking on the image below: Enjoy!