Skip to main content

Boost - shared pointer

Shared pointer is another kind of Boost library's pointer. It is similar to scoped pointer but shared pointer allows share ownership of object. We are able to assign two or more pointers pointing to the same object (it was impossible for scoped pointer).

Take a look to the example below: Output of this example is:
In point I we are initializing two shared pointers pointing to two separate instances of TestClass class, then we are printing its values in point II.

Point III shows use difference between shared pointer and scoped pointer. We are assigning two pointers to the same object of class TestClass. In this point object having testValue==5 is being destroyed (because we remove the only one pointer to that object). Also, we have two pointers pointing to objects having testValue==6 now. Note that that object will be destroyed when last shared pointer pointing to them will be destroyed (int our case it is destroyed when we are reaching end of main() function). This is key difference between scoped pointer and shared pointer.

In point IV we are printing testValues of objects which are being pointed by our both scoped pointers. Actually, it is the same object so we are getting value 6 in both cases.

Code of this example you can find in our GitHub account:
https://github.com/xmementoit/CppAdventureExamples/tree/master/boost/sharedPointer


Labels:

Comments

  1. blogReader19 January 2014 at 18:42

    Are you going to present some article describing comparison (similarities and differences) of all Boost smart pointers?

    ReplyDelete
  2. Unknown19 January 2014 at 18:43

    I scheduled your request in my articles lists so it will be released here, soon.

    ReplyDelete

Post a Comment

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
Post a Comment
Read more

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
Post a Comment
Read more

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
Post a Comment
Read more