SUIT_SmartPtr.h

Go to the documentation of this file.

// Copyright (C) 2007-2025  CEA, EDF, OPEN CASCADE
//
// Copyright (C) 2003-2007  OPEN CASCADE, EADS/CCR, LIP6, CEA/DEN,
// CEDRAT, EDF R&D, LEG, PRINCIPIA R&D, BUREAU VERITAS
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307 USA
//
// See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
//
 
#if !defined(__SUIT_SMARTPTR_H)
#define __SUIT_SMARTPTR_H
 
#include "SUIT.h"
 
class SUIT_EXPORT RefCount {
public:
  RefCount() : crefs( 0 ) {}
  RefCount( const RefCount& ) : crefs( 0 ) {}
  virtual ~RefCount() {}
  RefCount& operator=( const RefCount& ) { return *this; }
 
  void upcount() { 
    ++crefs; 
  }
 
  void downcount()
  {
    if ( crefs > 0 && --crefs == 0 )
      delete this;
  }
  
  int refcount() const { return crefs; }
 
private:
  unsigned long crefs;   
};
 
template <class T> class SmartPtr {
public:
  SmartPtr() : p( 0 ) {}
  template<class Y> SmartPtr( Y* y_ ) { p = dynamic_cast<T*>( y_ ); if ( p ) p->upcount(); }
  template<class Y> SmartPtr( const SmartPtr<Y>& y_ ) { p = dynamic_cast<T*>( y_.get() ); if ( p ) p->upcount(); }
  SmartPtr( const SmartPtr& t_ ) : p( t_.p ) { if ( p ) p->upcount();   }
  virtual ~SmartPtr(void)     
  { 
    if ( p )
      p->downcount(); 
  }
 
  // getting access
  T& operator*() const        { return *p;           }
  T* operator->() const       { return  p;           }
  operator T*() const         { return  p;           }
  T* get() const              { return  p;           }
 
  template<class Y> SmartPtr& operator=( const SmartPtr<Y>& y_ ) 
  { 
    if ( this == &y_) return *this;
    return operator=( y_.get() );
  }
  SmartPtr& operator=( const SmartPtr& t_ )
  { 
    if ( this == &t_) return *this;
    return operator=( t_.get() ); 
  }
  SmartPtr& operator=( T* p_ )
  {
    if ( p )
      p->downcount(); 
    p = p_; 
    if ( p )
      p->upcount(); 
    return *this;
  }
  
  // comparing
  int operator==( const SmartPtr& t_ ) { return p == t_.p; }
  int operator==( const T* p_ )           { return p == p_; }
  friend int operator==( const T* p_, const SmartPtr& t_ ) { return t_ == p_; }
  int operator!=( SmartPtr& t_ ) { return p != t_.p; }
  int operator!=( T* p_ )           { return p != p_; }
  friend int operator!=( T* p_, SmartPtr& t_ ) { return p_ != t_.p; }
 
  void nullify() { if ( p ) p->downcount(); p = 0; }
  bool isNull() const { return p == 0; }
 
private:
  T* p;
};
 
#define SMART( C ) SmartPtr<C>
template <class T1, class T2> SMART(T1) downcast( SMART(T2)& t ) 
{
  return SMART(T1)(t.get());
}
 
#endif // __SUIT_SMARTPTR_H