/avr_isp/

• ../
• atmega88

	index : md5game.git	eli lcs-optimization lcs2-optimization lcs_sse lcs_upper_bound master
	MD5 longest common substring problem	ejona86@gmail.com

summaryrefslogtreecommitdiff

log msg author committer range

path: root/runner.c

Age	Commit message (Collapse)	Author
2010-12-28	The rough lcs calculation can't be compared against MSFlcs_upper_bound	Eric Anderson
	PEDANTIC testing showed an error with the current n * 4 + 6. pedantic_n = 7 and n = 6 during the PEDANTIC_TEST. I just reverting to old behavior until we can convert the value to something that can be compared to MSF.
2010-12-27	Add timing support to lcs_upper_bound	Eric Anderson
2010-12-27	Remove accidental left-over from copy-paste	Eric Anderson
2010-12-27	Reorganize structure and defines so that things are more understandable	Eric Anderson
	Most things are always "compiled" now, but testing did show that gcc's dead code elimination successfully removes them from the executable. Testing did not show any performance impact.
2010-12-27	lcs_upper_bound's second sum is required all the time and try to handle endians	Eric Anderson
2010-12-26	Add lcs_upper_bound check before lcs_32_rough for added speed	Eric Anderson