From d4b1664d1861fe176432f3b25c9563134dda93f5 Mon Sep 17 00:00:00 2001 From: Gordon Sim Date: Fri, 13 Nov 2009 10:57:50 +0000 Subject: 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 --- cpp/src/qpid/broker/Queue.cpp | 6 +----- 1 file changed, 1 insertion(+), 5 deletions(-) (limited to 'cpp/src/qpid/broker/Queue.cpp') 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 -- cgit v1.2.1