void *elems; //棧底指針int loglen; //已經使用的長度int alloclen; //已經申請的長度int elemSize; //單個元素的長度
assert(elemSize > 0);s->elemSize = elemSize;s->loglen = 0;s->alloclen = 4;s->elems = malloc(4 *elemSize);assert(s->elems != NULL);
if (s->loglen == s->alloclen){StackGrow(s);}void *target = (char *)(s->elems) + loglen * (s->elemSize);memcpy(target, elemAdd, s->elemSize);s->loglen++;
void *source = (char*)(s->elems) + (s->loglen - 1 ) *(s->elemSize);memcpy(elempop, source, s->elemSize);s->loglen--;
簡單測試
#include <iostream>
#include <string>
using namespace std;
class Student
{
public:
int id;
string name;
Student(){}
Student(int i,char* n)
{
id = i;
name = n;
}
};
int main()
{
stack s;
StackNew(&s,sizeof(Student));
Student *stu1 = new Student(1,"張三");
StackPush(&s,stu1);
Student stu2;
StackPop(&s,&stu2);
cout<<stu2.name<<endl;
delete stu1;
stu1 = 0;
return 0;
}