find_first_of: A performance pitfall among the STL algorithms

#ifndef __FIND_FIRST_OF_TEST_H__
#define __FIND_FIRST_OF_TEST_H__

#include <string>
#include <iostream>
#include <ctime>

typedef std::string test_string;

enum algo_type
{
	alg_void = 0,
	alg_find_first_of,
	alg_strpbrk,
	alg_find_first_of_set,
	alg_find_first_of_hash_set,
	alg_find_first_of_assoc_vec,
	alg_find_first_of_sorted_range,
	alg_dpx_find_first_of
};

void algo_test(algo_type type, unsigned long test_cycles, unsigned long search_size, unsigned long elements_count, std::ostream *outStream);
clock_t run_algo(algo_type type, const test_string &search_range, const test_string &search_elements, unsigned long test_cycles);

#define ARRAY_SIZE(X)	(sizeof (X) / sizeof (*(X)) )
#define ARRAY_END(X)	( (X) + ARRAY_SIZE(X) )

#endif //__FIND_FIRST_OF_TEST_H__