/usr/include/OTB-6.4/otbRCC8EdgeIterator.txx is in libotb-dev 6.4.0+dfsg-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 | /*
* Copyright (C) 2005-2017 Centre National d'Etudes Spatiales (CNES)
*
* This file is part of Orfeo Toolbox
*
* https://www.orfeo-toolbox.org/
*
* 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
*
* 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 otbRCC8EdgeIterator_txx
#define otbRCC8EdgeIterator_txx
#include "otbRCC8EdgeIterator.h"
namespace otb
{
/** Constructor */
template <class TGraph>
RCC8EdgeIterator<TGraph>
::RCC8EdgeIterator()
{
m_Graph = GraphType::New();
boost::tuples::tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
}
/**
* Copy operator.
*/
template <class TGraph>
RCC8EdgeIterator<TGraph>
::RCC8EdgeIterator(const Self& iter)
{
m_Iter = iter.m_Iter;
m_Graph = iter.m_Graph;
m_End = iter.m_End;
}
/**
*Constructor with input graph
*/
template <class TGraph>
RCC8EdgeIterator<TGraph>
::RCC8EdgeIterator(TGraph * graph)
{
m_Graph = graph;
boost::tuples::tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
}
/**
* Get the current edge value.
* \return The value of the current edge pointed by the iterator.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::RCC8ValueType
RCC8EdgeIterator<TGraph>
::GetValue(void)
{
return (*m_Graph->GetGraph())[*m_Iter]->GetValue();
}
/**
* Return the source vertex of the current edge.
* \return The source edge.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::VertexPointerType
RCC8EdgeIterator<TGraph>
::GetSourceVertex(void)
{
return (*m_Graph->GetGraph())[source(*m_Iter, (*m_Graph->GetGraph()))];
}
/**
* Return the target vertex of the current edge.
* \return The target vertex.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::VertexPointerType
RCC8EdgeIterator<TGraph>
::GetTargetVertex(void)
{
return (*m_Graph->GetGraph())[target(*m_Iter, (*m_Graph->GetGraph()))];
}
/**
* Return the source vertex index of the current edge.
* \return The source vertex index.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::VertexDescriptorType
RCC8EdgeIterator<TGraph>
::GetSourceIndex(void)
{
IndexMapType index = get(boost::vertex_index, (*m_Graph->GetGraph()));
return index[source(*m_Iter, (*m_Graph->GetGraph()))];
}
/**
* Return the target vertex index of the current edge.
* \return The target vertex index.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::VertexDescriptorType
RCC8EdgeIterator<TGraph>
::GetTargetIndex(void)
{
IndexMapType index = get(boost::vertex_index, (*m_Graph->GetGraph()));
return index[target(*m_Iter, (*m_Graph->GetGraph()))];
}
/**
* Return true if the iterator is at the end.
* \return True if the iterator is at the end.
*/
template <class TGraph>
bool
RCC8EdgeIterator<TGraph>
::IsAtEnd(void)
{
return (m_Iter == m_End);
}
/**
* Go to the beginning.
*/
template <class TGraph>
void
RCC8EdgeIterator<TGraph>
::GoToBegin(void)
{
boost::tuples::tie(m_Iter, m_End) = edges(*m_Graph->GetGraph());
}
/**
* Increment.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::Self&
RCC8EdgeIterator<TGraph>
::operator++ ()
{
++m_Iter;
return *this;
}
/**
* Decrement.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::Self&
RCC8EdgeIterator<TGraph>
::operator-- ()
{
--m_Iter;
return *this;
}
/**
* Add
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::Self&
RCC8EdgeIterator<TGraph>
::operator + (int i)
{
m_Iter = m_Iter + i;
return *this;
}
/**
* Remove
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::Self&
RCC8EdgeIterator<TGraph>
::operator - (int i)
{
m_Iter = m_Iter - i;
return *this;
}
/**
* Difference comparison operator.
*/
template <class TGraph>
bool
RCC8EdgeIterator<TGraph>
::operator != (const Self &iter)
{
return (m_Iter != iter.m_Iter);
}
/**
* Equality comparison operator.
*/
template <class TGraph>
bool
RCC8EdgeIterator<TGraph>
::operator == (const Self &iter)
{
return (m_Iter == iter.m_Iter);
}
/**
* Instantiation operator.
*/
template <class TGraph>
typename RCC8EdgeIterator<TGraph>
::Self&
RCC8EdgeIterator<TGraph>
::operator = (const Self &iter)
{
m_Iter = iter.m_Iter;
return *this;
}
} // End namespace otb
#endif
|