代码搜索:InitStack
找到约 954 项符合「InitStack」的源代码
代码结果 954
www.eeworm.com/read/327998/13052746
cpp subinform.cpp
#include"Tree.h"
void addmember(List* &head,memberTree * &root,int n)
{
Stack S=InitStack();
memberTree *s=new memberTree;
s->parent=NULL;
s->child=NULL;
s->brother=NULL;
www.eeworm.com/read/319133/13459756
txt shuzhizhuanhuan.txt
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10
typedef struct{
int *base;
int *top;
int stacksize;
}SqStack;
InitStack(SqStack *s)
{s->base=(int*)malloc(STACK_INIT_SIZE*siz
www.eeworm.com/read/17254/728589
s startup.s
PRESERVE8
AREA START, CODE, READONLY
ENTRY
CODE32
GET 2440addr.inc
IMPORT InitPLL
IMPORT InitBank
IMPORT InitStack
IMPORT InitRORWZI
IMPORT IRQ_Dispatch
IMPORT Main
IMPO
www.eeworm.com/read/380561/9142627
cpp stackfortree.cpp
#include "stdafx.h"
#include
#include
#include
#include "..\\header\\Bitree.h"
Status InitStack(SqStack &S)
{
S.base = (BiTNode*)malloc(sizeof(BiTNode) *
www.eeworm.com/read/397820/8020159
txt 车厢调度3.cpp.txt
#include
#define MaxLen 100
struct snode{
int data[MaxLen];
int top;
}s;//定义一个栈指针
int n;//定义输入序列总个数
void Initstack()
{
s.to
www.eeworm.com/read/397820/8020165
cpp 车厢调度4.cpp
#include
#define MaxLen 100
struct snode{
int data[MaxLen];
int top;
}s;//定义一个栈指针
int n;//定义输入序列总个数
void Initstack()
{
s.to
www.eeworm.com/read/400698/11570170
cpp 调度.cpp
#include
#include
int n;
int path[45];
struct pathss{
int paths[45][45];
int number;
}AllPath;
struct SNode{
int data[45];
int top;
}S;
void InitStack
www.eeworm.com/read/113786/15447894
cpp 后缀表达式求值.cpp
#include
#include
#include
const stack MaxSize=50;
typedef float ElemType;
#include "stack.h"
float Compute(char *str)
{
Stack S;
InitStack(S);
istrstrea
www.eeworm.com/read/391453/8403191
txt 表达式求解.txt
#include
#include
#define STACK_INIT_SIZE 100
#define STACK_INCREMENT 10
typedef struct {
char *base;
char *top;
int stacksize;
} stack; //字符栈
void InitStack(sta
www.eeworm.com/read/380187/9158214
cpp sqstack.cpp
#include
#include
#include "../header/SqStack.h"
Status InitStack(SqStack &S)
{
S.base = (SElemType*)malloc(sizeof(SElemType) * STACK_INIT_SIZE);
if(!S.base) exit(OVER