Name | Modified | Size | Downloads / Week |
---|---|---|---|
Parent folder | |||
README | 2019-06-29 | 989 Bytes | |
sbcl-1.5.4-release-notes.txt | 2019-06-29 | 989 Bytes | |
sbcl-1.5.4-documentation-html.tar.bz2 | 2019-06-29 | 229.7 kB | |
sbcl-1.5.4-source.tar.bz2 | 2019-06-29 | 6.4 MB | |
sbcl-1.5.4-x86-64-linux-binary.tar.bz2 | 2019-06-29 | 9.9 MB | |
sbcl-1.5.4-crhodes.asc | 2019-06-29 | 959 Bytes | |
Totals: 6 Items | 16.5 MB | 0 |
changes in sbcl-1.5.4 relative to sbcl-1.5.3: * minor incompatible change: hash tables on 64-bit machines consume roughly 20% less memory but can only grow to hold 2^31 entries (theoretically) due to use of 31-bit indices internally. * platform support: - RISC-V: improve rotate-byte support (thanks to Philipp Matthias Schaefer) * bug fix: the system reasons more correctly regarding the array rank of complicated array types. (reported by Bart Botta) * bug fix: DOUBLE-FLOAT-P never gets weaked to NUMBERP. (reported by Bart Botta) * enhancement: the regression test suite can now benefit from paralellism, completing much faster when enough compute power is available. * optimization: readtables with non-base-char dispatch characters are less inefficient. * optimization: INTERN performs fewer redundant type checks. * optimization: tests for PATHNAMEP and STRUCTURE-OBJECT (including in computing hash functions) are faster.