git/lancet
1
0
Fork 0
mirror of https://github.com/duke-git/lancet.git synced 2026-02-04 12:52:28 +08:00
Code Issues Projects Releases Wiki Activity

test: remove print info in test function

Browse Source
This commit is contained in:
dudaodong
2022-12-10 19:19:49 +08:00
parent 251f899f18
commit 8b99641de0
6 changed files with 1 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
datastructure/heap/maxheap_test.go
View File

@@ -30,8 +30,6 @@ func TestMaxHeap_BuildMaxHeap(t *testing.T) {
assert.Equal(expected, heap.data) assert.Equal(expected, heap.data)
assert.Equal(12, heap.Size()) assert.Equal(12, heap.Size())
heap.PrintStructure()
} }
func TestMaxHeap_Push(t *testing.T) { func TestMaxHeap_Push(t *testing.T) {

1
datastructure/link/singlylink_test.go
View File

@@ -145,7 +145,6 @@ func TestSinglyLink_Reverse(t *testing.T) {
link.InsertAtTail(4) link.InsertAtTail(4)
link.Reverse() link.Reverse()
link.Print()
assert.Equal([]int{4, 3, 2, 1}, link.Values()) assert.Equal([]int{4, 3, 2, 1}, link.Values())
} }

7
datastructure/queue/arrayqueue_test.go
View File

@@ -18,8 +18,6 @@ func TestArrayQueue_Enqueue(t *testing.T) {
data := queue.Data() data := queue.Data()
size := queue.Size() size := queue.Size()
queue.Print()
assert.Equal(expected, data) assert.Equal(expected, data)
assert.Equal(3, size) assert.Equal(3, size)
} }
@@ -35,7 +33,6 @@ func TestArrayQueue_Dequeue(t *testing.T) {
val, ok := queue.Dequeue() val, ok := queue.Dequeue()
assert.Equal(true, ok) assert.Equal(true, ok)
queue.Print()
assert.Equal(1, val) assert.Equal(1, val)
assert.Equal([]int{2, 3}, queue.Data()) assert.Equal([]int{2, 3}, queue.Data())
} }
@@ -50,8 +47,6 @@ func TestArrayQueue_Front(t *testing.T) {
val := queue.Front() val := queue.Front()
queue.Print()
assert.Equal(1, val) assert.Equal(1, val)
assert.Equal([]int{1, 2, 3}, queue.Data()) assert.Equal([]int{1, 2, 3}, queue.Data())
} }
@@ -66,8 +61,6 @@ func TestArrayQueue_Back(t *testing.T) {
val := queue.Back() val := queue.Back()
queue.Print()
assert.Equal(3, val) assert.Equal(3, val)
assert.Equal([]int{1, 2, 3}, queue.Data()) assert.Equal([]int{1, 2, 3}, queue.Data())
} }

2
datastructure/queue/linkedqueue_test.go
View File

@@ -14,8 +14,6 @@ func TestLinkedQueue_Enqueue(t *testing.T) {
queue.Enqueue(2) queue.Enqueue(2)
queue.Enqueue(3) queue.Enqueue(3)
queue.Print()
assert.Equal([]int{1, 2, 3}, queue.Data()) assert.Equal([]int{1, 2, 3}, queue.Data())
assert.Equal(3, queue.Size()) assert.Equal(3, queue.Size())
} }

2
datastructure/stack/linkedstack_test.go
View File

@@ -14,8 +14,6 @@ func TestLinkedStack_Push(t *testing.T) {
stack.Push(2) stack.Push(2)
stack.Push(3) stack.Push(3)
stack.Print()
expected := []int{3, 2, 1} expected := []int{3, 2, 1}
values := stack.Data() values := stack.Data()
size := stack.Size() size := stack.Size()

12
datastructure/tree/bstree_test.go
View File

@@ -27,8 +27,6 @@ func TestBSTree_Insert(t *testing.T) {
bstree.Insert(5) bstree.Insert(5)
bstree.Insert(2) bstree.Insert(2)
bstree.Insert(4) bstree.Insert(4)
bstree.Print()
} }
func TestBSTree_PreOrderTraverse(t *testing.T) { func TestBSTree_PreOrderTraverse(t *testing.T) {
@@ -86,8 +84,6 @@ func TestBSTree_LevelOrderTraverse(t *testing.T) {
bstree.Insert(2) bstree.Insert(2)
bstree.Insert(4) bstree.Insert(4)
bstree.Print()
acturl := bstree.LevelOrderTraverse() acturl := bstree.LevelOrderTraverse()
t.Log(acturl) t.Log(acturl)
assert.Equal([]int{6, 5, 7, 2, 4}, acturl) assert.Equal([]int{6, 5, 7, 2, 4}, acturl)
@@ -103,10 +99,8 @@ func TestBSTree_Delete(t *testing.T) {
bstree.Insert(2) bstree.Insert(2)
bstree.Insert(4) bstree.Insert(4)
bstree.Print()
bstree.Delete(4) bstree.Delete(4)
bstree.Print()
acturl1 := bstree.InOrderTraverse() acturl1 := bstree.InOrderTraverse()
t.Log(acturl1) t.Log(acturl1)
assert.Equal([]int{2, 5, 6, 7}, acturl1) assert.Equal([]int{2, 5, 6, 7}, acturl1)
@@ -129,8 +123,6 @@ func TestBSTree_Depth(t *testing.T) {
bstree.Insert(2) bstree.Insert(2)
bstree.Insert(4) bstree.Insert(4)
bstree.Print()
assert.Equal(bstree.Depth(), 4) assert.Equal(bstree.Depth(), 4)
} }
@@ -150,8 +142,6 @@ func TestBSTree_IsSubTree(t *testing.T) {
subTree.Insert(4) subTree.Insert(4)
subTree.Insert(6) subTree.Insert(6)
subTree.Print()
assert.Equal(true, superTree.HasSubTree(subTree)) assert.Equal(true, superTree.HasSubTree(subTree))
assert.Equal(false, subTree.HasSubTree(superTree)) assert.Equal(false, subTree.HasSubTree(superTree))
} }