跟着动手，泛型编程从未如此简单1_componentresourcemanager<t> 泛型-CSDN博客

本文链接：https://blog.csdn.net/weixin_41113594/article/details/78909946

跟着动手，知行泛型编程

实现一个只支持int类型的Stack

Stack是一个先进后出的队列，接下来我们先从实现一个整型数据的Stack开始

stack.h定义：

class Stack{
    public:
        int m_nLogicLen;                     //栈的实际长度
        int m_nAssignLen;                    //栈分配的空间的长度
        int *m_pElementBuffer;               //栈中数据的存放空间地址
    public:
        Stack();
        ~Stack();
    public:
        bool StackPush(int element);        //入栈
        int StackPop();                     //出栈
};

stack.cpp

#include "Stack.h"
Stack::Stack(){
    m_nLogicLen = 0;                      //初始栈的长度为0
    m_nAssignLen = 4;                     //初始栈分配的空间大小为4*sizeof(int)
    m_pElementBuffer = (int*)malloc(this->m_nAssignLen * sizeof(int));
}
Stack::~Stack(){
    free(this->m_pElementBuffer);
}
/*
* @brief 向栈中添加一个元素
* @element 添加的元素
* @return true成功，false失败
*/
bool Stack::StackPush( const int element){
    //如果内存初始化分配内存满了
    if( this->m_nLogicLen == this->m_nAssignLen){
        //内存增长策略为：每次在原先基础上扩大一倍
        this->m_nAssignLen  = this->m_nAssignLen * 2;
        this->m_pElementBuffer = (int*) realloc(this->m_pElementBuffer,this->m_nAssignLen * sizeof(int));
        //printf("address: %p", this->m_pElementBuffer);
        assert(m_pElementBuffer != NULL);
    }
    //入栈
    printf("push: %d\n",element);
    this->m_pElementBuffer[m_nLogicLen] = element;
    m_nLogicLen++;
    return true;
}
/*
* @brief 元素出栈
* @return int 出栈的元素
*/
int Stack::StackPop(){
    if( this->m_nLogicLen >= 0){
        int element = this->m_pElementBuffer[this->m_nLogicLen-1];
        this->m_nLogicLen --;
        return element;
    }
    else{
        printf("the stack is empty!\n");
        return -1;
    }
}