Christopher Browne <[EMAIL PROTECTED]> writes:
> I have some code in transit that handles this; that will also fairly
> substantively change the QIF code that I'm now actively fiddling with
> again.
>
> ;;; Less-than-well-tested:
> (define (hash-for-each fun table)
> (array-for-each
> (lambda (sublst)
> (if sublst
> (for-each fun sublst)))
> table))
>
> It looks like it does modular arithmetic, and can cope acceptably
> with tables that don't use prime sizes, although that presumably
> would minimize collisions...
This is probably OK, and I thought about doing this myself, but I
didn't because I was a little concerned about depending on the
internals of hash tables, and I didn't really need the performance
boost for the stuff I was doing. However, if you do need it, then
this is probably fine. We'll just have to keep an eye out for any
changes in guile's hash table implementation.
--
Rob Browning <[EMAIL PROTECTED]> PGP=E80E0D04F521A094 532B97F5D64E3930
--
Gnucash Developer's List
To unsubscribe send empty email to: [EMAIL PROTECTED]
