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
|
/*=========================================================================
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 GDCMFINDSTUDYROOTQUERY_H
#define GDCMFINDSTUDYROOTQUERY_H
#include "gdcmBaseRootQuery.h"
namespace gdcm
{
/**
* \brief FindStudyRootQuery
* \details contains: the class which will produce a dataset for C-FIND with study root
*/
class GDCM_EXPORT FindStudyRootQuery : public BaseRootQuery
{
friend class QueryFactory;
public:
FindStudyRootQuery();
void InitializeDataSet(const EQueryLevel& inQueryLevel) override;
std::vector<Tag> GetTagListByLevel(const EQueryLevel& inQueryLevel) override;
/// have to be able to ensure that (0008,0052) is set
/// that the level is appropriate (ie, not setting PATIENT for a study query
/// that the tags in the query match the right level (either required, unique, optional)
bool ValidateQuery(bool inStrict = true) const override;
UIDs::TSName GetAbstractSyntaxUID() const override;
};
} // end namespace gdcm
#endif // GDCMFINDSTUDYROOTQUERY_H
|
