X-Git-Url: http://repo.macrolet.net/gitweb/?a=blobdiff_plain;f=NEWS;h=60a328ed4cbba44eea3de26b0b3dd6cda66b9348;hb=05abd44bb4a3699285dd499dbbb4c77b64304835;hp=c4c6ce0b708baee079a1065b93e00117f6269787;hpb=0395c15ff8394bfaaed03050c1a7a131f197a732;p=sbcl.git

diff --git a/NEWS b/NEWS
index c4c6ce0..60a328e 100644
--- a/NEWS
+++ b/NEWS
@@ -6,6 +6,16 @@ changes relative to sbcl-1.0.57:
     updates of CAS-able places (similar to Clojure's swap!).
   * enhancement: run-program no longer decodes and re-encodes environment when
     :environment argument is not provided. (lp#985904)
+  * optimization: On x86-64, code alignment of block headers is done with
+    multi-byte NOPs now instead of repetitions of the single-byte NOP.
+  * optimization: MAP-INTO is substantially faster when the target sequence is
+    of unknown type; mapping into lists is no longer O(N^2). (thanks to James
+    M. Lawrence)
+  * optimization: the compiler no longer heap-conses to check exits in cases
+    where the exit function is dynamic extent, or when it can prove the exit
+    function cannot escape.
+  * optimization: SB-SEQUENCE:DOSEQUENCE is faster on vectors of unknown
+    element type, and vectors that aren't SIMPLE-ARRAYs.
   * 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
@@ -15,6 +25,9 @@ changes relative to sbcl-1.0.57:
   * bug fix: ENSURE-GENERIC-METHOD-COMBINATION accepts method combination
     objects as its :METHOD-COMBINATION argument, not just lists designating
     method combinations. (lp#936513)
+  * bug fix: run-program no longer unconditionally uses /tmp/ for temporary
+    files. (lp#968837).
+  * bug fix: restor build on solaris/sparc. (lp#1008506)
 
 changes in sbcl-1.0.57 relative to sbcl-1.0.56:
   * RANDOM enhancements and bug fixes:
@@ -24,7 +37,7 @@ changes in sbcl-1.0.57 relative to sbcl-1.0.56:
     ** bug fix: the distribution of random integers is now completely
        uniform even when the specified limit is not a power of two.
        (Previously some values could be about 0.1 % more probable than
-       others in the worst case.)
+       others in the worst case.) (lp#309467)
     ** RANDOM on large integer arguments is generally faster and conses
        less than before; this is visible for fixnums above a length of
        about 24 bits, but extremely so for bignums: the old implementation