编程范式，01.11.18

1线性查找函数的字符串泛型例程
以下演示了在指针数组里查找字符串的操作

char *note[]={"Ab", "F#", "B", "Gb", "b"};//定义了指向5个字符串常量的指针数组
char* favorite = "Eb";
char **found = lsearch(&favorite, notes, 5, sizeof (char*), StrCmp）；
int Strcmp(void*Vp1, void*Vp2);
{
 char* s1 = *(char**)Vp1;
 char* s2 = *(char**)Vp2;
 return strcmp(s1,s2);
 }

2数据结构栈型的纯C实现以及泛型化（1）

stack.h:
typedef struct{ 
	int *elems;
	int logicallen;
	int alloclength;
	}stack;
void StackNew(stack*s);
void StackDispose(stack*s);
void StackPush(Stack*s, int Value);
void StackPop(Stack*s);
stack.c:
创建栈
void StackNew(stack *s)
{
	s->logicallen=0;
	s->alloclength=4;
	s->elems=malloc(4 * sizeof(int));
	assert(s->elems！= NULL）；//保护
}
清除栈
void StackDispose(stack*s)
{
	free(s->elems);
};
压栈
void StackPush(stack*s, int value)
{
	if (s->logicallen == s->alloclength){ //长度不够时，自动扩充两倍
	s->alloclength * = 2;
	s->elems = realloc( s->elems, s->alloclength * sizeof(int) );
	assert(s->elems !=NULL);//保护
	}
	s->elems[s->logicallen] = value;
	s->logicallen++;
}
出栈
int StackPop(stack*s)
{
	assert(s->logicallen>0);
	s->logicallen--;
	return s->elems[s->logicallen];

下一次讲范型的实现