Keep reference algorithms in tests
This commit is contained in:
@@ -96,37 +96,6 @@ func TestPathContainmentMatchesPointerSpelling(t *testing.T) {
|
||||
}
|
||||
}
|
||||
|
||||
func TestAppendUniquePathMatchesPointerSpelling(t *testing.T) {
|
||||
parse := func(pointer string) Path {
|
||||
path, err := ParsePath(pointer)
|
||||
if err != nil {
|
||||
t.Fatalf("ParsePath(%q) error = %v", pointer, err)
|
||||
}
|
||||
return path
|
||||
}
|
||||
paths := []Path{
|
||||
Keys("a/b"), parse("/a~1b"),
|
||||
Keys("a~1b"), parse("/a~01b"),
|
||||
Keys("items").Index(0), parse("/items/0"), Keys("items", "0"),
|
||||
Keys("items", "01"), parse("/items/01"),
|
||||
Path{}.Index(-1), Keys("-1"),
|
||||
Keys("a", "b"), Keys("a/b"),
|
||||
}
|
||||
var got, want []Path
|
||||
for _, path := range paths {
|
||||
got = appendUniquePath(got, path)
|
||||
want = appendUniquePathByPointer(want, path)
|
||||
}
|
||||
if len(got) != len(want) {
|
||||
t.Fatalf("unique path counts = %d, want %d", len(got), len(want))
|
||||
}
|
||||
for i := range got {
|
||||
if got[i].String() != want[i].String() {
|
||||
t.Fatalf("unique path %d = %q, want %q", i, got[i].String(), want[i].String())
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
func pathContainsByPointer(container, descendant Path) bool {
|
||||
if !container.valid() || !descendant.valid() || len(container.segments) > len(descendant.segments) {
|
||||
return false
|
||||
@@ -139,15 +108,6 @@ func pathContainsByPointer(container, descendant Path) bool {
|
||||
return value == prefix || len(value) > len(prefix) && value[:len(prefix)] == prefix && value[len(prefix)] == '/'
|
||||
}
|
||||
|
||||
func appendUniquePathByPointer(paths []Path, path Path) []Path {
|
||||
for _, existing := range paths {
|
||||
if existing.String() == path.String() {
|
||||
return paths
|
||||
}
|
||||
}
|
||||
return append(paths, path.clone())
|
||||
}
|
||||
|
||||
func TestPathPreservesSegmentIntentAndImmutability(t *testing.T) {
|
||||
t.Parallel()
|
||||
|
||||
|
||||
Reference in New Issue
Block a user