func newDigestFromPath()

in experimental/digest.go [23:34]

• 10 lines of code
• 3 McCabe index (conditional complexity)

func newDigestFromPath(components []string) (d digest, err error) {
	if len(components) != 2 {
		return digest{}, fmt.Errorf("digest components should contain exactly two items: %v", components)
	}

	if components[0] != digestAlgorithm {
		return digest{}, fmt.Errorf("only %v is supported: %v", digestAlgorithm, components[0])
	}

	err = d.decode([]byte(components[1]))
	return
}