1 /** 2 * Orthanc - A Lightweight, RESTful DICOM Store 3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics 4 * Department, University Hospital of Liege, Belgium 5 * Copyright (C) 2017-2021 Osimis S.A., Belgium 6 * 7 * This program is free software: you can redistribute it and/or 8 * modify it under the terms of the GNU General Public License as 9 * published by the Free Software Foundation, either version 3 of the 10 * License, or (at your option) any later version. 11 * 12 * In addition, as a special exception, the copyright holders of this 13 * program give permission to link the code of its release with the 14 * OpenSSL project's "OpenSSL" library (or with modified versions of it 15 * that use the same license as the "OpenSSL" library), and distribute 16 * the linked executables. You must obey the GNU General Public License 17 * in all respects for all of the code used other than "OpenSSL". If you 18 * modify file(s) with this exception, you may extend this exception to 19 * your version of the file(s), but you are not obligated to do so. If 20 * you do not wish to do so, delete this exception statement from your 21 * version. If you delete this exception statement from all source files 22 * in the program, then also delete it here. 23 * 24 * This program is distributed in the hope that it will be useful, but 25 * WITHOUT ANY WARRANTY; without even the implied warranty of 26 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 27 * General Public License for more details. 28 * 29 * You should have received a copy of the GNU General Public License 30 * along with this program. If not, see <http://www.gnu.org/licenses/>. 31 **/ 32 33 34 #pragma once 35 36 #include "ListConstraint.h" 37 #include "SetOfResources.h" 38 39 #include <memory> 40 41 namespace Orthanc 42 { 43 class LookupResource : public boost::noncopyable 44 { 45 private: 46 typedef std::map<DicomTag, IFindConstraint*> Constraints; 47 48 class Level 49 { 50 private: 51 ResourceType level_; 52 std::set<DicomTag> identifiers_; 53 std::set<DicomTag> mainTags_; 54 Constraints identifiersConstraints_; 55 Constraints mainTagsConstraints_; 56 57 public: 58 Level(ResourceType level); 59 60 ~Level(); 61 62 bool Add(const DicomTag& tag, 63 std::auto_ptr<IFindConstraint>& constraint); 64 65 void Apply(SetOfResources& candidates, 66 IDatabaseWrapper& database) const; 67 68 bool IsMatch(const DicomMap& dicom) const; 69 }; 70 71 typedef std::map<ResourceType, Level*> Levels; 72 73 ResourceType level_; 74 Levels levels_; 75 Constraints unoptimizedConstraints_; // Constraints on non-main DICOM tags 76 std::auto_ptr<ListConstraint> modalitiesInStudy_; 77 78 bool AddInternal(ResourceType level, 79 const DicomTag& tag, 80 std::auto_ptr<IFindConstraint>& constraint); 81 82 void ApplyLevel(SetOfResources& candidates, 83 ResourceType level, 84 IDatabaseWrapper& database) const; 85 86 public: 87 LookupResource(ResourceType level); 88 89 ~LookupResource(); 90 GetLevel()91 ResourceType GetLevel() const 92 { 93 return level_; 94 } 95 96 void SetModalitiesInStudy(const std::string& modalities); 97 98 void Add(const DicomTag& tag, 99 IFindConstraint* constraint); // Takes ownership 100 101 void AddDicomConstraint(const DicomTag& tag, 102 const std::string& dicomQuery, 103 bool caseSensitive); 104 105 void FindCandidates(std::list<int64_t>& result, 106 IDatabaseWrapper& database) const; 107 HasOnlyMainDicomTags()108 bool HasOnlyMainDicomTags() const 109 { 110 return unoptimizedConstraints_.empty(); 111 } 112 113 bool IsMatch(const DicomMap& dicom) const; 114 }; 115 } 116