/*
	On veut trouver la façon la plus rapide pour remplacer une série de comparaison de chaines comme
	on build-protocol génére
*/
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <tlmplib.h>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include "getnow.h"

using namespace std;

#include "/tmp/manyifs_ref.h"

template<typename T>
void test(const char *title, unsigned nbrep, const char *s, T t){
	long long start = getnow();
	unsigned count = t(s,nbrep);
	long long end = getnow();
	showtime (title,start,end);
	printf ("count=%u\n",count);
}

<mod>
int main (int argc, char *argv[])
{
	glocal int ret = -1;
	glocal const char *func = "info_write";
	glocal unsigned nbrep = 1;

	glocal.ret = <call tlmpprogram>(argc,argv);
	<f init>
		setproginfo ("","0.0","...");
		setarg (' ',"func","Fonction a chercher",glocal.func,false);
		setarg ('n',"nbrep","Nombre de répétition",glocal.nbrep,false);
	</f>
	<f main_noarg>
		int ret = -1;
		test ("reference",glocal.nbrep,glocal.func,test_ref);
		test ("map",glocal.nbrep,glocal.func,test_map);
		test ("unordered",glocal.nbrep,glocal.func,test_unordered_map);
		return ret;
	</f>
	</call>
	return glocal.ret;
}
</mod>