Mercurial > hg > orthanc
view Plugins/Samples/Common/DicomPath.h @ 3664:85acfcc15829 storage-commitment
sample storage commitment plugin, C++ wrapper
author | Sebastien Jodogne <s.jodogne@gmail.com> |
---|---|
date | Wed, 12 Feb 2020 16:06:58 +0100 |
parents | 94f4a18a79cc |
children |
line wrap: on
line source
/** * Orthanc - A Lightweight, RESTful DICOM Store * Copyright (C) 2012-2016 Sebastien Jodogne, Medical Physics * Department, University Hospital of Liege, Belgium * Copyright (C) 2017-2020 Osimis S.A., Belgium * * This program 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. * * In addition, as a special exception, the copyright holders of this * program give permission to link the code of its release with the * OpenSSL project's "OpenSSL" library (or with modified versions of it * that use the same license as the "OpenSSL" library), and distribute * the linked executables. You must obey the GNU General Public License * in all respects for all of the code used other than "OpenSSL". If you * modify file(s) with this exception, you may extend this exception to * your version of the file(s), but you are not obligated to do so. If * you do not wish to do so, delete this exception statement from your * version. If you delete this exception statement from all source files * in the program, then also delete it here. * * This program 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 this program. If not, see <http://www.gnu.org/licenses/>. **/ #pragma once #include "DicomTag.h" #include <vector> #include <stddef.h> namespace OrthancPlugins { class DicomPath { private: typedef std::pair<DicomTag, size_t> Prefix; std::vector<Prefix> prefix_; DicomTag finalTag_; const Prefix& GetPrefixItem(size_t depth) const; Prefix& GetPrefixItem(size_t depth); public: DicomPath(const DicomTag& finalTag) : finalTag_(finalTag) { } DicomPath(const DicomTag& sequence, size_t index, const DicomTag& tag); DicomPath(const DicomTag& sequence1, size_t index1, const DicomTag& sequence2, size_t index2, const DicomTag& tag); DicomPath(const DicomTag& sequence1, size_t index1, const DicomTag& sequence2, size_t index2, const DicomTag& sequence3, size_t index3, const DicomTag& tag); void AddToPrefix(const DicomTag& tag, size_t position) { prefix_.push_back(std::make_pair(tag, position)); } size_t GetPrefixLength() const { return prefix_.size(); } DicomTag GetPrefixTag(size_t depth) const { return GetPrefixItem(depth).first; } size_t GetPrefixIndex(size_t depth) const { return GetPrefixItem(depth).second; } void SetPrefixIndex(size_t depth, size_t value) { GetPrefixItem(depth).second = value; } const DicomTag& GetFinalTag() const { return finalTag_; } void SetFinalTag(const DicomTag& tag) { finalTag_ = tag; } std::string Format() const; }; }