代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/176999/9477346
s stack.s
;/****************************************Copyright (c)**************************************************
;** 广州周立功单片机发展有限公司
;** 研
www.eeworm.com/read/373028/9477571
java stack.java
public class Stack {
private java.util.ArrayList pool = new java.util.ArrayList();
public Stack() {
}
public Stack(int n) {
pool.ensureCapacity(n);
}
public void
www.eeworm.com/read/372878/9489159
s stack.s
;;; Copyright ARM Ltd 2001. All rights reserved.
AREA Stacks, DATA, NOINIT
EXPORT UserStack
EXPORT SVCStack
EXPORT UndefStack
EXPORT IRQStack
www.eeworm.com/read/176642/9489315
s stack.s
;/****************************************Copyright (c)**************************************************
;** 广州周立功单片机发展有限公司
;** 研
www.eeworm.com/read/176642/9489345
o stack.o
www.eeworm.com/read/372762/9494300
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/372509/9506034
h stack.h
//stack.h
#ifndef STACK
#define STACK
struct Node{
int a;
Node* next;
};
class Stack{
public:
Stack();
~Stack();
void Put(int item);
int Get();
protected:
Node* head;
www.eeworm.com/read/372509/9506055
cpp stack.cpp
//stack.cpp
#include "stack.h"
#include
#include
Stack::Stack():head(NULL){}
void Stack::Put(int item)
{
Node* p = new Node;
p->a = item;
p->next = head;
www.eeworm.com/read/372507/9507130
h stack.h
// file stack.h
// formula-based stack
#ifndef Stack_
#define Stack_
#include "xcept.h"
template
class Stack {
// LIFO objects
public:
Stack(int MaxStackSize = 10);
www.eeworm.com/read/372507/9507170
cpp stack.cpp
// test formula based stack class
#include
#include "stack.h"
void main(void)
{
int x;
Stack S(3);
try {S.Add(1).Add(2).Add(3).Add(4);}
catch (NoMem) {