intset_test.go 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180
  1. // Copyright (c) Tailscale Inc & AUTHORS
  2. // SPDX-License-Identifier: BSD-3-Clause
  3. package set
  4. import (
  5. "maps"
  6. "math"
  7. "slices"
  8. "testing"
  9. "golang.org/x/exp/constraints"
  10. )
  11. func TestIntSet(t *testing.T) {
  12. t.Run("Int64", func(t *testing.T) {
  13. ss := make(Set[int64])
  14. var si IntSet[int64]
  15. intValues(t, ss, si)
  16. deleteInt(t, ss, &si, -5)
  17. deleteInt(t, ss, &si, 2)
  18. deleteInt(t, ss, &si, 75)
  19. intValues(t, ss, si)
  20. addInt(t, ss, &si, 2)
  21. addInt(t, ss, &si, 75)
  22. addInt(t, ss, &si, 75)
  23. addInt(t, ss, &si, -3)
  24. addInt(t, ss, &si, -3)
  25. addInt(t, ss, &si, -3)
  26. addInt(t, ss, &si, math.MinInt64)
  27. addInt(t, ss, &si, 8)
  28. intValues(t, ss, si)
  29. addInt(t, ss, &si, 77)
  30. addInt(t, ss, &si, 76)
  31. addInt(t, ss, &si, 76)
  32. addInt(t, ss, &si, 76)
  33. intValues(t, ss, si)
  34. addInt(t, ss, &si, -5)
  35. addInt(t, ss, &si, 7)
  36. addInt(t, ss, &si, -83)
  37. addInt(t, ss, &si, math.MaxInt64)
  38. intValues(t, ss, si)
  39. deleteInt(t, ss, &si, -5)
  40. deleteInt(t, ss, &si, 2)
  41. deleteInt(t, ss, &si, 75)
  42. intValues(t, ss, si)
  43. deleteInt(t, ss, &si, math.MinInt64)
  44. deleteInt(t, ss, &si, math.MaxInt64)
  45. intValues(t, ss, si)
  46. if !si.Equal(IntsOf(ss.Slice()...)) {
  47. t.Errorf("{%v}.Equal({%v}) = false, want true", si, ss)
  48. }
  49. })
  50. t.Run("Uint64", func(t *testing.T) {
  51. ss := make(Set[uint64])
  52. var si IntSet[uint64]
  53. intValues(t, ss, si)
  54. deleteInt(t, ss, &si, 5)
  55. deleteInt(t, ss, &si, 2)
  56. deleteInt(t, ss, &si, 75)
  57. intValues(t, ss, si)
  58. addInt(t, ss, &si, 2)
  59. addInt(t, ss, &si, 75)
  60. addInt(t, ss, &si, 75)
  61. addInt(t, ss, &si, 3)
  62. addInt(t, ss, &si, 3)
  63. addInt(t, ss, &si, 8)
  64. intValues(t, ss, si)
  65. addInt(t, ss, &si, 77)
  66. addInt(t, ss, &si, 76)
  67. addInt(t, ss, &si, 76)
  68. addInt(t, ss, &si, 76)
  69. intValues(t, ss, si)
  70. addInt(t, ss, &si, 5)
  71. addInt(t, ss, &si, 7)
  72. addInt(t, ss, &si, 83)
  73. addInt(t, ss, &si, math.MaxInt64)
  74. intValues(t, ss, si)
  75. deleteInt(t, ss, &si, 5)
  76. deleteInt(t, ss, &si, 2)
  77. deleteInt(t, ss, &si, 75)
  78. intValues(t, ss, si)
  79. deleteInt(t, ss, &si, math.MaxInt64)
  80. intValues(t, ss, si)
  81. if !si.Equal(IntsOf(ss.Slice()...)) {
  82. t.Errorf("{%v}.Equal({%v}) = false, want true", si, ss)
  83. }
  84. })
  85. }
  86. func intValues[T constraints.Integer](t testing.TB, ss Set[T], si IntSet[T]) {
  87. got := slices.Collect(maps.Keys(ss))
  88. slices.Sort(got)
  89. want := slices.Collect(si.Values())
  90. slices.Sort(want)
  91. if !slices.Equal(got, want) {
  92. t.Fatalf("Values mismatch:\n\tgot %v\n\twant %v", got, want)
  93. }
  94. if got, want := si.Len(), ss.Len(); got != want {
  95. t.Fatalf("Len() = %v, want %v", got, want)
  96. }
  97. }
  98. func addInt[T constraints.Integer](t testing.TB, ss Set[T], si *IntSet[T], v T) {
  99. t.Helper()
  100. if got, want := si.Contains(v), ss.Contains(v); got != want {
  101. t.Fatalf("Contains(%v) = %v, want %v", v, got, want)
  102. }
  103. ss.Add(v)
  104. si.Add(v)
  105. if !si.Contains(v) {
  106. t.Fatalf("Contains(%v) = false, want true", v)
  107. }
  108. if got, want := si.Len(), ss.Len(); got != want {
  109. t.Fatalf("Len() = %v, want %v", got, want)
  110. }
  111. }
  112. func deleteInt[T constraints.Integer](t testing.TB, ss Set[T], si *IntSet[T], v T) {
  113. t.Helper()
  114. if got, want := si.Contains(v), ss.Contains(v); got != want {
  115. t.Fatalf("Contains(%v) = %v, want %v", v, got, want)
  116. }
  117. ss.Delete(v)
  118. si.Delete(v)
  119. if si.Contains(v) {
  120. t.Fatalf("Contains(%v) = true, want false", v)
  121. }
  122. if got, want := si.Len(), ss.Len(); got != want {
  123. t.Fatalf("Len() = %v, want %v", got, want)
  124. }
  125. }
  126. func TestZigZag(t *testing.T) {
  127. t.Run("Int64", func(t *testing.T) {
  128. for _, tt := range []struct {
  129. decoded int64
  130. encoded uint64
  131. }{
  132. {math.MinInt64, math.MaxUint64},
  133. {-2, 3},
  134. {-1, 1},
  135. {0, 0},
  136. {1, 2},
  137. {2, 4},
  138. {math.MaxInt64, math.MaxUint64 - 1},
  139. } {
  140. encoded := encodeZigZag(tt.decoded)
  141. if encoded != tt.encoded {
  142. t.Errorf("encodeZigZag(%v) = %v, want %v", tt.decoded, encoded, tt.encoded)
  143. }
  144. decoded := decodeZigZag[int64](tt.encoded)
  145. if decoded != tt.decoded {
  146. t.Errorf("decodeZigZag(%v) = %v, want %v", tt.encoded, decoded, tt.decoded)
  147. }
  148. }
  149. })
  150. t.Run("Uint64", func(t *testing.T) {
  151. for _, tt := range []struct {
  152. decoded uint64
  153. encoded uint64
  154. }{
  155. {0, 0},
  156. {1, 1},
  157. {2, 2},
  158. {math.MaxInt64, math.MaxInt64},
  159. {math.MaxUint64, math.MaxUint64},
  160. } {
  161. encoded := encodeZigZag(tt.decoded)
  162. if encoded != tt.encoded {
  163. t.Errorf("encodeZigZag(%v) = %v, want %v", tt.decoded, encoded, tt.encoded)
  164. }
  165. decoded := decodeZigZag[uint64](tt.encoded)
  166. if decoded != tt.decoded {
  167. t.Errorf("decodeZigZag(%v) = %v, want %v", tt.encoded, decoded, tt.decoded)
  168. }
  169. }
  170. })
  171. }