代码搜索:Stack

找到约 10,000 项符合「Stack」的源代码

代码结果 10,000
www.eeworm.com/read/249070/12523812

cpp stackp.cpp

// ********************************************************* // Implementation file StackP.cpp for the ADT stack. // Pointer-based implementation. // **************************************************
www.eeworm.com/read/334943/12560363

m 6-4.m

Y = round(rand(5,3)*10); %随机函数产生5*3的数组,对产生的数据取整 subplot(2,2,1) bar(Y,'group') title 'Group' subplot(2,2,2) bar(Y,'stack') %堆型二维垂直条形图 title 'Stack' subplot(2,2,3)
www.eeworm.com/read/147315/12564920

c alloca.c

/* alloca.c -- allocate automatically reclaimed memory (Mostly) portable public-domain implementation -- D A Gwyn This implementation of the PWB library alloca function, which is used to all
www.eeworm.com/read/146753/12615404

s79 cstartup.s79

;------------------------------------------------------------------------------ ;- ATMEL Microcontroller Software Support - ROUSSET - ;----------------------------------------------------
www.eeworm.com/read/247668/12634115

cpp p2-107.cpp

#include const int MAX=5; //假定栈中最多保存5个数据 //定义名为stack的具有栈功能的类 class stack { //数据成员 double num[MAX]; //存放栈数据的数组 int top; //指示栈顶位置的变量 public: //成
www.eeworm.com/read/247668/12634151

cpp p2-103.cpp

#include const int MAX=5; //假定栈中最多保存5个数据 //定义名为stack的具有栈功能的类 class stack { //数据成员 float num[MAX]; //存放栈数据的数组 int top; //指示栈顶位置的变量 public: //
www.eeworm.com/read/247668/12634452

cpp p4-178.cpp

#include //定义栈的尺寸 const int SIZE = 100; //定义处理栈的类模板接口 template class stack { T stck[SIZE]; int tos; public: stack(void) { tos = 0; cout
www.eeworm.com/read/238106/13906247

cpp 20_2.cpp

//20_2.cpp #include template class Stack{ public: Stack(); ~Stack(){ delete[] stack; } void Push(T& n); T Pop(); private: static const int SIZE; T* sta
www.eeworm.com/read/238106/13906284

cpp 11_5.cpp

//11_5 #include #include "stack.h" void main() { Stack sta; sta.Put(10); sta.Put(12); sta.Put(14); cout
www.eeworm.com/read/237638/13940141

cpp 20_2.cpp

//20_2.cpp #include template class Stack{ public: Stack(); ~Stack(){ delete[] stack; } void Push(T& n); T Pop(); private: static const int SIZE; T* sta