(r1, r2 Reference)
| 300 | } |
| 301 | |
| 302 | func equalReference(r1, r2 Reference) bool { |
| 303 | switch v1 := r1.(type) { |
| 304 | case digestReference: |
| 305 | if v2, ok := r2.(digestReference); ok { |
| 306 | return v1 == v2 |
| 307 | } |
| 308 | case repository: |
| 309 | if v2, ok := r2.(repository); ok { |
| 310 | return v1 == v2 |
| 311 | } |
| 312 | case taggedReference: |
| 313 | if v2, ok := r2.(taggedReference); ok { |
| 314 | return v1 == v2 |
| 315 | } |
| 316 | case canonicalReference: |
| 317 | if v2, ok := r2.(canonicalReference); ok { |
| 318 | return v1 == v2 |
| 319 | } |
| 320 | case reference: |
| 321 | if v2, ok := r2.(reference); ok { |
| 322 | return v1 == v2 |
| 323 | } |
| 324 | } |
| 325 | return false |
| 326 | } |
| 327 | |
| 328 | func TestParseAnyReference(t *testing.T) { |
| 329 | tcases := []struct { |
no outgoing calls
no test coverage detected
searching dependent graphs…