5405584b7b
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. Signed-off-by: Anton Khirnov <anton@khirnov.net> |
||
|---|---|---|
| .. | ||
| checkasm | ||
| fate | ||
| filtergraphs | ||
| ref | ||
| audiogen.c | ||
| base64.c | ||
| fate-run.sh | ||
| fate.sh | ||
| lavf-regression.sh | ||
| Makefile | ||
| md5.sh | ||
| reference.pnm | ||
| regression-funcs.sh | ||
| rotozoom.c | ||
| tiny_psnr.c | ||
| utils.c | ||
| videogen.c | ||