1. make_shared<T>(args): return a shared_ptr dynamically allocated object of type T. Use args to initialize the object.

shared_ptr<T> p(q): p is a copy of shared_ptr q. Increase the count in q. The pointer in q must be convertable to T.

p = q: p and q are shared_ptr holding pointers that are convertable to one another. Decrease p's reference count, and increase q's count; delete p's existing memory if p's count goes to zero.

p.use_count(): return the number of objects sharing with p. Intended for debug purpose.

2. Ordinarily we use auto to make it easier to define an object to hold the result of make_shared:

auto p1 = make_shared<revector<string>>();
auto p2 = make_shared<int>();
auto p(q); // p and q point to the same object

3. The fact that the shared_ptr class automatically free dynamic objects when they are no longer needed makes it fairly easier to use dynamic memory.

// factory return a shared_ptr pointing to a dynamically allocated object
shared_ptr<Foo> factory(T arg)
{
// process arg as a appropriate
// shared_ptr will take care of deleting the memory
return make_shared<Foo>(arg);
} void use_factory(T arg)
{
shared_ptr<Foo> p = factory(arg);
// use p
} // p goes out of scope. The memory to which p points is automatically free

4.If you put shared_ptrs into a container, you should be sure to erase shared_ptr elements once you no longer need those elements.

Programs tend to use dynamic memory for one of three purpose:

  • They don't know how many object they will need
  • They don't know the precise type of the object they need.
  • They want to share data between serval objects.

So far, the classes we have used allocate resources that exist only as long as the corresponding object

vector<string> v1;
{
vector<string> v2 = {"a", "aa", "bbb"};
v1 = v2; // copies the elements in v2 to v1
} // v2 is deleted, which destroys the elements in v2
// v1 has three new copied elements

Two operators allocate and delete dynamic memory:

  • new: allocates memory
  • delete: frees memory allocated by new.

Use these two operator is more error-prone than using a smart pointer.

A dynamic object managed through a build-in pointer exists until it is explictly deleted

Foo factory(T arg)
{
return new Foo(arg); // caller is responsible for deleting this memory
} void use_factory(T arg)
{
Foo *p = use_factory(arg);
// use p but do not delete it
} p goes out of scope, but the memory to which p points is not freeed.

In this example, p was the only pointer to memory allocated by factory. Once use_factory returns, the program has no way to free the memory. Then memory leak.

There are three common problem with using new and delete to manage dynamic memory:

  • Forgetting to delete memory, which is known as memory leak
  • Using a object after it has been deleted
  • Deleting the same object twice

We should use smart pointers rather than plain pointers

If we do not initialize a smart pointer, it is initialized as a null pointer. We can also initialize a smart pointer from a pointer return from new

shared_ptr<double> p1;
shared_ptr<int> p2(new int());

The smart pointer constructors that take pointers are explict. We can not implictly conver a build-in pointer to a smart pointer.

shared_ptr<int> p1 = new int();    // error
shared_ptr<int> p2(new int()); // ok. use direct initilization

A function that return a shared_ptr cannot implictly return a plian pointer in its return statement

shared_ptr<int> clone(int p)
{
return new int(p); // error
} shared_ptr<int> clone(int p)
{
// ok; explicitly create a shared_ptr from int *
return shared_ptr<int>(new int(p));
}

Don't mix ordinary pointers and smart pointers.

When we bind a shared_ptr to a pain pointer, we give responsibility for that memory to the shared_ptr, and we should no longer use a build-in pointer to access the memory to which the shared_ptr now points.

Don't use get to initilize or assign another smart pointer.

c++ Dynamic Memory (part 1)的更多相关文章

  1. (转) Dynamic memory

      In the programs seen in previous chapters, all memory needs were determined before program executi ...

  2. 论文笔记:Learning Dynamic Memory Networks for Object Tracking

    Learning Dynamic Memory Networks for Object Tracking  ECCV 2018Updated on 2018-08-05 16:36:30 Paper: ...

  3. 动态内存分配(Dynamic memory allocation)

    下面的代码片段的输出是什么?为什么? 解析:这是一道动态内存分配(Dynamic memory allocation)题.    尽管不像非嵌入式计算那么常见,嵌入式系统还是有从堆(heap)中动态分 ...

  4. 从五大结构体,带你掌握鸿蒙轻内核动态内存Dynamic Memory

    摘要:本文带领大家一起剖析了鸿蒙轻内核的动态内存模块的源代码,包含动态内存的结构体.动态内存池初始化.动态内存申请.释放等. 本文分享自华为云社区<鸿蒙轻内核M核源码分析系列九 动态内存Dyna ...

  5. c++ Dynamic Memory (part 2)

    Don't use get to initialize or assign another smart pointer. The code that use the return from get c ...

  6. [Paper翻译]Scalable Lock-Free Dynamic Memory Allocation

    原文: http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.87.3870&rep=rep1&type=pdf Abstr ...

  7. C++ storage allocation + Dynamic memory allocation + setting limits + initializer list (1)

    1. 对象的空间在括号开始就已经分配,但是构造在定义对象的时候才会实现,若跳过(譬如goto),到括号结束析构会发生错误,编译会通不过. 2.初始化 1 struct X { int i ; floa ...

  8. 基于神经网络的混合计算(DNC)-Hybrid computing using a NN with dynamic external memory

    前言: DNC可以称为NTM的进一步发展,希望先看看这篇译文,关于NTM的译文:人工机器-NTM-Neutral Turing Machine 基于神经网络的混合计算 Hybrid computing ...

  9. (C/C++) Interview in English. - Memory Allocation/Deallocation.

    Q: What is the difference between new/delete and malloc/free? A: Malloc/free do not know about const ...

随机推荐

  1. 建立复数类Complex,并且进行赋值,求和,取模等操作

    #include "pch.h" #include <iostream> #include<cmath> using namespace std; clas ...

  2. 学习tp5的第三天(模型)

    一.模型 1.定义基础模型 <?php namespace app\index\model; use think\Model; class User extends Model{ // 设置完整 ...

  3. 在Windows下编译mongo-c-driver 1.3.x

    在Windows下编译mongo-c-driver 1.3.x 在Windows下编译mongo-c-driver 1.3.x 1.安装 MSYS2https://sourceforge.net/pr ...

  4. Python学习 :面向对象 -- 类的成员

    类的成员 一.字段 - 字段可以分为'普通字段'和'静态字段'两种 - 普通字段(保存在对象中,执行时只能通过对象来进行访问) - 静态字段(保存在类中,在内存中只保存一份数据(可以有效地节约内存的空 ...

  5. 双端队列 ADT接口 链表实现

    Deque ADT接口 DEQUEUE.h: #include <stdlib.h> #include "Item.h" typedef struct DEQUEUEn ...

  6. 一道hive面试题:explode map字段

    需要找到每个学生最好的课程和成绩,最差的课程和成绩,以及各科的平均分 文本数据如下: name scores张三 语文:,数学:,英语:,历史:,政治:,物理:,化学:,地理:,生物: 李四 语文:, ...

  7. postgres-xl 安装与部署 【异常处理】ERROR: could not open file (null)/STDIN_***_0 for write, No such file or directory

    https://www.jianshu.com/p/82aaf352b772 这篇文章很不错,里面有个bug,可能是版本不对. 当前(2018-04-11)通过git 下载原代码时,在配置  pgxc ...

  8. C#——数据库取数据,DataGridView显示数据

    使用未封装的方法连接数据库 步骤: 一.确定连接方式(以SqlServer为例): ①Windows身份验证. string ConnectionType = "server=.;datab ...

  9. 安装虚拟机&Linux命令学习

    安装虚拟机&Linux命令学习 基于VirtualBox虚拟机安装Ubuntu 1.下载安装VirtualBox 根据自己电脑(32位操作系统)的实际情况,我在网上找了相应的VirtualBo ...

  10. 考研编程练习----m叉树先序和后序所包含的情况

    题目描述: We are all familiar with pre-order, in-order and post-order traversals of binary trees. A comm ...