summaryrefslogtreecommitdiff
path: root/cpp/src
diff options
context:
space:
mode:
authorGordon Sim <gsim@apache.org>2009-11-13 10:57:50 +0000
committerGordon Sim <gsim@apache.org>2009-11-13 10:57:50 +0000
commitd4b1664d1861fe176432f3b25c9563134dda93f5 (patch)
tree981bbb3f3ae9be22d2f6ae0c4ae907d898fd09fd /cpp/src
parent1d4694bd541c5aef5e4207553f2ae311d3797955 (diff)
downloadqpid-python-d4b1664d1861fe176432f3b25c9563134dda93f5.tar.gz
Change from linear to binary search in requeue
git-svn-id: https://svn.apache.org/repos/asf/qpid/trunk/qpid@835808 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'cpp/src')
-rw-r--r--cpp/src/qpid/broker/Queue.cpp6
1 files changed, 1 insertions, 5 deletions
diff --git a/cpp/src/qpid/broker/Queue.cpp b/cpp/src/qpid/broker/Queue.cpp
index 7087c6b081..780c254a56 100644
--- a/cpp/src/qpid/broker/Queue.cpp
+++ b/cpp/src/qpid/broker/Queue.cpp
@@ -217,11 +217,7 @@ void Queue::requeue(const QueuedMessage& msg){
Mutex::ScopedLock locker(messageLock);
if (!isEnqueued(msg)) return;
msg.payload->enqueueComplete(); // mark the message as enqueued
- //put message back in correct position:
- Messages::reverse_iterator i = messages.rbegin();
- while (i != messages.rend() && msg.position < i->position) { ++i; }
- messages.insert(i.base(), msg);
-
+ messages.insert(lower_bound(messages.begin(), messages.end(), msg), msg);
listeners.populate(copy);
// for persistLastNode - don't force a message twice to disk, but force it if no force before