Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
K
k3s
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Registry
Registry
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Jacklull
k3s
Commits
a0786a2d
Commit
a0786a2d
authored
Feb 28, 2018
by
zhangxiaoyu-zidif
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
add unit test case for nodenames comparison
parent
e30b6634
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
11 additions
and
3 deletions
+11
-3
service_controller_test.go
pkg/controller/service/service_controller_test.go
+11
-3
No files found.
pkg/controller/service/service_controller_test.go
View file @
a0786a2d
...
...
@@ -779,13 +779,21 @@ func TestServiceCache(t *testing.T) {
//Test a utility functions as its not easy to unit test nodeSyncLoop directly
func
TestNodeSlicesEqualForLB
(
t
*
testing
.
T
)
{
numNodes
:=
10
nArray
:=
make
([]
*
v1
.
Node
,
10
)
nArray
:=
make
([]
*
v1
.
Node
,
numNodes
)
mArray
:=
make
([]
*
v1
.
Node
,
numNodes
)
for
i
:=
0
;
i
<
numNodes
;
i
++
{
nArray
[
i
]
=
&
v1
.
Node
{}
nArray
[
i
]
.
Name
=
fmt
.
Sprintf
(
"node1"
)
nArray
[
i
]
.
Name
=
fmt
.
Sprintf
(
"node%d"
,
i
)
}
for
i
:=
0
;
i
<
numNodes
;
i
++
{
mArray
[
i
]
=
&
v1
.
Node
{}
mArray
[
i
]
.
Name
=
fmt
.
Sprintf
(
"node%d"
,
i
+
1
)
}
if
!
nodeSlicesEqualForLB
(
nArray
,
nArray
)
{
t
.
Errorf
(
"nodeSlicesEqualForLB() Expected=true Obtained=false"
)
}
if
nodeSlicesEqualForLB
(
nArray
,
mArray
)
{
t
.
Errorf
(
"nodeSlicesEqualForLB() Expected=false Obtained=true"
)
}
}
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment