(t *testing.T)
| 204 | } |
| 205 | |
| 206 | func TestStringSorted_RoundTrip(t *testing.T) { |
| 207 | set := make(StringSorted) |
| 208 | set["val0"] = struct{}{} |
| 209 | set["val1"] = struct{}{} |
| 210 | set["val2"] = struct{}{} |
| 211 | set["val3"] = struct{}{} |
| 212 | set["val4"] = struct{}{} |
| 213 | |
| 214 | // Test EncodeMsg/DecodeMsg |
| 215 | var buf bytes.Buffer |
| 216 | writer := msgp.NewWriter(&buf) |
| 217 | err := set.EncodeMsg(writer) |
| 218 | if err != nil { |
| 219 | t.Fatalf("EncodeMsg failed: %v", err) |
| 220 | } |
| 221 | writer.Flush() |
| 222 | |
| 223 | reader := msgp.NewReader(&buf) |
| 224 | var decoded StringSorted |
| 225 | err = decoded.DecodeMsg(reader) |
| 226 | if err != nil { |
| 227 | t.Fatalf("DecodeMsg failed: %v", err) |
| 228 | } |
| 229 | |
| 230 | if len(set) != len(decoded) { |
| 231 | t.Fatalf("length mismatch: expected %d, got %d", len(set), len(decoded)) |
| 232 | } |
| 233 | |
| 234 | for k := range set { |
| 235 | if _, ok := decoded[k]; !ok { |
| 236 | t.Fatalf("missing key: %v", k) |
| 237 | } |
| 238 | } |
| 239 | |
| 240 | // Test MarshalMsg/UnmarshalMsg |
| 241 | data, err := set.MarshalMsg(nil) |
| 242 | if err != nil { |
| 243 | t.Fatalf("MarshalMsg failed: %v", err) |
| 244 | } |
| 245 | |
| 246 | var unmarshaled StringSorted |
| 247 | _, err = unmarshaled.UnmarshalMsg(data) |
| 248 | if err != nil { |
| 249 | t.Fatalf("UnmarshalMsg failed: %v", err) |
| 250 | } |
| 251 | |
| 252 | if len(set) != len(unmarshaled) { |
| 253 | t.Fatalf("length mismatch: expected %d, got %d", len(set), len(unmarshaled)) |
| 254 | } |
| 255 | |
| 256 | for k := range set { |
| 257 | if _, ok := unmarshaled[k]; !ok { |
| 258 | t.Fatalf("missing key: %v", k) |
| 259 | } |
| 260 | } |
| 261 | } |
| 262 | |
| 263 | func TestStringSorted_AsSlice(t *testing.T) { |
nothing calls this directly
no test coverage detected
searching dependent graphs…