|
1746
|
1 /**
|
|
|
2 * Orthanc - A Lightweight, RESTful DICOM Store
|
|
|
3 * Copyright (C) 2012-2015 Sebastien Jodogne, Medical Physics
|
|
|
4 * Department, University Hospital of Liege, Belgium
|
|
|
5 *
|
|
|
6 * This program is free software: you can redistribute it and/or
|
|
|
7 * modify it under the terms of the GNU General Public License as
|
|
|
8 * published by the Free Software Foundation, either version 3 of the
|
|
|
9 * License, or (at your option) any later version.
|
|
|
10 *
|
|
|
11 * In addition, as a special exception, the copyright holders of this
|
|
|
12 * program give permission to link the code of its release with the
|
|
|
13 * OpenSSL project's "OpenSSL" library (or with modified versions of it
|
|
|
14 * that use the same license as the "OpenSSL" library), and distribute
|
|
|
15 * the linked executables. You must obey the GNU General Public License
|
|
|
16 * in all respects for all of the code used other than "OpenSSL". If you
|
|
|
17 * modify file(s) with this exception, you may extend this exception to
|
|
|
18 * your version of the file(s), but you are not obligated to do so. If
|
|
|
19 * you do not wish to do so, delete this exception statement from your
|
|
|
20 * version. If you delete this exception statement from all source files
|
|
|
21 * in the program, then also delete it here.
|
|
|
22 *
|
|
|
23 * This program is distributed in the hope that it will be useful, but
|
|
|
24 * WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
25 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
|
26 * General Public License for more details.
|
|
|
27 *
|
|
|
28 * You should have received a copy of the GNU General Public License
|
|
|
29 * along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
|
30 **/
|
|
|
31
|
|
|
32
|
|
|
33 #include "PrecompiledHeadersServer.h"
|
|
|
34 #include "SetOfResources.h"
|
|
|
35
|
|
|
36 #include "../Core/OrthancException.h"
|
|
|
37
|
|
|
38
|
|
|
39 namespace Orthanc
|
|
|
40 {
|
|
|
41 void SetOfResources::Intersect(const std::list<int64_t>& resources)
|
|
|
42 {
|
|
|
43 if (resources_.get() == NULL)
|
|
|
44 {
|
|
|
45 resources_.reset(new Resources);
|
|
|
46
|
|
|
47 for (std::list<int64_t>::const_iterator
|
|
|
48 it = resources.begin(); it != resources.end(); ++it)
|
|
|
49 {
|
|
|
50 resources_->insert(*it);
|
|
|
51 }
|
|
|
52 }
|
|
|
53 else
|
|
|
54 {
|
|
|
55 std::auto_ptr<Resources> filtered(new Resources);
|
|
|
56
|
|
|
57 for (std::list<int64_t>::const_iterator
|
|
|
58 it = resources.begin(); it != resources.end(); ++it)
|
|
|
59 {
|
|
|
60 if (resources_->find(*it) != resources_->end())
|
|
|
61 {
|
|
|
62 filtered->insert(*it);
|
|
|
63 }
|
|
|
64 }
|
|
|
65
|
|
|
66 resources_ = filtered;
|
|
|
67 }
|
|
|
68 }
|
|
|
69
|
|
|
70
|
|
|
71 void SetOfResources::GoDown()
|
|
|
72 {
|
|
|
73 if (level_ == ResourceType_Instance)
|
|
|
74 {
|
|
|
75 throw OrthancException(ErrorCode_BadSequenceOfCalls);
|
|
|
76 }
|
|
|
77
|
|
|
78 std::auto_ptr<Resources> children(new Resources);
|
|
|
79
|
|
|
80 for (Resources::const_iterator it = resources_->begin();
|
|
|
81 it != resources_->end(); ++it)
|
|
|
82 {
|
|
|
83 std::list<int64_t> tmp;
|
|
|
84 database_.GetChildrenInternalId(tmp, *it);
|
|
|
85
|
|
|
86 for (std::list<int64_t>::const_iterator
|
|
|
87 child = tmp.begin(); child != tmp.end(); ++child)
|
|
|
88 {
|
|
|
89 children->insert(*child);
|
|
|
90 }
|
|
|
91 }
|
|
|
92
|
|
|
93 resources_ = children;
|
|
|
94 }
|
|
|
95
|
|
|
96
|
|
|
97 void SetOfResources::Flatten(std::list<std::string>& result)
|
|
|
98 {
|
|
|
99 result.clear();
|
|
|
100
|
|
|
101 if (resources_.get() == NULL)
|
|
|
102 {
|
|
|
103 // All the resources of this level are part of the filter
|
|
|
104 database_.GetAllPublicIds(result, level_);
|
|
|
105 }
|
|
|
106 else
|
|
|
107 {
|
|
|
108 for (Resources::const_iterator it = resources_->begin();
|
|
|
109 it != resources_->end(); ++it)
|
|
|
110 {
|
|
|
111 result.push_back(database_.GetPublicId(*it));
|
|
|
112 }
|
|
|
113 }
|
|
|
114 }
|
|
|
115 }
|
