/* Generic Vector in C */ /* by baptiste prunier */ /* If you have any questions, if you pinpoint a bug or something badly done, or if you have ideas of improvement, I'll be glad to hear them :) */ #include #include /* part to be hidden in vector.c*/ #define VEC_DEFAULT_SIZE 5 /* define to a small value for test purpose */ struct _Vector_{ void **tab; unsigned long space; unsigned long size; unsigned long begin; unsigned long current; void (*free)(void *); }; /* ---------- */ /* Header file */ typedef void* Vector; Vector newVector(); int setFreeCallBackVector(Vector v,void (*yourFree)(void *)); int deleteVector(Vector v); int pushBackVector(Vector v, void * value); int pushFrontVector(Vector v, void* value); void * popBackVector(Vector v); void * popFrontVector(Vector v); int initIteratorFrontVector(Vector v); void * nextIteratorVector(Vector v); unsigned long lenVector(Vector v); void * getVector(Vector v,unsigned long id); void * setVector(Vector v,void * value, unsigned long id); int initIteratorBackVector(Vector v); void * prevIteratorVector(Vector v); /* ---------------- */ Vector newVector(){ struct _Vector_ * v = (struct _Vector_*)malloc(sizeof(*v)); if(v){ v->tab = (void**)malloc(VEC_DEFAULT_SIZE*sizeof(*(v->tab))); if(v->tab){ v->begin=0; v->size=0; v->space=VEC_DEFAULT_SIZE; v->current=VEC_DEFAULT_SIZE; v->free=free; }else{ free(v); v=NULL; } } return (Vector)v; } int setFreeCallBackVector(Vector v,void (*yourFree)(void *)){ int error = 1; if(v){ ((struct _Vector_*)v)->free=yourFree; error=0; } return error; } int deleteVector(Vector v){ int error = 1; unsigned long i; struct _Vector_ * vec = (struct _Vector_*)v; if(v){ error = 2; if(vec->tab){ error=0; if(vec->free){ for(i = vec->begin; i < vec->begin + vec->size; ++i){ vec->free(vec->tab[i]); } } free(vec->tab); } free(v); error = 0; } return error; } int pushBackVector(Vector v, void * value){ struct _Vector_* vec =(struct _Vector_*)v; void ** tmp; int error = 1; int i; if(v && value){ if(vec->size >= vec->space){ tmp=(void**)malloc((vec->space<<1)*sizeof(*tmp)); if(tmp){ vec->space<<=1; error=0; for(i=0; isize; ++i){ tmp[i]=vec->tab[i]; } free(vec->tab); vec->tab=tmp; vec->tab[vec->size]=value; ++vec->size; } }else{ error=0; if(vec->begin && vec->begin+vec->size>=vec->space){ for(i = 0; isize; ++i){ vec->tab[i]=vec->tab[i+vec->begin]; } vec->begin=0; } vec->tab[vec->begin+vec->size]=value; ++vec->size; } } return error; } int pushFrontVector(Vector v, void* value){ struct _Vector_ * vec =(struct _Vector_*)v; void ** tmp; int i; int error = 0; if(v && value){ if(vec->size>=vec->space){ tmp=(void**)malloc((vec->space<<1)*sizeof(*tmp)); if(tmp){ vec->space<<=1; for(i=0;isize;++i){ tmp[i+1]=vec->tab[i]; } tmp[0]=value; free(vec->tab); vec->tab=tmp; ++vec->size; error=0; } }else{ error=0; if(vec->begin){ --vec->begin; ++vec->size; vec->tab[vec->begin]=value; }else{ for(i=vec->size; i; --i){ vec->tab[i]=vec->tab[i-1]; } vec->tab[0]=value; ++vec->size; } } } return error; } void * popBackVector(Vector v){ struct _Vector_ * vec =(struct _Vector_*)v; void * res = NULL; if(v && vec->size){ --vec->size; res=vec->tab[vec->begin+vec->size]; } return res; } void * popFrontVector(Vector v){ struct _Vector_ * vec =(struct _Vector_*)v; void * res = NULL; if(v && vec->size){ res=vec->tab[vec->begin]; ++vec->begin; --vec->size; } return res; } int initIteratorFrontVector(Vector v){ struct _Vector_ * vec =(struct _Vector_*)v; int error = 1; if(v && vec->size){ vec->current = vec->begin; error = 0; } return error; } void * nextIteratorVector(Vector v){ struct _Vector_ * vec =(struct _Vector_*)v; void * res = NULL; if(v && vec->current>=vec->begin && vec->currentbegin+vec->size){ res = vec->tab[vec->current]; ++vec->current; } return res; } unsigned long lenVector(Vector v){ unsigned long res=0; if(v){ res=((struct _Vector_ *)v)->size; } return res; } void * getVector(Vector v,unsigned long id){ void * res = NULL; struct _Vector_ * vec =(struct _Vector_*)v; if(v && vec->size > id){ res=vec->tab[vec->begin+id]; } return res; } void * setVector(Vector v,void * value,unsigned long id){ struct _Vector_ * vec =(struct _Vector_*)v; void * old = NULL; if(v && value && idsize){ old = vec->tab[vec->begin+id]; vec->tab[vec->begin+id]=value; } return old; } int initIteratorBackVector(Vector v){ struct _Vector_ * vec =(struct _Vector_*)v; int error = 1; if(v && vec->size){ vec->current = vec->begin+vec->size-1; error = 0; } return error; } void * prevIteratorVector(Vector v){ struct _Vector_ * vec =(struct _Vector_*)v; void * res = NULL; if(v && vec->current>=vec->begin && vec->currentbegin+vec->size){ res = vec->tab[vec->current]; --vec->current; } return res; } void fill_vect(Vector v){ int i; int *p; for(i = 0; i<10; ++i){ p=(int*)malloc(sizeof(*p)); *p=i; pushBackVector(v,p); } for(i=0;i<10;++i){ p=(int*)malloc(sizeof(*p)); *p=i; pushFrontVector(v,p); } } int main(){ int * p; int i; Vector v=newVector(); if(v){ /* Test push */ fill_vect(v); puts("|------ push test ------|"); printf("Size == %d\n\n",lenVector(v),lenVector(v)); printf("v[19] == %d\n",*(int*)getVector(v,19)); /* Test pop */ puts("\n|------ pop test ------|"); while(lenVector(v)){ if(lenVector(v)%2){ p=(int*)popBackVector(v); }else{ p=(int*)popFrontVector(v); } if(p){ printf("%d\n",*p); free(p); }else{ puts("Allocation error"); } } printf("0 - 0? %x - %x\n",popBackVector(v),popFrontVector(v)); fill_vect(v); /* ------ */ /* Test get/set */ puts("\n|------ get/set test ------|"); puts("Only errors are printed"); for(i=0;i

C container : Vector (generic)