/usr/include/ITK-4.9/itkArray.h is in libinsighttoolkit4-dev 4.9.0-4ubuntu1.
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 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 itkArray_h
#define itkArray_h
#include "itkMacro.h"
#include "vxl_version.h"
#if VXL_VERSION_DATE_FULL < 20110428
#error "System installed VXL version is too old. Please make sure the version date is later than 2011-04-28."
#endif
#include "vnl/vnl_vector.h"
namespace itk
{
/** \class Array
* \brief Array class with size defined at construction time.
*
* This class derives from the vnl_vector<> class.
* Its size is assigned at construction time (run time) and can
* not be changed afterwards except by using assignment to another
* Array.
*
* The class is templated over the type of the elements.
*
* Template parameters for class Array:
*
* - TValue = Element type stored at each location in the array.
*
* \ingroup DataRepresentation
* \ingroup ITKCommon
*/
template< typename TValue >
class Array : public vnl_vector< TValue >
{
public:
/** The element type stored at each location in the Array. */
typedef TValue ValueType;
typedef Array Self;
typedef vnl_vector< TValue > VnlVectorType;
typedef typename vnl_vector< TValue>::size_type SizeValueType;
public:
/** Default constructor. It is created with an empty array
* it has to be allocated later by assignment */
Array();
/** Copy constructor. Uses VNL copy construtor with correct
* setting for memory management. */
Array(const Array&);
/** Constructor with size. Size can only be changed by assignment */
explicit Array(SizeValueType dimension);
/** Constructor that initializes array with contents from a user supplied
* buffer. The pointer to the buffer and the length is specified. By default,
* the array does not manage the memory of the buffer. It merely points to
* that location and it is the user's responsibility to delete it.
* If "LetArrayManageMemory" is true, then this class will free the
* memory when this object is destroyed. */
Array(ValueType *data, SizeValueType sz, bool LetArrayManageMemory = false);
#if defined ( ITK_FUTURE_LEGACY_REMOVE )
/** Constructor that initializes array with contents from a user supplied
* const buffer. The pointer to the buffer and the length is specified. By default,
* the array does a deep copy of the const pointer data, so the array class also
* manages memory. */
Array(const ValueType *datain, SizeValueType sz);
#else // defined ( ITK_FUTURE_LEGACY_REMOVE )
/** Constructor that initializes array with contents from a user supplied
* buffer. The pointer to the buffer and the length is specified. By default,
* the array does not manage the memory of the buffer. It merely points to
* that location and it is the user's responsibility to delete it.
* If "LetArrayManageMemory" is true, then this class will free the
* memory when this object is destroyed. */
Array(const ValueType *data, SizeValueType sz,
bool LetArrayManageMemory = false);
#endif
/** Constructor to initialize an array from another of any data type */
template< typename TArrayValue >
Array(const Array< TArrayValue > & r)
{
this->m_LetArrayManageMemory = true;
this->SetSize( r.GetSize() );
for( SizeValueType i=0; i<r.GetSize(); i++ )
{
this->operator[](i) = static_cast< TValue >( r[i] );
}
}
/** Set the all the elements of the array to the specified value */
void Fill(TValue const & v)
{
this->fill(v);
}
/** Copy opertor */
const Self & operator=(const Self & rhs);
const Self & operator=(const VnlVectorType & rhs);
/** Return the number of elements in the Array */
SizeValueType Size(void) const
{ return static_cast<SizeValueType >( this->size() ); }
unsigned int GetNumberOfElements(void) const
{ return static_cast<SizeValueType >( this->size() ); }
/** Get one element */
const TValue & GetElement(SizeValueType i) const
{ return this->operator[](i); }
/** Set one element */
void SetElement(SizeValueType i, const TValue & value)
{ this->operator[](i) = value; }
/** Destructively set the size to that given. Will lose data. */
void SetSize(SizeValueType sz);
SizeValueType GetSize(void) const
{ return static_cast< SizeValueType >( this->size() ); }
/** Set the pointer from which the data is imported.
* If "LetArrayManageMemory" is false, then the application retains
* the responsibility of freeing the memory for this data. If
* "LetArrayManageMemory" is true, then this class will free the
* memory when this object is destroyed. */
void SetData(TValue *data, bool LetArrayManageMemory = false);
/** Similar to the previous method. In the above method, the size must be
* separately set prior to using user-supplied data. This introduces an
* unnecessary allocation step to be performed. This method avoids it
* and should be used to import data wherever possible to avoid this.
* Set the pointer from which the data is imported.
* If "LetArrayManageMemory" is false, then the application retains
* the responsibility of freeing the memory for this data. If
* "LetArrayManageMemory" is true, then this class will free the
* memory when this object is destroyed. */
void SetData(TValue *data, SizeValueType sz,
bool LetArrayManageMemory = false);
#ifdef __INTEL_COMPILER
#pragma warning disable 444 //destructor for base class "itk::Array<>" is not virtual
#endif
/** This destructor is not virtual for performance reasons. However, this
* means that subclasses cannot allocate memory. */
~Array();
#if ! defined ( ITK_FUTURE_LEGACY_REMOVE )
void swap(Array &other)
{
this->Swap(other);
}
#endif
void Swap(Array &other)
{
using std::swap;
this->VnlVectorType::swap(other);
swap(this->m_LetArrayManageMemory, other.m_LetArrayManageMemory);
}
private:
bool m_LetArrayManageMemory;
};
template< typename TValue >
std::ostream & operator<<(std::ostream & os, const Array< TValue > & arr)
{
os << "[";
const unsigned int length = arr.size();
if ( length >= 1 )
{
const unsigned int last = length - 1;
for ( unsigned int i = 0; i < last; ++i )
{
os << arr[i] << ", ";
}
os << arr[last];
}
os << "]";
return os;
}
// declaration of specialization
template<> ITKCommon_EXPORT std::ostream & operator<< <double> (std::ostream & os, const Array< double > & arr);
template<> ITKCommon_EXPORT std::ostream & operator<< <float> (std::ostream & os, const Array< float > & arr);
template<typename T>
inline void swap( Array<T> &a, Array<T> &b )
{
a.Swap(b);
}
} // namespace itk
#ifndef ITK_MANUAL_INSTANTIATION
#include "itkArray.hxx"
#endif
#endif
|