The current order of bit generation or consumption in integer->list, list->integer, integer->vector, vector->integer, bits, bitwise-fold, bitwise-for-each, bitwise-unfold, and make-bitwise-generator is not entirely satisfactory.
In SRFI 142, these were all defined to generate or consume bits in little-endian order: that is, bit #0 first, followed by bit #1, etc. However, this did not agree with the SLIB and SRFI 60 implementations, or indeed the implementation of SRFI 142 itself (since this implementation was taken directly from SRFI 60). So in SRFI 151 I switched the definition to big-endian order.
However, bitwise-fold, bitwise-for-each, bitwise-unfold, and make-bitwise-generator were first defined in SRFI 142, so I left them alone in SRFI 151. This makes them inconsistent with the above group.
Is this a problem? Should I change them to be consistent? This will involve changing make-bitwise-generator to produce a finite generator.
Other comments?
--