#include "../testTools.h" #include "../../DFPSR/collection/List.h" static void targetByReference(List &target, int32_t value) { target.push(value); } START_TEST(List) { // Populate List integers; ASSERT_EQUAL(integers.length(), 0); targetByReference(integers, 5); ASSERT_EQUAL(integers.length(), 1); ASSERT_EQUAL(integers[0], 5); targetByReference(integers, 86); ASSERT_EQUAL(integers.length(), 2); ASSERT_EQUAL(integers[0], 5); ASSERT_EQUAL(integers[1], 86); std::function method = [&integers](int32_t value) { integers.push(value); }; method(24); ASSERT_EQUAL(integers.length(), 3); ASSERT_EQUAL(integers[0], 5); ASSERT_EQUAL(integers[1], 86); ASSERT_EQUAL(integers[2], 24); integers.pushConstruct(123); ASSERT_EQUAL(integers.length(), 4); ASSERT_EQUAL(integers[0], 5); ASSERT_EQUAL(integers[1], 86); ASSERT_EQUAL(integers[2], 24); ASSERT_EQUAL(integers[3], 123); // Copy List copied = List(integers); ASSERT_EQUAL(integers.length(), 4); ASSERT_EQUAL(integers[0], 5); ASSERT_EQUAL(integers[1], 86); ASSERT_EQUAL(integers[2], 24); ASSERT_EQUAL(integers[3], 123); ASSERT_EQUAL(copied.length(), 4); ASSERT_EQUAL(copied[0], 5); ASSERT_EQUAL(copied[1], 86); ASSERT_EQUAL(copied[2], 24); ASSERT_EQUAL(copied[3], 123); // Assign List assigned = integers; ASSERT_EQUAL(integers.length(), 4); ASSERT_EQUAL(integers[0], 5); ASSERT_EQUAL(integers[1], 86); ASSERT_EQUAL(integers[2], 24); ASSERT_EQUAL(integers[3], 123); ASSERT_EQUAL(assigned.length(), 4); ASSERT_EQUAL(assigned[0], 5); ASSERT_EQUAL(assigned[1], 86); ASSERT_EQUAL(assigned[2], 24); ASSERT_EQUAL(assigned[3], 123); // Move List moved = std::move(integers); ASSERT_EQUAL(integers.length(), 0); ASSERT_EQUAL(moved.length(), 4); ASSERT_EQUAL(moved[0], 5); ASSERT_EQUAL(moved[1], 86); ASSERT_EQUAL(moved[2], 24); ASSERT_EQUAL(moved[3], 123); } { // Fixed size elements List myIntegers; ASSERT_EQUAL(myIntegers.length(), 0); for (int i = 0; i < 1000; i++) { myIntegers.push(i * 2 + 1); // 1, 3, 5, 7, 9, 11, 13... } ASSERT_EQUAL(myIntegers.length(), 1000); int integerErrorCount = 0; for (int i = 0; i < 1000; i++) { if (myIntegers[i] != i * 2 + 1) { // 1, 3, 5, 7, 9, 11, 13... integerErrorCount++; } } ASSERT_EQUAL(integerErrorCount, 0); } { // Complex elements List myStrings; ASSERT_EQUAL(myStrings.length(), 0); myStrings.pushConstruct(U"is"); myStrings.push(U"this"); myStrings.push(U"a"); myStrings.push(U"list"); ASSERT_EQUAL(myStrings.length(), 4); ASSERT_EQUAL(myStrings[0], U"is"); ASSERT_EQUAL(myStrings[1], U"this"); ASSERT_EQUAL(myStrings[2], U"a"); ASSERT_EQUAL(myStrings[3], U"list"); ASSERT_EQUAL(myStrings.first(), U"is"); ASSERT_EQUAL(myStrings.last(), U"list"); ASSERT_EQUAL(myStrings, List(U"is", U"this", U"a", U"list")); myStrings.swap(0, 1); ASSERT_EQUAL(myStrings.length(), 4); ASSERT_EQUAL(myStrings[0], U"this"); ASSERT_EQUAL(myStrings[1], U"is"); ASSERT_EQUAL(myStrings[2], U"a"); ASSERT_EQUAL(myStrings[3], U"list"); ASSERT_EQUAL(myStrings, List(U"this", U"is", U"a", U"list")); List myOtherStrings = myStrings; myStrings.remove(1); ASSERT_EQUAL(myStrings.length(), 3); ASSERT_EQUAL(myStrings[0], U"this"); ASSERT_EQUAL(myStrings[1], U"a"); ASSERT_EQUAL(myStrings[2], U"list"); ASSERT_EQUAL(myStrings, List(U"this", U"a", U"list")); myStrings.remove(0); ASSERT_EQUAL(myStrings.length(), 2); ASSERT_EQUAL(myStrings[0], U"a"); ASSERT_EQUAL(myStrings[1], U"list"); ASSERT_EQUAL(myStrings, List(U"a", U"list")); myStrings.pop(); ASSERT_EQUAL(myStrings.length(), 1); ASSERT_EQUAL(myStrings[0], U"a"); ASSERT_EQUAL(myStrings, List(U"a")); myStrings.clear(); ASSERT_EQUAL(myStrings.length(), 0); ASSERT_EQUAL(myOtherStrings.length(), 4); ASSERT_EQUAL(myOtherStrings[0], U"this"); ASSERT_EQUAL(myOtherStrings[1], U"is"); ASSERT_EQUAL(myOtherStrings[2], U"a"); ASSERT_EQUAL(myOtherStrings[3], U"list"); ASSERT_EQUAL(myOtherStrings, List(U"this", U"is", U"a", U"list")); myOtherStrings.clear(); ASSERT_EQUAL(myOtherStrings.length(), 0); } // TODO: Test lists of objects that can not be cloned. END_TEST