summaryrefslogtreecommitdiff
path: root/qpid/cpp/src/tests
diff options
context:
space:
mode:
authorAlan Conway <aconway@apache.org>2012-04-23 15:51:46 +0000
committerAlan Conway <aconway@apache.org>2012-04-23 15:51:46 +0000
commitfa2d517b97721670a0c5bd55276b346e242288ba (patch)
treeb80174ae0abc7edf88c1f764d11918ae1a5e2107 /qpid/cpp/src/tests
parenta7c7e18f5d000b1e6e211a97e725b8bdca2900cc (diff)
downloadqpid-python-fa2d517b97721670a0c5bd55276b346e242288ba.tar.gz
QPID-3960: Fix performance regression in priority queue implementation.
Revision r1307582 created a serious degredation in priority queue performance. It replaced a muti-deque implementation with o(1) complexity for consuming with a map implementation with o(log(n)) performance. This revision returns to a mutli-deque algorithm but with the addition of a FIFO index for fast browsing of acquired and unacquired messages. git-svn-id: https://svn.apache.org/repos/asf/qpid/trunk@1329301 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'qpid/cpp/src/tests')
-rwxr-xr-xqpid/cpp/src/tests/ha_tests.py1
1 files changed, 1 insertions, 0 deletions
diff --git a/qpid/cpp/src/tests/ha_tests.py b/qpid/cpp/src/tests/ha_tests.py
index 61b42ccc07..827cb7dca9 100755
--- a/qpid/cpp/src/tests/ha_tests.py
+++ b/qpid/cpp/src/tests/ha_tests.py
@@ -468,6 +468,7 @@ class ReplicationTests(BrokerTest):
s = primary.connect().session().sender("q; {create:always, node:{x-declare:{arguments:{'qpid.policy_type':ring, 'qpid.max_count':5, 'qpid.priorities':10}}}}")
priorities = [8,9,5,1,2,2,3,4,9,7,8,9,9,2]
for p in priorities: s.send(Message(priority=p))
+
# FIXME aconway 2012-02-22: there is a bug in priority ring
# queues that allows a low priority message to displace a high
# one. The following commented-out assert_browse is for the