summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMatthias Radestock <matthias@lshift.net>2010-04-09 15:35:05 +0100
committerMatthias Radestock <matthias@lshift.net>2010-04-09 15:35:05 +0100
commit0803a8a4f955a37680eb01e264cf53a9668a2922 (patch)
treed287c2242faac3058757ebe3c96eb81a13a497a7
parent2829795d6ed0857892cc23c161fcade87fd114cf (diff)
parentd28f156fc9d9071366d49df108bc257afb8411cf (diff)
downloadrabbitmq-server-git-0803a8a4f955a37680eb01e264cf53a9668a2922.tar.gz
merge default into bug21673
-rw-r--r--src/rabbit_channel.erl8
-rw-r--r--src/rabbit_router.erl8
2 files changed, 7 insertions, 9 deletions
diff --git a/src/rabbit_channel.erl b/src/rabbit_channel.erl
index a8c17efbde..a65bb31b52 100644
--- a/src/rabbit_channel.erl
+++ b/src/rabbit_channel.erl
@@ -962,10 +962,10 @@ fold_per_queue(F, Acc0, UAQ) ->
D = rabbit_misc:queue_fold(
fun ({_DTag, _CTag,
{_QName, QPid, MsgId, _Redelivered, _Message}}, D) ->
- %% dict:append would be simpler and avoid the
- %% lists:reverse in handle_message({recover, true},
- %% ...). However, it is significantly slower when
- %% going beyond a few thousand elements.
+ %% dict:append would avoid the lists:reverse in
+ %% handle_message({recover, true}, ...). However, it
+ %% is significantly slower when going beyond a few
+ %% thousand elements.
rabbit_misc:dict_cons(QPid, MsgId, D)
end, dict:new(), UAQ),
dict:fold(fun (QPid, MsgIds, Acc) -> F(QPid, MsgIds, Acc) end,
diff --git a/src/rabbit_router.erl b/src/rabbit_router.erl
index 96337b42e7..a449e19eb4 100644
--- a/src/rabbit_router.erl
+++ b/src/rabbit_router.erl
@@ -76,11 +76,9 @@ deliver(QPids, Delivery) ->
%% which then in turn delivers it to its queues.
deliver_per_node(
dict:to_list(
- lists:foldl(
- fun (QPid, D) ->
- rabbit_misc:dict_cons(node(QPid), QPid, D)
- end,
- dict:new(), QPids)),
+ lists:foldl(fun (QPid, D) ->
+ rabbit_misc:dict_cons(node(QPid), QPid, D)
+ end, dict:new(), QPids)),
Delivery).
deliver_per_node([{Node, QPids}], Delivery) when Node == node() ->