Function random_supported_problem_size

src/tests/accuracy_test_random.cpp:113–161

	}

	std::vector<size_t> random_supported_problem_size( size_t dimensions, clfftPrecision precision, clfftLayout layout )
	{
		std::vector<size_t> lengths;

		std::vector<size_t> supported_radices;
		supported_radices.push_back(2);
		supported_radices.push_back(3);
		supported_radices.push_back(5);
		supported_radices.push_back(7);

		// total size of this problem should be some fraction of the total space available on the device
		size_t this_problem_size = random_int(1, max_problem_size_in_datapoints(precision,layout));

		size_t total_problem_size = 1;
		std::vector<size_t> factors;

		while( total_problem_size < this_problem_size )
		{
			size_t a_factor = supported_radices[random_int(0, supported_radices.size()-1)];
			if( total_problem_size * a_factor <= this_problem_size )
			{
				total_problem_size *= a_factor;
				factors.push_back(a_factor);
			}
			else
				break;
		} // problem size is now factored into some permutation of 2s, 3s, and 5s
		  // (exact combination stored in "factors"

		for( size_t i = 0; i < dimensions; ++i )
			lengths.push_back(1);

		// distribute the values in factors to each valid length value
		while( !factors.empty() )
		{
			size_t which_factor = random_int( 0, factors.size()-1 );
			size_t dim = random_int( 0, dimensions-1 );
			lengths[dim] *= factors[which_factor];
			factors.erase(factors.begin() + which_factor);
		}

		// by the time we reach the end, we've calculated the total problem size, split it up into valid radices, and
		// distributed those among the dimensions available

		if( lengths.size() != dimensions )
			throw std::runtime_error( "random_supported_problem_size: number of lengths does not corroborate number of dimensions" );

		return lengths;
	}

	struct Parameters {
		size_t batch_size;