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
commitf4e9761a3c6a4cb710d949b55ab9612925783d36 (patch)
tree52c4a13ecc60415e8d7fc82b193c64c4426466bf
parent3e9bbe365360adf66e9ae40b013226e6c5297808 (diff)
downloadrabbitmq-server-f4e9761a3c6a4cb710d949b55ab9612925783d36.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 0d221b05..655bbb73 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