Function getMultiBranchTestRevtree1

db/revtree_test.go:91–188

getMultiBranchTestRevtree1 returns a rev tree with the specified number of revisions/branches ┌────────┐ ┌────────┐ ┌────────┐ ┌────────┐ ╔════════╗ │ 1-a │─│ 2-a │─┬──│ 3-a │─│ 4-a │─║ 5-a ║ └────────┘ └────────┘ │ └────────┘ └────────┘ ╚════════╝ │ ┌─

(ctx context.Context, unconflictedBranchNumRevs, winningBranchNumRevs int, losingBranches []BranchSpec)

//
// NOTE: the 1-a -- 2-a unconflicted branch can be longer, depending on value of unconflictedBranchNumRevs
func getMultiBranchTestRevtree1(ctx context.Context, unconflictedBranchNumRevs, winningBranchNumRevs int, losingBranches []BranchSpec) RevTree {

	if unconflictedBranchNumRevs < 1 {
		panic(fmt.Sprintf("Must have at least 1 unconflictedBranchNumRevs"))
	}

	winningBranchDigest := "winning"

	const testJSON = `{
		   "revs":[
			  "1-winning"
		   ],
		   "parents":[
			  -1
		   ],
		   "channels":[
			  null
		   ]
		}`

	revTree := RevTree{}
	if err := base.JSONUnmarshal([]byte(testJSON), &revTree); err != nil {
		panic(fmt.Sprintf("Error: %v", err))
	}
	if unconflictedBranchNumRevs > 1 {
		// Add revs to unconflicted branch
		addRevs(
			ctx,
			revTree,
			"1-winning",
			unconflictedBranchNumRevs-1,
			winningBranchDigest,
		)
	}

	if winningBranchNumRevs > 0 {

		// Figure out which generation the conflicting branches will start at
		generation := unconflictedBranchNumRevs

		// Figure out the starting revision id on winning and losing branches
		winningBranchStartRev := fmt.Sprintf("%d-%s", generation, winningBranchDigest)

		// Add revs to winning branch
		addRevs(
			ctx,
			revTree,
			winningBranchStartRev,
			winningBranchNumRevs,
			winningBranchDigest,
		)

	}

	for _, losingBranchSpec := range losingBranches {

		if losingBranchSpec.NumRevs > 0 {