mirror of
https://github.com/dolthub/dolt.git
synced 2026-02-10 03:09:35 -06:00
stretchr has fixed a bug with the -count flag. I could merge these changes into attic-labs, but it's easier to just use strechr. We forked stretchr a long time ago so that we didn't link in the HTTP testing libraries into the noms binaries (because we were using d.Chk in production code). The HTTP issue doesn't seem to happen anymore, even though we're still using d.Chk.
96 lines
3.4 KiB
Go
96 lines
3.4 KiB
Go
// Copyright 2016 Attic Labs, Inc. All rights reserved.
|
|
// Licensed under the Apache License, version 2.0:
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
package diff
|
|
|
|
import (
|
|
"math/rand"
|
|
"sort"
|
|
"testing"
|
|
|
|
"github.com/attic-labs/noms/go/types"
|
|
"github.com/stretchr/testify/assert"
|
|
)
|
|
|
|
func TestPatchPathPartCompare(t *testing.T) {
|
|
assert := assert.New(t)
|
|
|
|
fieldPath1 := mustParsePath(assert, `.field1`)[0]
|
|
fieldPath2 := mustParsePath(assert, `.field2`)[0]
|
|
indexPath1 := mustParsePath(assert, `["field1"]`)[0]
|
|
indexPath2 := mustParsePath(assert, `["field2"]`)[0]
|
|
indexPathKey1 := mustParsePath(assert, `["field1"]@key`)[0]
|
|
indexPathKey2 := mustParsePath(assert, `["field2"]@key`)[0]
|
|
hashIndexPath1 := mustParsePath(assert, `[#01234567890123456789012345678901]`)[0]
|
|
hashIndexPath2 := mustParsePath(assert, `[#0123456789abcdef0123456789abcdef]`)[0]
|
|
hashIndexPathKey1 := mustParsePath(assert, `[#01234567890123456789012345678901]`)[0]
|
|
hashIndexPathKey2 := mustParsePath(assert, `[#0123456789abcdef0123456789abcdef]`)[0]
|
|
|
|
testCases := [][]types.PathPart{
|
|
{fieldPath1, fieldPath2},
|
|
{indexPath1, indexPath2},
|
|
{indexPathKey1, indexPathKey2},
|
|
{hashIndexPath1, hashIndexPath2},
|
|
{hashIndexPathKey1, hashIndexPathKey2},
|
|
{fieldPath2, indexPath1},
|
|
{fieldPath2, indexPathKey1},
|
|
{fieldPath2, hashIndexPath1},
|
|
{fieldPath2, hashIndexPathKey1},
|
|
{indexPath2, hashIndexPath1},
|
|
{indexPath2, hashIndexPathKey1},
|
|
}
|
|
|
|
for i, tc := range testCases {
|
|
assert.Equal(-1, pathPartCompare(tc[0], tc[1]), "test case %d failed, pp0: %s, pp1: %s", i, tc[0], tc[1])
|
|
assert.Equal(0, pathPartCompare(tc[0], tc[0]), "test case %d failed, pp0: %s, pp1: %s", i, tc[0], tc[1])
|
|
assert.Equal(1, pathPartCompare(tc[1], tc[0]), "test case %d failed, pp0: %s, pp1: %s", i, tc[0], tc[1])
|
|
}
|
|
}
|
|
|
|
func TestPatchPathIsLess(t *testing.T) {
|
|
assert := assert.New(t)
|
|
|
|
testCases := [][]string{
|
|
{``, `["field1"]`},
|
|
{`["field1"]`, `["field1"].f1`},
|
|
{`["field1"].f1`, `["field1"]["f1"]`},
|
|
{`["field1"]["f1"]@key`, `["field1"]["f1"]`},
|
|
{`["field1"]["f1"]`, `["field1"][#01234567890123456789012345678901]`},
|
|
{`["field1"][#01234567890123456789012345678901]`, `["field1"][#0123456789abcdef0123456789abcdef]`},
|
|
}
|
|
|
|
for i, tc := range testCases {
|
|
p0 := mustParsePath(assert, tc[0])
|
|
p1 := mustParsePath(assert, tc[1])
|
|
assert.True(pathIsLess(p0, p1), "test case %d failed", i)
|
|
assert.False(pathIsLess(p0, p0), "test case %d failed", i)
|
|
assert.False(pathIsLess(p1, p0), "test case %d failed", i)
|
|
}
|
|
//p := mustParsePath(assert, `#0123456789abcdef0123456789abcdef.value`)
|
|
//fmt.Printf("p[0]: %s, type: %T\n", p[0], p[0])
|
|
}
|
|
|
|
func TestPatchSort(t *testing.T) {
|
|
assert := assert.New(t)
|
|
|
|
sortedPaths := Patch{
|
|
{Path: mustParsePath(assert, `["field1"]`)},
|
|
{Path: mustParsePath(assert, `["field1"].f1`)},
|
|
{Path: mustParsePath(assert, `["field1"]["f1"]`), ChangeType: types.DiffChangeRemoved},
|
|
{Path: mustParsePath(assert, `["field1"]["f1"]`), ChangeType: types.DiffChangeModified},
|
|
{Path: mustParsePath(assert, `["field1"]["f1"]`), ChangeType: types.DiffChangeAdded},
|
|
{Path: mustParsePath(assert, `["field1"][#01234567890123456789012345678901]`)},
|
|
{Path: mustParsePath(assert, `["field1"][#0123456789abcdef0123456789abcdef]`)},
|
|
}
|
|
|
|
rand.Perm(len(sortedPaths))
|
|
shuffledPaths := Patch{}
|
|
for _, idx := range rand.Perm(len(sortedPaths)) {
|
|
shuffledPaths = append(shuffledPaths, sortedPaths[idx])
|
|
}
|
|
|
|
sort.Sort(shuffledPaths)
|
|
assert.Equal(sortedPaths, shuffledPaths)
|
|
}
|