I have come to understand how Guile handles hashing; Rob Browning
was looking, in .../scm/prefs.scm for a "hash-for-each."
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...
--
Go, lemmings, go!
[EMAIL PROTECTED] <http://www.ntlug.org/~cbbrowne/languages.html>
--
Gnucash Developer's List
To unsubscribe send empty email to: [EMAIL PROTECTED]
