代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/338984/12268598
java stack.java
package association.fptree;
/**
* 堆栈
* @author qjt
* 当将某类型数据放入堆栈又
* 取出后，应该将取出的Object类型Downcast回原来类型
*
*/
class Stack{
Elem top;
void push(Object obj){
Elem temp;
temp=to
www.eeworm.com/read/338621/12291479
o stack.o
www.eeworm.com/read/338621/12291645
s stack.s
;;; Copyright ARM Ltd 2001. All rights reserved.
AREA Stacks, DATA, NOINIT
EXPORT top_of_stacks
; Create dummy variable used to locate stacks in memory
top_of_stacks
www.eeworm.com/read/252063/12304973
h stack.h
/* 堆栈
*
*/
#ifndef STACK_CLASS
#define STACK_CLASS
#include "dclinkedlist.h"
template
class Stack
{
private:
// 私有数据成员，栈数组
DCLinkedList stacklist;
public:
// 构造函数，
www.eeworm.com/read/150177/12307604
s stack.s
;/****************************************Copyright (c)**************************************************
;** 广州周立功单片机发展有限公司
;** 研
www.eeworm.com/read/150174/12307723
s stack.s
;/****************************************Copyright (c)**************************************************
;** 广州周立功单片机发展有限公司
;** 研
www.eeworm.com/read/338375/12311616
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/338036/12327194
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/251644/12328809
hpp stack.hpp
/* The following code example is taken from the book
* "The C++ Standard Library - A Tutorial and Reference"
* by Nicolai M. Josuttis, Addison-Wesley, 1999
*
* (C) Copyright Nicolai M. Josuttis 19
www.eeworm.com/read/337954/12332597
h stack.h
#include
#include
const int MaxStackSize=150;
template
class Stack
{
private:
T Stacklist[MaxStackSize];
int top;
public:
Stack(void);
void push(T item);