refactor: Replace poll with pop in Queue and Deque (#415)

codes/rust/chapter_stack_and_queue/array_queue.rs

@@ -36,7 +36,7 @@ impl ArrayQueue {
         self.que_size += 1;
     }
 
-    fn poll(&mut self) -> i32 {
+    fn pop(&mut self) -> i32 {
         let num = self.peek();
         self.front = (self.front + 1) % self.que_capacity;
         self.que_size -= 1;
@@ -77,10 +77,10 @@ fn main() {
     let peek = queue.peek();
     println!("队首元素 peek = {}", peek);
 
-    let poll = queue.poll();
+    let pop = queue.pop();
     println!(
-        "出队元素 poll = {:?},出队后 queue = {:?}",
-        poll,
+        "出队元素 pop = {:?},出队后 queue = {:?}",
+        pop,
         queue.to_vector()
     );
 
@@ -92,7 +92,7 @@ fn main() {
 
     for i in 0..10 {
         queue.push(i);
-        queue.poll();
+        queue.pop();
         println!("第 {:?} 轮入队 + 出队后 queue = {:?}", i, queue.to_vector());
     }
 }

codes/rust/chapter_stack_and_queue/deque.rs

@@ -27,11 +27,11 @@ pub fn main() {
     print!("\n队尾元素 peekLast = {peek_last}");
 
     // 元素出队
-    let poll_first = deque.pop_front().unwrap();    // 队首元素出队
-    print!("\n队首出队元素 pollFirst = {poll_first}，队首出队后 deque = ");
+    let pop_first = deque.pop_front().unwrap();    // 队首元素出队
+    print!("\n队首出队元素 popFirst = {pop_first}，队首出队后 deque = ");
     print_util::print_queue(&deque);
-    let poll_last = deque.pop_back().unwrap();      // 队尾元素出队     
-    print!("\n队尾出队元素 pollLast = {poll_last}，队尾出队后 deque = ");
+    let pop_last = deque.pop_back().unwrap();      // 队尾元素出队     
+    print!("\n队尾出队元素 popLast = {pop_last}，队尾出队后 deque = ");
     print_util::print_queue(&deque);
 
     // 获取双向队列的长度

codes/rust/chapter_stack_and_queue/queue.rs

@@ -27,8 +27,8 @@ pub fn main() {
     println!("\n队首元素 peek = {peek}");
 
     // 元素出队
-    let poll = queue.pop_front().unwrap();
-    print!("出队元素 poll = {poll}，出队后 queue = ");
+    let pop = queue.pop_front().unwrap();
+    print!("出队元素 pop = {pop}，出队后 queue = ");
     print_util::print_queue(&queue);
 
     // 获取队列的长度