代码搜索：InitStack
找到约 954 项符合「InitStack」的源代码
代码结果 954
www.eeworm.com/read/364026/9925021
cpp o.cpp
#include
#include
#include"o.h"
void stack1::InitStack(Stack& S,int ms)
{
S.stack=new Mg [ms];
if(!S.stack)
{
cerr
www.eeworm.com/read/464867/7061540
cpp stack.cpp
void InitStack(SqStack &S)
{
S.base =(SElemType*)malloc(sizeof(SElemType)*STACK_INIT_SIZE);
if(!S.base )
exit(OVERFLOW);
S.top =S.base ;
S.stacksize =STACK_INIT_SIZE;
}
void DestroyStack
www.eeworm.com/read/458949/7284967
c stackdouble.c
#define TRUE 1
#define FALSE 0
#define STACK_SIZE 50 /*stack at most 50 elem*/
#define TYPE float
typedef struct {
TYPE elem[STACK_SIZE];
int top;
}seqstack1;
void Initstack1(seqst
www.eeworm.com/read/447789/7545594
cpp stack.cpp
#include
#include
#include "../header/bitree.h"
#include "../header/queue.h"
#include "../header/stack.h"
#include "../header/expr.h"
Status InitStack( SqStack &S )
{
S.b
www.eeworm.com/read/444723/7608008
cpp 1.cpp
#include
#include
typedef Struct
{
int *base;
int *top;
int stacksize;
}SqStack;
void initstack(SqStack *S)
{
S->base=(int*)malloc(100*sizeof(int));
S->top=S->base;
www.eeworm.com/read/484417/6587664
h stack.h
typedef struct Node1
{
char ch;
struct Node1 *Next;
}Optr,*LinkOptr;//运算符栈
typedef struct Node
{
int num;
struct Node *Next;
}Opnd,*LinkOpnd;//运算数栈
void InitStack(LinkOptr *S)
www.eeworm.com/read/221562/14737556
cpp stack.cpp
#include
#include
#include "../header/bitree.h"
#include "../header/queue.h"
#include "../header/stack.h"
#include "../header/expr.h"
Status InitStack( SqStack &S )
{
S.b
www.eeworm.com/read/182642/6840487
cpp stack.cpp
#include
#include "stack.h"
void InitStack(SeqStack *S)
{//将顺序栈置空
S->top = -1;
}
int StackEmpty(SeqStack *S)
{
return S->top == -1;
}
int StackFull(SeqStack *S)
{
re
www.eeworm.com/read/393250/8302233
txt 3.15.txt
//只可存size-1个数！！！！！
Status InitStack(TwoWayStack &tws, int size)
{
tws.size=size;
tws.elem=(SElemType *)malloc(size*sizeof(SElemType));
tws.top[0]=0;
tws.top[
www.eeworm.com/read/393250/8302451
txt 3.21.txt
char *RPExpression(char *e)
/* 返回表达式e的逆波兰式 */
{
int i=0,j=0;
char * a,temp;
a=(char*)malloc((strlen(e)+1)*sizeof(char));
Stack s;
InitStack(s);
while(e[i]!='\0'){