gitlab-com-seaweedfs/seaweedfs
1
0
Fork 0
mirror of https://github.com/seaweedfs/seaweedfs.git synced 2024-01-19 02:48:24 +00:00
Code Issues Projects Releases Wiki Activity

test: add fail message

Browse source
This commit is contained in:
Chris Lu 2021-10-13 20:42:16 -07:00
parent b693a8d6b9
commit 4cbd390fbe
1 changed files with 3 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
weed/util/skiplist/skiplist_test.go
View file

@ -230,7 +230,7 @@ func TestFindGreaterOrEqual(t *testing.T) {
// Test on empty list. // Test on empty list.
if _, _, ok, _ := listPointer.FindGreaterOrEqual(Element(0)); ok { if _, _, ok, _ := listPointer.FindGreaterOrEqual(Element(0)); ok {
t.Fail() t.Errorf("found element 0 in an empty list")
} }
list = New(memStore) list = New(memStore)
@ -250,16 +250,14 @@ func TestFindGreaterOrEqual(t *testing.T) {
// v should be bigger or equal to f // v should be bigger or equal to f
// If we compare directly, we get an equal key with a difference on the 10th decimal point, which fails. // If we compare directly, we get an equal key with a difference on the 10th decimal point, which fails.
if bytes.Compare(v.Key, key) < 0 { if bytes.Compare(v.Key, key) < 0 {
fmt.Printf("v: %s\n key: %s\n\n", string(v.Key), string(key)) t.Errorf("v: %s\n key: %s\n\n", string(v.Key), string(key))
t.Fail()
} }
} else { } else {
lastNode, _ := list.GetLargestNode() lastNode, _ := list.GetLargestNode()
lastV := lastNode.GetValue() lastV := lastNode.GetValue()
// It is OK, to fail, as long as f is bigger than the last element. // It is OK, to fail, as long as f is bigger than the last element.
if bytes.Compare(key, lastV) <= 0 { if bytes.Compare(key, lastV) <= 0 {
fmt.Printf("lastV: %s\n key: %s\n\n", string(lastV), string(key)) t.Errorf("lastV: %s\n key: %s\n\n", string(lastV), string(key))
t.Fail()
} }
} }
} }