int expectedSize = StrictMath::min(n, x);
int expectedSize = StrictMath::minimum(n, x);
 	void testResize3()	{		int size = 10;		for (int n = 1; n < (size * 2); n++)		{			for (int i = 0; i < size; i++)			{				for (int d = 0; d < i; d++)				{					for (int r = 0; r < d; r++)					{						BoundedFIFO bf(size);						for (int p0 = 0; p0 < i; p0++)							bf.put(e[p0]);						for (int g = 0; g < d; g++)							bf.get();						for (int p1 = 0; p1 < r; p1++)							bf.put(e[i + p1]);						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);					}				}			}		}	}