Re: Hash table read syntax in guile 2.0

[Hengqing Hu]

Thanks for spending time to investigate.

One thing I'd like to point out, the intention of use hash-length
in remove-unrelated-blocks is to avoid furthur processing
if all blocks are related.

Of course you can use your left hand for the purpose of your right hand.
It does not mean having one hand is better than two hands.

在 2013-2-18，13:11，Daniel Hartwig <address@hidden> 写道：

> On 18 February 2013 11:28, Hengqing Hu <address@hidden> 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.
> <0001-remove-hash-length.patch>