Skip to main content

Boost - Scoped pointer

Here is the first article about Boost libraries features. I am starting that new series of articles with explanation of scoped_ptr - one of the Boost smart pointers.

scoped_ptr is smart pointer that is the only owner of dynamically allocated object and is automatically freed allocated memory when destructor of scoped_ptr is called.

See example below:
Output of this example is:

In point I and II we are defining two scoped_ptr pointers - one for int and one for Test (custom class) object.

Notice comment marked as Ia. That is impossible operation for scoped_ptr. It is trying to assign ownership of allocated object to second pointer. scoped_ptr does not allow it. It have to be sole owner of its object.

Point III shows how we can assign new values to object which refers to scoped_ptr. We can use dereference operator (operator*) as for normal pointers (this operator is overloaded in Boost smart pointers) as well as use get() function implemented to Boost smart pointers.

Point IV shows how to use reset function to replace object which is being pointed by scoped_ptr. We can use reset() function for it. After using that function new object will be allocated and old object will be freed automatically. Therefore you can see text: "Constructor of Test class: 2 Destructor of Test class: 1" in the output text.

Take a special look at point V. This is place where we are exiting area of visibility of our scoped_ptr objects. In that place memory allocated for those pointers will be automatically freed. We do not have to use delete function like for normal pointers.

Smart pointers automatically free memory associated with dynamically allocated object which is being pointed by them while scoped_ptr destructor is being invoked.

Code of this example can be downloaded from here: https://github.com/xmementoit/CppAdventureExamples/tree/master/boost/scopedPointer


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.

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

C++ Multithreading - Race conditions

In the previous C++ Multithreading article I presented you how to pass parameters between threads. Take a detail look on the output of that example once again: In the first line of that output you can notice that output text from two threads is mixed. You are probably wondering why it happens? It is because we are not protecting resources which are shared by two threads (in this example cout stream is shared in both threads) which causes multithreading's phenomenon called race condition . Because threads switching and accessing to shared resources are managed by operating system we do not know when std::cout stream will be accessed by main thread and when it will be accessed by second thread. Therefore in the previous article I mentioned that output of the example can be little different on your computer than my output example. What's more it is possible that this output will be different for few consecutive invoking of the example on the same machine. It is beca...