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

Fetch the repository succeeded.

Scan WeChat QR to Pay

Cancel

Complete

richgiteeai

Watch

Unwatch Watching Releases Only Ignoring

1 Star 0 Fork 127

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

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

Code Issues 0 Wiki Insights Pipelines

Service

Tencent Cloud Serverless

Create your Gitee Account

Explore and code with more than 14 million developers,Free private repositories !:)

Already have an account? Sign in

文件

master

Branches (3)

Manage

master

Prometheus

dev

Clone or Download

Clone/Download

HTTPS SSH SVN SVN+SSH Download ZIP

Prompt

To download the code, please copy the following command and execute it in the terminal

To ensure that your submitted code identity is correctly recognized by Gitee, please execute the following command.

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

When using the SSH protocol for the first time to clone or push code, follow the prompts below to complete the SSH configuration.

1 Generate RSA keys.

2 Obtain the content of the RSA public key and configure it in SSH Public Keys

To use SVN on Gitee, please visit the usage guide

When using the HTTPS protocol, the command line will prompt for account and password verification as follows. For security reasons, Gitee recommends configure and use personal access tokens instead of login passwords for cloning, pushing, and other operations.

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

Password for 'https://userName@gitee.com': # Private Token

Branches 3

Tags 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;
}

Copy Edit Raw Blame History

Y_Dash authored 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;
}