From 32a9369680cfb49dec725511106812c92b59ac2e Mon Sep 17 00:00:00 2001
From: Magese <magese@live.cn>
Date: Fri, 31 Dec 2021 17:51:35 +0800
Subject: [PATCH] =?UTF-8?q?=E6=B3=A8=E9=87=8A=E6=A0=BC=E5=BC=8F=E5=8C=96?=
 =?UTF-8?q?=EF=BC=9B?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../org/wltea/analyzer/core/QuickSortSet.java | 30 +++++++++++--------
 1 file changed, 17 insertions(+), 13 deletions(-)

diff --git a/src/main/java/org/wltea/analyzer/core/QuickSortSet.java b/src/main/java/org/wltea/analyzer/core/QuickSortSet.java
index 8f97496..6e841b7 100644
--- a/src/main/java/org/wltea/analyzer/core/QuickSortSet.java
+++ b/src/main/java/org/wltea/analyzer/core/QuickSortSet.java
@@ -28,14 +28,20 @@
 package org.wltea.analyzer.core;
 
 /**
- * IK分词器专用的Lexem快速排序集合
+ * IK分词器专用的Lexeme快速排序集合
  */
 class QuickSortSet {
-    //链表头
+    /**
+     * 链表头
+     */
     private Cell head;
-    //链表尾
+    /**
+     * 链表尾
+     */
     private Cell tail;
-    //链表的实际大小
+    /**
+     * 链表的实际大小
+     */
     private int size;
 
     QuickSortSet() {
@@ -53,31 +59,29 @@ class QuickSortSet {
             this.size++;
 
         } else {
-			/*if(this.tail.compareTo(newCell) == 0){//词元与尾部词元相同，不放入集合
-
-			}else */
-            if (this.tail.compareTo(newCell) < 0) {//词元接入链表尾部
+            if (this.tail.compareTo(newCell) < 0) {
+                // 词元接入链表尾部
                 this.tail.next = newCell;
                 newCell.prev = this.tail;
                 this.tail = newCell;
                 this.size++;
 
-            } else if (this.head.compareTo(newCell) > 0) {//词元接入链表头部
+            } else if (this.head.compareTo(newCell) > 0) {
+                // 词元接入链表头部
                 this.head.prev = newCell;
                 newCell.next = this.head;
                 this.head = newCell;
                 this.size++;
 
             } else {
-                //从尾部上逆
+                // 从尾部上逆
                 Cell index = this.tail;
                 while (index != null && index.compareTo(newCell) > 0) {
                     index = index.prev;
                 }
-				/*if(index.compareTo(newCell) == 0){//词元与集合中的词元重复，不放入集合
 
-				}else */
-                if ((index != null ? index.compareTo(newCell) : 1) < 0) {//词元插入链表中的某个位置
+                // 词元插入链表中的某个位置
+                if ((index != null ? index.compareTo(newCell) : 1) < 0) {
                     newCell.prev = index;
                     newCell.next = index.next;
                     index.next.prev = newCell;