2 * This program is free software: you can redistribute it and/or modify
3 * it under the terms of the GNU Lesser General Public License as
4 * published by the Free Software Foundation, either version 3 of the
5 * License, or (at your option) any later version.
7 * This program is distributed in the hope that it will be useful,
8 * but WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10 * GNU General Public License for more details.
12 * You should have received a copy of the GNU General Public License
13 * along with this program. If not, see <http://www.gnu.org/licenses/>.
18 * @file GraphVisitorRange.ih
19 * @author Jacques-Olivier Lachaud (\c jacques-olivier.lachaud@univ-savoie.fr )
20 * Laboratory of Mathematics (CNRS, UMR 5127), University of Savoie, France
24 * Implementation of inline methods defined in GraphVisitorRange.h
26 * This file is part of the DGtal library.
30//////////////////////////////////////////////////////////////////////////////
32//////////////////////////////////////////////////////////////////////////////
34///////////////////////////////////////////////////////////////////////////////
35// IMPLEMENTATION of inline methods.
36///////////////////////////////////////////////////////////////////////////////
38///////////////////////////////////////////////////////////////////////////////
39// ----------------------- Standard services ------------------------------
41//-----------------------------------------------------------------------------
42template <typename TGraphVisitor>
44DGtal::GraphVisitorRange<TGraphVisitor>::
48//-----------------------------------------------------------------------------
49template <typename TGraphVisitor>
51DGtal::GraphVisitorRange<TGraphVisitor>::
52GraphVisitorRange( GraphVisitor* visitorPtr )
53 : myVisitor( visitorPtr )
55 ASSERT( visitorPtr != 0 );
57//-----------------------------------------------------------------------------
58template <typename TGraphVisitor>
60typename DGtal::GraphVisitorRange<TGraphVisitor>::ConstIterator
61DGtal::GraphVisitorRange<TGraphVisitor>::
64 ASSERT( myVisitor.unique() );
65 return ConstIterator( myVisitor );
67//-----------------------------------------------------------------------------
68template <typename TGraphVisitor>
70typename DGtal::GraphVisitorRange<TGraphVisitor>::ConstIterator
71DGtal::GraphVisitorRange<TGraphVisitor>::
74 return ConstIterator();
76//-----------------------------------------------------------------------------
77template <typename TGraphVisitor>
79typename DGtal::GraphVisitorRange<TGraphVisitor>::NodeConstIterator
80DGtal::GraphVisitorRange<TGraphVisitor>::
83 ASSERT( myVisitor.unique() );
84 return NodeConstIterator( myVisitor );
86//-----------------------------------------------------------------------------
87template <typename TGraphVisitor>
89typename DGtal::GraphVisitorRange<TGraphVisitor>::NodeConstIterator
90DGtal::GraphVisitorRange<TGraphVisitor>::
93 return NodeConstIterator();
96///////////////////////////////////////////////////////////////////////////////
97// Interface - public :
100 * Writes/Displays the object on an output stream.
101 * @param out the output stream where the object is written.
103template <typename TGraphVisitor>
106DGtal::GraphVisitorRange<TGraphVisitor>::selfDisplay ( std::ostream & out ) const
108 out << "[GraphVisitorRange in_traversal="
109 << ( myVisitor.unique() ? "no" : "yes" ) << " ]";
113 * Checks the validity/consistency of the object.
114 * @return 'true' if the object is valid, 'false' otherwise.
116template <typename TGraphVisitor>
119DGtal::GraphVisitorRange<TGraphVisitor>::isValid() const
126///////////////////////////////////////////////////////////////////////////////
127// Implementation of inline functions //
129template <typename TGraphVisitor>
132DGtal::operator<< ( std::ostream & out,
133 const GraphVisitorRange<TGraphVisitor> & object )
135 object.selfDisplay( out );
140///////////////////////////////////////////////////////////////////////////////