Stack/src/test.cpp · 烟圈/数据结构(C++模板实现)

代码拉取完成,页面将自动刷新

扫描微信二维码支付

取消

支付完成

richgiteeai

Watch

不关注关注所有动态仅关注版本发行动态关注但不提醒动态

1 Star 0 Fork 127

烟圈/数据结构(C++模板实现)

forked from cyberdash/数据结构(C++模板实现)

代码 Issues 0 Wiki 统计流水线

服务

加入 Gitee

与超过 1400万开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)

免费加入

已有帐号? 立即登录

文件

master

分支 (3)

管理

master

Prometheus

dev

克隆/下载

HTTPS SSH SVN SVN+SSH 下载ZIP

提示

下载代码请复制以下命令到终端执行

为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置

git config --global user.name userName 
git config --global user.email userEmail

初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置

1 生成 RSA 密钥

2 获取 RSA 公钥内容,并配置到 SSH公钥中

在 Gitee 上使用 SVN,请访问使用指南

使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议配置并使用私人令牌替代登录密码进行克隆、推送等操作

Username for 'https://gitee.com': userName

Password for 'https://userName@gitee.com': # 私人令牌

分支 3

标签 0

data-structures-cpp

Stack

src

test.cpp

test.cpp 6.00 KB

/*!
 * @file test.cpp
 * @author CyberDash计算机考研, cyberdash@163.com(抖音id:cyberdash_yuan)
 * @brief 栈测试源文件
 * @version 0.2.1
 * @date 2020年07月15日
 */

#include "test.h"
#include "linked_stack.h"
#include "seq_stack.h"

/*!
 * @brief **测试-链式栈-入栈**
 * @note
 * 测试-链式栈-入栈
 * ---------------
 * ---------------
 *
 * ---------------
 * 声明test_stack(整型链式栈)\n
 * 依次将1, 2, 3, 4入栈\n
 * 打印test_stack\n
 *
 *
 * ---------------
 */
void TestLinkedStackPush() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test LinkedStack Push |" << endl;
 cout << "| 测试-链式栈-入栈 |" << endl << endl << endl;

// 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

// 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

// 打印test_stack
 cout << test_stack << endl;

cout << "-------------------------------------------------------------" << endl << endl;
}

/*!
 * @brief **测试-链式栈-出栈**
 * @note
 * 测试-链式栈-出栈
 * ---------------
 * ---------------
 *
 * ---------------
 * 声明test_stack(整型链式栈)\n
 * 依次将1, 2, 3, 4入栈\n
 * 栈顶出栈3次\n
 * 打印test_stack\n
 *
 *
 * ---------------
 */
void TestLinkedStackPop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test LinkedStack Pop |" << endl;
 cout << "| 测试-链式栈-出栈 |" << endl << endl << endl;

// 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

// 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

// 栈顶出栈3次
 int pop_data;

test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);

// 打印test_stack
 cout << test_stack << endl;

cout << "-------------------------------------------------------------" << endl << endl;
}

/*!
 * @brief **测试-链式栈-取栈顶**
 * @note
 * 测试-链式栈-取栈顶
 * ---------------
 * ---------------
 *
 * ---------------
 *
 *
 * ---------------
 */
void TestLinkedStackTop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test LinkedStack Top |" << endl;
 cout << "| 测试-链式栈-取栈顶 |" << endl << endl << endl;

// 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

// 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

// 取top_data(栈顶数据项)
 int top_data;
 test_stack.Top(top_data);

// 打印top_data
 cout << "top_data: " << top_data << endl;

cout << "-------------------------------------------------------------" << endl << endl;
}

/*!
 * @brief **测试-顺序栈-入栈**
 * @note
 * 测试-顺序栈-入栈
 * ---------------
 * ---------------
 *
 * ---------------
 *
 *
 * ---------------
 */
void TestSeqStackPush() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test SeqStack Push |" << endl;
 cout << "| 测试-顺序栈-入栈 |" << endl << endl << endl;

// 声明test_stack(整型顺序栈)
 SeqStack<int> test_stack;

// 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

// 打印test_stack
 cout << test_stack << endl;

cout << "-------------------------------------------------------------" << endl << endl;
}

/*!
 * @brief **测试-顺序栈-出栈**
 * @note
 * 测试-顺序栈-出栈
 * ---------------
 * ---------------
 *
 * ---------------
 *
 *
 * ---------------
 */
void TestSeqStackPop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test SeqStack Pop |" << endl;
 cout << "| 测试-顺序栈-出栈 |" << endl << endl << endl;

// 声明test_stack(整型顺序栈)
 SeqStack<int> test_stack;

// 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

// 栈顶出栈3次
 int pop_data;

test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);

// 打印test_stack
 cout << test_stack << endl;

cout << "-------------------------------------------------------------" << endl << endl;
}

/*!
 * @brief **测试-链式栈-取栈顶**
 * @note
 * 测试-链式栈-取栈顶
 * ---------------
 * ---------------
 *
 * ---------------
 * 声明test_stack(整型链式栈)\n
 * 依次将1, 2, 3, 4入栈\n
 * 取top_data(栈顶数据项)\n
 * 打印top_data\n
 *
 *
 * ---------------
 */
void TestSeqStackTop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test SeqStack Top |" << endl;
 cout << "| 测试-顺序栈-取栈顶 |" << endl << endl << endl;

// 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

// 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

// 取top_data(栈顶数据项)
 int top_data;
 test_stack.Top(top_data);

// 打印top_data
 cout << "top_data: " << top_data << endl;

cout << "-------------------------------------------------------------" << endl << endl;
}

一键复制编辑原始数据按行查看历史

Y_Dash 提交于 2023年06月16日 16:00 +08:00 . 栈更新doxygen

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248

/*!
 * @file test.cpp
 * @author CyberDash计算机考研, cyberdash@163.com(抖音id:cyberdash_yuan)
 * @brief 栈测试源文件
 * @version 0.2.1
 * @date 2020年07月15日
 */

#include "test.h"
#include "linked_stack.h"
#include "seq_stack.h"


/*!
 * @brief **测试-链式栈-入栈**
 * @note
 * 测试-链式栈-入栈
 * ---------------
 * ---------------
 *
 * ---------------
 * 声明test_stack(整型链式栈)\n
 * 依次将1, 2, 3, 4入栈\n
 * 打印test_stack\n
 *
 *
 * ---------------
 */
void TestLinkedStackPush() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test LinkedStack Push |" << endl;
 cout << "| 测试-链式栈-入栈 |" << endl << endl << endl;

 // 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

 // 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

 // 打印test_stack
 cout << test_stack << endl;

 cout << "-------------------------------------------------------------" << endl << endl;
}


/*!
 * @brief **测试-链式栈-出栈**
 * @note
 * 测试-链式栈-出栈
 * ---------------
 * ---------------
 *
 * ---------------
 * 声明test_stack(整型链式栈)\n
 * 依次将1, 2, 3, 4入栈\n
 * 栈顶出栈3次\n
 * 打印test_stack\n
 *
 *
 * ---------------
 */
void TestLinkedStackPop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test LinkedStack Pop |" << endl;
 cout << "| 测试-链式栈-出栈 |" << endl << endl << endl;

 // 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

 // 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

 // 栈顶出栈3次
 int pop_data;

 test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);

 // 打印test_stack
 cout << test_stack << endl;

 cout << "-------------------------------------------------------------" << endl << endl;
}


/*!
 * @brief **测试-链式栈-取栈顶**
 * @note
 * 测试-链式栈-取栈顶
 * ---------------
 * ---------------
 *
 * ---------------
 *
 *
 * ---------------
 */
void TestLinkedStackTop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test LinkedStack Top |" << endl;
 cout << "| 测试-链式栈-取栈顶 |" << endl << endl << endl;

 // 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

 // 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

 // 取top_data(栈顶数据项)
 int top_data;
 test_stack.Top(top_data);

 // 打印top_data
 cout << "top_data: " << top_data << endl;

 cout << "-------------------------------------------------------------" << endl << endl;
}


/*!
 * @brief **测试-顺序栈-入栈**
 * @note
 * 测试-顺序栈-入栈
 * ---------------
 * ---------------
 *
 * ---------------
 *
 *
 * ---------------
 */
void TestSeqStackPush() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test SeqStack Push |" << endl;
 cout << "| 测试-顺序栈-入栈 |" << endl << endl << endl;

 // 声明test_stack(整型顺序栈)
 SeqStack<int> test_stack;

 // 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

 // 打印test_stack
 cout << test_stack << endl;

 cout << "-------------------------------------------------------------" << endl << endl;
}


/*!
 * @brief **测试-顺序栈-出栈**
 * @note
 * 测试-顺序栈-出栈
 * ---------------
 * ---------------
 *
 * ---------------
 *
 *
 * ---------------
 */
void TestSeqStackPop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test SeqStack Pop |" << endl;
 cout << "| 测试-顺序栈-出栈 |" << endl << endl << endl;

 // 声明test_stack(整型顺序栈)
 SeqStack<int> test_stack;

 // 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

 // 栈顶出栈3次
 int pop_data;

 test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);
 test_stack.Pop(pop_data);

 // 打印test_stack
 cout << test_stack << endl;

 cout << "-------------------------------------------------------------" << endl << endl;
}


/*!
 * @brief **测试-链式栈-取栈顶**
 * @note
 * 测试-链式栈-取栈顶
 * ---------------
 * ---------------
 *
 * ---------------
 * 声明test_stack(整型链式栈)\n
 * 依次将1, 2, 3, 4入栈\n
 * 取top_data(栈顶数据项)\n
 * 打印top_data\n
 *
 *
 * ---------------
 */
void TestSeqStackTop() {
 cout << endl;
 cout << "|------------------------ CyberDash ------------------------|" << endl;
 cout << "| Test SeqStack Top |" << endl;
 cout << "| 测试-顺序栈-取栈顶 |" << endl << endl << endl;

 // 声明test_stack(整型链式栈)
 LinkedStack<int> test_stack;

 // 依次将1, 2, 3, 4入栈
 test_stack.Push(1);
 test_stack.Push(2);
 test_stack.Push(3);
 test_stack.Push(4);

 // 取top_data(栈顶数据项)
 int top_data;
 test_stack.Top(top_data);

 // 打印top_data
 cout << "top_data: " << top_data << endl;

 cout << "-------------------------------------------------------------" << endl << endl;
}