@@ -696,43 +696,43 @@ func TestStackDepsFindTree(t *testing.T) {
696696 depsByPath [c .Path ] = c .Dependencies
697697 }
698698
699- var pathA , pathB , pathC , pathD , pathE string
699+ var aPath , bPath , cPath , dPath , ePath string
700700
701701 for path := range depsByPath {
702702 switch {
703703 case strings .HasSuffix (path , "unit-a" ):
704- pathA = path
704+ aPath = path
705705 case strings .HasSuffix (path , "unit-b" ):
706- pathB = path
706+ bPath = path
707707 case strings .HasSuffix (path , "unit-c" ):
708- pathC = path
708+ cPath = path
709709 case strings .HasSuffix (path , "unit-d" ):
710- pathD = path
710+ dPath = path
711711 case strings .HasSuffix (path , "unit-e" ):
712- pathE = path
712+ ePath = path
713713 }
714714 }
715715
716- require .NotEmpty (t , pathA , "unit-a should be in output" )
717- require .NotEmpty (t , pathB , "unit-b should be in output" )
718- require .NotEmpty (t , pathC , "unit-c should be in output" )
719- require .NotEmpty (t , pathD , "unit-d should be in output" )
720- require .NotEmpty (t , pathE , "unit-e should be in output" )
716+ require .NotEmpty (t , aPath , "unit-a should be in output" )
717+ require .NotEmpty (t , bPath , "unit-b should be in output" )
718+ require .NotEmpty (t , cPath , "unit-c should be in output" )
719+ require .NotEmpty (t , dPath , "unit-d should be in output" )
720+ require .NotEmpty (t , ePath , "unit-e should be in output" )
721721
722722 // A depends on B and C
723- require .Len (t , depsByPath [pathA ], 2 )
724- assert .Contains (t , depsByPath [pathA ], pathB )
725- assert .Contains (t , depsByPath [pathA ], pathC )
723+ require .Len (t , depsByPath [aPath ], 2 )
724+ assert .Contains (t , depsByPath [aPath ], bPath )
725+ assert .Contains (t , depsByPath [aPath ], cPath )
726726
727727 // B depends on D and E
728- require .Len (t , depsByPath [pathB ], 2 )
729- assert .Contains (t , depsByPath [pathB ], pathD )
730- assert .Contains (t , depsByPath [pathB ], pathE )
728+ require .Len (t , depsByPath [bPath ], 2 )
729+ assert .Contains (t , depsByPath [bPath ], dPath )
730+ assert .Contains (t , depsByPath [bPath ], ePath )
731731
732732 // C, D, E are leaves
733- assert .Empty (t , depsByPath [pathC ])
734- assert .Empty (t , depsByPath [pathD ])
735- assert .Empty (t , depsByPath [pathE ])
733+ assert .Empty (t , depsByPath [cPath ])
734+ assert .Empty (t , depsByPath [dPath ])
735+ assert .Empty (t , depsByPath [ePath ])
736736}
737737
738738// TestStackDepsFindTreeDAGOrder verifies that find --dag with a multi-level
0 commit comments