On 18 February 2013 11:28, Hengqing Hu <hengqing.hu@gmail.com> wrote:
> Here it is:
>
> https://github.com/hudayou/fib
>
> Welcome your suggestions!

Please see the attached patch.

For remove-unrelated-blocks, building the hash-tree may be suboptimal
and I suspect could be avoided altogether, but I have not investigated
the rest of the program enough to determine this.  At the final part
it is *important* to check every element in the hash-table in case of
processing bugs, assumptions about size are dangerous to make here,
and probably save very little processing time on average.

pretty-show would not output anything when given an empty hash table,
so no need to avoid it there.