INNER CODE UNIT · C++

c

rcedgar/usearch12 · src/alignresult.cpp:292

		char c = *p;
		if (c == 'M' || c == 'D')
			Log("%c", Q[i++]);
		else
			Log("-");
		}
	Log("\n");

	i = Loi;
	j = Loj;
	for (const char *p = Path; *p; ++p)
		{
		char c = *p;
		if (c == 'M')
			{
			char q = Q[i++];
			char t = T[j++];
			if (toupper(q) == toupper(t))

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…