代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/488496/6488098
cpp stack.cpp
/*
* This file contains code from "C++ Primer, Fourth Edition", by Stanley B.
* Lippman, Jose Lajoie, and Barbara E. Moo, and is covered under the
* copyright and warranty notices given in that
www.eeworm.com/read/488546/6489213
h stack.h
/* $Id: H:/drh/idioms/book/RCS/inter.doc,v 1.11 1997/02/21 19:42:15 drh Exp $ */
#ifndef STACK_INCLUDED
#define STACK_INCLUDED
#define T Stack_T
typedef struct T *T;
extern T Stack_new (void
www.eeworm.com/read/488546/6489250
c stack.c
static char rcsid[] = "$Id: H:/drh/idioms/book/RCS/inter.doc,v 1.11 1997/02/21 19:42:15 drh Exp $";
#include
#include "assert.h"
#include "mem.h"
#include "stack.h"
#define T Stack_T
www.eeworm.com/read/487368/6510780
c stack.c
#include
#include
#define Max 100
int *p;
int *tos;
int *bos;
/*添加一个数据放到堆栈对顶端*/
void push(int i)
{
if(p > bos)
{
printf("堆栈以满\n");
return;
}
*p = i;
p+
www.eeworm.com/read/487405/6511137
obj stack.obj
www.eeworm.com/read/487033/6522457
java stack.java
package wapide;
import java.lang.*;
import java.util.*;
/**
* A helper class that simulates a stack object.
* Copyright (c) 2003
* @author Mark Busman
* @version 1.0
*
* For Licens
www.eeworm.com/read/487037/6522773
cc stack.cc
#include
using namespace std;
typedef int T;
class List{
struct Node{
T data;
Node* next;
Node(const T& d):data(d),next(NULL){++cnt;}
~Node(){--cnt;}
static int cnt;
www.eeworm.com/read/486816/6530378
cpp stack.cpp
#include "Operater Declare.h"
Status InitStack(SqStack &S)
{
S.base=(SElemType *)malloc(STACK_INIT_SIZE*sizeof(SElemType));
if(!S.base)
{
exit(OVERFLOW);
}
S.top=S.base;
S.stacksi
www.eeworm.com/read/486816/6530388