itkTreeIteratorClone.h

Go to the documentation of this file.

/*=========================================================================
 *
 *  Copyright Insight Software Consortium
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *         http://www.apache.org/licenses/LICENSE-2.0.txt
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 *
 *=========================================================================*/
#ifndef itkTreeIteratorClone_h
#define itkTreeIteratorClone_h

#include "itkMacro.h"
#include <iostream>

namespace itk
{
template< typename TObjectType >
class TreeIteratorClone
{
public:

  typedef TreeIteratorClone< TObjectType > Self;
  typedef TObjectType                      ObjectType;

  TreeIteratorClone () { m_Pointer = 0; }

  TreeIteratorClone (const TreeIteratorClone< ObjectType > & p)
  {
    m_Pointer = ITK_NULLPTR;
    if ( p.m_Pointer != ITK_NULLPTR )
      {
      m_Pointer = p.m_Pointer->Clone();
      }
  }

  TreeIteratorClone (ObjectType *p)
  {
    m_Pointer = 0;
    if ( p != ITK_NULLPTR )
      {
      m_Pointer = p->Clone();
      }
  }

  TreeIteratorClone (const ObjectType & p)
  {
    m_Pointer = ITK_NULLPTR;
    m_Pointer = const_cast< ObjectType * >( &p )->Clone();
  }

  ~TreeIteratorClone ()
  {
    delete m_Pointer;
    m_Pointer = ITK_NULLPTR;
  }

  ObjectType * operator->() const { return m_Pointer; }

  bool IsNotNull() const { return m_Pointer != 0; }
  bool IsNull() const { return m_Pointer == 0; }

  template< typename TR >
  bool operator==(TR r) const { return ( m_Pointer == (ObjectType *)( r ) ); }

  template< typename TR >
  bool operator!=(TR r) const { return ( m_Pointer != (ObjectType *)( r ) ); }

  ObjectType * GetPointer() const { return m_Pointer; }

  bool operator<(const TreeIteratorClone & r) const { return (void *)m_Pointer < (void *)r.m_Pointer;  }

  bool operator>(const TreeIteratorClone & r) const { return (void *)m_Pointer > (void *)r.m_Pointer; }

  bool operator<=(const TreeIteratorClone & r) const { return (void *)m_Pointer <= (void *)r.m_Pointer; }

  bool operator>=(const TreeIteratorClone & r) const { return (void *)m_Pointer >= (void *)r.m_Pointer; }

  TreeIteratorClone & operator=(const TreeIteratorClone & r) { return this->operator=( r.GetPointer() ); }

  TreeIteratorClone & operator=(const ObjectType *r)
  {
    if ( m_Pointer != r )
      {
      delete m_Pointer;
      m_Pointer = ITK_NULLPTR;
      if ( r != ITK_NULLPTR )
        {
        m_Pointer = const_cast< ObjectType * >( r )->Clone();
        }
      }
    return *this;
  }

  Self &
  operator++()
  {
    if ( m_Pointer )
      {
      ++( *m_Pointer );
      }
    return *this;
  }

  const Self
  operator++(int)
  {
    if ( m_Pointer )
      {
      const Self oldValue(m_Pointer);   // create a copy of the iterator behind
                                        // the pointer (Clone())
      ++( *m_Pointer );
      return oldValue;
      }
  }

  ObjectType * Print(std::ostream & os) const
  {
    // This prints the object pointed to by the pointer
    ( *m_Pointer ).Print(os);
    return m_Pointer;
  }

private:
  ObjectType *m_Pointer;
};

template< typename T >
std::ostream & operator<<(std::ostream & os, TreeIteratorClone< T > p)
{
  p.Print(os);
  return os;
}
} // end namespace itk

#endif