find_first_of: A performance pitfall among the STL algorithms

#include "find_first_of_test.h"
#include <fstream>

void TestA(algo_type type, std::ostream *outStreamPtr)
{
unsigned long element_count_array[] = { 1, 2, 4, 8, 16, 32, 48, 64 };

#if NDEBUG
	unsigned long test_cycles		= 10;
#else
	unsigned long test_cycles		= 1;
#endif
	unsigned long search_size		= 10000000;

	unsigned long *it = NULL;

	for ( it = element_count_array; it != ARRAY_END(element_count_array); ++it)
		algo_test(type, test_cycles, search_size, *it, outStreamPtr);
}

int main(int argc, char* argv[])
{
	std::ofstream outfile;
	
	if (argc == 2)
		outfile.open(argv[1], std::ios::app);
	
	std::ostream *outStream = outfile.is_open() ? &outfile : &std::cout;

	TestA(alg_find_first_of, outStream);
	TestA(alg_strpbrk, outStream);
	TestA(alg_dpx_find_first_of, outStream);
	TestA(alg_find_first_of_set, outStream);
	TestA(alg_find_first_of_hash_set, outStream);
	TestA(alg_find_first_of_sorted_range, outStream);
	//TestA(alg_find_first_of_assoc_vec, outStream);

	return 0;
}