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
|
/*=========================================================================
Program: GDCM (Grassroots DICOM). A DICOM library
Copyright (c) 2006-2011 Mathieu Malaterre
All rights reserved.
See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html 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 notice for more information.
=========================================================================*/
#ifndef GDCMSWAPPER_H
#define GDCMSWAPPER_H
#include "gdcmSwapCode.h"
namespace gdcm
{
#ifdef GDCM_WORDS_BIGENDIAN
class SwapperDoOp
{
public:
template <typename T> static T Swap(T val) {return val;}
template <typename T> static void SwapArray(T *, unsigned int ) {}
};
class SwapperNoOp
{
public:
template <typename T> static T Swap(T val);
template <typename T>
static void SwapArray(T *array, unsigned int n)
{
// TODO: need to unroll loop:
for(unsigned int i = 0; i < n; ++i)
{
array[i] = Swap<T>(array[i]);
}
}
};
#else
class SwapperNoOp
{
public:
template <typename T> static T Swap(T val) {return val;}
template <typename T> static void SwapArray(T *, size_t ) {}
};
class SwapperDoOp
{
public:
template <typename T> static T Swap(T val);
template <typename T>
static void SwapArray(T *array, size_t n)
{
// TODO: need to unroll loop:
for(size_t i = 0; i < n; ++i)
{
array[i] = Swap<T>(array[i]);
}
}
};
#endif
} // end namespace gdcm
#include "gdcmSwapper.txx"
#endif //GDCMSWAPPER_H
|
