代码搜索：StackNode
找到约 208 项符合「StackNode」的源代码
代码结果 208
www.eeworm.com/read/299227/7875042
cpp linearstack2.cpp
// 链式堆栈的实现linearStack2.cpp
#include "linearStack2.h"
#include
//构造函数
LinStack::LinStack()
{top=NULL;size=0;}
//初始化栈,分配存储空间并置空
void LinStack::InitStack(int L)
{top=new StackNode[
www.eeworm.com/read/299227/7875048
h linearstack2.h
//链式堆栈的类定义linearStack2.h
const int LEN=40;
typedef struct Stack{
ElemType data;
struct Stack *next;
}StackNode;//结点数据类型
class LinStack
{private:
StackNode *top;//指向栈顶的指针
int size;// 堆
www.eeworm.com/read/398476/7944564
h stack.h
#define MAXCHILDREN 1000
#define MAXNODENUMBER 1000
#define MAXREG 1000
#define MaxLength 128
#define MaxTokenLength 32
#define MaxGrammar 256
#define Maxnode 256
////////////////////////////
www.eeworm.com/read/298538/7951813
cpp page106.cpp
#include
#include
#define NULL 0
template class Stack;
template class StackNode{
friend class Stack;
private:
Type data;
S
www.eeworm.com/read/396663/8096362
h stack.h
templateclass stack;
templateclass stackNode
{
private:
stackNode *next;
T element;
public:
stackNode(T data,stackNode *l){ element=data; next=l;
www.eeworm.com/read/195872/8125141
c puke.c
/***************************
作者：林宝尉
学号：计031_03
功能：用堆栈完成四人扑克对战
时间：2006.10.15 0:03
***************************/
#include
#include
#include
#include
#incl
www.eeworm.com/read/195872/8125148
c puke.c
/***************************
作者：林宝尉
学号：计031_03
功能：用堆栈完成四人扑克对战
时间：2006.10.15 0:03
***************************/
#include
#include
#include
#include
#incl
www.eeworm.com/read/328878/12996833
cpp stack.cpp
// 程 式 名: LinkStack.c
// 程式功能: 链栈的实现
// 功能描述: 置栈空、判栈空、压栈、出栈、取栈顶元素
// 置栈空
#include "stack.h"
void Initial(LinkStack *s)
{
s->top = 0;
}
// 判栈空
int IsEmpty(LinkStack *s)
{
return s->top
www.eeworm.com/read/327175/13096398
cpp p106.cpp
#include
#include
#define NULL 0
template class Stack;
template class StackNode{
friend class Stack;
friend ostream& operator
www.eeworm.com/read/242043/13097504
h linstack.h
#include
#include
template class LinStack; //前视定义,否则友元无法定义
template //模板类型为T
class StackNode
{
friend class LinStack; //定义类LinStack