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
75
76
77
78
79
80
81
|
/*
Copyright 2008 Brain Research Institute, Melbourne, Australia
Written by J-Donald Tournier, 27/06/08.
This file is part of MRtrix.
MRtrix is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
MRtrix is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with MRtrix. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __file_dicom_tree_h__
#define __file_dicom_tree_h__
#include "ptr.h"
#include "file/dicom/patient.h"
namespace MR {
namespace File {
namespace Dicom {
class Series;
class Patient;
class Tree : public std::vector< RefPtr<Patient> > {
protected:
void read_dir (const String& filename);
void read_file (const String& filename);
public:
String description;
void read (const String& filename);
RefPtr<Patient> find (
const String& patient_name,
const String& patient_ID = "",
const String& patient_DOB = "");
void sort();
};
std::ostream& operator<< (std::ostream& stream, const Tree& item);
extern std::vector< RefPtr<Series> > (*select_func) (const Tree& tree);
inline void Tree::sort() {
for (guint patient = 0; patient < size(); patient++) {
Patient& pat (*((*this)[patient]));
for (guint study = 0; study < pat.size(); study++)
std::sort (pat[study]->begin(), pat[study]->end());
}
}
}
}
}
#endif
|
