C语言实现 栈

#define STACK_TPYE char
#define STACK_LENGTH 512
#define CUSTOM_STACK_NAME myself_stack

struct stack
{
	STACK_TPYE custom_stack[STACK_LENGTH];
	int  stack_top;
	void (*stack_push)(struct stack * obj_stack,STACK_TPYE input);
	STACK_TPYE (*stack_pop)(struct stack * obj_stack);
	int (*is_stack_empty)(struct stack * obj_stack);
	int (*is_stack_full)(struct stack * obj_stack);
};

void stack_push(struct stack * obj_stack,STACK_TPYE input);
STACK_TPYE stack_pop(struct stack * obj_stack);
int is_stack_empty(struct stack * obj_stack);
int is_stack_full(struct stack * obj_stack);

struct stack CUSTOM_STACK_NAME = {
	.custom_stack=0,
	.stack_top=0,
	.stack_push=stack_push,
	.stack_pop=stack_pop,
	.is_stack_empty=is_stack_empty,
	.is_stack_full=is_stack_full
};

void stack_push(struct stack * obj_stack,STACK_TPYE input)
{
	obj_stack->custom_stack[obj_stack->stack_top++]=input;
}
STACK_TPYE stack_pop(struct stack * obj_stack)
{
	return obj_stack->custom_stack[--obj_stack->stack_top];
}
int is_stack_empty(struct stack * obj_stack)
{
	return obj_stack->stack_top == 0;
}
int is_stack_full(struct stack * obj_stack)
{
	return (obj_stack->stack_top - 1) == STACK_LENGTH;
}

int main()
{
	CUSTOM_STACK_NAME.stack_push(&CUSTOM_STACK_NAME,'a');
	CUSTOM_STACK_NAME.stack_push(&CUSTOM_STACK_NAME,'b');
	printf("%c",CUSTOM_STACK_NAME.stack_pop(&CUSTOM_STACK_NAME));
	printf("%c",CUSTOM_STACK_NAME.stack_pop(&CUSTOM_STACK_NAME));

	return 0;
}