lazy *STACK-TOP-HINT*s

[sbcl.git] / NEWS

diff --git a/NEWS b/NEWS
index 3e7bb67..9513f4f 100644 (file)
--- a/NEWS
+++ b/NEWS
@@ -1,5 +1,13 @@
 ;;;; -*- coding: utf-8; fill-column: 78 -*-
-changes relative to sbcl-1.0.56:
+changes relative to sbcl-1.0.57:
+  * enhancement: SB-EXT:ATOMIC-UPDATE makes it easy to perform non-destructive
+    updates of CAS-able places (similar to Clojure's swap!).
+  * bug fix: potential for infinite recursion during compilation of CLOS slot
+    typechecks when dependency graph had loops. (lp#1001799)
+  * bug fix: error forms reported with some program-errors were not escaped
+    properly.
+
+changes in sbcl-1.0.57 relative to sbcl-1.0.56:
   * RANDOM enhancements and bug fixes:
     ** bug fix: the range and distribution of random integers could be
        catastrophically wrong when the compiler derived the type of its
@@ -66,8 +74,9 @@ changes relative to sbcl-1.0.56:
     strictly-monotonic functions.  (lp#975528)
   * bug fix: copy-tree caused stack exhaustion on long linear lists, and now
     it's also slightly faster. (lp#998926)
-  * bug fix: better error messages for malformed IGNORE declarations.
+  * bug fix: better error messages for malformed declarations.
     (lp#1000239)
+  * bug fix: define-condition didn't return the name of the defined condition.
   * documentation:
     ** improved docstrings: REPLACE (lp#965592)