[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Hash table read syntax in guile 2.0

From: Daniel Hartwig
Subject: Re: Hash table read syntax in guile 2.0
Date: Mon, 18 Feb 2013 14:29:30 +0800

On 18 February 2013 13:39, Hengqing Hu <address@hidden> wrote:
> 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.

This involves the assumption that the sizes of hash-tree and
hash-table are equal.  It is hard to verify this due to the not
trivial construction of hash-tree.

I have not profiled the code but it is clear that most of the
processing happens in build-interval-tree-table and build-hash-tree.
The final part for removing the unrelated items is nothing compared to
that.  At the small expense of sometimes doing the final loop when it
could have been avoided, you gain an procedure that is more easily

I suspect that remove-unrelated can be restructued to use two loops at
most, but don't have time further to consider it.  Anyway, enjoy.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]