diff options
author | 2019-01-18 16:54:25 -0800 | |
---|---|---|
committer | 2019-01-18 16:54:30 -0800 | |
commit | 96c1fc6a2be0cf4dc39d93bfc7f8df0cd76a7b14 (patch) | |
tree | 6ca4e827f22237a159c651cee285ffb9f3de8649 /src/k8splugin/rb/definition_test.go | |
parent | 4bfbc6d3fb1cb11ac2a409764a1380d1741f2af1 (diff) |
Fix sorting with right index value
Fix the less function used in sort.Slice
with the right index.
I am using the same index which obviously will not work.
Issue-ID: MULTICLOUD-439
Change-Id: Ibb78c03d67cf59e3941acc786796d0cc69b4f0aa
Signed-off-by: Kiran Kamineni <kiran.k.kamineni@intel.com>
Diffstat (limited to 'src/k8splugin/rb/definition_test.go')
-rw-r--r-- | src/k8splugin/rb/definition_test.go | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/src/k8splugin/rb/definition_test.go b/src/k8splugin/rb/definition_test.go index 6074f8b3..b3603136 100644 --- a/src/k8splugin/rb/definition_test.go +++ b/src/k8splugin/rb/definition_test.go @@ -149,12 +149,12 @@ func TestListDefinition(t *testing.T) { // Since the order of returned slice is not guaranteed // Check both and return error if both don't match sort.Slice(got, func(i, j int) bool { - return got[i].UUID < got[i].UUID + return got[i].UUID < got[j].UUID }) // Sort both as it is not expected that testCase.expected // is sorted sort.Slice(testCase.expected, func(i, j int) bool { - return testCase.expected[i].UUID < testCase.expected[i].UUID + return testCase.expected[i].UUID < testCase.expected[j].UUID }) if reflect.DeepEqual(testCase.expected, got) == false { |