From 9f333ecc87f9ce4b77d56e3ce372c284b8d17e25 Mon Sep 17 00:00:00 2001
From: Litrix2 <wbpstn@163.com>
Date: Sat, 21 Dec 2024 16:08:28 +0800
Subject: [PATCH] =?UTF-8?q?=F0=9F=8C=88=20style:=20=E4=BF=AE=E6=94=B9?=
 =?UTF-8?q?=E4=BB=A3=E7=A0=81=E6=A0=BC=E5=BC=8F?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/utils/double-queue.ts | 34 +++++++++++++++++-----------------
 1 file changed, 17 insertions(+), 17 deletions(-)

diff --git a/src/utils/double-queue.ts b/src/utils/double-queue.ts
index 592ebfe..3b628e3 100644
--- a/src/utils/double-queue.ts
+++ b/src/utils/double-queue.ts
@@ -4,8 +4,8 @@ interface Node<T> {
   next?: Node<T>;
 }
 export class DoubleQueue<T> {
-  protected head?: Node<T>;
-  protected tail?: Node<T>;
+  protected _head?: Node<T>;
+  protected _tail?: Node<T>;
   protected _size = 0;
   constructor(it?: Iterable<T>) {
     if (it) {
@@ -20,51 +20,51 @@ export class DoubleQueue<T> {
   push(item: T) {
     const node: Node<T> = { value: item };
     if (this.size) {
-      (this.tail!.next = node).prev = this.tail;
-      this.tail = node;
+      (this._tail!.next = node).prev = this._tail;
+      this._tail = node;
     } else {
-      this.head = this.tail = node;
+      this._head = this._tail = node;
     }
     this._size++;
   }
   pop(): T | undefined {
     if (!this.size) return undefined;
-    const node = this.tail!;
+    const node = this._tail!;
     if (this.size === 1) {
-      this.head = this.tail = undefined;
+      this._head = this._tail = undefined;
     } else {
       node.prev!.next = undefined;
     }
     this._size--;
-    if (this.size === 1) this.head = this.tail;
+    if (this.size === 1) this._head = this._tail;
     return node.value;
   }
   unshift(item: T) {
     const node: Node<T> = { value: item };
     if (this.size) {
-      (this.head!.prev = node).next = this.head;
-      this.head = node;
+      (this._head!.prev = node).next = this._head;
+      this._head = node;
     } else {
-      this.head = this.tail = node;
+      this._head = this._tail = node;
     }
     this._size++;
   }
   shift(): T | undefined {
     if (!this.size) return undefined;
-    const node = this.head!;
+    const node = this._head!;
     if (this.size === 1) {
-      this.head = this.tail = undefined;
+      this._head = this._tail = undefined;
     } else {
       node.next!.prev = undefined;
     }
     this._size--;
-    if (this.size === 1) this.tail = this.head;
+    if (this.size === 1) this._tail = this._head;
     return node.value;
   }
   get(i: number): T | undefined {
     const reversed = i < 0;
     if (i < -this.size || i >= this.size) return undefined;
-    let node = reversed ? this.tail! : this.head!;
+    let node = reversed ? this._tail! : this._head!;
     if (reversed) i = -i - 1;
     for (let j = 1; j <= i; j++) {
       node = reversed ? node.prev! : node.next!;
@@ -72,7 +72,7 @@ export class DoubleQueue<T> {
     return node.value;
   }
   *iter() {
-    for (let node = this.head; node; node = node.next) {
+    for (let node = this._head; node; node = node.next) {
       yield node.value;
     }
   }
@@ -80,7 +80,7 @@ export class DoubleQueue<T> {
     return this.iter();
   }
   *reverseIter() {
-    for (let node = this.tail; node; node = node.prev) {
+    for (let node = this._tail; node; node = node.prev) {
       yield node.value;
     }
   }