代码搜索：InitStack
找到约 954 项符合「InitStack」的源代码
代码结果 954
www.eeworm.com/read/369421/9649007
cpp initstack.cpp
//InitStack.cpp
//This program is to initialize a stack
# include
# include
# include
# define STACK_INIT_SIZE 100
# define STACKINCREMENT 10
# define OK 1
#
www.eeworm.com/read/221360/14743738
o post_initstack.o
www.eeworm.com/read/221360/14743764
s post_initstack.s
IMPORT StackSvc
IMPORT StackIrq
IMPORT StackFiq
IMPORT StackAbt
IMPORT StackUnd
IMPORT StackUsr
EXPORT init_Stack
AREA init_Stack, CODE, READONLY
;Set IRQ mode(IR
www.eeworm.com/read/208910/15233033
s post_initstack.s
IMPORT StackSvc
IMPORT StackIrq
IMPORT StackFiq
IMPORT StackAbt
IMPORT StackUnd
IMPORT StackUsr
EXPORT init_Stack
AREA init_Stack, CODE, READONLY
;Set IRQ mode(IR
www.eeworm.com/read/362558/9992946
c 3.5.c
void InitStack(DqStack *S)
{
S->top[0]=-1;
S->top[1]=M;
}
www.eeworm.com/read/122677/14675814
c path123.c
#define max 10
#define increment 5
int net[max][max],x,NUM;
struct stack
{int e[max];
int top;
int stacksize;
};
Initstack(struct stack *p)
{p->top=-1;
p->stacksize=
www.eeworm.com/read/180141/9318432
c 1-2-2.c
/*中国系统分析员顾问团，http://www.csai.cn*/
/*程序员下午考试指南书籍源码*/
#include
#include
#define MAXSIZE 32
typedef struct {
int *elem; /*栈的存储区*/
int max; /*栈的容量，即栈中最多能存放的元素个数*/
www.eeworm.com/read/161836/10366679
c main.c
#include
#include
#include
#include"definition.h"
int main()
{
SqStack Optr, Opnd, tmp;
int a, e, i, j, flag;
if( InitStack(&Optr) ){//运算符栈
printf("创建堆栈失败。
www.eeworm.com/read/351570/10639566
cpp algo0713.cpp
Status TopologicalOrder(ALGraph G, Stack &T) { // 算法7.13
// 有向网G采用邻接表存储结构，求各顶点事件的最早发生时间ve(全局变量)。
// T为拓扑序列定点栈，S为零入度顶点栈。
// 若G无回路，则用栈T返回G的一个拓扑序列，且函数值为OK，否则为ERROR。
Stack S;int count=0,k;