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

GDB Automatic Deadlock Detector

Have you ever had a problem with detection deadlock between threads in your C/C++ application? Would you like to do that automatically? Try this GDB Automatic Deadlock Detector from my github: GDB Automatic Deadlock Detector Picture source: http://csunplugged.org/wp-content/uploads/2015/03/deadlock.jpg1286488735

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

Advanced C++ - Stack unwinding

Stack unwinding is normally a concept of removing function entries from call stack (also known as Execution stack, Control stack, Function stack or Run-time stack). Call Stack is a stack data structure that stores active functions' addresses and helps in supporting function call/return mechanism. Every time when a function is called, an entry is made into Call stack which contains the return address of the calling function where the control needs to return after the execution of called function. This entry is called by various names like stack frame , activation frame or activation record. With respect to exception handling , stack Unwinding is a process of linearly searching function call stack to reach exception handler. When an exception occurs, if it is not handled in current function where it is thrown, the function Call Stack is unwound until the control reaches try block and then passes to catch block at the end of try block to handle exception. Also, in this proc