git/lancet
1
0
Fork 0
mirror of https://github.com/duke-git/lancet.git synced 2026-02-08 14:42:27 +08:00
Code Issues Projects Releases Wiki Activity

upgrade go module v2

Browse Source
This commit is contained in:
dudaodong
2022-03-17 10:57:35 +08:00
parent 1434e00712
commit 50c6e51393
42 changed files with 46 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
datastructure/tree/bstree.go
View File

@@ -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,

2
datastructure/tree/bstree_test.go
View File

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

4
datastructure/tree/tree_internal.go
View File

@@ -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 {