summaryrefslogtreecommitdiff
path: root/src
diff options
context:
space:
mode:
authorSimon MacMullen <simon@rabbitmq.com>2012-10-04 17:58:49 +0100
committerSimon MacMullen <simon@rabbitmq.com>2012-10-04 17:58:49 +0100
commitf963474c1923ac8fcefe45e0f9e304a7ef4a1a9f (patch)
treefbe18e2557393736f3d215c9675bd703504e69dc /src
parentcf2a634008a622e90178404efb6696e0edd0c63c (diff)
downloadrabbitmq-server-git-f963474c1923ac8fcefe45e0f9e304a7ef4a1a9f.tar.gz
Clearer
Diffstat (limited to 'src')
-rw-r--r--src/rabbit_mirror_queue_misc.erl4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/rabbit_mirror_queue_misc.erl b/src/rabbit_mirror_queue_misc.erl
index 150b089970..00cb170a97 100644
--- a/src/rabbit_mirror_queue_misc.erl
+++ b/src/rabbit_mirror_queue_misc.erl
@@ -267,8 +267,8 @@ suggested_queue_nodes(<<"nodes">>, Nodes0, {MNode, _SNodes}, All) ->
end;
%% When we need to add nodes, we randomise our candidate list as a
%% crude form of load-balancing. TODO it would also be nice to
-%% randomise when we have too many - but that would fail to take
-%% account of synchronisation...
+%% randomise the list of ones to remove when we have too many - but
+%% that would fail to take account of synchronisation...
suggested_queue_nodes(<<"exactly">>, Count, {MNode, SNodes}, All) ->
SCount = Count - 1,
{MNode, case SCount > length(SNodes) of