seaweedfs/weed/storage/needle_map/compact_map_test.go

182 lines
4.4 KiB
Go
Raw Normal View History

2019-04-19 04:43:36 +00:00
package needle_map
import (
2019-04-09 02:40:56 +00:00
"fmt"
"github.com/chrislusf/seaweedfs/weed/sequence"
. "github.com/chrislusf/seaweedfs/weed/storage/types"
2018-07-22 00:39:10 +00:00
"testing"
)
func TestSnowflakeSequencer(t *testing.T) {
m := NewCompactMap()
seq, _ := sequence.NewSnowflakeSequencer("for_test", 1)
for i := 0; i < 200000; i++ {
id := seq.NextFileId(1)
oldOffset, oldSize := m.Set(NeedleId(id), ToOffset(8), 3000073)
if oldSize != 0 {
t.Errorf("id %d oldOffset %v oldSize %d", id, oldOffset, oldSize)
}
}
}
2018-12-22 19:05:29 +00:00
func TestOverflow2(t *testing.T) {
m := NewCompactMap()
2019-12-24 19:29:26 +00:00
_, oldSize := m.Set(NeedleId(150088), ToOffset(8), 3000073)
2019-12-24 22:56:16 +00:00
if oldSize != 0 {
2019-12-24 19:29:26 +00:00
t.Fatalf("expecting no previous data")
}
_, oldSize = m.Set(NeedleId(150088), ToOffset(8), 3000073)
2019-12-24 22:56:16 +00:00
if oldSize != 3000073 {
2019-12-24 19:29:26 +00:00
t.Fatalf("expecting previous data size is %d, not %d", 3000073, oldSize)
}
2019-04-09 02:40:56 +00:00
m.Set(NeedleId(150073), ToOffset(8), 3000073)
m.Set(NeedleId(150089), ToOffset(8), 3000073)
m.Set(NeedleId(150076), ToOffset(8), 3000073)
m.Set(NeedleId(150124), ToOffset(8), 3000073)
m.Set(NeedleId(150137), ToOffset(8), 3000073)
m.Set(NeedleId(150147), ToOffset(8), 3000073)
m.Set(NeedleId(150145), ToOffset(8), 3000073)
m.Set(NeedleId(150158), ToOffset(8), 3000073)
m.Set(NeedleId(150162), ToOffset(8), 3000073)
2018-12-22 19:05:29 +00:00
m.AscendingVisit(func(value NeedleValue) error {
2018-12-22 19:05:29 +00:00
println("needle key:", value.Key)
return nil
})
}
2013-10-31 19:55:51 +00:00
func TestIssue52(t *testing.T) {
m := NewCompactMap()
2019-04-09 02:40:56 +00:00
m.Set(NeedleId(10002), ToOffset(10002), 10002)
if element, ok := m.Get(NeedleId(10002)); ok {
2019-04-09 02:40:56 +00:00
fmt.Printf("key %d ok %v %d, %v, %d\n", 10002, ok, element.Key, element.Offset, element.Size)
2013-10-31 19:55:51 +00:00
}
2019-04-09 02:40:56 +00:00
m.Set(NeedleId(10001), ToOffset(10001), 10001)
if element, ok := m.Get(NeedleId(10002)); ok {
2019-04-09 02:40:56 +00:00
fmt.Printf("key %d ok %v %d, %v, %d\n", 10002, ok, element.Key, element.Offset, element.Size)
2013-10-31 19:55:51 +00:00
} else {
t.Fatal("key 10002 missing after setting 10001")
}
}
2018-12-09 09:27:11 +00:00
func TestCompactMap(t *testing.T) {
m := NewCompactMap()
for i := uint32(0); i < 100*batch; i += 2 {
m.Set(NeedleId(i), ToOffset(int64(i)), Size(i))
}
for i := uint32(0); i < 100*batch; i += 37 {
m.Delete(NeedleId(i))
}
for i := uint32(0); i < 10*batch; i += 3 {
m.Set(NeedleId(i), ToOffset(int64(i+11)), Size(i+5))
}
2013-01-17 08:56:56 +00:00
// 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)
2013-01-17 08:56:56 +00:00
// }
// }
for i := uint32(0); i < 10*batch; i++ {
v, ok := m.Get(NeedleId(i))
if i%3 == 0 {
2013-01-17 08:56:56 +00:00
if !ok {
t.Fatal("key", i, "missing!")
}
if v.Size != Size(i+5) {
t.Fatal("key", i, "size", v.Size)
}
} else if i%37 == 0 {
2020-08-19 01:01:37 +00:00
if ok && v.Size.IsValid() {
t.Fatal("key", i, "should have been deleted needle value", v)
}
} else if i%2 == 0 {
if v.Size != Size(i) {
t.Fatal("key", i, "size", v.Size)
}
}
}
for i := uint32(10 * batch); i < 100*batch; i++ {
v, ok := m.Get(NeedleId(i))
if i%37 == 0 {
2020-08-19 01:01:37 +00:00
if ok && v.Size.IsValid() {
2013-01-17 08:56:56 +00:00
t.Fatal("key", i, "should have been deleted needle value", v)
}
} else if i%2 == 0 {
2013-01-17 08:56:56 +00:00
if v == nil {
t.Fatal("key", i, "missing")
}
if v.Size != Size(i) {
t.Fatal("key", i, "size", v.Size)
}
}
}
}
2018-12-09 09:27:11 +00:00
func TestOverflow(t *testing.T) {
cs := NewCompactSection(1)
2018-12-09 09:27:11 +00:00
cs.setOverflowEntry(1, ToOffset(12), 12)
cs.setOverflowEntry(2, ToOffset(12), 12)
cs.setOverflowEntry(3, ToOffset(12), 12)
cs.setOverflowEntry(4, ToOffset(12), 12)
cs.setOverflowEntry(5, ToOffset(12), 12)
2018-12-09 09:27:11 +00:00
if cs.overflow[2].Key != 3 {
t.Fatalf("expecting o[2] has key 3: %+v", cs.overflow[2].Key)
2018-12-09 09:27:11 +00:00
}
cs.setOverflowEntry(3, ToOffset(24), 24)
2018-12-09 09:27:11 +00:00
if cs.overflow[2].Key != 3 {
t.Fatalf("expecting o[2] has key 3: %+v", cs.overflow[2].Key)
2018-12-09 09:27:11 +00:00
}
if cs.overflow[2].Size != 24 {
t.Fatalf("expecting o[2] has size 24: %+v", cs.overflow[2].Size)
2018-12-09 09:27:11 +00:00
}
cs.deleteOverflowEntry(4)
2018-12-09 09:27:11 +00:00
2020-08-19 08:37:56 +00:00
if len(cs.overflow) != 5 {
t.Fatalf("expecting 5 entries now: %+v", cs.overflow)
2018-12-09 09:27:11 +00:00
}
_, x, _ := cs.findOverflowEntry(5)
2018-12-09 09:27:11 +00:00
if x.Key != 5 {
t.Fatalf("expecting entry 5 now: %+v", x)
}
for i, x := range cs.overflow {
2018-12-09 09:27:11 +00:00
println("overflow[", i, "]:", x.Key)
}
println()
cs.deleteOverflowEntry(1)
2018-12-09 09:27:11 +00:00
for i, x := range cs.overflow {
2020-08-19 08:37:56 +00:00
println("overflow[", i, "]:", x.Key, "size", x.Size)
2018-12-09 09:27:11 +00:00
}
println()
cs.setOverflowEntry(4, ToOffset(44), 44)
for i, x := range cs.overflow {
2018-12-09 09:27:11 +00:00
println("overflow[", i, "]:", x.Key)
}
println()
cs.setOverflowEntry(1, ToOffset(11), 11)
2018-12-09 09:27:11 +00:00
for i, x := range cs.overflow {
2018-12-09 09:27:11 +00:00
println("overflow[", i, "]:", x.Key)
}
println()
}