These changes correct a corner case that the old code managed correctly.
commit1819b3015b71ed958ee14da9a767ad5a84fa7f1b
authorFrancesco Potortì <pot@gnu.org>
Wed, 1 Aug 2001 19:07:33 +0000 (1 19:07 +0000)
committerFrancesco Potortì <pot@gnu.org>
Wed, 1 Aug 2001 19:07:33 +0000 (1 19:07 +0000)
treef4001713d2758837cef00f866e21ac81893cd8b0
parentd52a780b42f7305bf32d9facc9c217220f2237b1
These changes correct a corner case that the old code managed correctly.
Precisely when you have a buffer visiting a file in the root directory
and then revert it to a file with the same name in a different
directory.

(uniquify-fix-item-proposed): Renamed from
uniquify-fix-item-min-proposed.
(uniquify-set-proposed): New function.
(uniquify-rationalize-file-buffer-names): Code reshuffled for
clarity and speed.
(uniquify-item-greaterp): Substitutes uniquify-item-lessp.  This
is equivalent to what the old code did.
(uniquify-rationalize-a-list): Never recompute the proposed
name.  Sort the conflicting sublist before rationalising it: this
is equivalent to what the old code did, but one directory element
at a time, and only when necessary.
(uniquify-rationalize-conflicting-sublist): Recompute here the
proposed name.
lisp/uniquify.el