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.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// 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 Teuchos_Ordinal Ordinal;
 
  typedef Ordinal size_type;
 
  typedef Ordinal difference_type;
 
  typedef std::random_access_iterator_tag iterator_category;
 
  typedef  T* iterator_type;
 
  typedef  T value_type;
 
  typedef T& reference;
 
  typedef const T& const_reference;
 
  typedef T* pointer;
 
  typedef T* const_pointer;
 
  typedef T  element_type;
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  typedef ArrayRCP<T> iterator;
  typedef ArrayRCP<const T> const_iterator;
#else
  typedef T* iterator;
  typedef const T* const_iterator;
#endif
 
 
 
  inline ArrayRCP( ENull null_arg = null );
 
  inline ArrayRCP( T* p, size_type lowerOffset, size_type size,
    bool has_ownership, const ERCPNodeLookup rcpNodeLookup = RCP_ENABLE_NODE_LOOKUP );
 
  template<class Dealloc_T>
  inline ArrayRCP( T* p, size_type lowerOffset, size_type size, Dealloc_T dealloc,
    bool has_ownership );
 
  inline explicit ArrayRCP( size_type size, const T& val = T() );
 
  inline ArrayRCP(const ArrayRCP<T>& r_ptr);
 
  inline ~ArrayRCP();
 
  inline ArrayRCP<T>& operator=(const ArrayRCP<T>& r_ptr);
 
 
 
  inline bool is_null() const;
 
  inline T* operator->() const;
 
  inline T& operator*() const;
 
  inline T* get() const;
 
  inline T* getRawPtr() const;
 
  inline T& operator[](size_type offset) const;
 
 
 
  inline ArrayRCP<T>& operator++();
 
  inline ArrayRCP<T> operator++(int);
 
  inline ArrayRCP<T>& operator--();
 
  inline ArrayRCP<T> operator--(int);
 
  inline ArrayRCP<T>& operator+=(size_type offset);
 
  inline ArrayRCP<T>& operator-=(size_type offset);
 
  inline ArrayRCP<T> operator+(size_type offset) const;
 
  inline ArrayRCP<T> operator-(size_type offset) const;
 
 
 
  inline iterator begin() const;
 
  inline iterator end() const;
 
 
 
  inline ArrayRCP<const T> getConst() const;
 
  inline ArrayRCP<T> persistingView( size_type lowerOffset, size_type size ) const;
 
 
 
  inline size_type lowerOffset() const;
 
  inline size_type upperOffset() const;
 
  inline size_type size() const;
 
 
 
  inline ArrayView<T> view( size_type lowerOffset, size_type size ) const;
 
  inline ArrayView<T> operator()( size_type lowerOffset, size_type size ) const;
 
  inline ArrayView<T> operator()() const;
 
 
 
  inline operator ArrayRCP<const T>() const;
 
 
 
  inline void assign(size_type n, const T &val);
 
  template<class Iter>
  inline void assign(Iter first, Iter last);
 
  inline void deepCopy(const ArrayView<const T>& av);
 
  inline void resize(const size_type n, const T &val = T());
 
  inline void clear();
 
 
 
  inline ERCPStrength strength() const;
 
  inline bool is_valid_ptr() const;
 
  inline int strong_count() const;
 
  inline int weak_count() const;
 
  inline int total_count() const;
 
  inline void set_has_ownership();
 
  inline bool has_ownership() const;
 
  inline T* release();
 
  inline ArrayRCP<T> create_weak() const;
 
  inline ArrayRCP<T> create_strong() const;
 
  template<class T2>
  inline bool shares_resource(const ArrayRCP<T2>& r_ptr) const;
 
 
 
  inline const ArrayRCP<T>& assert_not_null() const;
 
  inline const ArrayRCP<T>& assert_in_range( size_type lowerOffset, size_type size ) const;
 
  inline const ArrayRCP<T>& assert_valid_ptr() const;
 
 
private:
  T *ptr_;
  RCPNodeHandle node_;
  size_type lowerOffset_;
  size_type upperOffset_;
 
  inline void debug_assert_not_null () const {
#ifdef TEUCHOS_REFCOUNTPTR_ASSERT_NONNULL
    assert_not_null();
#endif
  }
 
  inline void
  debug_assert_in_range (size_type lowerOffset_in,
                         size_type size_in) const
  {
    (void) lowerOffset_in;
    (void) size_in;
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    assert_in_range (lowerOffset_in, size_in);
#endif
  }
 
  inline 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, size_type lowerOffset, size_type size,
    const RCPNodeHandle& node );
  T* access_private_ptr() const;
  RCPNodeHandle& nonconst_access_private_node();
  const RCPNodeHandle& access_private_node() const;
#endif
 
};
 
 
template<class T>
class ArrayRCP<const T> {
public:
  typedef Teuchos_Ordinal Ordinal;
  typedef Ordinal size_type;
  typedef Ordinal difference_type;
  typedef std::random_access_iterator_tag iterator_category;
  typedef const T* iterator_type;
  typedef const T  value_type;
  typedef const T& reference;
  typedef const T& const_reference;
  typedef const T* pointer;
  typedef const T* const_pointer;
  typedef const T  element_type;
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  typedef ArrayRCP<const T> iterator;
  typedef ArrayRCP<const T> const_iterator;
#else
  typedef const T* iterator;
  typedef const T* const_iterator;
#endif
 
  inline ArrayRCP (ENull null_arg = null);
  inline ArrayRCP (const T* p, size_type lowerOffset,
                   size_type size, bool has_ownership,
                   const ERCPNodeLookup rcpNodeLookup = RCP_ENABLE_NODE_LOOKUP);
  template<class Dealloc_T>
  inline ArrayRCP (const T* p, size_type lowerOffset, size_type size,
                   Dealloc_T dealloc, bool has_ownership);
  inline explicit ArrayRCP (size_type size, const T& val = T ());
  inline ArrayRCP (const ArrayRCP<const T>& r_ptr);
  inline ~ArrayRCP();
 
  inline ArrayRCP<const T>& operator= (const ArrayRCP<const T>& r_ptr);
  inline bool is_null() const;
  inline const T* operator->() const;
  inline const T& operator*() const;
  inline const T* get() const;
  inline const T* getRawPtr() const;
  inline const T& operator[] (size_type offset) const;
 
  inline ArrayRCP<const T>& operator++ ();
  inline ArrayRCP<const T> operator++ (int);
  inline ArrayRCP<const T>& operator-- ();
  inline ArrayRCP<const T> operator-- (int);
  inline ArrayRCP<const T>& operator+= (size_type offset);
  inline ArrayRCP<const T>& operator-= (size_type offset);
  inline ArrayRCP<const T> operator+ (size_type offset) const;
  inline ArrayRCP<const T> operator- (size_type offset) const;
 
  inline iterator begin() const;
  inline iterator end() const;
 
  inline ArrayRCP<const T> getConst () const;
  inline ArrayRCP<const T> persistingView (size_type lowerOffset, size_type size) const;
 
  inline size_type lowerOffset() const;
  inline size_type upperOffset() const;
  inline size_type size() const;
 
  inline ArrayView<const T> view (size_type lowerOffset, size_type size) const;
  inline ArrayView<const T> operator() (size_type lowerOffset, size_type size) const;
  inline ArrayView<const T> operator() () const;
 
  inline void resize (const size_type n, const T& val = T ());
  inline void clear ();
 
  inline ERCPStrength strength() const;
  inline bool is_valid_ptr() const;
  inline int strong_count() const;
  inline int weak_count() const;
  inline int total_count() const;
  inline void set_has_ownership();
  inline bool has_ownership() const;
  inline const T* release();
  inline ArrayRCP<const T> create_weak() const;
  inline ArrayRCP<const T> create_strong() const;
 
  template<class T2>
  inline bool shares_resource (const ArrayRCP<T2>& r_ptr) const;
 
  inline const ArrayRCP<const T>& assert_not_null () const;
  inline const ArrayRCP<const T>& assert_in_range (size_type lowerOffset, size_type size) const;
  inline const ArrayRCP<const T>& assert_valid_ptr() const;
 
private:
  const T* ptr_; // NULL if this pointer is null
  RCPNodeHandle node_; // NULL if this pointer is null
  size_type lowerOffset_; // 0 if this pointer is null
  size_type upperOffset_; // -1 if this pointer is null
 
  inline void debug_assert_not_null() const {
#ifdef TEUCHOS_REFCOUNTPTR_ASSERT_NONNULL
    assert_not_null ();
#endif
  }
 
  inline void
  debug_assert_in_range (size_type lowerOffset_in,
                         size_type size_in) const
  {
    (void) lowerOffset_in; (void) size_in;
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    assert_in_range (lowerOffset_in, size_in);
#endif
  }
 
  inline 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 (const T* p, size_type lowerOffset,
            size_type size, const RCPNodeHandle& node);
  const T* access_private_ptr() const;
  RCPNodeHandle& nonconst_access_private_node();
  const RCPNodeHandle& access_private_node() const;
#endif
};
 
 
template<>
class ArrayRCP<void> {
public:
  typedef Teuchos_Ordinal Ordinal;
  typedef Ordinal size_type;
  typedef Ordinal difference_type;
  typedef std::random_access_iterator_tag iterator_category;
  typedef  void* iterator_type;
  typedef  void value_type;
  // typedef T& reference;              // these are not valid
  // typedef const T& const_reference;  // these are not valid
  typedef void* pointer;
  typedef void* const_pointer;
  typedef void  element_type;
 
  inline ArrayRCP ();
};
 
template<>
class ArrayRCP<const void> {
public:
  typedef Teuchos_Ordinal Ordinal;
  typedef Ordinal size_type;
  typedef Ordinal difference_type;
  typedef std::random_access_iterator_tag iterator_category;
  typedef  const void* iterator_type;
  typedef  const void value_type;
  // typedef T& reference;              // these are not valid
  // typedef const T& const_reference;  // these are not valid
  typedef const void* pointer;
  typedef const void* const_pointer;
  typedef const void  element_type;
 
  inline 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>::size_type lowerOffset,
  typename ArrayRCP<T>::size_type size,
  bool owns_mem = true
  );
 
 
template<class T, class Dealloc_T>
ArrayRCP<T> arcp(
  T* p,
  typename ArrayRCP<T>::size_type lowerOffset,
  typename ArrayRCP<T>::size_type size,
  Dealloc_T dealloc, bool owns_mem
  );
 
 
template<class T>
ArrayRCP<T> arcp( typename ArrayRCP<T>::size_type size );
 
 
template<class T>
ArrayRCP<T> arcpCloneNode( const ArrayRCP<T> &a );
 
 
template<class T>
ArrayRCP<T> arcpClone( const ArrayView<const T> &v );
 
 
template<class T, class Embedded>
ArrayRCP<T>
arcpWithEmbeddedObjPreDestroy(
  T* p,
  typename ArrayRCP<T>::size_type lowerOffset,
  typename ArrayRCP<T>::size_type size,
  const Embedded &embedded,
  bool owns_mem = true
  );
 
 
template<class T, class Embedded>
ArrayRCP<T>
arcpWithEmbeddedObjPostDestroy(
  T* p,
  typename ArrayRCP<T>::size_type lowerOffset,
  typename ArrayRCP<T>::size_type size,
  const Embedded &embedded,
  bool owns_mem = true
  );
 
 
template<class T, class Embedded>
ArrayRCP<T>
arcpWithEmbeddedObj(
  T* p,
  typename ArrayRCP<T>::size_type lowerOffset,
  typename ArrayRCP<T>::size_type 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>
inline
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_reinterpret_cast_nonpod(const ArrayRCP<T1>& p1, const T2& val=T2());
 
 
template<class T2, class T1>
inline
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