CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-05 03:30:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

Replace poll with pop

Browse Source
This commit is contained in:
krahets
2023-03-13 22:39:45 +08:00
parent 28aacccf44
commit 516cb17775
6 changed files with 27 additions and 27 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
codes/rust/chapter_stack_and_queue/linkedlist_deque.rs
View File

@@ -99,7 +99,7 @@ impl<T: Copy> LinkedListDeque<T> {
}
/* 出队操作 */
pub fn poll(&mut self, is_front: bool) -> Option<T> {
pub fn pop(&mut self, is_front: bool) -> Option<T> {
if self.is_empty() {return None};
// 队首出队操作
if is_front {
@@ -135,13 +135,13 @@ impl<T: Copy> LinkedListDeque<T> {
}
/* 队首出队 */
pub fn poll_first(&mut self) -> Option<T> {
return self.poll(true);
pub fn pop_first(&mut self) -> Option<T> {
return self.pop(true);
}
/* 队尾出队 */
pub fn poll_last(&mut self) -> Option<T> {
return self.poll(false);
pub fn pop_last(&mut self) -> Option<T> {
return self.pop(false);
}
/* 访问队首元素 */
@@ -190,11 +190,11 @@ fn main() {
print_util::print_array(&deque.to_array(deque.peek_first()));
/* 元素出队 */
let poll_last = deque.poll_last().unwrap();
print!("\n队尾出队元素 = {}，队尾出队后 deque = ", poll_last);
let pop_last = deque.pop_last().unwrap();
print!("\n队尾出队元素 = {}，队尾出队后 deque = ", pop_last);
print_util::print_array(&deque.to_array(deque.peek_first()));
let poll_first = deque.poll_first().unwrap();
print!("\n队首出队元素 = {}，队首出队后 deque = ", poll_first);
let pop_first = deque.pop_first().unwrap();
print!("\n队首出队元素 = {}，队首出队后 deque = ", pop_first);
print_util::print_array(&deque.to_array(deque.peek_first()));
/* 获取双向队列的长度 */

6
codes/rust/chapter_stack_and_queue/linkedlist_queue.rs
View File

@@ -57,7 +57,7 @@ impl<T: Copy> LinkedListQueue<T> {
}
/* 出队 */
pub fn poll(&mut self) -> Option<T> {
pub fn pop(&mut self) -> Option<T> {
self.front.take().map(|old_front| {
match old_front.borrow_mut().next.take() {
Some(new_front) => {
@@ -107,8 +107,8 @@ fn main() {
print!("\n队首元素 peek = {}", peek);
/* 元素出队 */
let poll = queue.poll().unwrap();
print!("\n出队元素 poll = {}，出队后 queue = ", poll);
let pop = queue.pop().unwrap();
print!("\n出队元素 pop = {}，出队后 queue = ", pop);
print_util::print_array(&queue.to_array(queue.peek()));
/* 获取队列的长度 */