(t *testing.T)
| 864 | } |
| 865 | |
| 866 | func TestIntSorted_RoundTrip(t *testing.T) { |
| 867 | set := make(IntSorted) |
| 868 | set[0] = struct{}{} |
| 869 | set[1] = struct{}{} |
| 870 | set[2] = struct{}{} |
| 871 | set[3] = struct{}{} |
| 872 | set[4] = struct{}{} |
| 873 | |
| 874 | // Test EncodeMsg/DecodeMsg |
| 875 | var buf bytes.Buffer |
| 876 | writer := msgp.NewWriter(&buf) |
| 877 | err := set.EncodeMsg(writer) |
| 878 | if err != nil { |
| 879 | t.Fatalf("EncodeMsg failed: %v", err) |
| 880 | } |
| 881 | writer.Flush() |
| 882 | |
| 883 | reader := msgp.NewReader(&buf) |
| 884 | var decoded IntSorted |
| 885 | err = decoded.DecodeMsg(reader) |
| 886 | if err != nil { |
| 887 | t.Fatalf("DecodeMsg failed: %v", err) |
| 888 | } |
| 889 | |
| 890 | if len(set) != len(decoded) { |
| 891 | t.Fatalf("length mismatch: expected %d, got %d", len(set), len(decoded)) |
| 892 | } |
| 893 | |
| 894 | for k := range set { |
| 895 | if _, ok := decoded[k]; !ok { |
| 896 | t.Fatalf("missing key: %v", k) |
| 897 | } |
| 898 | } |
| 899 | |
| 900 | // Test MarshalMsg/UnmarshalMsg |
| 901 | data, err := set.MarshalMsg(nil) |
| 902 | if err != nil { |
| 903 | t.Fatalf("MarshalMsg failed: %v", err) |
| 904 | } |
| 905 | |
| 906 | var unmarshaled IntSorted |
| 907 | _, err = unmarshaled.UnmarshalMsg(data) |
| 908 | if err != nil { |
| 909 | t.Fatalf("UnmarshalMsg failed: %v", err) |
| 910 | } |
| 911 | |
| 912 | if len(set) != len(unmarshaled) { |
| 913 | t.Fatalf("length mismatch: expected %d, got %d", len(set), len(unmarshaled)) |
| 914 | } |
| 915 | |
| 916 | for k := range set { |
| 917 | if _, ok := unmarshaled[k]; !ok { |
| 918 | t.Fatalf("missing key: %v", k) |
| 919 | } |
| 920 | } |
| 921 | } |
| 922 | |
| 923 | func TestIntSorted_AsSlice(t *testing.T) { |
nothing calls this directly
no test coverage detected
searching dependent graphs…