Henrik Gramner 2ab65b652d checkasm: Use a self-balancing tree ... Tested functions are internally kept in a binary search tree for efficient lookups. The downside of the current implementation is that the tree quickly becomes unbalanced which causes an unneccessary amount of comparisons between nodes. Improve this by changing the tree into a self-balancing left-leaning red-black tree with a worst case lookup/insertion time complexity of O(log n). Significantly reduces the recursion depth and makes the tests run around 10% faster overall. The relative performance improvement compared to the existing non-balanced tree will also most likely increase as more tests are added.		2015-09-26 15:11:11 +02:00
..
api	fate: add api-band-test	2015-08-24 03:54:55 +02:00
checkasm	checkasm: Use a self-balancing tree	2015-09-26 15:11:11 +02:00
fate	AAC encoder: tweak PNS usage to be more aggressive	2015-09-25 03:56:32 -03:00
filtergraphs	fate: add test for mergeplanes filter	2015-07-18 01:55:44 +00:00
ref	fate: add chroma position scale test	2015-09-23 23:42:28 +02:00
audiogen.c
base64.c
copycooker.sh
fate-run.sh	tests/fate-run: Pass bitexact flags to enc_dec_pcm() output	2015-09-06 00:25:49 +02:00
fate-valgrind.supp
fate.sh
ffserver-regression.sh
ffserver.conf
ffserver.regression.ref
lavf-regression.sh
Makefile	fate: add -fflags +bitexact to the relevant targets	2015-08-30 23:31:10 +02:00
md5.sh
reference.pnm
regression-funcs.sh
rotozoom.c
test.ffmeta
tiny_psnr.c
tiny_ssim.c
utils.c
videogen.c