0.8.7.37:

[sbcl.git] / NEWS

diff --git a/NEWS b/NEWS
index 5402e4b..45facf6 100644 (file)
--- a/NEWS
+++ b/NEWS
@@ -2257,11 +2257,15 @@ changes in sbcl-0.8.8 relative to sbcl-0.8.7:
     behaviour, and in particular no longer treats all memory as being
     exhausted when many small objects point to each other in a deeply
     recursive manner.
+  * bug fix: arrays specialized on (UNSIGNED-BYTE 15) are now
+    recognized as being TYPEP their class.
   * optimization: implemented multiplication as a modular
     (UNSIGNED-BYTE 32) operation on the x86 backend.
   * optimization: SEARCH on simple-base-strings can now be open-coded.
     (see also contrib/compiler-extras.lisp for inspiration for
     teaching the compiler about the Boyer-Moore algorithm).
+  * value, returned by MAX (and MIN) called with several EQUALP, but
+    not EQL, arguments now does not depend on compiler settings.
   * fixed some bugs revealed by Paul Dietz' test suite:
     ** in stack analysis liveness information is propagated from
        non-local entry points.