Fix up the COUNT bitvector transform. Already caught by the
test suite.
to approximately the same size (using Euclid's algorithm) before
applying the more sophisticated binary GCD. (thanks to Juho
Snellman)
+ * optimization: COUNT on bitvectors now operates word-at-a-time.
* fixed some bugs revealed by Paul Dietz' test suite:
** FORMAT variable parameters ("~V<char>") are defaulted properly
if the corresponding argument is NIL.
(:big-endian
'(- sb!vm:n-word-bits extra))))
(%raw-bits sequence index))))
- (declare (type (mod #.sb!vm:n-word-bits)) extra)
+ (declare (type (mod #.sb!vm:n-word-bits) extra))
(declare (type sb!vm:word mask bits))
;; could consider LOGNOT for the zero case instead of
;; doing the subtraction...
;;; checkins which aren't released. (And occasionally for internal
;;; versions, especially for internal versions off the main CVS
;;; branch, it gets hairier, e.g. "0.pre7.14.flaky4.13".)
-"0.8.13.58"
+"0.8.13.59"