ListTest.cpp 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133
  1. 
  2. #include "../testTools.h"
  3. #include "../../DFPSR/collection/List.h"
  4. static void targetByReference(List<int32_t> &target, int32_t value) {
  5. target.push(value);
  6. }
  7. START_TEST(List)
  8. {
  9. // Populate
  10. List<int32_t> integers;
  11. ASSERT_EQUAL(integers.length(), 0);
  12. targetByReference(integers, 5);
  13. ASSERT_EQUAL(integers.length(), 1);
  14. ASSERT_EQUAL(integers[0], 5);
  15. targetByReference(integers, 86);
  16. ASSERT_EQUAL(integers.length(), 2);
  17. ASSERT_EQUAL(integers[0], 5);
  18. ASSERT_EQUAL(integers[1], 86);
  19. std::function<void(int32_t value)> method = [&integers](int32_t value) {
  20. integers.push(value);
  21. };
  22. method(24);
  23. ASSERT_EQUAL(integers.length(), 3);
  24. ASSERT_EQUAL(integers[0], 5);
  25. ASSERT_EQUAL(integers[1], 86);
  26. ASSERT_EQUAL(integers[2], 24);
  27. integers.pushConstruct(123);
  28. ASSERT_EQUAL(integers.length(), 4);
  29. ASSERT_EQUAL(integers[0], 5);
  30. ASSERT_EQUAL(integers[1], 86);
  31. ASSERT_EQUAL(integers[2], 24);
  32. ASSERT_EQUAL(integers[3], 123);
  33. // Copy
  34. List<int32_t> copied = List<int32_t>(integers);
  35. ASSERT_EQUAL(integers.length(), 4);
  36. ASSERT_EQUAL(integers[0], 5);
  37. ASSERT_EQUAL(integers[1], 86);
  38. ASSERT_EQUAL(integers[2], 24);
  39. ASSERT_EQUAL(integers[3], 123);
  40. ASSERT_EQUAL(copied.length(), 4);
  41. ASSERT_EQUAL(copied[0], 5);
  42. ASSERT_EQUAL(copied[1], 86);
  43. ASSERT_EQUAL(copied[2], 24);
  44. ASSERT_EQUAL(copied[3], 123);
  45. // Assign
  46. List<int32_t> assigned = integers;
  47. ASSERT_EQUAL(integers.length(), 4);
  48. ASSERT_EQUAL(integers[0], 5);
  49. ASSERT_EQUAL(integers[1], 86);
  50. ASSERT_EQUAL(integers[2], 24);
  51. ASSERT_EQUAL(integers[3], 123);
  52. ASSERT_EQUAL(assigned.length(), 4);
  53. ASSERT_EQUAL(assigned[0], 5);
  54. ASSERT_EQUAL(assigned[1], 86);
  55. ASSERT_EQUAL(assigned[2], 24);
  56. ASSERT_EQUAL(assigned[3], 123);
  57. // Move
  58. List<int32_t> moved = std::move(integers);
  59. ASSERT_EQUAL(integers.length(), 0);
  60. ASSERT_EQUAL(moved.length(), 4);
  61. ASSERT_EQUAL(moved[0], 5);
  62. ASSERT_EQUAL(moved[1], 86);
  63. ASSERT_EQUAL(moved[2], 24);
  64. ASSERT_EQUAL(moved[3], 123);
  65. }
  66. { // Fixed size elements
  67. List<int> myIntegers;
  68. ASSERT_EQUAL(myIntegers.length(), 0);
  69. for (int i = 0; i < 1000; i++) {
  70. myIntegers.push(i * 2 + 1); // 1, 3, 5, 7, 9, 11, 13...
  71. }
  72. ASSERT_EQUAL(myIntegers.length(), 1000);
  73. int integerErrorCount = 0;
  74. for (int i = 0; i < 1000; i++) {
  75. if (myIntegers[i] != i * 2 + 1) { // 1, 3, 5, 7, 9, 11, 13...
  76. integerErrorCount++;
  77. }
  78. }
  79. ASSERT_EQUAL(integerErrorCount, 0);
  80. }
  81. { // Complex elements
  82. List<String> myStrings;
  83. ASSERT_EQUAL(myStrings.length(), 0);
  84. myStrings.pushConstruct(U"is");
  85. myStrings.push(U"this");
  86. myStrings.push(U"a");
  87. myStrings.push(U"list");
  88. ASSERT_EQUAL(myStrings.length(), 4);
  89. ASSERT_EQUAL(myStrings[0], U"is");
  90. ASSERT_EQUAL(myStrings[1], U"this");
  91. ASSERT_EQUAL(myStrings[2], U"a");
  92. ASSERT_EQUAL(myStrings[3], U"list");
  93. ASSERT_EQUAL(myStrings.first(), U"is");
  94. ASSERT_EQUAL(myStrings.last(), U"list");
  95. ASSERT_EQUAL(myStrings, List<String>(U"is", U"this", U"a", U"list"));
  96. myStrings.swap(0, 1);
  97. ASSERT_EQUAL(myStrings.length(), 4);
  98. ASSERT_EQUAL(myStrings[0], U"this");
  99. ASSERT_EQUAL(myStrings[1], U"is");
  100. ASSERT_EQUAL(myStrings[2], U"a");
  101. ASSERT_EQUAL(myStrings[3], U"list");
  102. ASSERT_EQUAL(myStrings, List<String>(U"this", U"is", U"a", U"list"));
  103. List<String> myOtherStrings = myStrings;
  104. myStrings.remove(1);
  105. ASSERT_EQUAL(myStrings.length(), 3);
  106. ASSERT_EQUAL(myStrings[0], U"this");
  107. ASSERT_EQUAL(myStrings[1], U"a");
  108. ASSERT_EQUAL(myStrings[2], U"list");
  109. ASSERT_EQUAL(myStrings, List<String>(U"this", U"a", U"list"));
  110. myStrings.remove(0);
  111. ASSERT_EQUAL(myStrings.length(), 2);
  112. ASSERT_EQUAL(myStrings[0], U"a");
  113. ASSERT_EQUAL(myStrings[1], U"list");
  114. ASSERT_EQUAL(myStrings, List<String>(U"a", U"list"));
  115. myStrings.pop();
  116. ASSERT_EQUAL(myStrings.length(), 1);
  117. ASSERT_EQUAL(myStrings[0], U"a");
  118. ASSERT_EQUAL(myStrings, List<String>(U"a"));
  119. myStrings.clear();
  120. ASSERT_EQUAL(myStrings.length(), 0);
  121. ASSERT_EQUAL(myOtherStrings.length(), 4);
  122. ASSERT_EQUAL(myOtherStrings[0], U"this");
  123. ASSERT_EQUAL(myOtherStrings[1], U"is");
  124. ASSERT_EQUAL(myOtherStrings[2], U"a");
  125. ASSERT_EQUAL(myOtherStrings[3], U"list");
  126. ASSERT_EQUAL(myOtherStrings, List<String>(U"this", U"is", U"a", U"list"));
  127. myOtherStrings.clear();
  128. ASSERT_EQUAL(myOtherStrings.length(), 0);
  129. }
  130. // TODO: Test lists of objects that can not be cloned.
  131. END_TEST