代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/485014/6570706
class stack.class
www.eeworm.com/read/485014/6570712
java stack.java
// stack.java
// demonstrates stacks
// to run this program: C>java StackApp
////////////////////////////////////////////////////////////////
class StackX
{
private int maxSize; //
www.eeworm.com/read/485014/6570901
class stack.class
www.eeworm.com/read/484236/6582425
h stack.h
#include
using namespace std;
#define STACK_INIT_SIZE 100
#define STACKINCREMENT 20
#define OK 1
#define ERROR 0
#define OVERFLOW -2
typedef int Status;
template
www.eeworm.com/read/484236/6582427
cpp stack.cpp
#include
#include "stack.h"
using namespace std;
Status Stack::InitStack(){
base=new SElemType[STACK_INIT_SIZE];
if(!base) exit(OVERFLOW);
top=base;
stacksize=STACK_INI
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/483868/6596530
h stack.h
#ifndef _STACK_H
#define _STACK_H
struct Node;
typedef struct Node *PtrToNode;
typedef PtrToNode Stack;
typedef int ElmentType;
struct Node
{
ElmentType Elment;
PtrToNode Next;
};
v
www.eeworm.com/read/483868/6596531
c stack.c
#include
#include
#include "stack.h"
int IsEmpty(Stack S)
{
return S->Next==NULL;
}
void Pop(Stack S)
{
PtrToNode FirstCell;
if(IsEmpty(S))
printf("Empty stac
www.eeworm.com/read/483199/6611154
java stack.java
public interface Stack{
public void push(Object obj) throws Exception;
public Object pop() throws Exception;
public Object getTop() throws Exception;
public boolean notEmpty();
}
www.eeworm.com/read/482776/6611799
h stack.h
/*
*
* Copyright (c) 1994
* Hewlett-Packard Company
*
* Permission to use, copy, modify, distribute and sell this software
* and its documentation for any purpose is hereby granted without fee,