(kv ...string)
| 987 | } |
| 988 | |
| 989 | func labelmap(kv ...string) map[string]string { |
| 990 | if len(kv)%2 != 0 { |
| 991 | panic("bad labels argument") |
| 992 | } |
| 993 | l := map[string]string{} |
| 994 | for i := 0; i < len(kv); i = i + 2 { |
| 995 | l[kv[i]] = kv[i+1] |
| 996 | } |
| 997 | return l |
| 998 | } |
| 999 | |
| 1000 | func dgst(i int64) digest.Digest { |
| 1001 | r := rand.New(rand.NewSource(i)) |
no outgoing calls
no test coverage detected
searching dependent graphs…