mirror of
https://github.com/chrislusf/seaweedfs
synced 2024-09-03 15:40:35 +02:00
78 lines
1.6 KiB
Go
78 lines
1.6 KiB
Go
package storage
|
|
|
|
import (
|
|
"testing"
|
|
)
|
|
|
|
func TestIssue52(t *testing.T) {
|
|
m := NewCompactMap()
|
|
m.Set(Key(10002), 10002, 10002)
|
|
if element, ok := m.Get(Key(10002)); ok {
|
|
println("key", 10002, "ok", ok, element.Key, element.Offset, element.Size)
|
|
}
|
|
m.Set(Key(10001), 10001, 10001)
|
|
if element, ok := m.Get(Key(10002)); ok {
|
|
println("key", 10002, "ok", ok, element.Key, element.Offset, element.Size)
|
|
} else {
|
|
t.Fatal("key 10002 missing after setting 10001")
|
|
}
|
|
}
|
|
|
|
func TestXYZ(t *testing.T) {
|
|
m := NewCompactMap()
|
|
for i := uint32(0); i < 100*batch; i += 2 {
|
|
m.Set(Key(i), i, i)
|
|
}
|
|
|
|
for i := uint32(0); i < 100*batch; i += 37 {
|
|
m.Delete(Key(i))
|
|
}
|
|
|
|
for i := uint32(0); i < 10*batch; i += 3 {
|
|
m.Set(Key(i), i+11, i+5)
|
|
}
|
|
|
|
// for i := uint32(0); i < 100; i++ {
|
|
// if v := m.Get(Key(i)); v != nil {
|
|
// glog.V(4).Infoln(i, "=", v.Key, v.Offset, v.Size)
|
|
// }
|
|
// }
|
|
|
|
for i := uint32(0); i < 10*batch; i++ {
|
|
v, ok := m.Get(Key(i))
|
|
if i%3 == 0 {
|
|
if !ok {
|
|
t.Fatal("key", i, "missing!")
|
|
}
|
|
if v.Size != i+5 {
|
|
t.Fatal("key", i, "size", v.Size)
|
|
}
|
|
} else if i%37 == 0 {
|
|
if ok && v.Size > 0 {
|
|
t.Fatal("key", i, "should have been deleted needle value", v)
|
|
}
|
|
} else if i%2 == 0 {
|
|
if v.Size != i {
|
|
t.Fatal("key", i, "size", v.Size)
|
|
}
|
|
}
|
|
}
|
|
|
|
for i := uint32(10 * batch); i < 100*batch; i++ {
|
|
v, ok := m.Get(Key(i))
|
|
if i%37 == 0 {
|
|
if ok && v.Size > 0 {
|
|
t.Fatal("key", i, "should have been deleted needle value", v)
|
|
}
|
|
} else if i%2 == 0 {
|
|
if v == nil {
|
|
t.Fatal("key", i, "missing")
|
|
}
|
|
if v.Size != i {
|
|
t.Fatal("key", i, "size", v.Size)
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|