upgrade go module v2

datastructure/link/doublylink.go

@@ -4,7 +4,7 @@ import (
 	"errors"
 	"fmt"
 
-	"github.com/duke-git/lancet/datastructure"
+	"github.com/duke-git/lancet/v2/datastructure"
 )
 
 // DoublyLink is a linked list. Whose node has a generic Value, Pre pointer points to a previous node of the link, Next pointer points to a next node of the link.

datastructure/link/doublylink_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestDoublyLink_InsertAtFirst(t *testing.T) {

datastructure/link/singlylink.go

@@ -4,7 +4,7 @@ import (
 	"errors"
 	"fmt"
 
-	"github.com/duke-git/lancet/datastructure"
+	"github.com/duke-git/lancet/v2/datastructure"
 )
 
 // SinglyLink is a linked list. Whose node has a Value generics and Next pointer points to a next node of the link.

datastructure/link/singlylink_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestSinglyLink_InsertAtFirst(t *testing.T) {

datastructure/list/list_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestListData(t *testing.T) {

datastructure/queue/arrayqueue_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestArrayQueue_EnQueue(t *testing.T) {

datastructure/queue/circularqueue_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestCircularQueue_EnQueue(t *testing.T) {

datastructure/queue/linkedqueue.go

@@ -4,7 +4,7 @@ import (
 	"errors"
 	"fmt"
 
-	"github.com/duke-git/lancet/datastructure"
+	"github.com/duke-git/lancet/v2/datastructure"
 )
 
 // LinkedQueue implements queue with link list

datastructure/queue/linkedqueue_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestLinkedQueue_EnQueue(t *testing.T) {

datastructure/set/set_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestSet_Add(t *testing.T) {

datastructure/stack/arraystack_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestArrayStack_Push(t *testing.T) {

datastructure/stack/linkedstack.go

@@ -4,7 +4,7 @@ import (
 	"errors"
 	"fmt"
 
-	"github.com/duke-git/lancet/datastructure"
+	"github.com/duke-git/lancet/v2/datastructure"
 )
 
 // LinkedStack implements stack with link list

datastructure/stack/linkedstack_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 func TestLinkedStack_Push(t *testing.T) {

datastructure/tree/bstree.go

@@ -3,8 +3,8 @@ package datastructure
 import (
 	"math"
 
-	"github.com/duke-git/lancet/datastructure"
-	"github.com/duke-git/lancet/lancetconstraints"
+	"github.com/duke-git/lancet/v2/datastructure"
+	"github.com/duke-git/lancet/v2/lancetconstraints"
 )
 
 // BSTree is a binary search tree data structure in which each node has at most two children,

datastructure/tree/bstree_test.go

@@ -3,7 +3,7 @@ package datastructure
 import (
 	"testing"
 
-	"github.com/duke-git/lancet/internal"
+	"github.com/duke-git/lancet/v2/internal"
 )
 
 type intComparator struct{}

datastructure/tree/tree_internal.go

@@ -4,8 +4,8 @@ import (
 	"fmt"
 	"math"
 
-	"github.com/duke-git/lancet/datastructure"
-	"github.com/duke-git/lancet/lancetconstraints"
+	"github.com/duke-git/lancet/v2/datastructure"
+	"github.com/duke-git/lancet/v2/lancetconstraints"
 )
 
 func preOrderTraverse[T any](node *datastructure.TreeNode[T]) []T {