Create Repositories method
This change removes the Catalog Service and replaces it with a more simplistic Repositories() method for obtaining a catalog of all repositories. The Repositories method takes a pre-allocated slice and fills it up to the size of the slice and returns the amount filled. The catalog is returned lexicographically and will start being filled from the last entry passed to Repositories(). If there are no more entries to fill, io.EOF will be returned. Signed-off-by: Patrick Devine <patrick.devine@docker.com> Conflicts: registry/client/repository.go registry/handlers/api_test.go
This commit is contained in:
parent
f3207e76c8
commit
bf62b7ebb7
9 changed files with 246 additions and 137 deletions
|
@ -1,6 +1,7 @@
|
|||
package storage
|
||||
|
||||
import (
|
||||
"io"
|
||||
"testing"
|
||||
|
||||
"github.com/docker/distribution"
|
||||
|
@ -15,7 +16,6 @@ type setupEnv struct {
|
|||
driver driver.StorageDriver
|
||||
expected []string
|
||||
registry distribution.Namespace
|
||||
catalog distribution.CatalogService
|
||||
}
|
||||
|
||||
func setupFS(t *testing.T) *setupEnv {
|
||||
|
@ -41,8 +41,6 @@ func setupFS(t *testing.T) *setupEnv {
|
|||
}
|
||||
}
|
||||
|
||||
catalog := registry.Catalog(ctx)
|
||||
|
||||
expected := []string{
|
||||
"bar/c",
|
||||
"bar/d",
|
||||
|
@ -56,20 +54,21 @@ func setupFS(t *testing.T) *setupEnv {
|
|||
driver: d,
|
||||
expected: expected,
|
||||
registry: registry,
|
||||
catalog: catalog,
|
||||
}
|
||||
}
|
||||
|
||||
func TestCatalog(t *testing.T) {
|
||||
env := setupFS(t)
|
||||
|
||||
repos, more, _ := env.catalog.Get(100, "")
|
||||
p := make([]string, 50)
|
||||
|
||||
if !testEq(repos, env.expected) {
|
||||
numFilled, err := env.registry.Repositories(env.ctx, p, "")
|
||||
|
||||
if !testEq(p, env.expected, numFilled) {
|
||||
t.Errorf("Expected catalog repos err")
|
||||
}
|
||||
|
||||
if more {
|
||||
if err != io.EOF {
|
||||
t.Errorf("Catalog has more values which we aren't expecting")
|
||||
}
|
||||
}
|
||||
|
@ -78,50 +77,46 @@ func TestCatalogInParts(t *testing.T) {
|
|||
env := setupFS(t)
|
||||
|
||||
chunkLen := 2
|
||||
p := make([]string, chunkLen)
|
||||
|
||||
repos, more, _ := env.catalog.Get(chunkLen, "")
|
||||
if !testEq(repos, env.expected[0:chunkLen]) {
|
||||
numFilled, err := env.registry.Repositories(env.ctx, p, "")
|
||||
if err == io.EOF || numFilled != len(p) {
|
||||
t.Errorf("Expected more values in catalog")
|
||||
}
|
||||
|
||||
if !testEq(p, env.expected[0:chunkLen], numFilled) {
|
||||
t.Errorf("Expected catalog first chunk err")
|
||||
}
|
||||
|
||||
if !more {
|
||||
lastRepo := p[len(p)-1]
|
||||
numFilled, err = env.registry.Repositories(env.ctx, p, lastRepo)
|
||||
|
||||
if err == io.EOF || numFilled != len(p) {
|
||||
t.Errorf("Expected more values in catalog")
|
||||
}
|
||||
|
||||
lastRepo := repos[len(repos)-1]
|
||||
repos, more, _ = env.catalog.Get(chunkLen, lastRepo)
|
||||
|
||||
if !testEq(repos, env.expected[chunkLen:chunkLen*2]) {
|
||||
if !testEq(p, env.expected[chunkLen:chunkLen*2], numFilled) {
|
||||
t.Errorf("Expected catalog second chunk err")
|
||||
}
|
||||
|
||||
if !more {
|
||||
t.Errorf("Expected more values in catalog")
|
||||
}
|
||||
lastRepo = p[len(p)-1]
|
||||
numFilled, err = env.registry.Repositories(env.ctx, p, lastRepo)
|
||||
|
||||
lastRepo = repos[len(repos)-1]
|
||||
repos, more, _ = env.catalog.Get(chunkLen, lastRepo)
|
||||
|
||||
if !testEq(repos, env.expected[chunkLen*2:chunkLen*3-1]) {
|
||||
t.Errorf("Expected catalog third chunk err")
|
||||
}
|
||||
|
||||
if more {
|
||||
if err != io.EOF {
|
||||
t.Errorf("Catalog has more values which we aren't expecting")
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
func testEq(a, b []string) bool {
|
||||
if len(a) != len(b) {
|
||||
return false
|
||||
if !testEq(p, env.expected[chunkLen*2:chunkLen*3-1], numFilled) {
|
||||
t.Errorf("Expected catalog third chunk err")
|
||||
}
|
||||
|
||||
for count := range a {
|
||||
if a[count] != b[count] {
|
||||
}
|
||||
|
||||
func testEq(a, b []string, size int) bool {
|
||||
for cnt := 0; cnt < size-1; cnt++ {
|
||||
if a[cnt] != b[cnt] {
|
||||
return false
|
||||
}
|
||||
}
|
||||
|
||||
return true
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue