summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMatthew Sackman <matthew@lshift.net>2009-09-03 11:39:10 +0100
committerMatthew Sackman <matthew@lshift.net>2009-09-03 11:39:10 +0100
commite51355478f8ae924cc6df1dc021790b67601fc1e (patch)
treef1cb5b9fab67b243fc42ee33404fdd1bb0188959
parentf21402056a977af1a8b33938597d3d89e72c7313 (diff)
downloadrabbitmq-server-git-e51355478f8ae924cc6df1dc021790b67601fc1e.tar.gz
sort files for compaction numerically
-rw-r--r--src/rabbit_disk_queue.erl2
1 files changed, 1 insertions, 1 deletions
diff --git a/src/rabbit_disk_queue.erl b/src/rabbit_disk_queue.erl
index 6238088413..63df5cc5d1 100644
--- a/src/rabbit_disk_queue.erl
+++ b/src/rabbit_disk_queue.erl
@@ -1285,7 +1285,7 @@ maybe_roll_to_new_file(_, State) ->
compact(FilesSet, State) ->
%% smallest number, hence eldest, hence left-most, first
- Files = lists:sort(sets:to_list(FilesSet)),
+ Files = lists:sort(fun file_name_sort/2, sets:to_list(FilesSet)),
%% foldl reverses, so now youngest/right-most first
RemainingFiles = lists:foldl(fun (File, Acc) ->
delete_empty_files(File, Acc, State)