2
0

diff_test.go 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128
  1. package opencost
  2. import (
  3. "reflect"
  4. "testing"
  5. "time"
  6. )
  7. func TestDiff(t *testing.T) {
  8. start := time.Now().AddDate(0, 0, -1)
  9. end := time.Now()
  10. window1 := NewWindow(&start, &end)
  11. node1 := NewNode("node1", "cluster1", "123abc", start, end, window1)
  12. node1.CPUCost = 10
  13. node1b := node1.Clone().(*Node)
  14. node1b.CPUCost = 20
  15. node1Key, _ := key(node1, nil, nil)
  16. node2 := NewNode("node2", "cluster1", "123abc", start, end, window1)
  17. node2.CPUCost = 100
  18. node2b := node2.Clone().(*Node)
  19. node2b.CPUCost = 105
  20. node2Key, _ := key(node2, nil, nil)
  21. node3 := NewNode("node3", "cluster1", "123abc", start, end, window1)
  22. node3Key, _ := key(node3, nil, nil)
  23. node4 := NewNode("node4", "cluster1", "123abc", start, end, window1)
  24. node4Key, _ := key(node4, nil, nil)
  25. disk1 := NewDisk("disk1", "cluster1", "123abc", start, end, window1)
  26. disk1Key, _ := key(disk1, nil, nil)
  27. disk2 := NewDisk("disk2", "cluster1", "123abc", start, end, window1)
  28. disk2Key, _ := key(disk2, nil, nil)
  29. cases := map[string]struct {
  30. inputAssetsBefore []Asset
  31. inputAssetsAfter []Asset
  32. costChangeRatio float64
  33. expected map[string]Diff[Asset]
  34. }{
  35. "added node": {
  36. inputAssetsBefore: []Asset{node1, node2},
  37. inputAssetsAfter: []Asset{node1, node2, node3},
  38. expected: map[string]Diff[Asset]{node3Key: {nil, node3, DiffAdded}},
  39. },
  40. "multiple adds": {
  41. inputAssetsBefore: []Asset{node1, node2},
  42. inputAssetsAfter: []Asset{node1, node2, node3, node4},
  43. expected: map[string]Diff[Asset]{node3Key: {nil, node3, DiffAdded}, node4Key: {nil, node4, DiffAdded}},
  44. },
  45. "removed node": {
  46. inputAssetsBefore: []Asset{node1, node2},
  47. inputAssetsAfter: []Asset{node2},
  48. expected: map[string]Diff[Asset]{node1Key: {node1, nil, DiffRemoved}},
  49. },
  50. "multiple removes": {
  51. inputAssetsBefore: []Asset{node1, node2, node3},
  52. inputAssetsAfter: []Asset{node2},
  53. expected: map[string]Diff[Asset]{node1Key: {node1, nil, DiffRemoved}, node3Key: {node3, nil, DiffRemoved}},
  54. },
  55. "remove all": {
  56. inputAssetsBefore: []Asset{node1, node2},
  57. inputAssetsAfter: []Asset{},
  58. expected: map[string]Diff[Asset]{node1Key: {node1, nil, DiffRemoved}, node2Key: {node2, nil, DiffRemoved}},
  59. },
  60. "add and remove": {
  61. inputAssetsBefore: []Asset{node1, node2},
  62. inputAssetsAfter: []Asset{node2, node3},
  63. expected: map[string]Diff[Asset]{node1Key: {node1, nil, DiffRemoved}, node3Key: {nil, node3, DiffAdded}},
  64. },
  65. "no change": {
  66. inputAssetsBefore: []Asset{node1, node2},
  67. inputAssetsAfter: []Asset{node1, node2},
  68. expected: map[string]Diff[Asset]{},
  69. },
  70. "order switch": {
  71. inputAssetsBefore: []Asset{node2, node1},
  72. inputAssetsAfter: []Asset{node1, node2},
  73. expected: map[string]Diff[Asset]{},
  74. },
  75. "disk add": {
  76. inputAssetsBefore: []Asset{disk1, node1},
  77. inputAssetsAfter: []Asset{disk1, node1, disk2},
  78. expected: map[string]Diff[Asset]{disk2Key: {nil, disk2, DiffAdded}},
  79. },
  80. "disk and node add": {
  81. inputAssetsBefore: []Asset{disk1, node1},
  82. inputAssetsAfter: []Asset{disk1, node1, disk2, node2},
  83. expected: map[string]Diff[Asset]{disk2Key: {nil, disk2, DiffAdded}, node2Key: {nil, node2, DiffAdded}},
  84. },
  85. "disk and node removed": {
  86. inputAssetsBefore: []Asset{disk1, node1, disk2, node2},
  87. inputAssetsAfter: []Asset{disk2, node2},
  88. expected: map[string]Diff[Asset]{disk1Key: {disk1, nil, DiffRemoved}, node1Key: {node1, nil, DiffRemoved}},
  89. },
  90. "cost change more than 10%": {
  91. inputAssetsBefore: []Asset{node1},
  92. inputAssetsAfter: []Asset{node1b},
  93. costChangeRatio: 0.1,
  94. expected: map[string]Diff[Asset]{node1Key: {node1, node1b, DiffChanged}},
  95. },
  96. "cost change less than 10%": {
  97. inputAssetsBefore: []Asset{node2},
  98. inputAssetsAfter: []Asset{node2b},
  99. costChangeRatio: 0.1,
  100. expected: map[string]Diff[Asset]{},
  101. },
  102. }
  103. for name, tc := range cases {
  104. t.Run(name, func(t *testing.T) {
  105. as1 := NewAssetSet(start, end, tc.inputAssetsBefore...)
  106. as2 := NewAssetSet(start, end, tc.inputAssetsAfter...)
  107. result, err := DiffAsset(as1.Clone(), as2.Clone(), tc.costChangeRatio)
  108. if err != nil {
  109. t.Fatalf("error; got %s", err)
  110. }
  111. if !reflect.DeepEqual(result, tc.expected) {
  112. t.Fatalf("expected %+v; got %+v", tc.expected, result)
  113. }
  114. })
  115. }
  116. }