sort.Search returns the smallest index, so provide the available IDs in decreasing order. It fixes an issue when splitting the current mappings over multiple available IDs. Signed-off-by: Giuseppe Scrivano <gscrivan@redhat.com> |
||
|---|---|---|
| .. | ||
| rootless.go | ||
| rootless_linux.c | ||
| rootless_linux.go | ||
| rootless_test.go | ||
| rootless_unsupported.go | ||