自学教程：C++ stack_init函数代码示例

/*** open parts that may cause memory-allocation errors*/static void f_luaopen (lua_State *L, void *ud) {  global_State *g = G(L);  UNUSED(ud);  stack_init(L, L);  /* init stack */  sethvalue(L, gt(L), luaH_new(L, 0, 2));  /* table of globals */  sethvalue(L, registry(L), luaH_new(L, 0, 2));  /* registry */  luaS_resize(L, MINSTRTABSIZE);  /* initial size of string table */  luaT_init(L);  luaX_init(L);  luaS_fix(luaS_newliteral(L, MEMERRMSG));  g->GCthreshold = 4*g->totalbytes;}

/*** open parts of the state that may cause memory-allocation errors.** ('g->version' != NULL flags that the state was completely build)*/static void f_luaopen (lua_State *L, void *ud) {  global_State *g = G(L);  UNUSED(ud);  stack_init(L, L);  /* init stack */  init_registry(L, g);  luaS_init(L);  luaT_init(L);  luaX_init(L);  g->gcrunning = 1;  /* allow gc */  g->version = lua_version(NULL);  luai_userstateopen(L);}

int main(void) {    tlsf_create_with_pool(_tlsf_heap, sizeof(_tlsf_heap));    printf("%s started/n", APPLICATION_NAME);    xtimer_init();    msg_init_queue(main_msg_queue, MAIN_MSG_QUEUE_SIZE);    netdev_init();    stack_init();    exp_run();    printf("%s stopped/n", APPLICATION_NAME);    return 0;}

int main(int argc, const char **argv){  int opt;#if 0  if (argc != 2)    {      fprintf(stderr, "Usage: motlle `smottle`/n");      exit(2);    }  sscanf(argv[1], "%p", &load_address);#endif  for (;;)    switch (getopt(argc, argv, "+d"))      {      case 'd':	debug_lvl = 2;	break;      case '?':	break;      case -1:	goto done;      } done:  signal(SIGALRM, silly_sig);  garbage_init();  interpret_init();  stack_init();  runtime_init();  call_init();  parser_init();  compile_init();  mcompile_init();  context_init();  ports_init();  if (optind < argc)    make_global_state(argc - optind, argv + optind);  else    make_global_state(0, NULL);  mudio_init();  print_init();  if (optind < argc)    mload(argv[optind]);  else    push_repl();  for (;;)    motlle_run1();}

uint32_t *ets_terms_copy_non_recursive_N(term_t *terms, int num,								uint32_t *htop, t_proc_bin_t **pbs){	uint32_t cradle[256];	stack_t st;	stack_init(&st, WSIZE(ets_deferred_copy_t), cradle, 256);	uint32_t *last_htop = terms_copy(&st, terms, num, htop, pbs);	stack_done(&st);	return last_htop;}

static stack *get_saved_pos(void){	static stack st;	static stack *s;	if (s == NULL) {		s = &st;		stack_init(s, NULL);	}	return s;}

int bst_postOrder(const BisTree *pTree, BNode *pStartNode, Queue *qPostorder) {		BNode *pNode;	BNode *pLeftChild, *pRightChild;	Stack stNodesA, stNodesB;		if (pStartNode == 0 || qPostorder == 0)		return -1;		pNode = 0;	pLeftChild = pRightChild = 0;	stack_init(&stNodesA, 0);	stack_init(&stNodesB, 0);	stack_push(&stNodesA, (const void *) pStartNode);		while (stack_size(&stNodesA) > 0) {				stack_pop(&stNodesA, (void **) &pNode);		stack_push(&stNodesB, (const void *) pNode);				pLeftChild = bst_leftChild((const BNode *) pNode);		pRightChild = bst_rightChild((const BNode *) pNode);				if (pLeftChild != 0) {			stack_push(&stNodesA, (const void *) pLeftChild);		}		if (pRightChild != 0) {			stack_push(&stNodesA, (const void *) pRightChild);		}	}		while (stack_size(&stNodesB) > 0) {		stack_pop(&stNodesB, (void **) &pNode);		queue_enqueue(qPostorder, (const void *) pNode);	}		stack_destroy(&stNodesA);	stack_destroy(&stNodesB);	return 0;}

int main(){	Stack pe, *pe1;	PilaFloat pilaFloat, *pFloat1;	init(&pilaFloat);	stack_init(&pe);	stack_push(&pe, (void*)10);	stack_push(&pe, (void*)9);	stack_push(&pe, (void*)8);	stack_push(&pe, (void*)7);	stack_push(&pe, (void*)6);	stack_push(&pe, (void*)5);	stack_push(&pe, (void*)4);	stack_push(&pe, (void*)3);	stack_push(&pe, (void*)2);	stack_push(&pe, (void*)1);	stack_push(&pe, (void*)0);	stack_push(&pe, (void*)-1);	stack_push(&pe, (void*)-2);	stack_push(&pe, (void*)-3);	stack_push(&pe, (void*)-4);	push(&pilaFloat, 10.0);	push(&pilaFloat, 9.0);	push(&pilaFloat, 8.0);	push(&pilaFloat, 7.0);	push(&pilaFloat, 6.0);	push(&pilaFloat, 5.0);	push(&pilaFloat, 4.0);	push(&pilaFloat, 3.0);	push(&pilaFloat, 2.0);	push(&pilaFloat, 1.0);	push(&pilaFloat, 0.0);	push(&pilaFloat, -1.0);	push(&pilaFloat, -2.0);	push(&pilaFloat, -3.0);	push(&pilaFloat, -4.0);	pe1 = &pe;	pFloat1 = &pilaFloat;	mulPilaPila(&pe, pe1);	mulPilaPilaF(&pilaFloat, pFloat1);	while(!stack_empty(&pe)){				printf("%d %f/n", (int)stack_top(&pe), tope(&pilaFloat));		//printf("OK/n");		pop(&pilaFloat);		stack_pop(&pe, 0);	}				return 0;}

/** *	/ingroup time *  TM_AddOneSecond z
C++ stack_is_empty函数代码示例
C++ stack_get函数代码示例