/usr/include/InsightToolkit/Common/itkVariableLengthVector.txx is in libinsighttoolkit3-dev 3.20.1-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 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 | /*=========================================================================
Program: Insight Segmentation & Registration Toolkit
Module: itkVariableLengthVector.txx
Language: C++
Date: $Date$
Version: $Revision$
Copyright (c) Insight Software Consortium. All rights reserved.
See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm for details.
This software is distributed WITHOUT ANY WARRANTY; without even
the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
PURPOSE. See the above copyright notices for more information.
=========================================================================*/
#ifndef __itkVariableLengthVector_txx
#define __itkVariableLengthVector_txx
#include "itkVariableLengthVector.h"
#include "itkNumericTraitsVariableLengthVectorPixel.h"
#include "vnl/vnl_math.h"
#include <cstring>
#include <stdlib.h>
#include <string.h>
namespace itk
{
/** Default constructor */
template < typename TValueType >
VariableLengthVector<TValueType >
::VariableLengthVector() : m_LetArrayManageMemory( true ),
m_Data( 0 ),
m_NumElements( 0 )
{}
/** Constructor with size */
template < typename TValueType >
VariableLengthVector<TValueType >
::VariableLengthVector(unsigned int length) :
m_LetArrayManageMemory( true ),
m_Data( 0 )
{
Reserve( length );
}
/** Constructor with user specified data */
template < typename TValueType >
VariableLengthVector<TValueType >
::VariableLengthVector( ValueType *datain, unsigned int sz, bool LetArrayManageMemory) :
m_LetArrayManageMemory( LetArrayManageMemory ),
m_Data( datain ),
m_NumElements( sz )
{}
/** Constructor with user specified data */
template < typename TValueType >
VariableLengthVector<TValueType >
::VariableLengthVector( const ValueType *datain, unsigned int sz, bool LetArrayManageMemory)
: m_LetArrayManageMemory( LetArrayManageMemory )
{
m_Data = const_cast< ValueType * >(datain);
m_NumElements = sz;
}
/** Copy constructer.. Override the default non-templated copy constructor
* that the compiler provides */
template < typename TValueType >
VariableLengthVector<TValueType >
::VariableLengthVector(const VariableLengthVector< TValueType > & v)
{
m_NumElements = v.Size();
m_Data = this->AllocateElements(m_NumElements);
m_LetArrayManageMemory = true;
for( ElementIdentifier i=0; i< v.Size(); i++ )
{
this->m_Data[i] = v[i];
}
}
/** Destructor */
template < typename TValueType >
VariableLengthVector<TValueType >
::~VariableLengthVector()
{
// if data exists and we are responsible for its memory, get rid of it..
if(m_LetArrayManageMemory && m_Data)
{
delete [] m_Data;
}
}
/** Reserve memory of certain size for m_Data */
template < typename TValueType >
void VariableLengthVector<TValueType >
::Reserve( ElementIdentifier size )
{
if( m_Data )
{
if( size> m_NumElements )
{
TValueType *temp = this->AllocateElements( size );
// only copy the portion of the data used in the old buffer
memcpy(temp, m_Data, m_NumElements*sizeof(TValueType));
if (m_Data && m_LetArrayManageMemory)
{
delete[] m_Data;
}
m_Data = temp;
m_LetArrayManageMemory = true;
m_NumElements = size;
}
}
else
{
m_Data = this->AllocateElements(size);
m_NumElements = size;
m_LetArrayManageMemory = true;
}
}
/** Allocate memory of certain size and return it */
template < typename TValueType >
TValueType * VariableLengthVector< TValueType >
::AllocateElements( ElementIdentifier size ) const
{
TValueType *data;
try
{
data = new TValueType[ size ];
}
catch(...)
{
data = 0;
}
if( !data )
{
itkGenericExceptionMacro( << "Failed to allocate memory of length " << size
<< " for VariableLengthVector.");
}
return data;
}
/** 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. Note that you need to explicitly
* set the number of elements. */
template < typename TValueType >
void
VariableLengthVector<TValueType >
::SetData(TValueType* datain,bool LetArrayManageMemory)
{
// Free any existing data if we manage its memory
if(m_LetArrayManageMemory && m_Data)
{
delete [] m_Data;
}
m_LetArrayManageMemory = LetArrayManageMemory;
m_Data = datain;
}
/** Similar to the previous method. In the above method, the size must be
* seperately 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 whereever 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. */
template < typename TValueType >
void
VariableLengthVector<TValueType >
::SetData(TValueType* datain, unsigned int sz, bool LetArrayManageMemory)
{
// Free any existing data if we manage its memory
if(m_LetArrayManageMemory && m_Data)
{
delete [] m_Data;
}
m_LetArrayManageMemory = LetArrayManageMemory;
m_Data = datain;
m_NumElements = sz;
}
template < typename TValueType >
void VariableLengthVector<TValueType >
::SetSize(unsigned int sz, bool destroyExistingData)
{
if( destroyExistingData )
{
// Free any existing data if we manage its memory and if we need to destroy
if(!m_LetArrayManageMemory)
{
m_Data=0;
m_NumElements = 0;
}
else if( m_Data )
{
if( (m_NumElements != sz))
{
if(m_NumElements>0)
{
delete [] m_Data;
m_Data = 0;
}
}
else return;
}
}
if ( m_NumElements != sz )
{
Reserve( sz );
}
}
/** Set the all the elements of the array to the specified value */
template < typename TValueType >
void VariableLengthVector<TValueType >
::Fill (TValueType const& v)
{
for( ElementIdentifier i=0; i< m_NumElements; i++ )
{
this->m_Data[i] = v;
}
}
/** Assignment operator */
template < typename TValueType > const VariableLengthVector< TValueType >&
VariableLengthVector<TValueType >
::operator=(const Self & v)
{
if( this == &v )
{
return *this;
}
this->SetSize( v.Size());
for( ElementIdentifier i=0; i< v.Size(); i++ )
{
this->m_Data[i] = v[i];
}
return *this;
}
template < typename TValueType > VariableLengthVector< TValueType >&
VariableLengthVector<TValueType >
::operator- ()
{
for( ElementIdentifier i=0; i< m_NumElements; i++ )
{
m_Data[i] = -m_Data[i];
}
return *this;
}
template < typename TValueType > bool
VariableLengthVector<TValueType >
::operator==( const Self & v) const
{
if( m_NumElements != v.Size() )
{
return false;
}
for( ElementIdentifier i=0; i< m_NumElements; i++ )
{
if( m_Data[i] != v[i] )
{
return false;
}
}
return true;
}
template < typename TValueType > bool
VariableLengthVector<TValueType >
::operator!=( const Self & v) const
{
if( m_NumElements != v.Size() )
{
return true;
}
for( ElementIdentifier i=0; i< m_NumElements; i++ )
{
if( m_Data[i] != v[i] )
{
return true;
}
}
return false;
}
/**
* Returns vector's Euclidean Norm
*/
template < typename TValueType >
typename VariableLengthVector< TValueType >::RealValueType
VariableLengthVector<TValueType >
::GetNorm( void ) const
{
return (RealValueType)( vcl_sqrt(double(this->GetSquaredNorm()) ));
}
/**
* Returns vector's Squared Euclidean Norm
*/
template < typename TValueType >
typename VariableLengthVector< TValueType >::RealValueType
VariableLengthVector<TValueType >
::GetSquaredNorm( void ) const
{
RealValueType sum = 0.0;
for( unsigned int i=0; i< this->m_NumElements; i++)
{
const RealValueType value = (*this)[i];
sum += value * value;
}
return sum;
}
} // namespace itk
#endif
|