Teuchos_ArrayRCPDecl.hpp

// @HEADER
// ***********************************************************************
// 
//                    Teuchos: Common Tools Package
//                 Copyright (2004) Sandia Corporation
// 
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
// 
// 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
// Questions? Contact Michael A. Heroux (maherou@sandia.gov) 
// 
// ***********************************************************************
// @HEADER


#ifndef TEUCHOS_ARRAY_RCP_DECL_HPP
#define TEUCHOS_ARRAY_RCP_DECL_HPP


#include "Teuchos_RCP.hpp"
#include "Teuchos_Exceptions.hpp"
#include "Teuchos_ArrayViewDecl.hpp"


namespace Teuchos {


template<class T>
class ArrayRCP {
public:



  typedef std::random_access_iterator_tag iterator_category;
  typedef  T* iterator_type;
  typedef  T value_type;
  typedef T& reference; 
  typedef T* pointer;
  typedef  ptrdiff_t difference_type;

  typedef T  element_type;
  typedef Teuchos_Index Ordinal;
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK

  typedef ArrayRCP<T> iterator;
#else
  typedef T* iterator;
#endif
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK

  typedef ArrayRCP<T> const_iterator;
#else
  typedef T* const_iterator;
#endif




  ArrayRCP( ENull null_arg = null );

  ArrayRCP( T* p, Ordinal lowerOffset, Ordinal upperOffset, bool has_ownership );

  template<class Dealloc_T>
  ArrayRCP( T* p, Ordinal lowerOffset, Ordinal upperOffset, Dealloc_T dealloc,
    bool has_ownership );

  explicit ArrayRCP( Ordinal lowerOffset, const T& val = T() );

  ArrayRCP(const ArrayRCP<T>& r_ptr);

  ~ArrayRCP();

  ArrayRCP<T>& operator=(const ArrayRCP<T>& r_ptr);




  bool is_null() const;

  T* operator->() const;

  T& operator*() const;

  T* get() const;

  T* getRawPtr() const;

  T& operator[](Ordinal offset) const;




  ArrayRCP<T>& operator++();

  ArrayRCP<T> operator++(int);

  ArrayRCP<T>& operator--();

  ArrayRCP<T> operator--(int);

  ArrayRCP<T>& operator+=(Ordinal offset);

  ArrayRCP<T>& operator-=(Ordinal offset);

  ArrayRCP<T> operator+(Ordinal offset) const;

  ArrayRCP<T> operator-(Ordinal offset) const;




  const_iterator begin() const;

  const_iterator end() const;




  ArrayRCP<const T> getConst() const;

  ArrayRCP<T> persistingView( Ordinal lowerOffset, Ordinal size ) const;




  Ordinal lowerOffset() const;

  Ordinal upperOffset() const;

  Ordinal size() const;




  ArrayView<T> view( Ordinal lowerOffset, Ordinal size ) const;

  ArrayView<T> operator()( Ordinal lowerOffset, Ordinal size ) const;

  ArrayView<T> operator()() const;




  operator ArrayView<T>() const;

  operator ArrayRCP<const T>() const;




  void assign(Ordinal n, const T &val);

  template<class Iter>
  void assign(Iter first, Iter last);

  void deepCopy(const ArrayView<const T>& av);

  void resize(const Ordinal n, const T &val = T());

  void clear();




  ERCPStrength strength() const;

  bool is_valid_ptr() const;

  int strong_count() const;

  int weak_count() const;

  int total_count() const;

  void set_has_ownership();

  bool has_ownership() const;

  T* release();

  ArrayRCP<T> create_weak() const;

  ArrayRCP<T> create_strong() const;

  template<class T2>
  bool shares_resource(const ArrayRCP<T2>& r_ptr) const;




  const ArrayRCP<T>& assert_not_null() const;

  const ArrayRCP<T>& assert_in_range( Ordinal lowerOffset, Ordinal size ) const;

  const ArrayRCP<T>& assert_valid_ptr() const;



  int count() const;


private:

  // //////////////////////////////////////////////////////////////
  // Private data members

  T *ptr_; // NULL if this pointer is null
  RCPNodeHandle node_; // NULL if this pointer is null
  Ordinal lowerOffset_; // 0 if this pointer is null
  Ordinal upperOffset_; // -1 if this pointer is null

  void debug_assert_not_null() const
    {
#ifdef TEUCHOS_REFCOUNTPTR_ASSERT_NONNULL
      assert_not_null();
#endif
    }

  void debug_assert_in_range( Ordinal lowerOffset_in, Ordinal size_in ) const
    {
      (void)lowerOffset_in; (void)size_in;
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
      assert_in_range(lowerOffset_in, size_in);
#endif
    }

  void debug_assert_valid_ptr() const
    {
#ifdef TEUCHOS_DEBUG
      assert_valid_ptr();
#endif
    }

public:

#ifndef DOXYGEN_COMPILE
  // These constructors should be private but I have not had good luck making
  // this portable (i.e. using friendship etc.) in the past
  // This is a very bad breach of encapsulation that is needed since MS VC++
  // 5.0 will not allow me to declare template functions as friends.
  ArrayRCP( T* p, Ordinal lowerOffset, Ordinal upperOffset,
    const RCPNodeHandle& node );
  T* access_private_ptr() const;
  RCPNodeHandle& nonconst_access_private_node();
  const RCPNodeHandle& access_private_node() const;
#endif

};  // end class ArrayRCP<...>


// 2008/09/22: rabartl: NOTE: I removed the TypeNameTraits<ArrayRCP<T> >
// specialization since I want to be able to print the type name of an
// ArrayRCP that does not have the type T fully defined!


template<typename T>
class NullIteratorTraits<ArrayRCP<T> > {
public:
  static ArrayRCP<T> getNull() { return null; }
};


template<class T>
ArrayRCP<T> arcp(
  T* p,
  typename ArrayRCP<T>::Ordinal lowerOffset,
  typename ArrayRCP<T>::Ordinal size,
  bool owns_mem = true
  );


template<class T, class Dealloc_T>
ArrayRCP<T> arcp(
  T* p,
  typename ArrayRCP<T>::Ordinal lowerOffset,
  typename ArrayRCP<T>::Ordinal size,
  Dealloc_T dealloc, bool owns_mem
  );

 
template<class T>
ArrayRCP<T> arcp( typename ArrayRCP<T>::Ordinal size );

 
template<class T>
ArrayRCP<T> arcpClone( const ArrayView<const T> &v );


template<class T, class Embedded>
ArrayRCP<T>
arcpWithEmbeddedObjPreDestroy(
  T* p,
  typename ArrayRCP<T>::Ordinal lowerOffset,
  typename ArrayRCP<T>::Ordinal size,
  const Embedded &embedded,
  bool owns_mem = true
  );


template<class T, class Embedded>
ArrayRCP<T>
arcpWithEmbeddedObjPostDestroy(
  T* p,
  typename ArrayRCP<T>::Ordinal lowerOffset,
  typename ArrayRCP<T>::Ordinal size,
  const Embedded &embedded,
  bool owns_mem = true
  );


template<class T, class Embedded>
ArrayRCP<T>
arcpWithEmbeddedObj(
  T* p,
  typename ArrayRCP<T>::Ordinal lowerOffset,
  typename ArrayRCP<T>::Ordinal size,
  const Embedded &embedded,
  bool owns_mem = true
  );


template<class T>
ArrayRCP<T> arcp( const RCP<std::vector<T> > &v );


template<class T>
ArrayRCP<const T> arcp( const RCP<const std::vector<T> > &v );


template<class T>
ArrayRCP<T> arcpFromArrayView(const ArrayView<T> &av);


template<class T>
RCP<std::vector<T> > get_std_vector( const ArrayRCP<T> &ptr );


template<class T>
RCP<const std::vector<T> > get_std_vector( const ArrayRCP<const T> &ptr );


template<class T>
bool is_null( const ArrayRCP<T> &p );


template<class T>
bool nonnull( const ArrayRCP<T> &p );


template<class T>
bool operator==( const ArrayRCP<T> &p, ENull );


template<class T>
bool operator!=( const ArrayRCP<T> &p, ENull );


template<class T1, class T2>
bool operator==( const ArrayRCP<T1> &p1, const ArrayRCP<T2> &p2 );


template<class T1, class T2>
bool operator!=( const ArrayRCP<T1> &p1, const ArrayRCP<T2> &p2 );


template<class T1, class T2>
bool operator<( const ArrayRCP<T1> &p1, const ArrayRCP<T2> &p2 );


template<class T1, class T2>
bool operator<=( const ArrayRCP<T1> &p1, const ArrayRCP<T2> &p2 );


template<class T1, class T2>
bool operator>( const ArrayRCP<T1> &p1, const ArrayRCP<T2> &p2 );


template<class T1, class T2>
bool operator>=( const ArrayRCP<T1> &p1, const ArrayRCP<T2> &p2 );


template<class T>
typename ArrayRCP<T>::difference_type
operator-( const ArrayRCP<T> &p1, const ArrayRCP<T> &p2 );


template<class T2, class T1>
ArrayRCP<T2> arcp_const_cast(const ArrayRCP<T1>& p1);


template<class T2, class T1>
ArrayRCP<T2> arcp_reinterpret_cast(const ArrayRCP<T1>& p1);


template<class T2, class T1>
ArrayRCP<T2> arcp_implicit_cast(const ArrayRCP<T1>& p1);


template<class T1, class T2>
void set_extra_data(
  const T1 &extra_data, const std::string& name,
  const Ptr<ArrayRCP<T2> > &p, EPrePostDestruction destroy_when = POST_DESTROY,
  bool force_unique = true );


template<class T1, class T2>
T1& get_extra_data( ArrayRCP<T2>& p, const std::string& name );


template<class T1, class T2>
const T1& get_extra_data( const ArrayRCP<T2>& p, const std::string& name );


template<class T1, class T2>
T1* get_optional_extra_data( ArrayRCP<T2>& p, const std::string& name );


template<class T1, class T2>
const T1* get_optional_extra_data( const ArrayRCP<T2>& p, const std::string& name );


template<class Dealloc_T, class T>
Dealloc_T& get_nonconst_dealloc( const ArrayRCP<T>& p );


template<class Dealloc_T, class T>
const Dealloc_T& get_dealloc( const ArrayRCP<T>& p );


template<class Dealloc_T, class T>
const Dealloc_T* get_optional_dealloc( const ArrayRCP<T>& p );


template<class Dealloc_T, class T>
Dealloc_T* get_optional_nonconst_dealloc( const ArrayRCP<T>& p );


template<class TOrig, class Embedded, class T>
const Embedded& getEmbeddedObj( const ArrayRCP<T>& p );


template<class TOrig, class Embedded, class T>
Embedded& getNonconstEmbeddedObj( const ArrayRCP<T>& p );


template<class T>
std::ostream& operator<<( std::ostream& out, const ArrayRCP<T>& p );


} // end namespace Teuchos


#endif  // TEUCHOS_ARRAY_RCP_DECL_HPP

---