From 1209261bdda9c3bb6a1b4bc29a075341b88c0dcc Mon Sep 17 00:00:00 2001
From: xBLACKICEx <xBLACKICEx@outlook.com>
Date: Wed, 15 Feb 2023 14:32:03 +0100
Subject: [PATCH] =?UTF-8?q?=F0=9F=A6=84=20refactor(rust/deque):=20=20chang?=
 =?UTF-8?q?e=20LinkedList=20to=20VecDeque=20(#364)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

* 🦄 refactor(deque):  change LinkedList to VecDeque

* 📃 docs(deque): add author

* 🦄 refactor(rust/queue):  change LinkedList to VecDeque

* 📃 docs(rust/queue): add author

* 📃 docs(deque): corrent author format
---
 codes/rust/chapter_stack_and_queue/deque.rs | 6 +++---
 codes/rust/chapter_stack_and_queue/queue.rs | 6 +++---
 codes/rust/include/print_util.rs            | 6 +++---
 3 files changed, 9 insertions(+), 9 deletions(-)

diff --git a/codes/rust/chapter_stack_and_queue/deque.rs b/codes/rust/chapter_stack_and_queue/deque.rs
index 8bb8ad42..3bc6f5fb 100644
--- a/codes/rust/chapter_stack_and_queue/deque.rs
+++ b/codes/rust/chapter_stack_and_queue/deque.rs
@@ -1,17 +1,17 @@
 /*
  * File: deque.rs
  * Created Time: 2023-02-05
- * Author: sjinzh (sjinzh@gmail.com)
+ * Author: sjinzh (sjinzh@gmail.com), xBLACKICEx (xBLACKICEx@outlook.com)
  */
 
 include!("../include/include.rs");
 
-use std::collections::LinkedList;
+use std::collections::VecDeque;
 
 /* Driver Code */
 pub fn main() {
     // 初始化双向队列
-    let mut deque: LinkedList<i32> = LinkedList::new();
+    let mut deque: VecDeque<i32> = VecDeque::new();
     deque.push_back(2);     // 添加至队尾
     deque.push_back(5);
     deque.push_back(4);
diff --git a/codes/rust/chapter_stack_and_queue/queue.rs b/codes/rust/chapter_stack_and_queue/queue.rs
index 014b5a5d..bc25cb36 100644
--- a/codes/rust/chapter_stack_and_queue/queue.rs
+++ b/codes/rust/chapter_stack_and_queue/queue.rs
@@ -1,17 +1,17 @@
 /*
  * File: queue.rs
  * Created Time: 2023-02-05
- * Author: sjinzh (sjinzh@gmail.com)
+ * Author: sjinzh (sjinzh@gmail.com), xBLACKICEx (xBLACKICEx@outlook.com)
  */
 
 include!("../include/include.rs");
 
-use std::collections::LinkedList;
+use std::collections::VecDeque;
 
 /* Driver Code */
 pub fn main() {
     // 初始化队列
-    let mut queue: LinkedList<i32> = LinkedList::new();
+    let mut queue: VecDeque<i32> = VecDeque::new();
 
     // 元素入队
     queue.push_back(1);
diff --git a/codes/rust/include/print_util.rs b/codes/rust/include/print_util.rs
index ccf1068a..edd4affc 100644
--- a/codes/rust/include/print_util.rs
+++ b/codes/rust/include/print_util.rs
@@ -1,11 +1,11 @@
 /*
  * File: print_util.rs
  * Created Time: 2023-02-05
- * Author: sjinzh (sjinzh@gmail.com)
+ * Author: sjinzh (sjinzh@gmail.com), xBLACKICEx (xBLACKICEx@outlook.com)
  */
 
 use std::fmt::Display;
-use std::collections::{HashMap, LinkedList};
+use std::collections::{HashMap, VecDeque};
 
 /* Print an array */
 pub fn print_array<T: Display>(nums: &[T]) {
@@ -27,7 +27,7 @@ pub fn print_hash_map<TKey: Display, TValue: Display>(map: &HashMap<TKey, TValue
 }
 
 /* Print a queue or deque */
-pub fn print_queue<T: Display>(queue: &LinkedList<T>) {
+pub fn print_queue<T: Display>(queue: &VecDeque<T>) {
     print!("[");
     let iter = queue.iter();
     for (i, data) in iter.enumerate() {