DomainAdjacency.ih

#include <cstdlib>

// IMPLEMENTATION of inline methods.
#include "DGtal/topology/MetricAdjacency.h"
// ----------------------- Standard services ------------------------------

template <typename TDomain, typename TAdjacency>
inline
DGtal::DomainAdjacency<TDomain,TAdjacency>
::~DomainAdjacency()
{}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
DGtal::DomainAdjacency<TDomain,TAdjacency>
::DomainAdjacency( const Domain & aDomain, 
       const Adjacency & adjacency )
  : myPred( aDomain ), myAdjacency( adjacency )
{
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
DGtal::DomainAdjacency<TDomain,TAdjacency>
::DomainAdjacency( const DomainAdjacency & other )
  : myPred( other.myPred ), myAdjacency( other.myAdjacency )
{
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
const TDomain &
DGtal::DomainAdjacency<TDomain,TAdjacency>
::domain() const
{
  return myPred.domain();
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
const typename DGtal::DomainAdjacency<TDomain,TAdjacency>::Predicate &
DGtal::DomainAdjacency<TDomain,TAdjacency>
::predicate() const
{
  return myPred;
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
bool
DGtal::DomainAdjacency<TDomain,TAdjacency>
::isAdjacentTo( const Point & p1, const Point & p2 ) const
{
  ASSERT( myPred( p1 ) );
  ASSERT( myPred( p2 ) );
  return isAdjacentTo( p1, p2 );
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
bool
DGtal::DomainAdjacency<TDomain,TAdjacency>
::isProperlyAdjacentTo( const Point & p1, const Point & p2 ) const
{
  ASSERT( myPred( p1 ) );
  ASSERT( myPred( p2 ) );
  return isProperlyAdjacentTo( p1, p2 );
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
void
DGtal::DomainAdjacency<TDomain,TAdjacency>
::selfDisplay ( std::ostream & out ) const
{
  out << "[DomainAdjacency]";
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
bool
DGtal::DomainAdjacency<TDomain,TAdjacency>
::isValid() const
{
    return true;
}
//------------------------------------------------------------------------------
template <typename TDomain, typename TAdjacency>
inline
std::ostream&
DGtal::operator<< ( std::ostream & out, 
      const DomainAdjacency<TDomain,TAdjacency> & object )
{
  object.selfDisplay( out );
  return out;
}

// ----------------------- Local graph services -----------------------------

template <typename TDomain, typename TAdjacency>
inline
typename DGtal::DomainAdjacency<TDomain, TAdjacency>::Size 
DGtal::DomainAdjacency<TDomain, TAdjacency>::bestCapacity() const
{
  return myAdjacency.bestCapacity();
}

template <typename TDomain, typename TAdjacency>
inline
typename DGtal::DomainAdjacency<TDomain, TAdjacency>::Size 
DGtal::DomainAdjacency<TDomain, TAdjacency>::degree
( const Vertex & v ) const
{
  return myAdjacency.degree( v );
}

template <typename TDomain, typename TAdjacency>
template <typename OutputIterator>
inline
void  
DGtal::DomainAdjacency<TDomain, TAdjacency>::writeNeighbors
( OutputIterator &it, const Vertex & v ) const
{
  //myAdjacency.writeProperNeighborhood( v, it, myPred );//writeNeighbors<OutputIterator>( v, it );
  myAdjacency.writeNeighbors( it, v );
}

template <typename TDomain, typename TAdjacency>
template <typename OutputIterator, typename VertexPredicate>
void
DGtal::DomainAdjacency<TDomain, TAdjacency>::writeNeighbors
( OutputIterator &it, const Vertex & v, const VertexPredicate & pred) const
{
  vector<Vertex> vect;
  back_insert_iterator< vector<Vertex> > out_it(vect);
  //myAdjacency.writeProperNeighborhood( vect, out_it, myPred );
  myAdjacency.writeNeighbors( out_it, v, myPred );
  for( typename vector<Vertex>::const_iterator cit = vect.begin(); cit != vect.end(); cit ++ )
  {
    if( pred(*cit) )
    {
      *it++ = *cit;
    }
  }
  //myAdjacency.writeNeighbors<OutputIterator, VertexPredicate>( v, it, pred );
}

//                                                                           //