Function TestTreeDiffConflictsAndStatus

common/sync/merger/tree-diff_test.go:654–700

(t *testing.T)

}

func TestTreeDiffConflictsAndStatus(t *testing.T) {

	var left, right *memory.MemDB
	Convey("", t, func() {
		left = memory.NewMemDB()
		right = memory.NewMemDB()

		_ = right.CreateNode(testCtx, &tree.Node{
			Path: "/aaa",
			Type: tree.NodeType_COLLECTION,
			Uuid: "uuid1",
			Etag: "uuid1-hash",
		}, true)
		_ = left.CreateNode(testCtx, &tree.Node{
			Path: "/aaa",
			Type: tree.NodeType_COLLECTION,
			Uuid: "uuid2",
			Etag: "uuid2-hash",
		}, true)

		statusChan := make(chan model.Status, 1)
		doneChan := make(chan interface{}, 1)

		diff := newTreeDiff(left, right)
		diff.SetupChannels(statusChan, doneChan, nil)

		// start a routine to read status
		f := func() {
			for {
				select {
				case <-doneChan:
					return
				case s := <-statusChan:
					t.Log(s)
				}
			}
		}

		go f()
		e := diff.Compute(testCtx, "/", nil, nil)
		So(e, ShouldBeNil)

		go f()
		_, _ = diff.leftAndRightPatches(testCtx, left, right)
		So(diff.conflicts, ShouldHaveLength, 1)
	})
}

func TestTreeNodeFromSourceWithGlob(t *testing.T) {