123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166 |
- package needle_map
- import (
- "fmt"
- . "github.com/chrislusf/seaweedfs/weed/storage/types"
- "testing"
- )
- func TestOverflow2(t *testing.T) {
- m := NewCompactMap()
- _, oldSize := m.Set(NeedleId(150088), ToOffset(8), 3000073)
- if oldSize != 0 {
- t.Fatalf("expecting no previous data")
- }
- _, oldSize = m.Set(NeedleId(150088), ToOffset(8), 3000073)
- if oldSize != 3000073 {
- t.Fatalf("expecting previous data size is %d, not %d", 3000073, oldSize)
- }
- 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)
- m.AscendingVisit(func(value NeedleValue) error {
- println("needle key:", value.Key)
- return nil
- })
- }
- func TestIssue52(t *testing.T) {
- m := NewCompactMap()
- m.Set(NeedleId(10002), ToOffset(10002), 10002)
- if element, ok := m.Get(NeedleId(10002)); ok {
- fmt.Printf("key %d ok %v %d, %v, %d\n", 10002, ok, element.Key, element.Offset, element.Size)
- }
- m.Set(NeedleId(10001), ToOffset(10001), 10001)
- if element, ok := m.Get(NeedleId(10002)); ok {
- fmt.Printf("key %d ok %v %d, %v, %d\n", 10002, ok, element.Key, element.Offset, element.Size)
- } else {
- t.Fatal("key 10002 missing after setting 10001")
- }
- }
- 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))
- }
- // 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(NeedleId(i))
- if i%3 == 0 {
- 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 {
- 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 {
- if ok && v.Size.IsValid() {
- 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 != Size(i) {
- t.Fatal("key", i, "size", v.Size)
- }
- }
- }
- }
- func TestOverflow(t *testing.T) {
- cs := NewCompactSection(1)
- 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)
- if cs.overflow[2].Key != 3 {
- t.Fatalf("expecting o[2] has key 3: %+v", cs.overflow[2].Key)
- }
- cs.setOverflowEntry(3, ToOffset(24), 24)
- if cs.overflow[2].Key != 3 {
- t.Fatalf("expecting o[2] has key 3: %+v", cs.overflow[2].Key)
- }
- if cs.overflow[2].Size != 24 {
- t.Fatalf("expecting o[2] has size 24: %+v", cs.overflow[2].Size)
- }
- cs.deleteOverflowEntry(4)
- if len(cs.overflow) != 5 {
- t.Fatalf("expecting 5 entries now: %+v", cs.overflow)
- }
- _, x, _ := cs.findOverflowEntry(5)
- if x.Key != 5 {
- t.Fatalf("expecting entry 5 now: %+v", x)
- }
- for i, x := range cs.overflow {
- println("overflow[", i, "]:", x.Key)
- }
- println()
- cs.deleteOverflowEntry(1)
- for i, x := range cs.overflow {
- println("overflow[", i, "]:", x.Key, "size", x.Size)
- }
- println()
- cs.setOverflowEntry(4, ToOffset(44), 44)
- for i, x := range cs.overflow {
- println("overflow[", i, "]:", x.Key)
- }
- println()
- cs.setOverflowEntry(1, ToOffset(11), 11)
- for i, x := range cs.overflow {
- println("overflow[", i, "]:", x.Key)
- }
- println()
- }
|