Method enqueue_bulk

tests/unittests/unittests.cpp:650–1005

	}
	
	bool enqueue_bulk()
	{
		typedef TestTraits<2> Traits2;
		typedef TestTraits<4> Traits4;
		
		int arr123[] = { 1, 2, 3 };
		int arr1234[] = { 1, 2, 3, 4 };
		int arr123456[] = { 1, 2, 3, 4, 5, 6 };
		
		Traits2::reset();
		{
			// Implicit, block allocation required
			ConcurrentQueue<int, Traits2> q(2);
			ASSERT_OR_FAIL(Traits2::malloc_count() == 1);
			
			q.enqueue_bulk(arr123, 3);
			ASSERT_OR_FAIL(Traits2::malloc_count() == 4);		// One for producer, one for block index, one for block
			
			int item;
			for (int i = 0; i != 3; ++i) {
				ASSERT_OR_FAIL(q.try_dequeue(item));
				ASSERT_OR_FAIL(item == i + 1);
			}
			ASSERT_OR_FAIL(!q.try_dequeue(item));
		}
		
		Traits4::reset();
		{
			// Implicit, block allocation not required (end on block boundary)
			ConcurrentQueue<int, Traits4> q(2);
			ASSERT_OR_FAIL(Traits4::malloc_count() == 1);
			
			q.enqueue_bulk(arr1234, 4);
			ASSERT_OR_FAIL(Traits4::malloc_count() == 3);		// One for producer, one for block index
			
			int item;
			for (int i = 0; i != 4; ++i) {
				ASSERT_OR_FAIL(q.try_dequeue(item));
				ASSERT_OR_FAIL(item == i + 1);
			}
			ASSERT_OR_FAIL(!q.try_dequeue(item));
		}
		
		Traits2::reset();
		{
			// Implicit, allocation fail
			ConcurrentQueue<int, Traits2> q(2);
			ASSERT_OR_FAIL(Traits2::malloc_count() == 1);
			
			ASSERT_OR_FAIL(!q.try_enqueue_bulk(arr123, 3));
			ASSERT_OR_FAIL(Traits2::malloc_count() == 3);		// Still has to allocate implicit producer and block index
			
			int item;
			ASSERT_OR_FAIL(!q.try_dequeue(item));
			
			ASSERT_OR_FAIL(q.try_enqueue_bulk(arr123, 2));
			for (int i = 0; i != 2; ++i) {
				ASSERT_OR_FAIL(q.try_dequeue(item));