C语言实现 vector( 动态数组)。
2010-09-30 10:39
232 查看
下面是2年前做项目时实现的一个动态数组，先后加入了好几个之后的项目，下面晒下代码。
头文件：
C文件：
头文件：
# ifndef __CVECTOR_H__ # define __CVECTOR_H__ # define MIN_LEN 256 # define CVEFAILED -1 # define CVESUCCESS 0 # define CVEPUSHBACK 1 # define CVEPOPBACK 2 # define CVEINSERT 3 # define CVERM 4 # define EXPANED_VAL 1 # define REDUSED_VAL 2 typedef void *citerator; typedef struct _cvector *cvector; # ifdef _cplusplus # define EXTERN_ extern "C" # else # define EXTERN_ extern # endif EXTERN_ cvector cvector_create (const size_t size ); EXTERN_ void cvector_destroy (const cvector cv ); EXTERN_ size_t cvector_length (const cvector cv ); EXTERN_ int cvector_pushback (const cvector cv, void *memb ); EXTERN_ int cvector_popback (const cvector cv, void *memb ); EXTERN_ size_t cvector_iter_at (const cvector cv, citerator iter ); EXTERN_ int cvector_iter_val (const cvector cv, citerator iter, void *memb); EXTERN_ citerator cvector_begin (const cvector cv ); EXTERN_ citerator cvector_end (const cvector cv ); EXTERN_ citerator cvector_next (const cvector cv, citerator iter ); EXTERN_ int cvector_val_at (const cvector cv, size_t index, void *memb ); EXTERN_ int cvector_insert (const cvector cv, citerator iter, void *memb); EXTERN_ int cvector_insert_at(const cvector cv, size_t index, void *memb ); EXTERN_ int cvector_rm (const cvector cv, citerator iter ); EXTERN_ int cvector_rm_at (const cvector cv, size_t index ); /* for test */ EXTERN_ void cv_info (const cvector cv ); EXTERN_ void cv_print (const cvector cv ); #endif /* EOF file cvector.h */
C文件：
# include <stdio.h>
# include <stdlib.h>
# include <string.h>
# include <unistd.h>
# define MIN_LEN 256
# define CVEFAILED -1
# define CVESUCCESS 0
# define CVEPUSHBACK 1
# define CVEPOPBACK 2
# define CVEINSERT 3
# define CVERM 4
# define EXPANED_VAL 1
# define REDUSED_VAL 2
typedef void *citerator;
typedef struct _cvector
{
void *cv_pdata;
size_t cv_len, cv_tot_len, cv_size;
} *cvector;
# define CWARNING_ITER(cv, iter, file, func, line) \
do {\
if ((cvector_begin(cv) > iter) || (cvector_end(cv) <= iter)) {\
fprintf(stderr, "var(" #iter ") warng out of range, "\
"at file:%s func:%s line:%d!!/n", file, func, line);\
return CVEFAILED;\
}\
} while (0)
# ifdef _cplusplus
# define EXTERN_ extern "C"
# else
# define EXTERN_ extern
# endif
EXTERN_ cvector cvector_create (const size_t size );
EXTERN_ void cvector_destroy (const cvector cv );
EXTERN_ size_t cvector_length (const cvector cv );
EXTERN_ int cvector_pushback (const cvector cv, void *memb );
EXTERN_ int cvector_popback (const cvector cv, void *memb );
EXTERN_ size_t cvector_iter_at (const cvector cv, citerator iter );
EXTERN_ int cvector_iter_val (const cvector cv, citerator iter, void *memb);
EXTERN_ citerator cvector_begin (const cvector cv );
EXTERN_ citerator cvector_end (const cvector cv );
EXTERN_ citerator cvector_next (const cvector cv, citerator iter );
EXTERN_ int cvector_val_at (const cvector cv, size_t index, void *memb );
EXTERN_ int cvector_insert (const cvector cv, citerator iter, void *memb);
EXTERN_ int cvector_insert_at(const cvector cv, size_t index, void *memb );
EXTERN_ int cvector_rm (const cvector cv, citerator iter );
EXTERN_ int cvector_rm_at (const cvector cv, size_t index );
/* for test */
EXTERN_ void cv_info (const cvector cv );
EXTERN_ void cv_print (const cvector cv );
cvector cvector_create(const size_t size)
{
cvector cv = (cvector)malloc(sizeof (struct _cvector));
if (!cv) return NULL;
cv->cv_pdata = malloc(MIN_LEN * size);
if (!cv->cv_pdata)
{
free(cv);
return NULL;
}
cv->cv_size = size;
cv->cv_tot_len = MIN_LEN;
cv->cv_len = 0;
return cv;
}
void cvector_destroy(const cvector cv)
{
free(cv->cv_pdata);
free(cv);
return;
}
size_t cvector_length(const cvector cv)
{
return cv->cv_len;
}
int cvector_pushback(const cvector cv, void *memb)
{
if (cv->cv_len >= cv->cv_tot_len)
{
void *pd_sav = cv->cv_pdata;
cv->cv_tot_len <<= EXPANED_VAL;
cv->cv_pdata = realloc(cv->cv_pdata, cv->cv_tot_len * cv->cv_size);
if (!cv->cv_pdata)
{
cv->cv_pdata = pd_sav;
cv->cv_tot_len >>= EXPANED_VAL;
return CVEPUSHBACK;
}
}
memcpy(cv->cv_pdata + cv->cv_len * cv->cv_size, memb, cv->cv_size);
cv->cv_len++;
return CVESUCCESS;
}
int cvector_popback(const cvector cv, void *memb)
{
if (cv->cv_len <= 0) return CVEPOPBACK;
cv->cv_len--;
memcpy(memb, cv->cv_pdata + cv->cv_len * cv->cv_size, cv->cv_size);
if ((cv->cv_tot_len >= (MIN_LEN << REDUSED_VAL))
&& (cv->cv_len <= (cv->cv_tot_len >> REDUSED_VAL)))
{
void *pd_sav = cv->cv_pdata;
cv->cv_tot_len >>= EXPANED_VAL;
cv->cv_pdata = realloc(cv->cv_pdata, cv->cv_tot_len * cv->cv_size);
if (!cv->cv_pdata)
{
cv->cv_tot_len <<= EXPANED_VAL;
cv->cv_pdata = pd_sav;
return CVEPOPBACK;
}
}
return CVESUCCESS;
}
size_t cvector_iter_at(const cvector cv, citerator iter)
{
CWARNING_ITER(cv, iter, __FILE__, __func__, __LINE__);
return (iter - cv->cv_pdata) / cv->cv_size;
}
int cvector_iter_val(const cvector cv, citerator iter, void *memb)
{
CWARNING_ITER(cv, iter, __FILE__, __func__, __LINE__);
memcpy(memb, iter, cv->cv_size);
return 0;
}
citerator cvector_begin(const cvector cv)
{
return cv->cv_pdata;
}
citerator cvector_end(const cvector cv)
{
return cv->cv_pdata + (cv->cv_size * cv->cv_len);
}
static inline void cvmemove_foreward(const cvector cv, void *from, void *to)
{
size_t size = cv->cv_size;
void *p;
for (p = to; p >= from; p -= size) memcpy(p + size, p, size);
return;
}
static inline void cvmemove_backward(const cvector cv, void *from, void *to)
{
memcpy(from, from + cv->cv_size, to - from);
return;
}
int cvector_insert(const cvector cv, citerator iter, void *memb)
{
CWARNING_ITER(cv, iter, __FILE__, __func__, __LINE__);
if (cv->cv_len >= cv->cv_tot_len)
{
void *pd_sav = cv->cv_pdata;
cv->cv_tot_len <<= EXPANED_VAL;
cv->cv_pdata = realloc(cv->cv_pdata, cv->cv_tot_len * cv->cv_size);
if (!cv->cv_pdata)
{
cv->cv_pdata = pd_sav;
cv->cv_tot_len >>= EXPANED_VAL;
return CVEINSERT;
}
}
cvmemove_foreward(cv, iter, cv->cv_pdata + cv->cv_len * cv->cv_size);
memcpy(iter, memb, cv->cv_size);
cv->cv_len++;
return CVESUCCESS;
}
int cvector_insert_at(const cvector cv, size_t index, void *memb)
{
citerator iter;
if (index >= cv->cv_tot_len)
{
cv->cv_len = index + 1;
while (cv->cv_len >= cv->cv_tot_len) cv->cv_tot_len <<= EXPANED_VAL;
cv->cv_pdata = realloc(cv->cv_pdata, cv->cv_tot_len * cv->cv_size);
iter = cv->cv_pdata + cv->cv_size * index;
memcpy(iter, memb, cv->cv_size);
}
else
{
iter = cv->cv_pdata + cv->cv_size * index;
cvector_insert(cv, iter, memb);
}
return 0;
}
citerator cvector_next(const cvector cv, citerator iter)
{
return iter + cv->cv_size;
}
int cvector_val(const cvector cv, citerator iter, void *memb)
{
memcpy(memb, iter, cv->cv_size);
return 0;
}
int cvector_val_at(const cvector cv, size_t index, void *memb)
{
memcpy(memb, cv->cv_pdata + index * cv->cv_size, cv->cv_size);
return 0;
}
int cvector_rm(const cvector cv, citerator iter)
{
citerator from;
citerator end;
CWARNING_ITER(cv, iter, __FILE__, __func__, __LINE__);
from = iter;
end = cvector_end(cv);
memcpy(from, from + cv->cv_size, end - from);
cv->cv_len--;
if ((cv->cv_tot_len >= (MIN_LEN << REDUSED_VAL))
&& (cv->cv_len <= (cv->cv_tot_len >> REDUSED_VAL)))
{
void *pd_sav = cv->cv_pdata;
cv->cv_tot_len >>= EXPANED_VAL;
cv->cv_pdata = realloc(cv->cv_pdata, cv->cv_tot_len * cv->cv_size);
if (!cv->cv_pdata)
{
cv->cv_tot_len <<= EXPANED_VAL;
cv->cv_pdata = pd_sav;
return CVERM;
}
}
return CVESUCCESS;
}
int cvector_rm_at(const cvector cv, size_t index)
{
citerator iter;
iter = cv->cv_pdata + cv->cv_size * index;
CWARNING_ITER(cv, iter, __FILE__, __func__, __LINE__);
return cvector_rm(cv, iter);
}
void cv_info(const cvector cv)
{
printf("/n/ntot :%s : %d/n", __func__, cv->cv_tot_len);
printf("len :%s : %d/n", __func__, cv->cv_len);
printf("size:%s : %d/n/n", __func__, cv->cv_size);
return;
}
void cv_print(const cvector cv)
{
int num;
citerator iter;
if (cvector_length(cv) == 0)
fprintf(stderr, "file:%s func:%s line:%d error, null length cvector!!/n", __FILE__, __func__, __LINE__);
for (iter = cvector_begin(cv);
iter != cvector_end(cv);
iter = cvector_next(cv, iter))
{
cvector_iter_val(cv, iter, &num);
printf("var:%d at:%d/n", num, cvector_iter_at(cv, iter));
}
return;
}
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- C语言实现 vector( 动态数组) 改进版
- C语言实现 vector( 动态数组)
- 层序遍历二叉树（不借助vector或deque，用C语言实现）
- PAT考试乙级1050(C语言实现) （重点题目）（按格式读取，使用容器vector）
- 【CS107】Assignment 3 C语言中vector与hashset的实现
- Stanford公开课Programming Paradigms----assignment 3--C语言中vector与hashset的实现
- C语言实现使用动态数组实现循环队列
- STL vector 动态数组实现
- c语言实现vector实例
- c语言实现vector实例
- 使用C语言实现vector动态数组的实例分享
- C语言堆栈实现( 动态数组 )
- C语言实现 vector
- C语言实现类似C++的容器vector
- C语言队列实现( 动态数组 )
- 使用nodejs实现类似于C语言的scanf输入一个动态数组
- C语言 动态数组实现
- C语言实现类似于C++的Vector容器
- 用C语言实现常见的三种中文内码转换
- C语言面向对象的实现