Translate all code to English (#1836)

* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
2026-07-14 16:16:06 +00:00 · 2025-12-31 07:44:52 +08:00
parent 45e1295241
commit 2778a6f9c7
1284 changed files with 71557 additions and 3275 deletions
@@ -0,0 +1,49 @@
+/*
+ * File: deque.rs
+ * Created Time: 2023-02-05
+ * Author: codingonion (coderonion@gmail.com), xBLACKICEx (xBLACKICEx@outlook.com)
+ */
+
+use hello_algo_rust::include::print_util;
+use std::collections::VecDeque;
+
+/* Driver Code */
+pub fn main() {
+    // Get the length of the double-ended queue
+    let mut deque: VecDeque<i32> = VecDeque::new();
+    deque.push_back(3);
+    deque.push_back(2);
+    deque.push_back(5);
+    print!("Double-ended queue deque = ");
+    print_util::print_queue(&deque);
+
+    // Update element
+    let peek_first = deque.front().unwrap();
+    print!("\nFront element peekFirst = {peek_first}");
+    let peek_last = deque.back().unwrap();
+    print!("\nRear element peekLast = {peek_last}");
+
+    /* Elements enqueue */
+    deque.push_back(4);
+    print!("\nAfter element 4 enqueues at rear, deque = ");
+    print_util::print_queue(&deque);
+    deque.push_front(1);
+    print!("\nAfter element 1 enqueues at front, deque = ");
+    print_util::print_queue(&deque);
+
+    // Element dequeue
+    let pop_last = deque.pop_back().unwrap();
+    print!("\nDequeue rear element = {pop_last}, after dequeue deque = ");
+    print_util::print_queue(&deque);
+    let pop_first = deque.pop_front().unwrap();
+    print!("\nDequeue front element = {pop_first}, after dequeue deque = ");
+    print_util::print_queue(&deque);
+
+    // Get the length of the double-ended queue
+    let size = deque.len();
+    print!("\nDeque length size = {size}");
+
+    // Check if the double-ended queue is empty
+    let is_empty = deque.is_empty();
+    print!("\nIs deque empty = {is_empty}");
+}