test(list): pin orderSiblingsByDeps cycle fallback under a sort-derived comparator
A two-node scheduling cycle where priority and ID favor pa-x but --sort closed favors pa-y: the cycle fallback must follow the caller's compare. AC: AC-2 Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
parent
5c973b4ba9
commit
d29c4611e6
1 changed files with 17 additions and 0 deletions
|
|
@ -110,6 +110,23 @@ func TestOrderSiblingsByDeps_ReadySetFollowsCallerCompare(t *testing.T) {
|
|||
}
|
||||
}
|
||||
|
||||
func TestOrderSiblingsByDeps_CycleFallbackFollowsCallerCompare(t *testing.T) {
|
||||
// x <-> y cycle: x wins on priority and ID, but y closed more recently, so
|
||||
// the cycle fallback under --sort closed must emit y first.
|
||||
x := closedSibling("pa-x", 0, 2)
|
||||
y := closedSibling("pa-y", 1, 1)
|
||||
deps := map[string][]*types.Dependency{
|
||||
"pa-x": {schedDep("pa-x", "pa-y")},
|
||||
"pa-y": {schedDep("pa-y", "pa-x")},
|
||||
}
|
||||
|
||||
got := idsOf(orderSiblingsByDeps([]*types.Issue{x, y}, deps, compareIssuesForTree("closed", false)))
|
||||
want := []string{"pa-y", "pa-x"}
|
||||
if !slices.Equal(got, want) {
|
||||
t.Fatalf("--sort closed cycle fallback: got %v, want %v", got, want)
|
||||
}
|
||||
}
|
||||
|
||||
func TestDepEdgeDisplay(t *testing.T) {
|
||||
cases := []struct {
|
||||
name string
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue