Really? Too bad, would have been useful. I assume that by overhead you mean the need to store for each result item the full scouring source information and such. But perhaps when "show score break-down" is clicked, the search can be *rerun*, and as it progresses this time around the more expensive code path is chosen, the one which notes all the details. That way things would be fast and lean during normal operation, as usual, and the extra load is only incurred on an introspective run through the search... Just a thought; in all likelihood this approach is not even viable, I don't really know what the control flow of FARR is during its searches. But hey, I can wish.
