From 3130e493f12700b018cd0a3286802f1c0d3a602d Mon Sep 17 00:00:00 2001
From: Andrew Stitcher <astitcher@apache.org>
Date: Tue, 25 Mar 2008 05:04:10 +0000
Subject: Fixed use of intrusive_ptr in code that was missed

git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk@640702 13f79535-47bb-0310-9956-ffa450edef68
---
 qpid/cpp/src/qpid/cluster/Cluster.h   |  5 +++--
 qpid/cpp/src/qpid/sys/RefCountedMap.h | 13 +++++++------
 2 files changed, 10 insertions(+), 8 deletions(-)

(limited to 'qpid/cpp/src')

diff --git a/qpid/cpp/src/qpid/cluster/Cluster.h b/qpid/cpp/src/qpid/cluster/Cluster.h
index 733db8003d..1b0c1b1689 100644
--- a/qpid/cpp/src/qpid/cluster/Cluster.h
+++ b/qpid/cpp/src/qpid/cluster/Cluster.h
@@ -31,6 +31,7 @@
 
 #include <boost/optional.hpp>
 #include <boost/function.hpp>
+#include <boost/intrusive_ptr.hpp>
 
 #include <map>
 #include <vector>
@@ -62,7 +63,7 @@ class Cluster : private sys::Runnable, private Cpg::Handler
     virtual ~Cluster();
 
     // FIXME aconway 2008-01-29: 
-    intrusive_ptr<broker::PreviewSessionManager::Observer> getObserver() { return observer; }
+    boost::intrusive_ptr<broker::PreviewSessionManager::Observer> getObserver() { return observer; }
     
     /** Get the current cluster membership. */
     MemberList getMembers() const;
@@ -116,7 +117,7 @@ class Cluster : private sys::Runnable, private Cpg::Handler
     MemberMap members;
     sys::Thread dispatcher;
     boost::function<void()> callback;
-    intrusive_ptr<broker::PreviewSessionManager::Observer> observer;
+    boost::intrusive_ptr<broker::PreviewSessionManager::Observer> observer;
 
   friend std::ostream& operator <<(std::ostream&, const Cluster&);
   friend std::ostream& operator <<(std::ostream&, const MemberMap::value_type&);
diff --git a/qpid/cpp/src/qpid/sys/RefCountedMap.h b/qpid/cpp/src/qpid/sys/RefCountedMap.h
index 7db1d34953..2186e61b15 100644
--- a/qpid/cpp/src/qpid/sys/RefCountedMap.h
+++ b/qpid/cpp/src/qpid/sys/RefCountedMap.h
@@ -28,6 +28,7 @@
 #include <boost/bind.hpp>
 #include <boost/tuple/tuple.hpp>
 #include <boost/cast.hpp>
+#include <boost/intrusive_ptr.hpp>
 #include <vector>
 #include <map>
 #include <algorithm>
@@ -52,7 +53,7 @@ class RefCountedMapData : public Base {
 
   private:
       friend class RefCountedMap<Key, Data, Impl>;
-    intrusive_ptr<Map> map;
+    boost::intrusive_ptr<Map> map;
     typename Impl::iterator self;
 
   public:
@@ -79,7 +80,7 @@ class RefCountedMap : public RefCountedChild {
 
     // Acquire the lock and ensure map is not deleted before unlock.
     class Lock {
-        intrusive_ptr<const RefCountedMap> map;
+        boost::intrusive_ptr<const RefCountedMap> map;
         sys::Mutex::ScopedLock lock;
       public:
         Lock(const RefCountedMap* m) : map(m), lock(m->lock) {}
@@ -100,13 +101,13 @@ class RefCountedMap : public RefCountedChild {
     ~RefCountedMap() {}
     
     /** Return 0 if not found */
-    intrusive_ptr<Data> find(const Key& k) {
+    boost::intrusive_ptr<Data> find(const Key& k) {
         Lock l(this);
         iterator i = map.find(k);
         return (i == map.end()) ? 0 : i->second;
     }
 
-    bool insert(const Key& k, intrusive_ptr<Data> d) {
+    bool insert(const Key& k, boost::intrusive_ptr<Data> d) {
         Lock l(this);
         iterator i;
         bool inserted;
@@ -132,7 +133,7 @@ class RefCountedMap : public RefCountedChild {
     template <class F> void clear(F functor) {
         Lock l(this);
         while (!map.empty()) {
-            intrusive_ptr<Data> ptr;
+            boost::intrusive_ptr<Data> ptr;
             if (map.empty()) return;
             ptr = map.begin()->second;
             detach(map.begin());
@@ -143,7 +144,7 @@ class RefCountedMap : public RefCountedChild {
 
     /** Apply functor to each map entry. */
     template <class F> void apply(F functor) {
-        std::vector<intrusive_ptr<Data> > snapshot;
+        std::vector<boost::intrusive_ptr<Data> > snapshot;
         {
             // Take a snapshot referencing all values in map.
             Lock l(this);
-- 
cgit v1.2.1