Mercurial > hg > orthanc
annotate OrthancFramework/Sources/DicomFormat/DicomPath.h @ 5640:f7adfb22e20e
updated copyright, as Orthanc Team now replaces Osimis
| author | Sebastien Jodogne <s.jodogne@gmail.com> |
|---|---|
| date | Thu, 30 May 2024 21:19:57 +0200 |
| parents | 48b8dae6dc77 |
| children |
| rev | line source |
|---|---|
| 4681 | 1 /** |
| 2 * Orthanc - A Lightweight, RESTful DICOM Store | |
| 3 * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics | |
| 4 * Department, University Hospital of Liege, Belgium | |
|
5640
f7adfb22e20e
updated copyright, as Orthanc Team now replaces Osimis
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
5485
diff
changeset
|
5 * Copyright (C) 2017-2023 Osimis S.A., Belgium |
|
f7adfb22e20e
updated copyright, as Orthanc Team now replaces Osimis
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
5485
diff
changeset
|
6 * Copyright (C) 2024-2024 Orthanc Team SRL, Belgium |
|
5485
48b8dae6dc77
upgrade to year 2024
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
5185
diff
changeset
|
7 * Copyright (C) 2021-2024 Sebastien Jodogne, ICTEAM UCLouvain, Belgium |
| 4681 | 8 * |
| 9 * This program is free software: you can redistribute it and/or | |
| 10 * modify it under the terms of the GNU Lesser General Public License | |
| 11 * as published by the Free Software Foundation, either version 3 of | |
| 12 * the License, or (at your option) any later version. | |
| 13 * | |
| 14 * This program is distributed in the hope that it will be useful, but | |
| 15 * WITHOUT ANY WARRANTY; without even the implied warranty of | |
| 16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
| 17 * Lesser General Public License for more details. | |
| 18 * | |
| 19 * You should have received a copy of the GNU Lesser General Public | |
| 20 * License along with this program. If not, see | |
| 21 * <http://www.gnu.org/licenses/>. | |
| 22 **/ | |
| 23 | |
| 24 | |
| 25 #pragma once | |
| 26 | |
| 27 #include "../OrthancFramework.h" | |
| 28 #include "../DicomFormat/DicomTag.h" | |
| 29 | |
| 30 #include <vector> | |
| 31 | |
| 32 namespace Orthanc | |
| 33 { | |
|
4682
d38a7040474a
FromDcmtkBridge::RemovePath() and FromDcmtkBridge::ReplacePath()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4681
diff
changeset
|
34 class ORTHANC_PUBLIC DicomPath |
| 4681 | 35 { |
| 36 private: | |
| 37 class PrefixItem | |
| 38 { | |
| 39 private: | |
| 40 DicomTag tag_; | |
| 41 bool isUniversal_; // Matches any index | |
| 42 size_t index_; | |
| 43 | |
| 44 PrefixItem(DicomTag tag, | |
| 45 bool isUniversal, | |
| 46 size_t index); | |
| 47 | |
| 48 public: | |
| 49 static PrefixItem CreateUniversal(const DicomTag& tag) | |
| 50 { | |
| 51 return PrefixItem(tag, true, 0 /* dummy value */); | |
| 52 } | |
| 53 | |
| 54 static PrefixItem CreateIndexed(const DicomTag& tag, | |
| 55 size_t index) | |
| 56 { | |
| 57 return PrefixItem(tag, false, index); | |
| 58 } | |
| 59 | |
| 60 const DicomTag& GetTag() const | |
| 61 { | |
| 62 return tag_; | |
| 63 } | |
| 64 | |
| 65 bool IsUniversal() const | |
| 66 { | |
| 67 return isUniversal_; | |
| 68 } | |
| 69 | |
| 70 size_t GetIndex() const; | |
|
4689
ead3b81f4541
added DicomPath::SetPrefixIndex()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4683
diff
changeset
|
71 |
|
ead3b81f4541
added DicomPath::SetPrefixIndex()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4683
diff
changeset
|
72 void SetIndex(size_t index); |
| 4681 | 73 }; |
| 74 | |
| 75 std::vector<PrefixItem> prefix_; | |
| 76 Orthanc::DicomTag finalTag_; | |
| 77 | |
| 78 static DicomTag ParseTag(const std::string& token); | |
| 79 | |
| 80 const PrefixItem& GetLevel(size_t i) const; | |
| 81 | |
| 82 public: | |
| 4690 | 83 explicit DicomPath(const Orthanc::DicomTag& tag); |
| 4681 | 84 |
| 85 DicomPath(const Orthanc::DicomTag& sequence, | |
| 86 size_t index, | |
| 87 const Orthanc::DicomTag& tag); | |
| 88 | |
| 89 DicomPath(const Orthanc::DicomTag& sequence1, | |
| 90 size_t index1, | |
| 91 const Orthanc::DicomTag& sequence2, | |
| 92 size_t index2, | |
| 93 const Orthanc::DicomTag& tag); | |
| 94 | |
| 95 DicomPath(const Orthanc::DicomTag& sequence1, | |
| 96 size_t index1, | |
| 97 const Orthanc::DicomTag& sequence2, | |
| 98 size_t index2, | |
| 99 const Orthanc::DicomTag& sequence3, | |
| 100 size_t index3, | |
| 101 const Orthanc::DicomTag& tag); | |
| 102 | |
|
4683
7182f5732480
use of DicomPath in ParsedDicomFile
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4682
diff
changeset
|
103 DicomPath(const std::vector<Orthanc::DicomTag>& parentTags, |
| 4690 | 104 const std::vector<size_t>& parentIndexes, |
|
4683
7182f5732480
use of DicomPath in ParsedDicomFile
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4682
diff
changeset
|
105 const Orthanc::DicomTag& finalTag); |
|
7182f5732480
use of DicomPath in ParsedDicomFile
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4682
diff
changeset
|
106 |
| 4681 | 107 void AddIndexedTagToPrefix(const Orthanc::DicomTag& tag, |
| 108 size_t index); | |
| 109 | |
| 110 void AddUniversalTagToPrefix(const Orthanc::DicomTag& tag); | |
| 111 | |
| 4690 | 112 size_t GetPrefixLength() const; |
| 4681 | 113 |
| 4690 | 114 const Orthanc::DicomTag& GetFinalTag() const; |
| 4681 | 115 |
| 4690 | 116 const Orthanc::DicomTag& GetPrefixTag(size_t level) const; |
| 4681 | 117 |
| 4690 | 118 bool IsPrefixUniversal(size_t level) const; |
| 4681 | 119 |
| 4690 | 120 size_t GetPrefixIndex(size_t level) const; |
| 4681 | 121 |
|
4682
d38a7040474a
FromDcmtkBridge::RemovePath() and FromDcmtkBridge::ReplacePath()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4681
diff
changeset
|
122 bool HasUniversal() const; |
|
d38a7040474a
FromDcmtkBridge::RemovePath() and FromDcmtkBridge::ReplacePath()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4681
diff
changeset
|
123 |
|
4689
ead3b81f4541
added DicomPath::SetPrefixIndex()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4683
diff
changeset
|
124 // This method is used for an optimization in Stone |
|
ead3b81f4541
added DicomPath::SetPrefixIndex()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4683
diff
changeset
|
125 // (cf. "DicomStructureSet.cpp") |
|
ead3b81f4541
added DicomPath::SetPrefixIndex()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4683
diff
changeset
|
126 void SetPrefixIndex(size_t level, |
|
ead3b81f4541
added DicomPath::SetPrefixIndex()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4683
diff
changeset
|
127 size_t index); |
|
ead3b81f4541
added DicomPath::SetPrefixIndex()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4683
diff
changeset
|
128 |
| 4681 | 129 std::string Format() const; |
| 130 | |
|
4682
d38a7040474a
FromDcmtkBridge::RemovePath() and FromDcmtkBridge::ReplacePath()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4681
diff
changeset
|
131 static DicomPath Parse(const std::string& s); |
|
4683
7182f5732480
use of DicomPath in ParsedDicomFile
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4682
diff
changeset
|
132 |
|
7182f5732480
use of DicomPath in ParsedDicomFile
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4682
diff
changeset
|
133 static bool IsMatch(const DicomPath& pattern, |
|
7182f5732480
use of DicomPath in ParsedDicomFile
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4682
diff
changeset
|
134 const DicomPath& path); |
|
4735
e17fdc43ef6c
optimized version of DicomPath::IsMatch()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4690
diff
changeset
|
135 |
|
e17fdc43ef6c
optimized version of DicomPath::IsMatch()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4690
diff
changeset
|
136 static bool IsMatch(const DicomPath& pattern, |
|
e17fdc43ef6c
optimized version of DicomPath::IsMatch()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4690
diff
changeset
|
137 const std::vector<Orthanc::DicomTag>& prefixTags, |
|
e17fdc43ef6c
optimized version of DicomPath::IsMatch()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4690
diff
changeset
|
138 const std::vector<size_t>& prefixIndexes, |
|
e17fdc43ef6c
optimized version of DicomPath::IsMatch()
Sebastien Jodogne <s.jodogne@gmail.com>
parents:
4690
diff
changeset
|
139 const DicomTag& finalTag); |
| 4681 | 140 }; |
| 141 } |