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
|
/*=========================================================================
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 GDCMTAGPATH_H
#define GDCMTAGPATH_H
#include "gdcmTag.h"
#include <vector>
namespace gdcm
{
/**
* \brief class to handle a path of tag.
*
* Any Resemblance to Existing XPath is Purely Coincidental
* ftp://medical.nema.org/medical/dicom/supps/sup118_pc.pdf
*/
class GDCM_EXPORT TagPath
{
public:
TagPath();
~TagPath();
void Print(std::ostream &) const;
/// "/0018,0018/"...
/// No space allowed, comma is use to separate tag group
/// from tag element and slash is used to separate tag
/// return false if invalid
bool ConstructFromString(const char *path);
/// Return if path is valid or not
static bool IsValid(const char *path);
/// Construct from a list of tags
bool ConstructFromTagList(Tag const *l, unsigned int n);
bool Push(Tag const & t);
bool Push(unsigned int itemnum);
private:
std::vector<Tag> Path;
};
} // end namespace gdcm
#endif //GDCMTAGPATH_H
|
