|Subject:||Re: guile-json 0.2.0 released|
|Date:||Fri, 5 Apr 2013 09:18:09 -0400|
I think you miss the hashx procedures.
On 05/04/2013 10:47 AM, "Noah Lavine" <address@hidden> wrote:
> Although hash tables in general do include arbitrary procedures, in Guile's implementation there are only three to choose from, so it should be possible to represent them in syntax.
> For exactly this reason, I believe that actually "hash table" is a bad name for the data structure. I think of Guile's hash tables as a generic dictionary structure with average O(1)-time lookup, insertion and deletion.
Where do you get your definition of 'hash table' that the guile type does not apply?
> In the rare case, when dictionary lookups are time- or space-critical and must be optimized, *then* it's worth it to design custom hash functions and implement hash tables from vectors and similar things.
That's what the current data type is anyway, and can be used with custom hash? I'm not sure I follow the distinctions you are making.
|[Prev in Thread]||Current Thread||[Next in Thread]|