代码搜索：Stack
找到约 10,000 项符合「Stack」的源代码
代码结果 10,000
www.eeworm.com/read/131315/5936990
c stack.c
/* stack.c
*
* Copyright (c) 1984, 1985 Xerox Corp.
*
* This module manipulates the RES stack.
*
*/
#include "stack.h"
extern long filepos;
extern unsigned char **malloc();
/* Private procedu
www.eeworm.com/read/131315/5937028
h stack.h
/*
* Copyright (c) 1984, 1985 Xerox Corp.
*
* stack.h -- elements of the RES stack.
*/
/* stack element types */
#define type_number 1
#define type_string 2
#define typ
www.eeworm.com/read/131315/5937029
c stack.c
/* stack.c
*
* Copyright (c) 1984, 1985 Xerox Corp.
*
* This module manipulates the RES stack.
*
*/
#include "stack.h"
extern long filepos;
extern unsigned char **malloc();
/* Private procedu
www.eeworm.com/read/131315/5939150
c stack.c
/* Print and select stack frames for GDB, the GNU debugger.
Copyright (C) 1986, 1987, 1989, 1991 Free Software Foundation, Inc.
This file is part of GDB.
This program is free software; you can re
www.eeworm.com/read/131315/5940904
ccp stack.ccp
#ifdef __GNUG__
#pragma implementation
#endif
#include ".Stack.h"
Stack::~Stack() {}
void Stack::error(const char* msg)
{
(*lib_error_handler)("Stack", msg);
}
www.eeworm.com/read/131315/5940966
hp stack.hp
// This may look like C code, but it is really -*- C++ -*-
/*
Copyright (C) 1988 Free Software Foundation
written by Doug Lea (dl@rocky.oswego.edu)
This file is part of the GNU C++ Library. Thi
www.eeworm.com/read/131171/5947770
3 stack.3
.TH stack 3 "13 Sep 1999" "FREE_C++_STANDARD_LIBRARY" \" -*- nroff -*-
.ad l
.nh
.SH NAME
stack \-
.SH SYNOPSIS
.br
.PP
.SS Namespaces
.in +1c
.ti -1c
.RI "namespace \fBstd\fR"
.br
.in -1c
.SH AUTHO
www.eeworm.com/read/128884/5978970
s stack.s
;/****************************************Copyright (c)**************************************************
;** 广州周立功单片机发展有限公司
;** 研
www.eeworm.com/read/128157/5992403
h stack.h
#ifndef STACK_H
#define STACK_H
/*====================================================================
Copyright 1996, 1997, 2004 Ian Kaplan, Bear Products International,
www.bearcave.com.
Al
www.eeworm.com/read/128026/5993029
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+