diff --git a/README.md b/README.md
index 8894bc8..3f23fcf 100644
--- a/README.md
+++ b/README.md
@@ -394,16 +394,26 @@ import heap "github.com/duke-git/lancet/v2/datastructure/heap"
 import hashmap "github.com/duke-git/lancet/v2/datastructure/hashmap"
 ```
 
-#### Function list:
+#### Structure list:
+
+-   **<big>List</big>** : a linear table, implemented with slice.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/list.md)]
+-   **<big>Link</big>** : link list structure, contains singly link and doubly link.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/link.md)]
+-   **<big>Stack</big>** : stack structure(fifo), contains array stack and link stack.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/stack.md)]
+-   **<big>Queue</big>** : queue structure(filo), contains array queue, circular queue, link queue and priority queue.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/queue.md)]
+-   **<big>Set</big>** : a data container, like slice, but element of set is not duplicate.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/set.md)]
+-   **<big>Tree</big>** : binary search tree structure.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/tree.md)]
+-   **<big>Heap</big>** : a binary max heap.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/heap.md)]
+-   **<big>Hashmap</big>** : hash map structure.
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/hashmap.md)]
+
 
--   [List](https://github.com/duke-git/lancet/blob/main/docs/datastructure/list.md)
--   [Linklist](https://github.com/duke-git/lancet/blob/main/docs/datastructure/linklist.md)
--   [Stack](https://github.com/duke-git/lancet/blob/main/docs/datastructure/stack.md)
--   [Queue](https://github.com/duke-git/lancet/blob/main/docs/datastructure/queue.md)
--   [Set](https://github.com/duke-git/lancet/blob/main/docs/datastructure/set.md)
--   [Tree](https://github.com/duke-git/lancet/blob/main/docs/datastructure/tree.md)
--   [Heap](https://github.com/duke-git/lancet/blob/main/docs/datastructure/heap.md)
--   [HashMap](https://github.com/duke-git/lancet/blob/main/docs/datastructure/hashmap.md)
 
 ### 8. Fileutil package implements some basic functions for file operations.
 
diff --git a/README_zh-CN.md b/README_zh-CN.md
index 62b3eae..7807a81 100644
--- a/README_zh-CN.md
+++ b/README_zh-CN.md
@@ -395,14 +395,25 @@ import hashmap "github.com/duke-git/lancet/v2/datastructure/hashmap"
 
 #### Function list:
 
--   [List](https://github.com/duke-git/lancet/blob/main/docs/datastructure/list_zh-CN.md)
--   [Linklist](https://github.com/duke-git/lancet/blob/main/docs/datastructure/linklist_zh-CN.md)
--   [Stack](https://github.com/duke-git/lancet/blob/main/docs/datastructure/stack_zh-CN.md)
--   [Queue](https://github.com/duke-git/lancet/blob/main/docs/datastructure/queue_zh-CN.md)
--   [Set](https://github.com/duke-git/lancet/blob/main/docs/datastructure/set_zh-CN.md)
--   [Tree](https://github.com/duke-git/lancet/blob/main/docs/datastructure/tree_zh-CN.md)
--   [Heap](https://github.com/duke-git/lancet/blob/main/docs/datastructure/heap.md)
--   [HashMap](https://github.com/duke-git/lancet/blob/main/docs/datastructure/hashmap.md)
+-   **<big>List</big>** : 线性表结构, 用切片实现。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/list_zh-CN.md)]
+-   **<big>Link</big>** : 链表解构, 包括单链表和双向链表。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/link_zh-CN.md)]
+-   **<big>Stack</big>** : 栈结构(fifo), 包括数组栈和链表栈。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/stack_zh-CN.md)]
+-   **<big>Queue</big>** : 队列结构(filo), 包括数组队列，链表队列，循环队列，优先级队列。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/queue_zh-CN.md)]
+-   **<big>Set</big>** : 集合（set）结构。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/set_zh-CN.md)]
+-   **<big>Tree</big>** : 二叉搜索树。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/tree_zh-CN.md)]
+-   **<big>Heap</big>** : 二叉max堆。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/heap_zh-CN.md)]
+-   **<big>Hashmap</big>** : 哈希映射。
+    [[doc](https://github.com/duke-git/lancet/blob/main/docs/datastructure/hashmap_zh-CN.md)]
+
+
+
 
 ### 8. fileutil 包含文件基本操作。
 
diff --git a/datastructure/list/list.go b/datastructure/list/list.go
index 199dd59..31687bd 100644
--- a/datastructure/list/list.go
+++ b/datastructure/list/list.go
@@ -8,17 +8,17 @@ import (
 	"reflect"
 )
 
-// List is a linear table, implemented with slice
+// List is a linear table, implemented with slice.
 type List[T any] struct {
 	data []T
 }
 
-// NewList return a pointer of List
+// NewList return a pointer of List.
 func NewList[T any](data []T) *List[T] {
 	return &List[T]{data: data}
 }
 
-// Data return list data
+// Data return list data.
 func (l *List[T]) Data() []T {
 	return l.data
 }
@@ -31,7 +31,7 @@ func (l *List[T]) ValueOf(index int) (*T, bool) {
 	return &l.data[index], true
 }
 
-// IndexOf returns the index of value. if not found return -1
+// IndexOf returns the index of value. if not found return -1.
 func (l *List[T]) IndexOf(value T) int {
 	index := -1
 	data := l.data
@@ -45,7 +45,7 @@ func (l *List[T]) IndexOf(value T) int {
 }
 
 // LastIndexOf returns the index of the last occurrence of the value in this list.
-// if not found return -1
+// if not found return -1.
 func (l *List[T]) LastIndexOf(value T) int {
 	index := -1
 	data := l.data
@@ -59,7 +59,7 @@ func (l *List[T]) LastIndexOf(value T) int {
 }
 
 // IndexOfFunc returns the first index satisfying f(v)
-// if not found return -1
+// if not found return -1.
 func (l *List[T]) IndexOfFunc(f func(T) bool) int {
 	index := -1
 	data := l.data
@@ -73,7 +73,7 @@ func (l *List[T]) IndexOfFunc(f func(T) bool) int {
 }
 
 // LastIndexOfFunc returns the index of the last occurrence of the value in this list satisfying f(data[i])
-// if not found return -1
+// if not found return -1.
 func (l *List[T]) LastIndexOfFunc(f func(T) bool) int {
 	index := -1
 	data := l.data
@@ -86,7 +86,7 @@ func (l *List[T]) LastIndexOfFunc(f func(T) bool) int {
 	return index
 }
 
-// Contain checks if the value in the list or not
+// Contain checks if the value in the list or not.
 func (l *List[T]) Contain(value T) bool {
 	data := l.data
 	for _, v := range data {
@@ -97,22 +97,22 @@ func (l *List[T]) Contain(value T) bool {
 	return false
 }
 
-// Push append value to the list data
+// Push append value to the list data.
 func (l *List[T]) Push(value T) {
 	l.data = append(l.data, value)
 }
 
-// InsertAtFirst insert value into list at first index
+// InsertAtFirst insert value into list at first index.
 func (l *List[T]) InsertAtFirst(value T) {
 	l.InsertAt(0, value)
 }
 
-// InsertAtLast insert value into list at last index
+// InsertAtLast insert value into list at last index.
 func (l *List[T]) InsertAtLast(value T) {
 	l.InsertAt(len(l.data), value)
 }
 
-// InsertAt insert value into list at index
+// InsertAt insert value into list at index.
 func (l *List[T]) InsertAt(index int, value T) {
 	data := l.data
 	size := len(data)
@@ -123,7 +123,7 @@ func (l *List[T]) InsertAt(index int, value T) {
 	l.data = append(data[:index], append([]T{value}, data[index:]...)...)
 }
 
-// PopFirst delete the first value of list and return it
+// PopFirst delete the first value of list and return it.
 func (l *List[T]) PopFirst() (*T, bool) {
 	if len(l.data) == 0 {
 		return nil, false
@@ -135,7 +135,7 @@ func (l *List[T]) PopFirst() (*T, bool) {
 	return &v, true
 }
 
-// PopLast delete the last value of list and return it
+// PopLast delete the last value of list and return it.
 func (l *List[T]) PopLast() (*T, bool) {
 	size := len(l.data)
 	if size == 0 {
@@ -148,7 +148,7 @@ func (l *List[T]) PopLast() (*T, bool) {
 	return &v, true
 }
 
-// DeleteAt delete the value of list at index
+// DeleteAt delete the value of list at index.
 func (l *List[T]) DeleteAt(index int) {
 	data := l.data
 	size := len(data)
@@ -199,7 +199,7 @@ func (l *List[T]) UpdateAt(index int, value T) {
 	l.data = append(data[:index], append([]T{value}, data[index+1:]...)...)
 }
 
-// Equal compare list to other list, use reflect.DeepEqual
+// Equal compare list to other list, use reflect.DeepEqual.
 func (l *List[T]) Equal(other *List[T]) bool {
 	if len(l.data) != len(other.data) {
 		return false
@@ -214,17 +214,17 @@ func (l *List[T]) Equal(other *List[T]) bool {
 	return true
 }
 
-// IsEmpty check if the list is empty or not
+// IsEmpty check if the list is empty or not.
 func (l *List[T]) IsEmpty() bool {
 	return len(l.data) == 0
 }
 
-// Clear the data of list
+// Clear the data of list.
 func (l *List[T]) Clear() {
 	l.data = make([]T, 0)
 }
 
-// Clone return a copy of list
+// Clone return a copy of list.
 func (l *List[T]) Clone() *List[T] {
 	cl := NewList(make([]T, len(l.data)))
 	copy(cl.data, l.data)
@@ -232,7 +232,7 @@ func (l *List[T]) Clone() *List[T] {
 	return cl
 }
 
-// Merge two list, return new list, don't change original list
+// Merge two list, return new list, don't change original list.
 func (l *List[T]) Merge(other *List[T]) *List[T] {
 	l1, l2 := len(l.data), len(other.data)
 	ml := NewList(make([]T, l1+l2))
@@ -243,17 +243,17 @@ func (l *List[T]) Merge(other *List[T]) *List[T] {
 	return ml
 }
 
-// Size return number of list data items
+// Size return number of list data items.
 func (l *List[T]) Size() int {
 	return len(l.data)
 }
 
-// Cap return cap of the inner data
+// Cap return cap of the inner data.
 func (l *List[T]) Cap() int {
 	return cap(l.data)
 }
 
-// Swap the value of index i and j in list
+// Swap the value of index i and j in list.
 func (l *List[T]) Swap(i, j int) {
 	size := len(l.data)
 	if i < 0 || i >= size || j < 0 || j >= size {
@@ -262,14 +262,14 @@ func (l *List[T]) Swap(i, j int) {
 	l.data[i], l.data[j] = l.data[j], l.data[i]
 }
 
-// Reverse the item order of list
+// Reverse the item order of list.
 func (l *List[T]) Reverse() {
 	for i, j := 0, len(l.data)-1; i < j; i, j = i+1, j-1 {
 		l.data[i], l.data[j] = l.data[j], l.data[i]
 	}
 }
 
-// Unique remove duplicate items in list
+// Unique remove duplicate items in list.
 func (l *List[T]) Unique() {
 	data := l.data
 	size := len(data)
@@ -303,7 +303,7 @@ func (l *List[T]) Union(other *List[T]) *List[T] {
 	return result
 }
 
-// Intersection creates a new list whose element both be contained in list l and other
+// Intersection creates a new list whose element both be contained in list l and other.
 func (l *List[T]) Intersection(other *List[T]) *List[T] {
 	result := NewList(make([]T, 0))
 
diff --git a/docs/datastructure/linklist.md b/docs/datastructure/linklist.md
deleted file mode 100644
index 174ccff..0000000
--- a/docs/datastructure/linklist.md
+++ /dev/null
@@ -1,1018 +0,0 @@
-# Linklist
-Linklist a linked list, whose node has a value and a pointer points to next node of the link.
-
-<div STYLE="page-break-after: always;"></div>
-
-## Source
-
-- [https://github.com/duke-git/lancet/blob/main/datastructure/link/singlylink.go](https://github.com/duke-git/lancet/blob/main/datastructure/link/singlylink.go)
-- [https://github.com/duke-git/lancet/blob/main/datastructure/link/doublylink.go](https://github.com/duke-git/lancet/blob/main/datastructure/link/doublylink.go)
-
-
-<div STYLE="page-break-after: always;"></div>
-
-## Usage
-```go
-import (
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-```
-
-<div STYLE="page-break-after: always;"></div>
-
-## Index
-
-### 1. SinglyLink
-
-- [NewSinglyLink](#NewSinglyLink)
-- [Values](#SinglyLink_Values)
-- [InsertAt](#SinglyLink_InsertAt)
-- [InsertAtHead](#SinglyLink_InsertAtHead)
-- [InsertAtTail](#SinglyLink_InsertAtTail)
-- [DeleteAt](#SinglyLink_DeleteAt)
-- [DeleteAtHead](#SinglyLink_DeleteAtHead)
-- [DeleteAtTail](#SinglyLink_DeleteAtTail)
-- [DeleteValue](#SinglyLink_DeleteValue)
-- [Reverse](#SinglyLink_Reverse)
-- [GetMiddleNode](#SinglyLink_GetMiddleNode)
-- [Size](#SinglyLink_Size)
-- [IsEmpty](#SinglyLink_IsEmpty)
-- [Clear](#SinglyLink_Clear)
-- [Print](#SinglyLink_Print)
-
-### 2. DoublyLink
-
-- [NewDoublyLink](#NewDoublyLink)
-- [Values](#DoublyLink_Values)
-- [InsertAt](#DoublyLink_InsertAt)
-- [InsertAtHead](#DoublyLink_InsertAtHead)
-- [InsertAtTail](#DoublyLink_InsertAtTail)
-- [DeleteAt](#DoublyLink_DeleteAt)
-- [DeleteAtHead](#DoublyLink_DeleteAtHead)
-- [DeleteAtTail](#DoublyLink_DeleteAtTail)
-- [Reverse](#DoublyLink_Reverse)
-- [GetMiddleNode](#DoublyLink_GetMiddleNode)
-- [Size](#DoublyLink_Size)
-- [IsEmpty](#DoublyLink_IsEmpty)
-- [Clear](#DoublyLink_Clear)
-- [Print](#DoublyLink_Print)
-
-
-<div STYLE="page-break-after: always;"></div>
-
-## Documentation
-
-### 1. SinglyLink
-SinglyLink a linked list, whose node has a value and a pointer points to next node of the link.
-
-### <span id="NewSinglyLink">NewSinglyLink</span>
-<p>Return a singly link(SinglyLink) instance</p>
-
-<b>Signature:</b>
-
-```go
-type LinkNode[T any] struct {
-	Value T
-	Next  *LinkNode[T]
-}
-type SinglyLink[T any] struct {
-	Head   *datastructure.LinkNode[T]
-	length int
-}
-func NewSinglyLink[T any]() *SinglyLink[T]
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-    fmt.Println(lk)
-}
-```
-
-
-
-### <span id="SinglyLink_Values">Values</span>
-<p>Return a slice of all node value in singly linklist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) Values() []T
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-
-### <span id="SinglyLink_InsertAt">InsertAt</span>
-<p>Insert value into singly linklist at index, param `index` should between [0, len(SinglyLink)], if index do not meet the conditions, do nothing</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) InsertAt(index int, value T)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAt(1, 1) //do nothing
-    
-    lk.InsertAt(0, 1)
-    lk.InsertAt(1, 2)
-    lk.InsertAt(2, 3)
-    lk.InsertAt(2, 4)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 4, 3}
-}
-```
-
-
-
-
-### <span id="SinglyLink_InsertAtHead">InsertAtHead</span>
-<p>Insert value into singly linklist at head(first) index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) InsertAtHead(value T)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtHead(1)
-    lk.InsertAtHead(2)
-    lk.InsertAtHead(3)
-
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-
-### <span id="SinglyLink_InsertAtTail">InsertAtTail</span>
-<p>Insert value into singly linklist at tail(last) index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) InsertAtTail(value T)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="SinglyLink_DeleteAt">DeleteAt</span>
-<p>Delete value at specific index, param `index` should be [0, len(SinglyLink)-1]</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteAt(index int)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAt(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="SinglyLink_DeleteAtHead">DeleteAtHead</span>
-<p>Delete value in singly linklist at first index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteAtHead()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAtHead()
-    
-    fmt.Println(lk.Values()) //[]int{2, 3, 4}
-}
-```
-
-
-
-
-### <span id="SinglyLink_DeleteAtTail">DeleteAtTail</span>
-<p>Delete value in singly linklist at last index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteAtTail()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.DeleteAtTail()
-    
-    fmt.Println(lk.Values()) //[]int{1, 2}
-}
-```
-
-
-
-### <span id="SinglyLink_DeleteValue">DeleteValue</span>
-<p>Delete all `value` in singly linklist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteValue(value T)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.DeleteValue(2)
-    fmt.Println(lk.Values()) //[]int{1, 3}
-}
-```
-
-
-
-
-### <span id="SinglyLink_Reverse">Reverse</span>
-<p>Reverse all nodes order in linkist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) Reverse()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Reverse()
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-### <span id="SinglyLink_GetMiddleNode">GetMiddleNode</span>
-<p>Get the node at middle index of linkist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) GetMiddleNode() *datastructure.LinkNode[T]
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    midNode := lk.GetMiddleNode()
-    fmt.Println(midNode.Value) //2
-}
-```
-
-
-
-### <span id="SinglyLink_Size">Size</span>
-<p>Get the number of nodes in linklist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) Size() int
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Size()) //3
-}
-```
-
-
-
-### <span id="SinglyLink_IsEmpty">IsEmpty</span>
-<p>Checks if linklist is empty or not</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) IsEmpty() bool
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-    fmt.Println(lk.IsEmpty()) //true
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.IsEmpty()) //false
-}
-```
-
-
-
-### <span id="SinglyLink_Clear">Clear</span>
-<p>Clear all nodes in the linklist, make it empty</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) Clear()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Clear()
-
-    fmt.Println(lk.Values()) //
-}
-```
-
-
-
-### <span id="SinglyLink_Print">Print</span>
-<p>Print all nodes info of linklist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *SinglyLink[T]) Clear()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    
-    lk.Print() //[ &{Value:1 Pre:<nil> Next:0xc0000a4048}, &{Value:2 Pre:<nil> Next:0xc0000a4060}, &{Value:3 Pre:<nil> Next:<nil>} ]
-}
-```
-
-
-
-### 2. DoublyLink
-DoublyLink is a linked list, whose node has a value, a next pointer points to next node and pre pointer points to previous node of the link.
-
-### <span id="NewDoublyLink">NewDoublyLink</span>
-<p>Return a doubly link instance</p>
-
-<b>Signature:</b>
-
-```go
-type LinkNode[T any] struct {
-	Value T
-    Pre   *LinkNode[T]
-	Next  *LinkNode[T]
-}
-type DoublyLink[T any] struct {
-	Head   *datastructure.LinkNode[T]
-	length int
-}
-func NewDoublyLink[T any]() *DoublyLink[T]
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-    fmt.Println(lk)
-}
-```
-
-
-
-### <span id="DoublyLink_Values">Values</span>
-<p>Return a slice of all node value in doubly linklist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) Values() []T
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-
-### <span id="DoublyLink_InsertAt">InsertAt</span>
-<p>Insert value into doubly linklist at index, param `index` should between [0, len(DoublyLink)], if index do not meet the conditions, do nothing</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) InsertAt(index int, value T)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAt(1, 1) //do nothing
-
-    lk.InsertAt(0, 1)
-    lk.InsertAt(1, 2)
-    lk.InsertAt(2, 3)
-    lk.InsertAt(2, 4)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 4, 3}
-}
-```
-
-
-
-
-### <span id="DoublyLink_InsertAtHead">InsertAtHead</span>
-<p>Insert value into doubly linklist at head(first) index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) InsertAtHead(value T)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtHead(1)
-    lk.InsertAtHead(2)
-    lk.InsertAtHead(3)
-
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-
-### <span id="DoublyLink_InsertAtTail">InsertAtTail</span>
-<p>Insert value into doubly linklist at tail(last) index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) InsertAtTail(value T)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="DoublyLink_DeleteAt">DeleteAt</span>
-<p>Delete value at specific index, param `index` should be [0, len(DoublyLink)-1]</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) DeleteAt(index int)
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAt(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="DoublyLink_DeleteAtHead">DeleteAtHead</span>
-<p>Delete value in doubly linklist at first index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) DeleteAtHead()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAtHead()
-    
-    fmt.Println(lk.Values()) //[]int{2, 3, 4}
-}
-```
-
-
-
-
-### <span id="DoublyLink_DeleteAtTail">DeleteAtTail</span>
-<p>Delete value in doubly linklist at last index</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) DeleteAtTail() error
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    err := lk.DeleteAtTail()
-    
-    fmt.Println(err) //nil
-    fmt.Println(lk.Values()) //[]int{1, 2}
-}
-```
-
-
-
-
-### <span id="DoublyLink_Reverse">Reverse</span>
-<p>Reverse all nodes order in linkist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) Reverse()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Reverse()
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-### <span id="DoublyLink_GetMiddleNode">GetMiddleNode</span>
-<p>Get the node at middle index of linkist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) GetMiddleNode() *datastructure.LinkNode[T]
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    midNode := lk.GetMiddleNode()
-    fmt.Println(midNode.Value) //2
-}
-```
-
-
-
-### <span id="DoublyLink_Size">Size</span>
-<p>Get the number of nodes in linklist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) Size() int
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Size()) //3
-}
-```
-
-
-
-### <span id="DoublyLink_IsEmpty">IsEmpty</span>
-<p>Checks if linklist is empty or not</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) IsEmpty() bool
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-    fmt.Println(lk.IsEmpty()) //true
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.IsEmpty()) //false
-}
-```
-
-
-
-### <span id="DoublyLink_Clear">Clear</span>
-<p>Clear all nodes in the linklist, make it empty</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) Clear()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Clear()
-
-    fmt.Println(lk.Values()) //
-}
-```
-
-
-
-### <span id="DoublyLink_Print">Print</span>
-<p>Print all nodes info of linklist</p>
-
-<b>Signature:</b>
-
-```go
-func (link *DoublyLink[T]) Clear()
-```
-<b>Example:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    
-    lk.Print() //
-}
-```
\ No newline at end of file
diff --git a/docs/datastructure/linklist_zh-CN.md b/docs/datastructure/linklist_zh-CN.md
deleted file mode 100644
index f7bc2e4..0000000
--- a/docs/datastructure/linklist_zh-CN.md
+++ /dev/null
@@ -1,1017 +0,0 @@
-# Linklist
-Linklist是链表数据结构，它的节点有一个值和一个指向下一个节点的指针。
-
-<div STYLE="page-break-after: always;"></div>
-
-## 源码
-
-- [https://github.com/duke-git/lancet/blob/main/datastructure/link/singlylink.go](https://github.com/duke-git/lancet/blob/main/datastructure/link/singlylink.go)
-- [https://github.com/duke-git/lancet/blob/main/datastructure/link/doublylink.go](https://github.com/duke-git/lancet/blob/main/datastructure/link/doublylink.go)
-
-
-<div STYLE="page-break-after: always;"></div>
-
-## 用法
-```go
-import (
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-```
-
-<div STYLE="page-break-after: always;"></div>
-
-## 目录
-
-### 1. SinglyLink单链表
-
-- [NewSinglyLink](#NewSinglyLink)
-- [Values](#SinglyLink_Values)
-- [InsertAt](#SinglyLink_InsertAt)
-- [InsertAtHead](#SinglyLink_InsertAtHead)
-- [InsertAtTail](#SinglyLink_InsertAtTail)
-- [DeleteAt](#SinglyLink_DeleteAt)
-- [DeleteAtHead](#SinglyLink_DeleteAtHead)
-- [DeleteAtTail](#SinglyLink_DeleteAtTail)
-- [DeleteValue](#SinglyLink_DeleteValue)
-- [Reverse](#SinglyLink_Reverse)
-- [GetMiddleNode](#SinglyLink_GetMiddleNode)
-- [Size](#SinglyLink_Size)
-- [IsEmpty](#SinglyLink_IsEmpty)
-- [Clear](#SinglyLink_Clear)
-- [Print](#SinglyLink_Print)
-
-### 2. DoublyLink双向链表
-
-- [NewDoublyLink](#NewDoublyLink)
-- [Values](#DoublyLink_Values)
-- [InsertAt](#DoublyLink_InsertAt)
-- [InsertAtHead](#DoublyLink_InsertAtHead)
-- [InsertAtTail](#DoublyLink_InsertAtTail)
-- [DeleteAt](#DoublyLink_DeleteAt)
-- [DeleteAtHead](#DoublyLink_DeleteAtHead)
-- [DeleteAtTail](#DoublyLink_DeleteAtTail)
-- [Reverse](#DoublyLink_Reverse)
-- [GetMiddleNode](#DoublyLink_GetMiddleNode)
-- [Size](#DoublyLink_Size)
-- [IsEmpty](#DoublyLink_IsEmpty)
-- [Clear](#DoublyLink_Clear)
-- [Print](#DoublyLink_Print)
-
-
-<div STYLE="page-break-after: always;"></div>
-
-## 文档
-
-### 1. SinglyLink
-SingleLink是单向链表，它的节点有一个值和一个指向链表的下一个节点的指针。
-
-### <span id="NewSinglyLink">NewSinglyLink</span>
-<p>创建SinglyLink指针实例</p>
-
-<b>函数签名:</b>
-
-```go
-type LinkNode[T any] struct {
-	Value T
-	Next  *LinkNode[T]
-}
-type SinglyLink[T any] struct {
-	Head   *datastructure.LinkNode[T]
-	length int
-}
-func NewSinglyLink[T any]() *SinglyLink[T]
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-    fmt.Println(lk)
-}
-```
-
-
-
-### <span id="SinglyLink_Values">Values</span>
-<p>返回链表中所有节点值的切片</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) Values() []T
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-
-### <span id="SinglyLink_InsertAt">InsertAt</span>
-<p>将值插入到索引处的链表中，索引应大于或等于0且小于或等于链表节点数</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) InsertAt(index int, value T)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAt(1, 1) //do nothing
-
-    lk.InsertAt(0, 1)
-    lk.InsertAt(1, 2)
-    lk.InsertAt(2, 3)
-    lk.InsertAt(2, 4)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 4, 3}
-}
-```
-
-
-
-
-### <span id="SinglyLink_InsertAtHead">InsertAtHead</span>
-<p>将值插入到链表表头</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) InsertAtHead(value T)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtHead(1)
-    lk.InsertAtHead(2)
-    lk.InsertAtHead(3)
-
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-
-### <span id="SinglyLink_InsertAtTail">InsertAtTail</span>
-<p>将值插入到链表末尾</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) InsertAtTail(value T)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="SinglyLink_DeleteAt">DeleteAt</span>
-<p>删除特定索引处的值，索引应大于或等于0且小于或等于链接节点数-1</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteAt(index int)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAt(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="SinglyLink_DeleteAtHead">DeleteAtHead</span>
-<p>删除链表头节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteAtHead()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAtHead()
-    
-    fmt.Println(lk.Values()) //[]int{2, 3, 4}
-}
-```
-
-
-
-
-### <span id="SinglyLink_DeleteAtTail">DeleteAtTail</span>
-<p>删除链表末尾节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteAtTail()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.DeleteAtTail()
-    
-    fmt.Println(lk.Values()) //[]int{1, 2}
-}
-```
-
-
-
-### <span id="SinglyLink_DeleteValue">DeleteValue</span>
-<p>删除链表中指定的value值</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) DeleteValue(value T)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.DeleteValue(2)
-    fmt.Println(lk.Values()) //[]int{1, 3}
-}
-```
-
-
-
-
-### <span id="SinglyLink_Reverse">Reverse</span>
-<p>反转链表所有节点顺序</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) Reverse()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Reverse()
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-### <span id="SinglyLink_GetMiddleNode">GetMiddleNode</span>
-<p>获取链表中部节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) GetMiddleNode() *datastructure.LinkNode[T]
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    midNode := lk.GetMiddleNode()
-    fmt.Println(midNode.Value) //2
-}
-```
-
-
-
-### <span id="SinglyLink_Size">Size</span>
-<p>获取链表节点数量</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) Size() int
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Size()) //3
-}
-```
-
-
-
-### <span id="SinglyLink_IsEmpty">IsEmpty</span>
-<p>判断链表是否为空</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) IsEmpty() bool
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-    fmt.Println(lk.IsEmpty()) //true
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.IsEmpty()) //false
-}
-```
-
-
-
-### <span id="SinglyLink_Clear">Clear</span>
-<p>清空链表所有节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) Clear()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Clear()
-
-    fmt.Println(lk.Values()) //
-}
-```
-
-
-
-### <span id="SinglyLink_Print">Print</span>
-<p>打印链表结构</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *SinglyLink[T]) Clear()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewSinglyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    
-    lk.Print() //[ &{Value:1 Pre:<nil> Next:0xc0000a4048}, &{Value:2 Pre:<nil> Next:0xc0000a4060}, &{Value:3 Pre:<nil> Next:<nil>} ]
-}
-```
-
-
-
-### 2. DoublyLink
-DoublyLink是双向链表，它的节点有一个值，next指针指向下一个节点，pre指针指向前一个节点。
-
-### <span id="NewDoublyLink">NewDoublyLink</span>
-<p>创建NewDoublyLink指针实例</p>
-
-<b>函数签名:</b>
-
-```go
-type LinkNode[T any] struct {
-	Value T
-    Pre   *LinkNode[T]
-	Next  *LinkNode[T]
-}
-type DoublyLink[T any] struct {
-	Head   *datastructure.LinkNode[T]
-	length int
-}
-func NewDoublyLink[T any]() *DoublyLink[T]
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-    fmt.Println(lk)
-}
-```
-
-
-
-### <span id="DoublyLink_Values">Values</span>
-<p>返回链表中所有节点值的切片</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) Values() []T
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-
-### <span id="DoublyLink_InsertAt">InsertAt</span>
-<p>将值插入到索引处的链表中，索引应大于或等于0且小于或等于链表节点数</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) InsertAt(index int, value T)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAt(1, 1) //do nothing
-
-    lk.InsertAt(0, 1)
-    lk.InsertAt(1, 2)
-    lk.InsertAt(2, 3)
-    lk.InsertAt(2, 4)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 4, 3}
-}
-```
-
-
-
-
-### <span id="DoublyLink_InsertAtHead">InsertAtHead</span>
-<p>将值插入到链表表头</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) InsertAtHead(value T)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtHead(1)
-    lk.InsertAtHead(2)
-    lk.InsertAtHead(3)
-
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-
-### <span id="DoublyLink_InsertAtTail">InsertAtTail</span>
-<p>将值插入到链表末尾</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) InsertAtTail(value T)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="DoublyLink_DeleteAt">DeleteAt</span>
-<p>删除特定索引处的值，索引应大于或等于0且小于或等于链接节点数-1</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) DeleteAt(index int)
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAt(3)
-
-    fmt.Println(lk.Values()) //[]int{1, 2, 3}
-}
-```
-
-
-
-### <span id="DoublyLink_DeleteAtHead">DeleteAtHead</span>
-<p>删除链表头节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) DeleteAtHead()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    lk.InsertAtTail(4)
-
-    lk.DeleteAtHead()
-    
-    fmt.Println(lk.Values()) //[]int{2, 3, 4}
-}
-```
-
-
-
-
-### <span id="DoublyLink_DeleteAtTail">DeleteAtTail</span>
-<p>删除链表末尾节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) DeleteAtTail()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.DeleteAtTail()
-    
-    fmt.Println(lk.Values()) //[]int{1, 2}
-}
-```
-
-
-
-
-### <span id="DoublyLink_Reverse">Reverse</span>
-<p>反转链表所有节点顺序</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) Reverse()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Reverse()
-    fmt.Println(lk.Values()) //[]int{3, 2, 1}
-}
-```
-
-
-
-### <span id="DoublyLink_GetMiddleNode">GetMiddleNode</span>
-<p>获取链表中部节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) GetMiddleNode() *datastructure.LinkNode[T]
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    midNode := lk.GetMiddleNode()
-    fmt.Println(midNode.Value) //2
-}
-```
-
-
-
-### <span id="DoublyLink_Size">Size</span>
-<p>获取链表节点数量</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) Size() int
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.Size()) //3
-}
-```
-
-
-
-### <span id="DoublyLink_IsEmpty">IsEmpty</span>
-<p>判断链表是否为空</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) IsEmpty() bool
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-    fmt.Println(lk.IsEmpty()) //true
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    fmt.Println(lk.IsEmpty()) //false
-}
-```
-
-
-
-### <span id="DoublyLink_Clear">Clear</span>
-<p>清空链表所有节点</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) Clear()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-
-    lk.Clear()
-
-    fmt.Println(lk.Values()) //
-}
-```
-
-
-
-### <span id="DoublyLink_Print">Print</span>
-<p>打印链表结构</p>
-
-<b>函数签名:</b>
-
-```go
-func (link *DoublyLink[T]) Clear()
-```
-<b>例子:</b>
-
-```go
-package main
-
-import (
-    "fmt"
-    link "github.com/duke-git/lancet/v2/datastructure/link"
-)
-
-func main() {
-    lk := link.NewDoublyLink[int]()
-
-    lk.InsertAtTail(1)
-    lk.InsertAtTail(2)
-    lk.InsertAtTail(3)
-    
-    lk.Print() //
-}
-```
\ No newline at end of file