NewDigest returns a new Digest representing the given name.
(name string, opts ...Option)
| 100 | |
| 101 | // NewDigest returns a new Digest representing the given name. |
| 102 | func NewDigest(name string, opts ...Option) (Digest, error) { |
| 103 | // Split on "@" |
| 104 | parts := strings.Split(name, digestDelim) |
| 105 | if len(parts) != 2 { |
| 106 | return Digest{}, newErrBadName("a digest must contain exactly one '@' separator (e.g. registry/repository@digest) saw: %s", name) |
| 107 | } |
| 108 | base := parts[0] |
| 109 | dig := parts[1] |
| 110 | prefix := digest.Canonical.String() + ":" |
| 111 | if !strings.HasPrefix(dig, prefix) { |
| 112 | return Digest{}, newErrBadName("unsupported digest algorithm: %s", dig) |
| 113 | } |
| 114 | hex := strings.TrimPrefix(dig, prefix) |
| 115 | if err := digest.Canonical.Validate(hex); err != nil { |
| 116 | return Digest{}, err |
| 117 | } |
| 118 | |
| 119 | tag, err := NewTag(base, opts...) |
| 120 | if err == nil { |
| 121 | base = tag.Repository.Name() |
| 122 | } |
| 123 | |
| 124 | repo, err := NewRepository(base, opts...) |
| 125 | if err != nil { |
| 126 | return Digest{}, err |
| 127 | } |
| 128 | return Digest{ |
| 129 | Repository: repo, |
| 130 | digest: dig, |
| 131 | original: name, |
| 132 | }, nil |
| 133 | } |
searching dependent graphs…