/usr/include/vigra/multi_fwd.hxx is in libvigraimpex-dev 1.10.0+git20160211.167be93+dfsg-2+b5.
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 222 223 | /************************************************************************/
/* */
/* Copyright 2011-2014 by Ullrich Koethe */
/* */
/* This file is part of the VIGRA computer vision library. */
/* The VIGRA Website is */
/* http://hci.iwr.uni-heidelberg.de/vigra/ */
/* Please direct questions, bug reports, and contributions to */
/* ullrich.koethe@iwr.uni-heidelberg.de or */
/* vigra@informatik.uni-hamburg.de */
/* */
/* Permission is hereby granted, free of charge, to any person */
/* obtaining a copy of this software and associated documentation */
/* files (the "Software"), to deal in the Software without */
/* restriction, including without limitation the rights to use, */
/* copy, modify, merge, publish, distribute, sublicense, and/or */
/* sell copies of the Software, and to permit persons to whom the */
/* Software is furnished to do so, subject to the following */
/* conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the */
/* Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES */
/* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND */
/* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT */
/* HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, */
/* WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING */
/* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR */
/* OTHER DEALINGS IN THE SOFTWARE. */
/* */
/************************************************************************/
#ifndef VIGRA_MULTI_FWD_HXX
#define VIGRA_MULTI_FWD_HXX
#include <memory>
#include "metaprogramming.hxx"
#include "tinyvector.hxx"
namespace vigra {
/** \addtogroup MultiIteratorGroup Multi-dimensional Shapes and Array Iterators
\brief Shape objects and general iterators for arrays of arbitrary dimension.
*/
//@{
/********************************************************/
/* */
/* shape */
/* */
/********************************************************/
/** Index type for a single dimension of a MultiArrayView or
MultiArray.
*/
typedef std::ptrdiff_t MultiArrayIndex;
template <unsigned int N>
class MultiArrayShape;
/********************************************************/
/* */
/* memory layout */
/* */
/********************************************************/
// the resulting MultiArray has no explicit channel axis
// (i.e. the number of channels is implicitly one)
template <class T>
struct Singleband;
// the last axis is explicitly designated as channel axis
template <class T>
struct Multiband;
// the array is organised in chunks
template <class T>
struct ChunkedMemory;
// helper classes to map memory layout to actual type
namespace detail {
template <class T>
struct ResolveMultiband;
template <class T>
struct ResolveChunkedMemory;
} // namespace detail
/********************************************************/
/* */
/* constructor tag */
/* */
/********************************************************/
/** \brief Initialize a MultiArray in a standard way.
*/
enum MultiArrayInitializationTag {
LinearSequence ///< Initialize array by a linear sequence in scan order
};
/********************************************************/
/* */
/* element handles */
/* */
/********************************************************/
template <class T, class NEXT>
class CoupledHandle;
template <unsigned int N, class T>
class SharedChunkHandle;
/********************************************************/
/* */
/* array types */
/* */
/********************************************************/
template <unsigned int N, class T, class C = StridedArrayTag>
class MultiArrayView;
template <unsigned int N, class T,
class A = std::allocator<typename detail::ResolveMultiband<T>::type> >
class MultiArray;
template <unsigned int N, class T>
class ChunkedArrayBase;
template <unsigned int N, class T>
class ChunkedArray;
/********************************************************/
/* */
/* iterators / traversers */
/* */
/********************************************************/
// DEPRECATED!
// hierarchical iterator whose innermost dimension is unstrided
template <unsigned int N, class T, class REFERENCE = T &, class POINTER = T *>
class MultiIterator;
// DEPRECATED!
// hierarchical iterator whose innermost dimension may be strided
template <unsigned int N, class T, class REFERENCE = T &, class POINTER = T *>
class StridedMultiIterator;
// multi-dimensional scan-order iteration returning the coordinate of the current element
template<unsigned int N>
class MultiCoordinateIterator;
// scan-order iteration returning the current element of a multi-dimensional array
template <unsigned int N, class V, class REFERENCE, class POINTER>
class StridedScanOrderIterator;
// simultaneous scan-order iteration over several multi-dimensional arrays
template <unsigned int N,
class HANDLES=CoupledHandle<TinyVector<MultiArrayIndex, N>, void>,
int DIMENSION = N-1>
class CoupledScanOrderIterator;
// scan-order iteration over the chunks of a chunked array
// returns a MultiArrayView for the current chunk
template<unsigned int N, class T>
class ChunkIterator;
/********************************************************/
/* */
/* neighborhood types */
/* */
/********************************************************/
/** \brief Choose the neighborhood system in a dimension-independent way.
DirectNeighborhood corresponds to 4-neighborhood in 2D and 6-neighborhood in 3D, whereas
IndirectNeighborhood means 8-neighborhood in 2D and 26-neighborhood in 3D. The general
formula for N dimensions are 2*N for direct neighborhood and 3^N-1 for indirect neighborhood.
*/
enum NeighborhoodType {
DirectNeighborhood=0, ///< use only direct neighbors
IndirectNeighborhood=1 ///< use direct and indirect neighbors
};
/********************************************************/
/* */
/* grid graph */
/* */
/********************************************************/
template<unsigned int N, bool BackEdgesOnly=false>
class GridGraphNeighborIterator;
template<unsigned int N, bool BackEdgesOnly=false>
class GridGraphEdgeIterator;
template<unsigned int N, bool BackEdgesOnly=false>
class GridGraphOutEdgeIterator;
template<unsigned int N, bool BackEdgesOnly=false>
class GridGraphArcIterator;
template<unsigned int N, bool BackEdgesOnly=false>
class GridGraphOutArcIterator;
template<unsigned int N, bool BackEdgesOnly=false>
class GridGraphInArcIterator;
template<unsigned int N, class DirectedTag>
class GridGraph;
//@}
} // namespace vigra
#endif // VIGRA_MULTI_FWD_HXX
|