git/lancet
1
0
Fork 0
mirror of https://github.com/duke-git/lancet.git synced 2026-03-01 00:35:28 +08:00
Code Issues Projects Releases Wiki Activity

fix: fix lint warning 'ineffassign'

Browse Source
This commit is contained in:
dudaodong
2022-03-22 14:36:35 +08:00
parent dd3b1f3aed
commit 7fd9a94922
6 changed files with 22 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
datastructure/link/doublylink_test.go
View File

@@ -44,14 +44,11 @@ func TestDoublyLink_InsertAt(t *testing.T) {
err := link.InsertAt(1, 1) err := link.InsertAt(1, 1)
assert.IsNotNil(err) assert.IsNotNil(err)
err = link.InsertAt(0, 1) link.InsertAt(0, 1)
err = link.InsertAt(1, 2) link.InsertAt(1, 2)
err = link.InsertAt(2, 4) link.InsertAt(2, 4)
err = link.InsertAt(2, 3) link.InsertAt(2, 3)
if err != nil {
t.FailNow()
}
link.Print() link.Print()
expected := []int{1, 2, 3, 4} expected := []int{1, 2, 3, 4}

8
datastructure/link/singlylink_test.go
View File

@@ -44,10 +44,10 @@ func TestSinglyLink_InsertAt(t *testing.T) {
err := link.InsertAt(1, 1) err := link.InsertAt(1, 1)
assert.IsNotNil(err) assert.IsNotNil(err)
err = link.InsertAt(0, 1) link.InsertAt(0, 1)
err = link.InsertAt(1, 2) link.InsertAt(1, 2)
err = link.InsertAt(2, 4) link.InsertAt(2, 4)
err = link.InsertAt(2, 3) link.InsertAt(2, 3)
if err != nil { if err != nil {
t.FailNow() t.FailNow()

4
datastructure/list/list_test.go
View File

@@ -99,7 +99,7 @@ func TestPopFirst(t *testing.T) {
assert.Equal([]int{2, 3}, list.Data()) assert.Equal([]int{2, 3}, list.Data())
list2 := NewList([]int{}) list2 := NewList([]int{})
v, ok = list2.PopFirst() _, ok = list2.PopFirst()
assert.Equal(false, ok) assert.Equal(false, ok)
assert.Equal([]int{}, list2.Data()) assert.Equal([]int{}, list2.Data())
} }
@@ -114,7 +114,7 @@ func TestPopLast(t *testing.T) {
assert.Equal([]int{1, 2}, list.Data()) assert.Equal([]int{1, 2}, list.Data())
list2 := NewList([]int{}) list2 := NewList([]int{})
v, ok = list2.PopLast() _, ok = list2.PopLast()
assert.Equal(false, ok) assert.Equal(false, ok)
assert.Equal([]int{}, list2.Data()) assert.Equal([]int{}, list2.Data())
} }

8
datastructure/queue/linkedqueue_test.go
View File

@@ -40,14 +40,14 @@ func TestLinkedQueue_Front(t *testing.T) {
assert := internal.NewAssert(t, "TestLinkedQueue_Front") assert := internal.NewAssert(t, "TestLinkedQueue_Front")
queue := NewLinkedQueue[int]() queue := NewLinkedQueue[int]()
val, err := queue.Front() _, err := queue.Front()
assert.IsNotNil(err) assert.IsNotNil(err)
queue.EnQueue(1) queue.EnQueue(1)
queue.EnQueue(2) queue.EnQueue(2)
queue.EnQueue(3) queue.EnQueue(3)
val, err = queue.Front() val, err := queue.Front()
assert.Equal(1, *val) assert.Equal(1, *val)
assert.IsNil(err) assert.IsNil(err)
} }
@@ -56,14 +56,14 @@ func TestLinkedQueue_Back(t *testing.T) {
assert := internal.NewAssert(t, "TestLinkedQueue_Back") assert := internal.NewAssert(t, "TestLinkedQueue_Back")
queue := NewLinkedQueue[int]() queue := NewLinkedQueue[int]()
val, err := queue.Back() _, err := queue.Back()
assert.IsNotNil(err) assert.IsNotNil(err)
queue.EnQueue(1) queue.EnQueue(1)
queue.EnQueue(2) queue.EnQueue(2)
queue.EnQueue(3) queue.EnQueue(3)
val, err = queue.Back() val, err := queue.Back()
assert.Equal(3, *val) assert.Equal(3, *val)
assert.IsNil(err) assert.IsNil(err)
} }

8
datastructure/stack/arraystack_test.go
View File

@@ -26,14 +26,14 @@ func TestArrayStack_Pop(t *testing.T) {
assert := internal.NewAssert(t, "TestArrayStack_Pop") assert := internal.NewAssert(t, "TestArrayStack_Pop")
stack := NewArrayStack[int]() stack := NewArrayStack[int]()
topItem, err := stack.Pop() _, err := stack.Pop()
assert.IsNotNil(err) assert.IsNotNil(err)
stack.Push(1) stack.Push(1)
stack.Push(2) stack.Push(2)
stack.Push(3) stack.Push(3)
topItem, err = stack.Pop() topItem, err := stack.Pop()
assert.IsNil(err) assert.IsNil(err)
assert.Equal(3, *topItem) assert.Equal(3, *topItem)
@@ -45,14 +45,14 @@ func TestArrayStack_Peak(t *testing.T) {
assert := internal.NewAssert(t, "TestArrayStack_Peak") assert := internal.NewAssert(t, "TestArrayStack_Peak")
stack := NewArrayStack[int]() stack := NewArrayStack[int]()
topItem, err := stack.Peak() _, err := stack.Peak()
assert.IsNotNil(err) assert.IsNotNil(err)
stack.Push(1) stack.Push(1)
stack.Push(2) stack.Push(2)
stack.Push(3) stack.Push(3)
topItem, err = stack.Peak() topItem, err := stack.Peak()
assert.IsNil(err) assert.IsNil(err)
assert.Equal(3, *topItem) assert.Equal(3, *topItem)

8
datastructure/stack/linkedstack_test.go
View File

@@ -28,14 +28,14 @@ func TestLinkedStack_Pop(t *testing.T) {
assert := internal.NewAssert(t, "TestLinkedStack_Pop") assert := internal.NewAssert(t, "TestLinkedStack_Pop")
stack := NewLinkedStack[int]() stack := NewLinkedStack[int]()
topItem, err := stack.Pop() _, err := stack.Pop()
assert.IsNotNil(err) assert.IsNotNil(err)
stack.Push(1) stack.Push(1)
stack.Push(2) stack.Push(2)
stack.Push(3) stack.Push(3)
topItem, err = stack.Pop() topItem, err := stack.Pop()
assert.IsNil(err) assert.IsNil(err)
assert.Equal(3, *topItem) assert.Equal(3, *topItem)
@@ -48,14 +48,14 @@ func TestLinkedStack_Peak(t *testing.T) {
assert := internal.NewAssert(t, "TestLinkedStack_Peak") assert := internal.NewAssert(t, "TestLinkedStack_Peak")
stack := NewLinkedStack[int]() stack := NewLinkedStack[int]()
topItem, err := stack.Peak() _, err := stack.Peak()
assert.IsNotNil(err) assert.IsNotNil(err)
stack.Push(1) stack.Push(1)
stack.Push(2) stack.Push(2)
stack.Push(3) stack.Push(3)
topItem, err = stack.Peak() topItem, err := stack.Peak()
assert.IsNil(err) assert.IsNil(err)
assert.Equal(3, *topItem) assert.Equal(3, *topItem)