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

en/codes/go/chapter_stack_and_queue/deque_test.go

@@ -0,0 +1,141 @@
+// File: deque_test.go
+// Created Time: 2022-11-29
+// Author: Reanon (793584285@qq.com)
+
+package chapter_stack_and_queue
+
+import (
+	"container/list"
+	"fmt"
+	"testing"
+
+	. "github.com/krahets/hello-algo/pkg"
+)
+
+func TestDeque(t *testing.T) {
+	/* Get the length of the double-ended queue */
+	// In Go, use list as deque
+	deque := list.New()
+
+	/* Elements enqueue */
+	deque.PushBack(2)
+	deque.PushBack(5)
+	deque.PushBack(4)
+	deque.PushFront(3)
+	deque.PushFront(1)
+	fmt.Print("Double-ended queue deque = ")
+	PrintList(deque)
+
+	/* Update element */
+	front := deque.Front()
+	fmt.Println("Front element front =", front.Value)
+	rear := deque.Back()
+	fmt.Println("Rear element rear =", rear.Value)
+
+	/* Element dequeue */
+	deque.Remove(front)
+	fmt.Print("Front dequeue element front = ", front.Value, ", after front dequeue, deque = ")
+	PrintList(deque)
+	deque.Remove(rear)
+	fmt.Print("Rear dequeue element rear = ", rear.Value, ", after rear dequeue, deque = ")
+	PrintList(deque)
+
+	/* Get the length of the double-ended queue */
+	size := deque.Len()
+	fmt.Println("Deque length size =", size)
+
+	/* Check if the double-ended queue is empty */
+	isEmpty := deque.Len() == 0
+	fmt.Println("Is deque empty =", isEmpty)
+}
+
+func TestArrayDeque(t *testing.T) {
+	/* Get the length of the double-ended queue */
+	// In Go, use list as deque
+	deque := newArrayDeque(16)
+
+	/* Elements enqueue */
+	deque.pushLast(3)
+	deque.pushLast(2)
+	deque.pushLast(5)
+	fmt.Print("Double-ended queue deque = ")
+	PrintSlice(deque.toSlice())
+
+	/* Update element */
+	peekFirst := deque.peekFirst()
+	fmt.Println("Front element peekFirst =", peekFirst)
+	peekLast := deque.peekLast()
+	fmt.Println("Rear element peekLast =", peekLast)
+
+	/* Elements enqueue */
+	deque.pushLast(4)
+	fmt.Print("After element 4 enqueues at rear, deque = ")
+	PrintSlice(deque.toSlice())
+	deque.pushFirst(1)
+	fmt.Print("After element 1 enqueues at front, deque = ")
+	PrintSlice(deque.toSlice())
+
+	/* Element dequeue */
+	popFirst := deque.popFirst()
+	fmt.Print("Front dequeue element popFirst = ", popFirst, ", after front dequeue, deque = ")
+	PrintSlice(deque.toSlice())
+	popLast := deque.popLast()
+	fmt.Print("Back dequeue element popLast = ", popLast, ", after rear dequeue, deque = ")
+	PrintSlice(deque.toSlice())
+
+	/* Get the length of the double-ended queue */
+	size := deque.size()
+	fmt.Println("Deque length size =", size)
+
+	/* Check if the double-ended queue is empty */
+	isEmpty := deque.isEmpty()
+	fmt.Println("Is deque empty =", isEmpty)
+}
+
+func TestLinkedListDeque(t *testing.T) {
+	// Access front of the queue element
+	deque := newLinkedListDeque()
+
+	// Elements enqueue
+	deque.pushLast(2)
+	deque.pushLast(5)
+	deque.pushLast(4)
+	deque.pushFirst(3)
+	deque.pushFirst(1)
+	fmt.Print("Deque deque = ")
+	PrintList(deque.toList())
+
+	// Return list for printing
+	front := deque.peekFirst()
+	fmt.Println("Front element front =", front)
+	rear := deque.peekLast()
+	fmt.Println("Rear element rear =", rear)
+
+	// Element dequeue
+	popFirst := deque.popFirst()
+	fmt.Print("Front dequeue element popFirst = ", popFirst, ", after front dequeue, deque = ")
+	PrintList(deque.toList())
+	popLast := deque.popLast()
+	fmt.Print("Back dequeue element popLast = ", popLast, ", after rear dequeue, deque = ")
+	PrintList(deque.toList())
+
+	// Get queue length
+	size := deque.size()
+	fmt.Println("Queue length size =", size)
+
+	// Check if empty
+	isEmpty := deque.isEmpty()
+	fmt.Println("Is queue empty =", isEmpty)
+}
+
+// BenchmarkLinkedListDeque 67.92 ns/op in Mac M1 Pro
+func BenchmarkLinkedListDeque(b *testing.B) {
+	deque := newLinkedListDeque()
+	// use b.N for looping
+	for i := 0; i < b.N; i++ {
+		deque.pushLast(777)
+	}
+	for i := 0; i < b.N; i++ {
+		deque.popFirst()
+	}
+}