Function phase2

test/Queue/QueueOperationsTestCase.cpp:330–625

 */

bool phase2()
{
	for (const auto dynamic : falseTrue)
		for (const auto raw : falseTrue)
			for (const auto fifo : falseTrue)
			{
				const auto queueWrapper = makeQueueWrapper<1>(dynamic, raw, fifo);
				const uint8_t constPriority {};
				const OperationCountingType constTestValue {};
				uint8_t nonConstPriority {};
				OperationCountingType nonConstTestValue {};

				{
					// queue is not full, so tryPush(..., const T&) must succeed immediately
					OperationCountingType::resetCounters();
					waitForNextTick();
					const auto start = TickClock::now();
					const auto ret = queueWrapper->tryPush(constPriority, constTestValue);	// 1 copy construction
					if (ret != 0 || start != TickClock::now() ||
							queueWrapper->checkCounters(0, 1, 0, 0, 0, 0, 0) != true)
						return false;
				}

				{
					const auto ret = testTryPushWhenFull(*queueWrapper);
					if (ret != true)
						return ret;
				}

				{
					const auto ret = testTryPopWhenNotEmpty(*queueWrapper);
					if (ret != true)
						return ret;
				}

				{
					const auto ret = testTryPopWhenEmpty(*queueWrapper);
					if (ret != true)
						return ret;
				}

				{
					// queue is not full, so tryPush(..., T&&) must succeed immediately
					OperationCountingType::resetCounters();
					waitForNextTick();
					const auto start = TickClock::now();
					// 1 construction, 1 move construction, 1 destruction
					const auto ret = queueWrapper->tryPush(constPriority, OperationCountingType{});
					if (ret != 0 || start != TickClock::now() ||
							queueWrapper->checkCounters(1, 0, 1, 1, 0, 0, 0) != true)
						return false;
				}

				{
					const auto ret = testTryPushWhenFull(*queueWrapper);
					if (ret != true)
						return ret;
				}