从这里:
A tidy little C implementation of stretchy buffers (aka C++ vectors)代码的描述说明了这一点:
declare an empty buffer with something like ‘mytype myarray = NULL’,and then use the sb() functions to manipulate; read/write individual elements by indexing as usual
我应该这样说,我只知道一点C,这实际上是未知的领域.我从来没有使用过双指针,void指针或任何内存函数,如realloc.有人可以用简单的英语解释这段代码中发生的事情吗?它使用了许多我不理解的花哨的宏定义,这让我想知道它的外观是什么样的.
代码:
// stretchy buffer // init: NULL // free: sbfree() // push_back: sbpush() // size: sbcount() // #define sbfree(a) ((a) ? free(stb__sbraw(a)),0 : 0) #define sbpush(a,v) (stb__sbmaybegrow(a,1),(a)[stb__sbn(a)++] = (v)) #define sbcount(a) ((a) ? stb__sbn(a) : 0) #define sbadd(a,n) (stb__sbmaybegrow(a,n),stb__sbn(a)+=(n),&(a)[stb__sbn(a)-(n)]) #define sblast(a) ((a)[stb__sbn(a)-1]) #include <stdlib.h> #define stb__sbraw(a) ((int *) (a) - 2) #define stb__sbm(a) stb__sbraw(a)[0] #define stb__sbn(a) stb__sbraw(a)[1] #define stb__sbneedgrow(a,n) ((a)==0 || stb__sbn(a)+n >= stb__sbm(a)) #define stb__sbmaybegrow(a,n) (stb__sbneedgrow(a,(n)) ? stb__sbgrow(a,n) : 0) #define stb__sbgrow(a,n) stb__sbgrowf((void **) &(a),(n),sizeof(*(a))) static void stb__sbgrowf(void **arr,int increment,int itemsize) { int m = *arr ? 2*stb__sbm(*arr)+increment : increment+1; void *p = realloc(*arr ? stb__sbraw(*arr) : 0,itemsize * m + sizeof(int)*2); assert(p); if (p) { if (!*arr) ((int *) p)[1] = 0; *arr = (void *) ((int *) p + 2); stb__sbm(*arr) = m; } }