(t *testing.T)
| 671 | } |
| 672 | |
| 673 | func TestInt_RoundTrip(t *testing.T) { |
| 674 | set := make(Int) |
| 675 | set[0] = struct{}{} |
| 676 | set[1] = struct{}{} |
| 677 | set[2] = struct{}{} |
| 678 | set[3] = struct{}{} |
| 679 | set[4] = struct{}{} |
| 680 | |
| 681 | // Test EncodeMsg/DecodeMsg |
| 682 | var buf bytes.Buffer |
| 683 | writer := msgp.NewWriter(&buf) |
| 684 | err := set.EncodeMsg(writer) |
| 685 | if err != nil { |
| 686 | t.Fatalf("EncodeMsg failed: %v", err) |
| 687 | } |
| 688 | writer.Flush() |
| 689 | |
| 690 | reader := msgp.NewReader(&buf) |
| 691 | var decoded Int |
| 692 | err = decoded.DecodeMsg(reader) |
| 693 | if err != nil { |
| 694 | t.Fatalf("DecodeMsg failed: %v", err) |
| 695 | } |
| 696 | |
| 697 | if len(set) != len(decoded) { |
| 698 | t.Fatalf("length mismatch: expected %d, got %d", len(set), len(decoded)) |
| 699 | } |
| 700 | |
| 701 | for k := range set { |
| 702 | if _, ok := decoded[k]; !ok { |
| 703 | t.Fatalf("missing key: %v", k) |
| 704 | } |
| 705 | } |
| 706 | |
| 707 | // Test MarshalMsg/UnmarshalMsg |
| 708 | data, err := set.MarshalMsg(nil) |
| 709 | if err != nil { |
| 710 | t.Fatalf("MarshalMsg failed: %v", err) |
| 711 | } |
| 712 | |
| 713 | var unmarshaled Int |
| 714 | _, err = unmarshaled.UnmarshalMsg(data) |
| 715 | if err != nil { |
| 716 | t.Fatalf("UnmarshalMsg failed: %v", err) |
| 717 | } |
| 718 | |
| 719 | if len(set) != len(unmarshaled) { |
| 720 | t.Fatalf("length mismatch: expected %d, got %d", len(set), len(unmarshaled)) |
| 721 | } |
| 722 | |
| 723 | for k := range set { |
| 724 | if _, ok := unmarshaled[k]; !ok { |
| 725 | t.Fatalf("missing key: %v", k) |
| 726 | } |
| 727 | } |
| 728 | } |
| 729 | |
| 730 | func TestInt_AsSlice(t *testing.T) { |
nothing calls this directly
no test coverage detected
searching dependent graphs…