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
|
/* Copyright (c) 2008-2022 the MRtrix3 contributors.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* Covered Software is provided under this License on an "as is"
* basis, without warranty of any kind, either expressed, implied, or
* statutory, including, without limitation, warranties that the
* Covered Software is free of defects, merchantable, fit for a
* particular purpose or non-infringing.
* See the Mozilla Public License v. 2.0 for more details.
*
* For more details, see http://www.mrtrix.org/.
*/
#ifndef __file_dicom_tree_h__
#define __file_dicom_tree_h__
#include "memory.h"
#include "file/dicom/patient.h"
namespace MR {
namespace File {
namespace Dicom {
class Series;
class Patient;
class Tree : public vector<std::shared_ptr<Patient>> { NOMEMALIGN
public:
std::string description;
void read (const std::string& filename);
std::shared_ptr<Patient> find (const std::string& patient_name, const std::string& patient_ID,
const std::string& patient_DOB);
void sort() {
std::sort (begin(), end(), compare_ptr_contents());
for (auto patient : *this) {
std::sort (patient->begin(), patient->end(), compare_ptr_contents());
for (auto study : *patient)
std::sort (study->begin(), study->end(), compare_ptr_contents());
}
}
protected:
void read_dir (const std::string& filename, ProgressBar& progress);
void read_file (const std::string& filename);
};
std::ostream& operator<< (std::ostream& stream, const Tree& item);
extern vector<std::shared_ptr<Series>> (*select_func) (const Tree& tree);
}
}
}
#endif
|
