zoukankan      html  css  js  c++  java
  • C/C++ Basic the differs between [malloc&free] and [new &delete]

    1.basic concepts
        malloc&free  and new&delete are all used to request memory allocation and release memory allocated from heap area.
        eg.
        malloc.h must be referenced when using malloc&free
       i)
        int *array;
        array=(int *)malloc(4*sizeof(int));// declare an array which has four int elements
         ....
        free(array);//release the memory which is allocated to array.
      ii)
        int *array
        array=new int[4];
        ...
        delete[] array;
    all these two cases works the same. but what is their differs then? are they the same functioanlity? NO!

    2.diffs.
        we can only say that in some cases, they work the same.that is to say, we can use malloc&free to take place of new&delete. but this can not applied all the time.
        the main reason is :malloc will not invoke class construtor in C++, while new do. At the same time, free will not invoke destructor,while delete do.
        eg.
        class TDate
    {
        public:
           TDate()
            {
            month=1;
            day=1;
            year=1;
            printf("constructor is invoked");
            }
            ~TDate()
            {
            printf("destructor is invoked");
            }
        protected:
            int month;
            int day;
            int year;
    }

    case 1: use Malloc
            TDate *p;
            p=(TDate *)malloc(sizeof(TDate));//do not invoke constructor at all
            ...
            free(p);//do not invoke destructor at all
        in this case, the constructor of TDate will not be invoked. so all its memebers can not be initialized.

    case 2: use new
            TDate *p;
            p=new Tdate;//invoke constructor to initialize the instance
            ...
            delete p;//invoke destructor to release resource.

  • 相关阅读:
    java之获取变量的类型
    java中的++和--
    java(三)基础类型之间的转换
    golang数据结构之总结
    golang数据结构之树的三种遍历方式
    golang数据结构之散哈希表(Hash)
    golang数据结构之递归解决迷宫问题
    golang数据结构之利用栈求计算表达式(加减乘除)
    golang数据结构之栈
    golang数据结构之快速排序
  • 原文地址:https://www.cnblogs.com/Winston/p/1142392.html
Copyright © 2011-2022 走看看