diff options
| author | Ted Ross <tross@apache.org> | 2008-09-15 15:37:59 +0000 |
|---|---|---|
| committer | Ted Ross <tross@apache.org> | 2008-09-15 15:37:59 +0000 |
| commit | 33d9364f9c3bc648faa1d04f3c02e58a9e5ad284 (patch) | |
| tree | 51699a22646fa02546da8b298b915df344646b8e /cpp/src/qpid/broker/TopicExchange.cpp | |
| parent | 5fc5a4610b2e85e245c752b81976dca36cc94666 (diff) | |
| download | qpid-python-33d9364f9c3bc648faa1d04f3c02e58a9e5ad284.tar.gz | |
QPID-1274 - Changed C++ namespace for generated management code. Improved efficiency of generated functions to use const references for non-simple types.
git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk/qpid@695511 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'cpp/src/qpid/broker/TopicExchange.cpp')
| -rw-r--r-- | cpp/src/qpid/broker/TopicExchange.cpp | 5 |
1 files changed, 3 insertions, 2 deletions
diff --git a/cpp/src/qpid/broker/TopicExchange.cpp b/cpp/src/qpid/broker/TopicExchange.cpp index 48d6e88503..787cf9637c 100644 --- a/cpp/src/qpid/broker/TopicExchange.cpp +++ b/cpp/src/qpid/broker/TopicExchange.cpp @@ -24,6 +24,7 @@ using namespace qpid::broker; using namespace qpid::framing; using namespace qpid::sys; +namespace _qmf = qmf::org::apache::qpid::broker; // TODO aconway 2006-09-20: More efficient matching algorithm. // Areas for improvement: @@ -139,7 +140,7 @@ bool TopicExchange::bind(Queue::shared_ptr queue, const string& routingKey, cons bindings[routingPattern].push_back(binding); if (mgmtExchange != 0) { mgmtExchange->inc_bindingCount(); - ((management::Queue*) queue->GetManagementObject())->inc_bindingCount(); + ((_qmf::Queue*) queue->GetManagementObject())->inc_bindingCount(); } return true; } @@ -160,7 +161,7 @@ bool TopicExchange::unbind(Queue::shared_ptr queue, const string& routingKey, co if(qv.empty()) bindings.erase(bi); if (mgmtExchange != 0) { mgmtExchange->dec_bindingCount(); - ((management::Queue*) queue->GetManagementObject())->dec_bindingCount(); + ((_qmf::Queue*) queue->GetManagementObject())->dec_bindingCount(); } return true; } |
