[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 11:24:09 +0800 |
On 18 February 2013 11:14, Hengqing Hu <address@hidden> wrote:
> Though I didn't look into the implementation.
>
> I suppose length is a constant time operation here,
> if you use fold instead to get the same thing.
> It would be linear time.
This is not guaranteed.
>
> Knowing something is empty or not rises after I put something inside
> and then take something out.
> Then I dont't know whether there are still something left, so I need to
> examine it.
> Or if something can tell me.
Although the point of your algorithm is vague, I believe you will find
a better one using hash-fold that does not involve checking for
emptiness.
Why do you need to know if some elements are left, and what happens if
there are? Do you have some code I could look at?
- Hash table read syntax in guile 2.0, Hengqing Hu, 2013/02/16
- Re: Hash table read syntax in guile 2.0, Daniel Hartwig, 2013/02/17
- Re: Hash table read syntax in guile 2.0, Hengqing Hu, 2013/02/17
- Re: Hash table read syntax in guile 2.0, Daniel Hartwig, 2013/02/17
- Re: Hash table read syntax in guile 2.0, Hengqing Hu, 2013/02/17
- Re: Hash table read syntax in guile 2.0, Daniel Hartwig, 2013/02/17
- Re: Hash table read syntax in guile 2.0, Hengqing Hu, 2013/02/17
- Re: Hash table read syntax in guile 2.0,
Daniel Hartwig <=
- Re: Hash table read syntax in guile 2.0, Hengqing Hu, 2013/02/17
- Re: Hash table read syntax in guile 2.0, Daniel Hartwig, 2013/02/18
- Re: Hash table read syntax in guile 2.0, Hengqing Hu, 2013/02/18
- Re: Hash table read syntax in guile 2.0, Daniel Hartwig, 2013/02/18
Re: Hash table read syntax in guile 2.0, Ludovic Courtès, 2013/02/17