C++ 模拟智能指针

参考：C++智能指针——探究六个常见的智能指针的使用及原理
模仿C++STL中share_ptr智能指针

• 将普通指针存在一个类中，类随着作用域的结束，在析构函数中释放指针，所以这个类需要是放在栈区，离开作用域后自动执行析构
• 类中有一个计数器，防止普通指针被多个类管理，多次释放造成程序崩溃
• 普通指针只有一个，在多个智能指针之间传递地址，计数器也需要是指针，在多个智能指针之间传递地址，所以他们在多个智能指针对象中始终是一个

#include <iostream>

using namespace std;

template <class T>
class SharePointer
{
public:
    SharePointer(T*p)
    {
        m_ptr = p;
        m_cnt = new int(1);
    }
    ~SharePointer()
    {
        (*m_cnt)--;
        cout << "解析后计数器:" << *m_cnt << endl;
        if(*m_cnt == 0)
        {
            delete m_ptr;
            m_ptr = nullptr;
        }
    }
    explicit SharePointer(SharePointer &sp)
    {
        m_ptr = sp.m_ptr;
        m_cnt = sp.m_cnt;
        (*m_cnt)++;
    }
    SharePointer<T>& operator=(SharePointer<T> &sp)
    {
       if(sp != *this)
       {
           if(--(*m_cnt) == 0) //如果该智能指针是最后一个保存另一个指针，则需要释放之前的资源
           {
              delete m_ptr;
              delete m_cnt;
           }
           m_ptr = sp.m_ptr;
           m_cnt = sp.m_cnt;
           (*m_cnt)++;
       }
       return *this;
    }
    int GetCnt()
    {
        return *m_cnt;
    }
    void *GetCntAdd()
    {
        return m_cnt;
    }
    T* operator*()
    {
        return *m_ptr;
    }
    T* operator->()
    {
        return m_ptr;
    }
private:
    T* m_ptr;
    int *m_cnt;
};

class Test
{
public:
    Test()
    {
        a = 0;
    }
    int GetValue()
    {
        return a;
    }
    void SetValue(int val)
    {
        a = val;
    }
private:
    int a;
};

int main()
{
    {
        SharePointer<Test> sp(new Test);
        cout << "first sp:" << sp.GetCnt() << endl;
        cout << "sp cnt address:" << (void*)sp.GetCntAdd() << endl;
        SharePointer<Test> sp1(sp);
        cout << "sp1 cnt address:" << (void*)sp1.GetCntAdd() << endl;
        cout << "second sp:" << sp.GetCnt() << endl;
        cout << "first sp1:" << sp1.GetCnt() << endl;
    }
    return 0;
}

//结果
first sp:1
sp cnt address:0x7411b0
sp1 cnt address:0x7411b0
second sp:2
first sp1:2
解析后计数器:1
解析后计数器:0