代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/209853/15212694
h stack.h
//: C04:Stack.h
// From Thinking in C++, 2nd Edition
// Available at http://www.BruceEckel.com
// (c) Bruce Eckel 2000
// Copyright notice in Copyright.txt
// Nested struct in linked list
#ifnde
www.eeworm.com/read/209775/15214508
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/209773/15214554
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/209772/15214602
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/209433/15220179
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/209308/15223665
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/209274/15224132
cpp stack.cpp
#include "stdafx.h"
using namespace std;
template
Stack::Stack (void):top(-1),StackList(InitStackSize) {}
template
void Stack::Push (const T& item)
{
if (top==S
www.eeworm.com/read/209274/15224154
h stack.h
const int InitStackSize=50; //栈数组的初始规模
template
class Stack
{
public:
Stack (void);
void Push (const T& item);
T Pop (void);
void ClearStack (void);
T Peek (void) const;
bo
www.eeworm.com/read/209062/15228575
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/209062/15228622