diff options
| author | Matthias Radestock <matthias@rabbitmq.com> | 2010-06-17 18:35:22 +0100 |
|---|---|---|
| committer | Matthias Radestock <matthias@rabbitmq.com> | 2010-06-17 18:35:22 +0100 |
| commit | 8bb31dbe6384aeadd3c5ffdd897b88b99778564f (patch) | |
| tree | 6c181e1e9f9c92f3aaaf20a480c9c1440d8b95e3 | |
| parent | d2c67b9fb4f9cbaa884fc05657bb9d6c9ee70c41 (diff) | |
| download | rabbitmq-server-git-8bb31dbe6384aeadd3c5ffdd897b88b99778564f.tar.gz | |
correct comment
| -rw-r--r-- | src/rabbit_queue_index.erl | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/rabbit_queue_index.erl b/src/rabbit_queue_index.erl index 62cbfbf308..49daaa3dc3 100644 --- a/src/rabbit_queue_index.erl +++ b/src/rabbit_queue_index.erl @@ -304,7 +304,7 @@ next_segment_boundary(SeqId) -> bounds(State = #qistate { segments = Segments }) -> %% This is not particularly efficient, but only gets invoked on - %% queue initialisation and termination. + %% queue initialisation. SegNums = lists:sort(segment_nums(Segments)), %% Don't bother trying to figure out the lowest seq_id, merely the %% seq_id of the start of the lowest segment. That seq_id may not |