Sort collections according to the last element in the path, so they

are orderered deterministically.  (Otherwise, order changes based on
where your home directory and your plt tree are.)

svn: r851
This commit is contained in:
Eli Barzilay 2005-09-13 18:35:07 +00:00
parent a69fc0380e
commit 1b4a3c7286

View File

@ -158,4 +158,6 @@
(quicksort unsorted compare-directories))))
(define (compare-directories a b)
(bytes<? (path->bytes a) (path->bytes b))))
(let-values ([(base1 name1 dir?1) (split-path a)]
[(base2 name2 dir?2) (split-path b)])
(bytes<? (path->bytes name1) (path->bytes name2)))))