for (int d = 0; d < StrictMath::min(i, size); d++)
for (int d = 0; d < StrictMath::minimum(i, size); d++)
	void testResize2()	{		int size = 10;		for (int n = 1; n < (size * 2); n++)		{			for (int i = 0; i < (size * 2); i++)			{				for (int d = 0; d < StrictMath::min(i, size); d++)				{					BoundedFIFO bf(size);					for (int p = 0; p < i; p++)					{						bf.put(e[p]);					}					for (int g = 0; g < d; g++)					{						bf.get();					}					// x = the number of elems in 					int x = bf.length();					bf.resize(n);					int expectedSize = StrictMath::min(n, x);					CPPUNIT_ASSERT_EQUAL(expectedSize, bf.length());					for (int c = 0; c < expectedSize; c++)					{						CPPUNIT_ASSERT_EQUAL(e[c + d], bf.get());					}					CPPUNIT_ASSERT(bf.get() == 0);				}			}		}	}