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
|
/*=========================================================================
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 GDCMTABLE_H
#define GDCMTABLE_H
#include "gdcmTableEntry.h"
#include "gdcmTag.h"
#include <map>
namespace gdcm
{
/**
* \brief Table
*/
class Table
{
public:
typedef std::map<Tag, TableEntry> MapTableEntry;
Table() {}
~Table() {}
friend std::ostream& operator<<(std::ostream& _os, const Table &_val);
void InsertEntry(Tag const &tag, TableEntry const &te)
{
#ifndef NDEBUG
MapTableEntry::size_type s = TableInternal.size();
#endif
TableInternal.insert(
MapTableEntry::value_type(tag, te));
assert( s < TableInternal.size() );
}
const TableEntry &GetTableEntry(const Tag &tag) const
{
MapTableEntry::const_iterator it =
TableInternal.find(tag);
if (it == TableInternal.end())
{
assert( 0 && "Impossible" );
return GetTableEntry(Tag(0,0));
}
return it->second;
}
private:
Table &operator=(const Table &_val); // purposely not implemented
Table(const Table&_val); // purposely not implemented
MapTableEntry TableInternal;
};
} // end namespace gdcm
#endif //GDCMTABLE_H
|
