John Cowan <xxxxxx@mercury.ccil.org> writes:

> In alist->hashtable, the leftmost value of a key wins, because alists
> are searched left to right.  I've added clarifying language.

Aw crap, I messed that up in SRFI-126.  It defines alist->*hashtable
through the simplistic snippet

  (let ((ht (make-*hashtable ...)))
    (for-each (lambda (entry)
                (hashtable-set! ht (car entry) (cdr entry)))
              alist)
    ht)

which means the last key in the alist wins.

How do I atone for this?  There is no official errata process for SRFIs,
is there?  It's a nontrivial change, too.

Taylan