Thanks a lot to all who have tested 2.018.x and found bugs (Nikodemus Siivola, Desmond O. Chang, Robert Goldman, Douglas Crosher).
Here is ASDF 2.018.20, the latest release candidate for 2.019, that I'd like to release this weekend.
Changes since previous release candidate 2.018.15:
* Bug fix: don't redefine reinitialize-instance in ways that break its contract and its clients (such as asdf-dependency-grovel). Use change-class to reset slots (.16), but not to 'standard-object, which breaks ecl, rather to a proto-system class (.19). * Bug fix: don't drop pathname components without a / at the end when reading a path using GETENV (.18). Fixes debbugs #647544. * Portability: fix type declaration for SCL (.17). * Upgrade: unintern some more functions that have changed signature (.20).
And since 2.018:
* Portability: debugged CormanLisp support (.1) * Usability: when a system can't be found, there's now a restart to retry finding a system after reinitializing the source-registry (.10). * UI: Create and use a load-systems abstraction, in view of using it in a system-granular parallelizing backend. (.15) * Feature: :around-compile now accepts lambda expressions, and also strings, so you can specify future wrappers that can't even be read yet. (.11, .12). * Filesystem: recursing through logical pathnames in LispWorks (.2, .3), on SBCL as on CMUCL, have asdf:subdirectories follow symlinks (.8., .9) * Internals: strcat (.5), split locate-systems from find-systems (.6) * Configuration: modify user-configuration-directories and system-configuration-directories to return all valid directory names even when they don't exist yet so you may create them (.6), also output name of non-existing configuration file when opening them for writing (.7), * Fixed bugs: buglet in maybe-add-tree (.4) * Upgrade: unintern internals of signature changed in 2.017.12 (.13), have *system-definition-search-functions* not be a defparameter, but a defvar with a fixup (.14), clear *systems-being-defined* when upgrading asdf but re-find them immediately because they may be needed as part of a higher operation (.14).
—♯ƒ • François-René ÐVB Rideau •Reflection&Cybernethics• http://fare.tunes.org The Feynman problem solving Algorithm 1) Write down the problem 2) Think real hard 3) Write down the answer Murray Gell-mann in the NY Times