Teuchos_ArrayViewDecl.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_VIEW_DECL_HPP
#define TEUCHOS_ARRAY_VIEW_DECL_HPP
 
 
#include "Teuchos_RCPNode.hpp"
#include "Teuchos_ENull.hpp"
#include "Teuchos_NullIteratorTraits.hpp"
#include "Teuchos_ConstTypeTraits.hpp"
#include <vector>
 
namespace Teuchos {
 
// Forward declaration; ArrayView uses ArrayRCP in debug mode.
template<class T> class ArrayRCP;
 
template<class T>
class ArrayView {
public:
 
 
  typedef Teuchos_Ordinal Ordinal;
 
  typedef Ordinal size_type;
 
  typedef Ordinal difference_type;
 
  typedef T value_type;
 
  typedef T* pointer;
 
  typedef const T* const_pointer;
 
  typedef T& reference;
 
  typedef const T& const_reference;
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  typedef ArrayRCP<T> iterator;
  typedef ArrayRCP<const T> const_iterator;
#else
  typedef pointer iterator;
  typedef const_pointer const_iterator;
#endif
 
 
 
  ArrayView( ENull null_arg = null );
 
  ArrayView (T* p, size_type size,
             const ERCPNodeLookup rcpNodeLookup = RCP_ENABLE_NODE_LOOKUP);
 
  ArrayView (const ArrayView<T>& array);
 
  ArrayView (std::vector<typename ConstTypeTraits<T>::NonConstType>& vec);
 
  ArrayView (const std::vector<typename ConstTypeTraits<T>::NonConstType>& vec);
 
  ArrayView<T>& operator= (const ArrayView<T>& array);
 
  ~ArrayView();
 
 
 
  bool is_null() const;
 
  size_type size() const;
 
  std::string toString() const;
 
 
 
  inline T* getRawPtr() const;
 
  inline T* data() const;
 
  T& operator[](size_type i) const;
 
  T& front() const;
 
  T& back() const;
 
 
 
  ArrayView<T> view( size_type offset, size_type size ) const;
 
  ArrayView<T> operator()( size_type offset, size_type size ) const;
 
  const ArrayView<T>& operator() () const;
 
  ArrayView<const T> getConst() const;
 
  operator ArrayView<const T>() const;
 
 
 
  void assign (const ArrayView<const T>& array) const;
 
 
 
  iterator begin() const;
 
  iterator end() const;
 
 
 
  const ArrayView<T>& assert_not_null() const;
 
  const ArrayView<T>& assert_in_range( size_type offset, size_type size ) const;
 
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
 
  // I should make these private but templated friends are not very portable.
  // Besides, if a client directly calls this it will not compile in an
  // optimized build.
 
  explicit ArrayView( const ArrayRCP<T> &arcp );
 
  explicit ArrayView( T* p, size_type size, const ArrayRCP<T> &arcp );
 
#endif
 
private:
  T *ptr_; //<! Pointer to the data
  size_type size_; //<! Number of entries in the view
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  ArrayRCP<T> arcp_;
#endif
 
  void setUpIterators(const ERCPNodeLookup rcpNodeLookup = RCP_ENABLE_NODE_LOOKUP);
 
  void debug_assert_not_null() const {
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    assert_not_null();
#endif
  }
 
  void debug_assert_in_range( size_type offset, size_type size_in ) const {
    (void)offset; (void)size_in;
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    assert_in_range(offset, size_in);
#endif
  }
 
  void debug_assert_valid_ptr() const {
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    arcp_.access_private_node().assert_valid_ptr(*this);
#endif
  }
 
public: // Bad bad bad
 
  // This is a very bad breach of encapsulation but it exists to avoid
  // problems with portability of tempalted friends
  T* access_private_ptr() const
    { return ptr_; }
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  ArrayRCP<T> access_private_arcp() const
    { return arcp_; }
#endif
 
};
 
 
template<class T>
class ArrayView<const T> {
public:
  typedef Teuchos_Ordinal Ordinal;
  typedef Ordinal size_type;
  typedef Ordinal difference_type;
  typedef const T value_type;
  typedef const T* pointer;
  typedef const T* const_pointer;
  typedef const T& reference;
  typedef const T& const_reference;
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  typedef ArrayRCP<const T> iterator;
  typedef ArrayRCP<const T> const_iterator;
#else
  typedef pointer iterator;
  typedef const_pointer const_iterator;
#endif
 
  ArrayView( ENull null_arg = null );
 
  ArrayView (const T* p, size_type size,
             const ERCPNodeLookup rcpNodeLookup = RCP_ENABLE_NODE_LOOKUP );
 
  ArrayView (const ArrayView<const T>& array);
 
  ArrayView (std::vector<typename ConstTypeTraits<T>::NonConstType>& vec);
 
  ArrayView (const std::vector<typename ConstTypeTraits<T>::NonConstType>& vec);
 
  ArrayView<const T>& operator= (const ArrayView<const T>& array);
 
  ~ArrayView();
 
  bool is_null() const;
 
  size_type size() const;
 
  std::string toString() const;
 
  inline const T* getRawPtr() const;
 
  inline const T* data() const;
 
  const T& operator[] (size_type i) const;
 
  const T& front() const;
 
  const T& back() const;
 
  ArrayView<const T> view( size_type offset, size_type size ) const;
 
  ArrayView<const T> operator()( size_type offset, size_type size ) const;
 
  const ArrayView<const T>& operator()() const;
 
  ArrayView<const T> getConst() const;
 
  iterator begin() const;
 
  iterator end() const;
 
  const ArrayView<const T>& assert_not_null() const;
 
  const ArrayView<const T>& assert_in_range( size_type offset, size_type size ) const;
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
 
  // I should make these private but templated friends are not very
  // portable.  Besides, if a client directly calls this it will not
  // compile in an optimized build.
 
  explicit ArrayView (const ArrayRCP<const T> &arcp );
 
  explicit ArrayView (const T* p, size_type size, const ArrayRCP<const T> &arcp );
 
#endif
 
private:
  const T* ptr_;
  size_type size_;
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  ArrayRCP<const T> arcp_;
#endif
 
  void setUpIterators(const ERCPNodeLookup rcpNodeLookup = RCP_ENABLE_NODE_LOOKUP);
 
  void debug_assert_not_null() const {
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    assert_not_null();
#endif
  }
 
  void debug_assert_in_range( size_type offset, size_type size_in ) const {
    (void)offset; (void)size_in;
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    assert_in_range(offset, size_in);
#endif
  }
 
  void debug_assert_valid_ptr() const {
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
    arcp_.access_private_node().assert_valid_ptr(*this);
#endif
  }
 
public: // Bad bad bad
 
  // This is a very bad breach of encapsulation but it exists to avoid
  // problems with portability of templated friends
  const T* access_private_ptr() const { return ptr_; }
 
#ifdef HAVE_TEUCHOS_ARRAY_BOUNDSCHECK
  ArrayRCP<const T> access_private_arcp() const { return arcp_; }
#endif
};
 
 
 
template<class T>
ArrayView<T> arrayView( T* p, typename ArrayView<T>::size_type size );
 
 
template<class T>
ArrayView<T> arrayViewFromVector( std::vector<T>& vec );
 
 
template<class T>
ArrayView<const T> arrayViewFromVector( const std::vector<T>& vec );
 
 
#ifndef __sun
 
 
// 2007/11/30: From some reason, the Sun C++ compile on sass9000 compains that
// a call to this function below is ambiguous.  However, if you just comment
// the function out, then the code on g++ (3.4.6 at least) will not compile.
// Therefore, I have no choice but to put in a hacked ifdef for the sun.
 
 
template<class T>
std::vector<T> createVector( const ArrayView<T> &av );
 
 
#endif // __sun
 
 
template<class T>
std::vector<T> createVector( const ArrayView<const T> &av );
 
 
template<class T>
bool is_null( const ArrayView<T> &av );
 
 
template<class T>
bool nonnull( const ArrayView<T> &av );
 
 
template<class T>
std::ostream& operator<<( std::ostream& out, const ArrayView<T>& av );
 
 
template<class T2, class T1>
ArrayView<T2> av_const_cast(const ArrayView<T1>& p1);
 
 
template<class T2, class T1>
ArrayView<T2> av_reinterpret_cast(const ArrayView<T1>& p1);
 
 
} // end namespace Teuchos
 
 
//
// Inline members
//
 
 
// ToDo: Fill in!
 
 
#endif  // TEUCHOS_ARRAY_VIEW_DECL_HPP