vector_test.go 2.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134
  1. // Copyright (C) 2015 The Protocol Authors.
  2. package protocol
  3. import "testing"
  4. func TestUpdate(t *testing.T) {
  5. var v Vector
  6. // Append
  7. v = v.Update(42)
  8. expected := Vector{Counter{42, 1}}
  9. if v.Compare(expected) != Equal {
  10. t.Errorf("Update error, %+v != %+v", v, expected)
  11. }
  12. // Insert at front
  13. v = v.Update(36)
  14. expected = Vector{Counter{36, 1}, Counter{42, 1}}
  15. if v.Compare(expected) != Equal {
  16. t.Errorf("Update error, %+v != %+v", v, expected)
  17. }
  18. // Insert in moddle
  19. v = v.Update(37)
  20. expected = Vector{Counter{36, 1}, Counter{37, 1}, Counter{42, 1}}
  21. if v.Compare(expected) != Equal {
  22. t.Errorf("Update error, %+v != %+v", v, expected)
  23. }
  24. // Update existing
  25. v = v.Update(37)
  26. expected = Vector{Counter{36, 1}, Counter{37, 2}, Counter{42, 1}}
  27. if v.Compare(expected) != Equal {
  28. t.Errorf("Update error, %+v != %+v", v, expected)
  29. }
  30. }
  31. func TestCopy(t *testing.T) {
  32. v0 := Vector{Counter{42, 1}}
  33. v1 := v0.Copy()
  34. v1.Update(42)
  35. if v0.Compare(v1) != Lesser {
  36. t.Errorf("Copy error, %+v should be ancestor of %+v", v0, v1)
  37. }
  38. }
  39. func TestMerge(t *testing.T) {
  40. testcases := []struct {
  41. a, b, m Vector
  42. }{
  43. // No-ops
  44. {
  45. Vector{},
  46. Vector{},
  47. Vector{},
  48. },
  49. {
  50. Vector{Counter{22, 1}, Counter{42, 1}},
  51. Vector{Counter{22, 1}, Counter{42, 1}},
  52. Vector{Counter{22, 1}, Counter{42, 1}},
  53. },
  54. // Appends
  55. {
  56. Vector{},
  57. Vector{Counter{22, 1}, Counter{42, 1}},
  58. Vector{Counter{22, 1}, Counter{42, 1}},
  59. },
  60. {
  61. Vector{Counter{22, 1}},
  62. Vector{Counter{42, 1}},
  63. Vector{Counter{22, 1}, Counter{42, 1}},
  64. },
  65. {
  66. Vector{Counter{22, 1}},
  67. Vector{Counter{22, 1}, Counter{42, 1}},
  68. Vector{Counter{22, 1}, Counter{42, 1}},
  69. },
  70. // Insert
  71. {
  72. Vector{Counter{22, 1}, Counter{42, 1}},
  73. Vector{Counter{22, 1}, Counter{23, 2}, Counter{42, 1}},
  74. Vector{Counter{22, 1}, Counter{23, 2}, Counter{42, 1}},
  75. },
  76. {
  77. Vector{Counter{42, 1}},
  78. Vector{Counter{22, 1}},
  79. Vector{Counter{22, 1}, Counter{42, 1}},
  80. },
  81. // Update
  82. {
  83. Vector{Counter{22, 1}, Counter{42, 2}},
  84. Vector{Counter{22, 2}, Counter{42, 1}},
  85. Vector{Counter{22, 2}, Counter{42, 2}},
  86. },
  87. // All of the above
  88. {
  89. Vector{Counter{10, 1}, Counter{20, 2}, Counter{30, 1}},
  90. Vector{Counter{5, 1}, Counter{10, 2}, Counter{15, 1}, Counter{20, 1}, Counter{25, 1}, Counter{35, 1}},
  91. Vector{Counter{5, 1}, Counter{10, 2}, Counter{15, 1}, Counter{20, 2}, Counter{25, 1}, Counter{30, 1}, Counter{35, 1}},
  92. },
  93. }
  94. for i, tc := range testcases {
  95. if m := tc.a.Merge(tc.b); m.Compare(tc.m) != Equal {
  96. t.Errorf("%d: %+v.Merge(%+v) == %+v (expected %+v)", i, tc.a, tc.b, m, tc.m)
  97. }
  98. }
  99. }
  100. func TestCounterValue(t *testing.T) {
  101. v0 := Vector{Counter{42, 1}, Counter{64, 5}}
  102. if v0.Counter(42) != 1 {
  103. t.Error("Counter error, %d != %d", v0.Counter(42), 1)
  104. }
  105. if v0.Counter(64) != 5 {
  106. t.Error("Counter error, %d != %d", v0.Counter(64), 5)
  107. }
  108. if v0.Counter(72) != 0 {
  109. t.Error("Counter error, %d != %d", v0.Counter(72), 0)
  110. }
  111. }