Class to represent a map of DictEntry.
More...
#include <gdcmDict.h>
List of all members.
Detailed Description
Class to represent a map of DictEntry.
- Note:
- bla TODO FIXME: For Element == 0x0 need to return Name = Group Length ValueRepresentation = UL ValueMultiplicity = 1
- Examples:
- GenAllVR.cxx, GenFakeIdentifyFile.cxx, PublicDict.cxx, and ReadAndPrintAttributes.cxx.
Member Typedef Documentation
Constructor & Destructor Documentation
Member Function Documentation
void gdcm::Dict::AddDictEntry |
( |
const Tag & |
tag, |
|
|
const DictEntry & |
de |
|
) |
| |
|
inline |
const DictEntry& gdcm::Dict::GetDictEntry |
( |
const Tag & |
tag | ) |
const |
|
inline |
const DictEntry& gdcm::Dict::GetDictEntryByKeyword |
( |
const char * |
keyword, |
|
|
Tag & |
tag |
|
) |
| const |
|
inline |
Lookup DictEntry by keyword. Even if DICOM standard defines keyword as being unique. The lookup table is built on Tag. Therefore looking up a DictEntry by Keyword is more inefficient than looking up by Tag.
const DictEntry& gdcm::Dict::GetDictEntryByName |
( |
const char * |
name, |
|
|
Tag & |
tag |
|
) |
| const |
|
inline |
Inefficient way of looking up tag by name. Technically DICOM does not garantee uniqueness (and Curve / Overlay are there to prove it). But most of the time name is in fact uniq and can be uniquely link to a tag
- Examples:
- ReadAndPrintAttributes.cxx.
const char* gdcm::Dict::GetKeywordFromTag |
( |
Tag const & |
tag | ) |
const |
|
inline |
Function to return the Keyword from a Tag.
bool gdcm::Dict::IsEmpty |
( |
| ) |
const |
|
inline |
void gdcm::Dict::LoadDefault |
( |
| ) |
|
|
protected |
Friends And Related Function Documentation
std::ostream& operator<< |
( |
std::ostream & |
_os, |
|
|
const Dict & |
_val |
|
) |
| |
|
friend |
The documentation for this class was generated from the following file: