summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMatthias Radestock <matthias@rabbitmq.com>2012-01-19 13:10:23 +0000
committerMatthias Radestock <matthias@rabbitmq.com>2012-01-19 13:10:23 +0000
commit70562444d8c538094c5469bef5a6ae0ff186dbbf (patch)
tree52c4a13ecc60415e8d7fc82b193c64c4426466bf
parent5f410c781b98180bae374409a4154b74e9cf10d5 (diff)
downloadrabbitmq-server-git-70562444d8c538094c5469bef5a6ae0ff186dbbf.tar.gz
correct typo
-rw-r--r--src/rabbit_binding.erl4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/rabbit_binding.erl b/src/rabbit_binding.erl
index 0d221b05dc..655bbb7369 100644
--- a/src/rabbit_binding.erl
+++ b/src/rabbit_binding.erl
@@ -354,8 +354,8 @@ continue({[], Continuation}) -> continue(mnesia:select(Continuation)).
%% For bulk operations we lock the tables we are operating on in order
%% to reduce the time complexity. Without the table locks we end up
-%% with num_tables*num_bulk_bindings row-level locks. Takiing each
-%% lock takes time proportional to the number of existing locks, thus
+%% with num_tables*num_bulk_bindings row-level locks. Taking each lock
+%% takes time proportional to the number of existing locks, thus
%% resulting in O(num_bulk_bindings^2) complexity.
%%
%% The locks need to be write locks since ultimately we end up