summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorAlan Conway <aconway@apache.org>2010-10-19 15:35:53 +0000
committerAlan Conway <aconway@apache.org>2010-10-19 15:35:53 +0000
commit91d8fc1b89c04891c6b1798a53671bd61860e462 (patch)
tree36bd1b79f7dc4ebe74400cdfd74e81e2c145708a
parentb35d3ed3ae1d1b5623f68433c4cae3ec777a6be4 (diff)
downloadqpid-python-91d8fc1b89c04891c6b1798a53671bd61860e462.tar.gz
Fix compile error in BrokerClusterCalls test, signed/unsigned comparison.
git-svn-id: https://svn.apache.org/repos/asf/qpid/trunk/qpid@1024279 13f79535-47bb-0310-9956-ffa450edef68
-rw-r--r--cpp/src/tests/BrokerClusterCalls.cpp10
1 files changed, 5 insertions, 5 deletions
diff --git a/cpp/src/tests/BrokerClusterCalls.cpp b/cpp/src/tests/BrokerClusterCalls.cpp
index 2b06d9ce34..9a9cd063f5 100644
--- a/cpp/src/tests/BrokerClusterCalls.cpp
+++ b/cpp/src/tests/BrokerClusterCalls.cpp
@@ -144,7 +144,7 @@ QPID_AUTO_TEST_CASE(testSimplePubSub) {
// Queue creation
Sender sender = f.s.createSender("q;{create:always,delete:always}");
- int i = 0;
+ size_t i = 0;
BOOST_CHECK_EQUAL(h.at(i++), "createq(q)"); // Note: at() does bounds checking.
BOOST_CHECK_EQUAL(h.size(), i);
@@ -199,7 +199,7 @@ QPID_AUTO_TEST_CASE(testReleaseReject) {
// Explicit release
f.s.release(m);
f.s.sync();
- int i = 0;
+ size_t i = 0;
BOOST_CHECK_EQUAL(h.at(i++), "release(q, 1, a)");
BOOST_CHECK_EQUAL(h.size(), i);
@@ -291,7 +291,7 @@ QPID_AUTO_TEST_CASE(testFanout) {
r1.setCapacity(0); // Don't receive immediately.
r2.setCapacity(0);
h.clear();
- int i = 0;
+ size_t i = 0;
// Send message
sender.send(Message("a"));
@@ -336,7 +336,7 @@ QPID_AUTO_TEST_CASE(testRingQueue) {
c.close();
Sender sender = f.s.createSender("ring");
- int i = 0;
+ size_t i = 0;
// Send message
sender.send(Message("a"));
sender.send(Message("b"));
@@ -388,7 +388,7 @@ QPID_AUTO_TEST_CASE(testTransactions) {
vector<string>& h = f.dc->history;
Session ts = f.c.createTransactionalSession();
Sender sender = ts.createSender("q;{create:always,delete:always}");
- int i = 0;
+ size_t i = 0;
BOOST_CHECK_EQUAL(h.at(i++), "createq(q)"); // Note: at() does bounds checking.
BOOST_CHECK_EQUAL(h.size(), i);